A double binary-tree FIR-filter form and the corresponding low-sensitivity IIR bandpass/bandstop structure

Author

Coleman, Jeffrey O.

Author_Institution

Naval Res. Lab., Washington, DC, USA

Volume

3

fYear

2002

fDate

4-7 Aug. 2002

Abstract

An FIR filter comprising back-to-back binary trees, each using multiple-sample delay blocks, offers advantages; (1) for rate-changing filters, (2) when block delays are especially hardware efficient, and (3) when replacing block delays with allpass sections to create an IIR filter. In the latter case, the peak group delays of the allpass sections approximate the several distinct delays of the blocks replaced. With allpass sections fixed, the combining weights are easily optimized.

Keywords

FIR filters; IIR filters; all-pass filters; band-pass filters; band-stop filters; circuit optimisation; logic design; trees (mathematics); FIR filter hardware implementation; allpass filter; allpass sections peak group delay; back-to-back binary trees; bandstop filter; combining weight optimization; double binary-tree FIR-filter; low-sensitivity IIR bandpass structure; multiple-sample delay blocks; rate-changing filters; Band pass filters; Binary trees; Clocks; Delay effects; Finite impulse response filter; Frequency response; Hardware; IIR filters; Laboratories; Topology;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2002. MWSCAS-2002. The 2002 45th Midwest Symposium on

Print_ISBN

0-7803-7523-8

Type

conf

DOI

10.1109/MWSCAS.2002.1187077

Filename

1187077