Nothing Special   »   [go: up one dir, main page]

Skip to main content

Heuristic Optimal Design of Multiplier-less Digital Filter

  • Chapter
Advances in Heuristic Signal Processing and Applications
  • 2041 Accesses

Abstract

This chapter introduces the design of multiplier-less digital filter based on Canonic Signed Digit (CSD) code. The well-known genetic algorithm (GA) is used to optimal design of the digital filter. Through the CSD coding of the filter parameters, the times of multiplication in the filtering process of a signal can be significantly reduced and then the calculation speed is increased. Among the existing heuristic algorithms, such as Particle Swarm Optimization (PSO), Differential Evolution (DE), Simulated Annealing (SA), etc., GA is the most suitable to CSD design due to its gene-wise crossover property. However, the CSD structure cannot be guaranteed by a general GA after the evolution of chromosomes. Thus in this chapter, a CSD-coded GA is introduced. The CSD-coded GA can reduce the time wasted by trials and errors during the evolution and then accelerate the training speed. Besides, a new hybrid code for the filter coefficients is proposed to improve the precision of the coefficients of a digital filter. Moreover, the design of both finite-impulse response (FIR) filter and infinite-impulse response (IIR) filter are examined. For the IIR filter, the stability problem is very important. Hence, a robust stability criterion is introduced in this chapter for the design of IIR filter.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook
USD 15.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Hewlitt, R.M., Swartzlantler, E.S. Jr.: Canonical signed digit representation for FIR digital filters. In: IEEE Workshop on Signal Processing Systems, 11–13 Oct., pp. 416–426 (2000)

    Google Scholar 

  2. Cabal-Yepez, E., Carozzi, T.D., de Romero-Troncoso, R.J., Goughc, M.P., Huberc, N.: FPGA-based system for frequency detection of the main periodic component in time series information. Digit. Signal Process. 18, 1029–1044 (2008)

    Article  Google Scholar 

  3. Tang, Z., Zhang, J., Min, H.: A high-speed, programmable, CSD coefficient FIR filter. IEEE Trans. Consum. Electron. 48(4), 834–837 (2002)

    Article  Google Scholar 

  4. Pan, S.-T.: A canonic-signed-digit coded genetic algorithm for designing finite impulse response digital filter. Digit. Signal Process. 20(2), 314–327 (2010)

    Article  Google Scholar 

  5. Pan, S.-T.: CSD-coded genetic algorithm on robustly stable multiplier-less IIR filter design. Math. Probl. Eng. 2012, 560650 (2012), 15 pages. doi:10.1155/2012/560650

    Google Scholar 

  6. Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms. Wiley, New York (1998)

    MATH  Google Scholar 

  7. Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)

    Google Scholar 

  8. Zhao, Q., Tadokoro, Y.: A simple design of FIR filters with powers-of-two coefficients. IEEE Trans. Circuits Syst. 35(5), 566–570 (1988)

    Article  Google Scholar 

  9. Khoo, K.Y., Kwentus, A., Willson, A.N. Jr.: A programmable FIR digital filter using CSD coefficients. IEEE J. Solid-State Circuits 31, 869–874 (1996)

    Article  Google Scholar 

  10. Lee, H.R., Jen, C.W., Liu, C.M.: A new hardware-efficient architecture for programmable FIR filters. IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process. 43, 637–644 (1996)

    Article  Google Scholar 

  11. Park, I.C., Kang, H.J.: Digital filter synthesis based on an algorithm to generate all minimal signed digit representations. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 21, 1525–1529 (2002)

    Article  Google Scholar 

  12. de Vegtea, J.V.: Fundamentals of Digital Signal Processing. Prentice Hall, Englewood Cliffs (2001)

    Google Scholar 

  13. Ifeachor, E.C., Jervis, B.W.: Digital Signal Processing: A Practical Approach. Addison-Wesley, London (1993)

    Google Scholar 

  14. Uesaka, K., Kawamata, M.: Evolutionary synthesis of digital filter structures using genetic algorithm. IEEE Trans. Circuits Syst. II 50, 977–983 (2003)

    Article  Google Scholar 

  15. Pan, S.-T.: Design of robust D-stable IIR filters using genetic algorithms with embedded stability criterion. IEEE Trans. Signal Process. 57(8), 3008–3016 (2009)

    Article  MathSciNet  Google Scholar 

  16. John, W.D.: Applied Complex Variables. Macmillan, New York (1967)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shing-Tai Pan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Pan, ST., Chang, CY. (2013). Heuristic Optimal Design of Multiplier-less Digital Filter. In: Chatterjee, A., Nobahari, H., Siarry, P. (eds) Advances in Heuristic Signal Processing and Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37880-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37880-5_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37879-9

  • Online ISBN: 978-3-642-37880-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics