The complexity of linear phase Finite Impulse Response (FIR) filters used in the channelizer of a software defined radio (SDR) receiver is dominated by the complexity of coefficient multipliers. It is well known that Common Subexpression Elimination (CSE) methods based on Canonical Signed Digit (CSD) coefficients produce low complexity FIR filter coefficient multipliers. A new CSE algorithm based on the binary representation of filter coefficients is presented in the paper. Design examples of channel filters employed in the Digital Advanced Mobile Phone Systems (D-AMPS) and Personal Digital Cellular (PDC) receivers show that the proposed method offers an average adder reduction of 23% over the conventional CSD-based CSE method. © 2006 IEEE.