Skip to main content

Review of Pseudo-Boolean Methods with Applications to Digital Filter Design

  • Chapter
  • First Online:
Topics in Signal Processing
  • 979 Accesses

Abstract

The technique of pseudo-Boolean methods which forms the basis for bivalent (0, 1) programming, has been used for many socio-economic and engineering problems in the past. In this chapter, we review these methods and discuss their applications to the quantized coefficient design of digital filters. Some other applications of these methods are also briefly described.

Source: R.K. Patney & S.C. Dutta Roy, “A Review of Pseudo –Boolean Methods with Applications to Digital Filter Design,” JIETE, vol 26, pp 1–8, January 1980.

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

Access this chapter

eBook
USD 16.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 139.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

Notes

  1. 1.

    Note that other forms of inequalities i.e. <, ≤ and > can easily be converted to the form ≥.

  2. 2.

    The method in its preliminary form was presented in 1978 IEEE International Conference on Acoustics, Speech and Signal Processing [6].

  3. 3.

    Whether a given nonlinear PB function F is always >0 (<0) can easily be determined by considering the constant term in F. If this term is positive (negative) and its magnitude is greater than the sum of all negative (positive) coefficient sin F, then F is always >0 (<0).

References

  1. G.B. Dantzig, Linear Programming and Extensions (Princeton University Press, Princeton, New Jersey, 1963)

    Book  Google Scholar 

  2. P.L. Ivanescu, Pseudo-Boolean Programming and Applications (Springer, Berlin, 1965)

    Book  Google Scholar 

  3. P.L. Ivanescu, S. Rudeanu, Pseudo-Boolean Methods for Bivalent Programing (Springer, Berlin, 1966)

    Book  Google Scholar 

  4. P.L. Hammer, S. Rudeanu, Boolean Methods in Operations Research and Related Areas (Springer, New York, 1968)

    Book  Google Scholar 

  5. T.L. Saaty, Optimization in Integers and Related External Problems (McGraw-Hill, New York, 1970)

    Google Scholar 

  6. R.K. Patney, S.C. Dutta Roy, Design of IIR filters using pseudo-Boolean methods, in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (1978)

    Google Scholar 

  7. R.K. Patney, Roundoff Noise and Co-efficient Sensitivity in Digital Filters. PhD thesis, IIT Delhi, 1978

    Google Scholar 

  8. R.K. Patney, S.C. Dutta Roy, Design of linear phase FIR filters using pseudo-Boolean methods. IEEE Trans. CAS-26, 4, 55–260 (1979)

    Google Scholar 

  9. R.K. Patney, S.C. Dutta Roy, A modified pseudo-Boolean method for quantized coefficient design of IIR filters, in Proceedings of the ICASSP (1979)

    Google Scholar 

  10. A.V. Oppenheim, R.W. Schafer, Digital Signal Processing (Prentice-Hall, New Jersey, 1975)

    MATH  Google Scholar 

  11. L.R. Rabiner, B. Gold, Theory and Applications of Digital Signal Processing (Prentice-Hall, New Jersey, 1975)

    Google Scholar 

  12. P. Chambon, A. Desblache, Integer co-efficient optimization of digital filters, in Proceedings of the IEEE International Symposium on Circuits and Systems (1976), pp. 461–464

    Google Scholar 

  13. E. Avenhaus, On the design of digital filters with co-efficients of finite word lengths. IEEE Trans. AU-20, 356–373 (1972)

    Google Scholar 

  14. E. Avenhaus, W. Schussler, On the approximation problem in the design of digital filters with limited world length. Arch. Elek. Ubertragung. 24, 571–572 (1970)

    Google Scholar 

  15. K. Steiglitz, Designing short word recursive digital filters, in Proceedings 9th Annual Allerton Conference on Circuit and System (1971), pp. 778–788

    Google Scholar 

  16. R.E. Crochiere, A new statistical approach to the coefficient word length problem for digital filters. IEEE Trans. CAS-22, 190–196 (1975)

    Google Scholar 

  17. F. Berglez, Digital filter design with co-efficients of reduced wod length, in Proceedings of the IEEE Symposium on Circuits and Systems (1977), pp. 52–55

    Google Scholar 

  18. C. Charalambous, M.J. Best, Optimization of recursive digital filters with finite word length. IEEE Trans. ASSP- 22, 424–431 (1974)

    Google Scholar 

  19. M. Suk, S.K. Mitra, Computer-aided design of digital filters with finite word length. IEEE Trans. AU-20, 356–373 (1972)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Suhash Chandra Dutta Roy .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Dutta Roy, S.C. (2020). Review of Pseudo-Boolean Methods with Applications to Digital Filter Design. In: Topics in Signal Processing. Springer, Singapore. https://doi.org/10.1007/978-981-13-9532-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-9532-1_20

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-9531-4

  • Online ISBN: 978-981-13-9532-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics