Design of narrow-band FIR bandpass digital filters with reduced arithmetic complexity
Yrjo A. Neuvo, G. T. Sundar Rajan, Sanjit K. Mitra · IEEE Transactions on Circuits and Systems · 1987
A computationally efficient realization of a symmetrical bandpass FIR filter is derived. The realization is composed of two branches, each consisting of a cascade of two FIR sections. In each branch, the first FIR section has a sparse impulse response with only everyLth sample being nonzero. The second section generates the remaining samples via interpolation. The method is applicable to both linear and nonlinear phase cases. Approximate expressions for the optimal value ofLand the corresponding number of multipliers and adders required in the overall realization are derived. In narrow-band implementations, the number of multipliers and adders is approximately proportional to1/\sqrt{{\Delta}F}, where{\Delta}Fis the desired relative transition bandwidth. Typically, the required number of multipliers and adders is1/2to1/4th of those in the conventional linear or nonlinear phase direct-form implementations. The total number of delays is only slightly larger than that required in the conventional implementations. The structure allows simple tuning of the center frequency of the bandpass filter and has good finite wordlength properties.