• DocumentCode
    3391464
  • Title

    Low-complexity linear phase fir filters in cascade form

  • Author

    Shi, Dong ; Yu, Ya Jun

  • Author_Institution
    Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore, Singapore
  • fYear
    2010
  • fDate
    May 30 2010-June 2 2010
  • Firstpage
    177
  • Lastpage
    180
  • Abstract
    The design of low complexity finite impulse response (FIR) filters in a single-stage direct form or transposed direct form has reached a certain limitation since various multiplierless techniques have been proposed and explored. In addition, further investigations have shown that, instead of minimizing the number of adders used to implement the filter, it makes more sense to reduce the adder depth (AD) of the multiplier block (MB) from a power consumption point of view. Therefore, filters in cascade form deserve more attention because of the possibility of achieving even lower AD within each subfilter. In this paper, an algorithm is proposed for the design of linear phase FIR filters in cascade form with discrete coefficients. The proposed algorithm designs the coefficients of the subfilters simultaneously in integer space and finds all the possible discrete valued solutions. We show by an example that it is possible to design a filter using even smaller effective wordlength (EWL) and lower AD, whereas the total number of adders used to implement the overall filter is also kept minimum.
  • Keywords
    FIR filters; transient response; adder depth; cascade form; complexity finite impulse response filters; effective wordlength; low-complexity linear phase FIR filters; multiplier block; multiplierless techniques; subfilters; Adders; Algorithm design and analysis; Circuits; Costs; Design engineering; Energy consumption; Finite impulse response filter; Mixed integer linear programming; Nonlinear filters; Pipeline processing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems (ISCAS), Proceedings of 2010 IEEE International Symposium on
  • Conference_Location
    Paris
  • Print_ISBN
    978-1-4244-5308-5
  • Electronic_ISBN
    978-1-4244-5309-2
  • Type

    conf

  • DOI
    10.1109/ISCAS.2010.5538008
  • Filename
    5538008