Mapping of on-set fixed polarity Reed-Muller coefficients from on-set canonical sum of products coefficients and the minimization of pseudo Reed-Muller expressions

International Journal of Electronics

Volumn 86, Issue 3, 1999, Pages 255-268

  Huq Azad Khan, Md Mozammel ^a   Alam, Md Shamsul ^b  

^a KHULNA UNIVERSITY   (Bangladesh)

^b BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; LOGIC GATES; VECTORS;

ON-SET FIXED POLARITY REED-MULLER COEFFICIENTS;

LOGIC CIRCUITS;

EID: 0033097881     PISSN: 00207217     EISSN: 13623060     Source Type: Journal    
DOI: 10.1080/002072199133391     Document Type: Article

References (24)

1. Almaini, A. E. A., Thomson, P., and Hanson, D., 1991, Tabular techniques for Reed-Muller logic. International Journal of Electronics, 70, 23-39.
2. Chattopadhyay, S., Roy, S., and Pal Chaudhuri, P., 1996, Synthesis of highly testable fixed-polarity AND-XOR canonical networks—A Genetic Algorithm based approach. IEEE Transaction of Computers, 45, 487-490.
3. Damarla, T R., and Karpovsky, M., 1989, Fault detection in combinational networks by Reed-Muller transforms. IEEE Transaction on Computers, 38, 788-797.
4. Davio, M., Deschamps, J. P., and Thayse, A., 1978, Discrete and Switching Functions. (McGraw-Hill International).
5. Falkowski, B. J., and Chang, C.-H., 1995, An exact minimizer of fixed polarity Reed-Muller expansions. International Journal of Electronics, 79, 389-409.
6. Falkowski, B. J., and Pehkowski, M. A., 1991, One more way to calculate generalized Reed-Muller expansions of Boolean functions. International Journal of Electronics, 71, 385-396.
7. Fisheh, L. T, 1974, Unateness properties of AND-EXCLUSIVE-OR logic circuits. IEEE Transaction on Computers, 23, 166-172.
8. Gheen, D., 1986, Modern Logic Design (Wokingham, England: Addison-Wesley Publishing Company).
9. Gheen, D. H., 1990, Reed-Muller canonical forms with mixed polarity and their manipulation. IEE Proceeding on Computers and Digital Technique, 137, 110-113.
10. Habib, M. K., 1992, Efficient algorithm for Reed-Muller expansion of completely and incompletely speci ed functions. International Symposium on Logic Synthesis and Microprocessor Architecture, Iizuka, Japan, July 12 15, 1992.
11. Hahking, B., 1990, Efficient algorithm for canonical Reed-Muller expansions of Boolean functions. IEE Proceeding on Computers and Digital Techniques, 137, 366-370.
12. Khan, M. M. H. A., and Alam, M. S., 1997, Mapping of fixed polarity Reed-Muller coefficients from minterms and the minimization of fixed polarity Reed-Muller expressions. International Journal of Electronics, 83, 235-247.
13. Lui, P. K., and Muzio, J., 1991, Boolean matrix transforms for the parity spectrum and the minimization of modulo-2 canonical expansions. IEE Proceeding on Computers and Digital Techniques, 138, 411-417.
14. Lui, P. K., and Muzio, J., 1992, Boolean matrix transforms for the minimization of modulo-2 canonical expressions. IEEE Transaction on Computers, 41, 342-347.
15. Puhwah, S., 1991, An efficient method of computing generalized Reed-Muller expansions from binary decision diagram IEEE Transactions on Computers, 40, 1298-1301.
16. Reddy, S. M., 1972, Easily testable realization for logic functions. IEEE Transaction on Computers, 21, 1182-1188.
17. Sahabi, A., and Pehkowski, M. A., 1992, Fast exact and quasi-minimal minimization of highly testable fixed polarity AND/XOR canonical networks. Proceeding of the 29th Design Automation Conference 1992, Anaheim, CA, 11.30-35.
18. Sasao, T, 1993, AND-EXOR expressions and their optimization. In T. Sasao (Ed.) Logic Synthesis and Optimization (Massachusetts, USA: Kluwer Academic Publishers), pp. 287-312.
19. Sasao, T, and Besslich, p., 1990, On the complexity of MOD-2 sum PLA’s. IEEE Transaction on Computers, 39, 262-266.
20. Sasao, T, and Izuhaha, F., 1995, Exact minimization of AND-EXOR expressions using multi-terminal EXOR ternary decision diagrams. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design.
21. Tsai, C.-C., and Mahek-Sadowska, M., 1994a, Boolean matching using generalized Reed-Muller forms. Proceeding of the 31st ACM/IEEE Design Automation Conference, pp. 339-344.
22. Tsai, C.-C., and Mahak-Sadowska, M., 1994b, Minimization of fixed-polarity AND/XOR canonical networks. IEE Proceedings on Computers and Digital Techniques, 141, 369-374.
23. Tsai, C.-C., and Mahak-Sadowska, M., 1996, Generalized Reed-Muller forms as a tool to detect symmetries. IEEE Transaction on Computers, 45, 33-40.
24. Tsai, C.-C., and Mahak-Sadowska, M., 1997, Boolean functions classifications via fixed polarity Reed-Muller forms. IEEE Transaction on Computers, 46, 173-186.