Techniques for dual forms of Reed-Muller expansion conversion

Authors:
M. Yang;L. Wang;J. R. Tong;A. E. A. Almaini
Affiliations:
State Key Laboratory of ASIC & System, Microelectronics Department, Fudan University, Shanghai 201203, China;State Key Laboratory of ASIC & System, Microelectronics Department, Fudan University, Shanghai 201203, China;State Key Laboratory of ASIC & System, Microelectronics Department, Fudan University, Shanghai 201203, China;10 Colinton Road, School of Engineering, Napier University, Edinburgh EH10 5DT, UK
Venue:
Integration, the VLSI Journal
Year:
2008

Citing 3
Cited 1

Electronic logic systems (3rd ed.)

Electronic logic systems (3rd ed.)
Power minimization of FPRM functions based on polarity conversion

Journal of Computer Science and Technology
Novel synthesis and optimization of multi-level mixed polarity Reed-Muller functions

Journal of Computer Science and Technology

A novel quantum genetic algorithm for area optimization of FPRM circuits

IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dual Forms of Reed-Muller (DFRM) are implemented in OR/XNOR forms, which are based on the features of coincidence operation. Map folding and transformation techniques are proposed for the conversion between Boolean and DFRM expansions. However, map techniques can only be used for up to 6 variables. To overcome the limitation, serial tabular technique (STT) and parallel tabular technique (PTT) are proposed. STT deals with one variable at a time while PTT generates terms in parallel. Both tabular techniques outperform significantly published work in terms of conversion time. Methods based on on-set canonical sum-of-products minterms and canonical product-of-sums maxterms are also investigated.