Skip to main content
SpringerLink
Log in

Optimization of fixed-polarity Reed-Muller circuits using dual-polarity property

  • Published:
Circuits, Systems and Signal Processing Aims and scope Submit manuscript

Abstract

In the optimization of canonical Reed-Muller (RM) circuits, RM polynomials with different polarities are usually derived directly from Boolean expressions. Time efficiency is thus not fully achieved because the information in finding RM expansion of one polarity is not utilized by others. We show in this paper that two fixed-polarity RM expansions that have the same number of variables and whose polarities are dual can be derived from each other without resorting to Boolean expressions. By repeated operations, RM expansions of all polarities can be derived. We consequently apply the result in conjunction with a hypercube traversal strategy to optimize RM expansions (i.e., to find the best polarity RM expansion). A recursive route is found among all possible polarities to derive RM expansion one by one. Simulation results are given to show that our optimization process, which is simpler, can perform exhaustive search as efficiently as other good exhaustive-search methods in the field.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. B. Akers, On a theory of Boolean functions,J. SIAM, vol. 7, 487–498, 1959.

    Google Scholar 

  2. A. E. A. Almaini,Electronic Logic Systems, Prentice-Hall, Englewood Cliffs, NJ, 1994.

    Google Scholar 

  3. A. E. A. Almaini and L. McKenzie, Tabular techniques for generating Kronecker expansions,Proc. IEE—Computer Digital Techs., vol. 143, 205–212, 1996.

    Google Scholar 

  4. A. E. A. Almaini, P. Thomson, and D. Hanson, Tabular techniques for Reed-Muller logic,Internat. J. Electron., vol. 70, 23–34, 1991.

    Google Scholar 

  5. P. W. Besslich, Efficient computer method for EX-OR logic design,Proc. IEE, Pt. E, Computer Digital Techs., vol. 130, 203–206, 1983.

    Google Scholar 

  6. R. E. Bryant, Graph-based algorithms for Boolean function manipulation,IEEE Trans. Computers, vol. 35, 677–691, 1986.

    Google Scholar 

  7. S. Chattopadhyay, S. Roy, and P. P. Chaudhuri, Synthesis of highly testable fixed-polarity AND-XOR canonical networks-A genetic algorithm-based approach,IEEE Trans. Computers, vol. 45, 487–490, 1996.

    Google Scholar 

  8. D. Debnath and T. Sasao, GRMIN2: A heuristic simplification algorithm for generalised Reed-Muller expressions,Proc. IEE—Computer Digital Techs., vol. 143, 376–384, 1996.

    Google Scholar 

  9. R. Drechsler and B. Becker, Relation between OFDDs and FPRMs,Electron. Lett., vol. 32, 1975–1976, 1996.

    Google Scholar 

  10. R. Drechsler, M. Theobald, and B. Becker, Fast OFDD-based minimisation of fixed polarity Reed-Muller expressions,IEEE Trans. Computers, vol. 45, 1294–1299, 1996.

    Google Scholar 

  11. B. Fei, Q. Hong, H. Wu, M. A. Perkowski, and N. Zhuang, Efficient computation for ternary Reed-Muller expansions under fixed polarities,Internat. J. Electron., vol. 75, 685–688, 1993.

    Google Scholar 

  12. D. H. Green,Modern logic design Addison-Wesley, Wokingham, U.K., 1986.

    Google Scholar 

  13. D. H. Green, Reed-Muller expansions of incompletely specified functions,Proc. IEE, Pt. E, Computer Digital Techs., vol. 134, 228–236, 1987.

    Google Scholar 

  14. D. H. Green, Simplification of switching functions using variable-entered maps,Internat. J. Electron., vol. 75, 877–886, 1993.

    Google Scholar 

  15. D. H. Green, Dual forms of Reed-Muller expansions,Proc. IEE—Computer Digital Techs., vol. 141, 184–192, 1994.

    Google Scholar 

  16. B. Harking, Efficient algorithm for canonical Reed-Muller expansions of Boolean functions,Proc. IEE, Pt. E, Computer Digital Techs., vol. 137, 366–370, 1990.

    Google Scholar 

  17. T. L. Lin and A. Tran, Minimization of multiple-output exclusive-OR switching functions,Internal. J. Electron., vol. 75, 665–674, 1993.

    Google Scholar 

  18. T. C. Lin, A. Tran, and C. Ouyang, Reed-Muller universal logic module and its application to function realization,Internat. J. Electron., vol. 75, 675–684, 1993.

    Google Scholar 

  19. P. K. Lui and J. C. Muzio, Boolean matrix transforms for the parity spectrum and minimisation of modulo-2 canonical expansions,Proc. IEE, Pt. E, Computer Digital Techs., vol. 138, 411–417, 1991.

    Google Scholar 

  20. L. McKenzie, A. E. A. Almaini, J. F. Miller, and P. Thomson, Optimisation of Reed-Muller logic functions.Internat. J. Electron. vol. 75, 451–466, 1993.

    Google Scholar 

  21. L. McKenzie and A. E. A. Almaini, Generating Kronecker expansions from reduced Boolean forms using tabular methods,Internat. J. Electron. vol. 82, 313–325, 1997.

    Google Scholar 

  22. H. C. Michael,Parallel programming — A new approach, Silicon Press, Summit, NJ, 1992.

    Google Scholar 

  23. J. F. Miller, H. Luchian, P. V. G. Bradbeer, and P. J. Barclay, Using a genetic algorithm for optimizing fixed polarity Reed-Muller expansions of Boolean functions,Internat. J. Electron., vol. 76, 601–609, 1994.

    Google Scholar 

  24. J. F. Miller and P. Thomson, Highly efficient exhaustive search algorithm for optimizing canonical Reed-Muller expansions of Boolean functions,Internat. J. Electron., vol. 76, 37–56, 1994.

    Google Scholar 

  25. S. Purwar, An efficient method of computing generalised Reed-Muller expansions from binary decision diagram.IEEE Trans. Computers, vol. 40, 1298–1301, 1991.

    Google Scholar 

  26. S. M. Reddy, Easily testable realisations for logic functions,IEEE Trans. Computers, vol. 21, 1183–1188, 1972.

    Google Scholar 

  27. G. I. Robertson, J. F. Miller, and P. Thomson, Non-exhaustive search methods and their use in the minimization of Reed-Muller canonical expansions,Internat. J. Electron., vol. 80, 1–12, 1996.

    Google Scholar 

  28. T. Sasao and P. Besslich, On the complexity of mod-2 sum PLAs,IEEE Trans. Computers, vol. 39, 262–266, 1990.

    Google Scholar 

  29. T. Sasao and F. Izuhara, Exact minimization of AND-EXOR ternary decision diagrams, inIFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pp. 213–220, 1995.

  30. P. Thomson and J. F. Miller, Symbolic method for simplifying AND-EXOR representations of Boolean functions using a binary-decision technique and a genetic algorithm,Proc. IEE—Computer Digital Techs., vol. 143, 151–155, 1996.

    Google Scholar 

  31. M. A. Thornton and V. S. S. Nair, BDD-based spectral approach for Reed-Muller circuit realisation,Proc. IEE—Computer Digital Techs., vol. 143, 145–150, 1996.

    Google Scholar 

  32. A. Tran, Graphical method for the conversion of minterms to Reed-Muller coefficients and the minimisation of exclusive-OR switching functions,Proc. IEE, Pt. E, Computer Digital Techs., vol. 134, 93–99, 1987.

    Google Scholar 

  33. A. Tran, Tri-state map for the minimisation of exclusive-OR switching functions,Proc. IEE, Pt E, Computer Digital Techs., vol. 136, 16–21, 1989.

    Google Scholar 

  34. C.-C. Tsai and M. Marek-Sadowska, Minimisation of fixed-polarity AND/XOR canonical networks,Proc. IEE—Computer Digital Techs., vol. 141, 369–374, 1994.

    Google Scholar 

  35. C.-C. Tsai and M. Marek-Sadowska, Boolean functions classification via fixed-polarity Reed-Muller forms,IEEE Trans. Computers, vol. 46, 173–186, 1997.

    Google Scholar 

  36. B. Vinnakota and V. V. B. Rao, Generation of all Reed-Muller expansions of a switching function,IEEE Trans. Computers, vol. 46, 122–124, 1994.

    Google Scholar 

  37. L. Wang, A. E. A. Almaini, and A. Bystrov, Efficient polarity conversion for large Boolean functions,Proc. IEE—Computer Digital Techs., vol. 146, 197–204, 1999.

    Google Scholar 

  38. X. Wu, A. E. A. Almaini, J. F. Miller, and L. McKenzie, Reed-Muller universal logic module networks,Proc. IEE, Pt. E, Computer Digital Techs., vol. 140, 105–108, 1993.

    Google Scholar 

  39. X. Xu, X. Chen, and S. L. Hurst, Mapping of Reed-Muller coefficients and the minimisation of EX-OR switching functions,Proc. IEE, Pt. E, Computer Digital Techs., vol. 129, 15–20, 1982.

    Google Scholar 

  40. Y. Z. Zhang and P. J. W. Rayner, Minimisation of Reed-Muller polynomials with fixed polarity,Proc. IEE, Pt. E, Computer Digital Techs., vol. 131, 177–186, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, 639798, Singapore, Singapore

    E. C. Tan & H. Yang

Authors
  1. E. C. Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tan, E.C., Yang, H. Optimization of fixed-polarity Reed-Muller circuits using dual-polarity property. Circuits Systems and Signal Process 19, 535–548 (2000). https://doi.org/10.1007/BF01271287

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01271287

Key words

Search

Navigation