Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Design of efficient multiplierless FIR filters

Design of efficient multiplierless FIR filters

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Circuits, Devices & Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

An algorithm for reducing the hardware complexity of linear phase finite impulse response digital filters that minimise the adder depth in the multiplier block adders (MBAs) is presented. The algorithm starts by aggressively reducing both the coefficient wordlength and the number of non-zero bits in the filter coefficients. This reduces the number of adders (the adder depth) that are needed to construct the coefficient multiplier and results in an increased operating frequency. A modification to the representation of the filter coefficients such that the number of full adders (FAs) in our hardware implementation is proportional to the product of the input signal wordlength and the number of adders is proposed. That is, in general, the number of FAs is independent of the coefficient wordlength and the number of shifts between non-zero bits in the coefficient. Results show that the proposed technique achieves a 67 and 70% reduction in the number of MBAs and the number of multiplier block FAs, respectively. A software program has been implemented, which generates a Verilog HDL description of the digital filter. The proposed technique is not limited to filters with only a small number of taps and has been successfully applied to filters with up to 500 taps.

Inspec keywords: linear phase filters; adders; FIR filters; hardware description languages

Other keywords: software program; coefficient wordlength reduction; Verilog HDL description; multiplierless FIR filters; multiplier block adders; coefficient multiplier; linear phase finite impulse response filters; filter coefficients; digital filters

Subjects: Digital filters; Digital circuit design, modelling and testing; Computer-aided circuit analysis and design; Digital filters

References

    1. 1)
      • A.P. Vinod , M.-K. Lai . On the implementation of efficient channel filters for wideband receivers by optimizing common subexpression elimination methods. IEEE Trans. Computer-Aided Design Integr. Circuits Syst. , 2 , 295 - 304
    2. 2)
    3. 3)
    4. 4)
    5. 5)
      • Tan, K.-H., Leong, W.F., Kaluri, K., Soderstrand, M.A., Johnson, L.G.: `FIR filter design program that matches specifications rather than filter coefficients results in large savings in FPGA resources', Thirty-Fifth Asilomar Conf. Signals, Systems and Computers, November 2001, 2, p. 1349–1352.
    6. 6)
    7. 7)
      • J. Yli-Kaakinen , T. Saramaki . A systematic algorithm for the design of multiplierless FIR filters. Proc. 2001 IEEE Int. Symp. Circuits Syst. , 185 - 188
    8. 8)
    9. 9)
      • M. Potkonjak , M.B. Srivastava , A.P. Chandrakasan . Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination. IEEE Trans. Computer-Aided Design Integr. Circuits Syst. , 2 , 151 - 165
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
      • I.-C. Park , H.-J. Kang . Digital filter synthesis based on an algorithm to generate all minimum signed digit representations. IEEE Trans. Computer-Aided Design Integr. Circuits Syst. , 12 , 1525 - 1529
    15. 15)
    16. 16)
    17. 17)
      • F. Ashrafzadeh , B. Nowrouzian , A.T.G. Fuller . A novel modified branch-and-bound technique for discrete optimization over canonical signed-digit number space. Proc. IEEE Int. Symp. Circuits Syst. , 391 - 394
    18. 18)
    19. 19)
    20. 20)
      • Dempster, A.G., Macleod, M.D.: `Variation of FIR filter complexity with order', Proc. 38th Midwest Symp. Circuits and Systems, August 1995, 1, p. 342–345.
    21. 21)
      • C.-Y. Pai , A.J. Al-Khalili , W.E. Lynch . Low-power constant-coefficient multiplier generator. J. VLSI Signal Process. Syst. , 187 - 194
    22. 22)
      • R. Pasko , P. Schaumont , V. Derudder , S. Vernalde , D. Durackova . A new algorithm for elimination of common subexpressions. IEEE Trans. Computer-Aided Design Integr. Circuits Syst. , 1 , 58 - 68
    23. 23)
    24. 24)
      • http://www.spiral.net/hardware/multless/html, accessed March 2007.
    25. 25)
    26. 26)
      • M. Bhattacharya , T. Saramäki . Some observations on multiplierless implementation of linear phase FIR filters. Proc. IEEE Int. Symp. Circuits Syst. , 193 - 196
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cds_20060201
Loading

Related content

content/journals/10.1049/iet-cds_20060201
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address