Techniques for dual forms of Reed–Muller expansion conversion

Yang, Meng; Wang, Lun Yao; Tong, Jiarong R; Almaini, A E A

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 uo 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 published work significantly in terms of conversion time. Methods based on on-set canonical sum-of-products minterms and canonical product-of-sums maxterms are also investigated.

Citation

Yang, M., Wang, L. Y., Tong, J. R., & Almaini, A. E. A. (2008). Techniques for dual forms of Reed–Muller expansion conversion. Integration : the VLSI journal, 41(1), 113-122. https://doi.org/10.1016/j.vlsi.2007.02.001

• Journal Article Type: Article
• Publication Date: 2008-01
• Deposit Date: Apr 17, 2009
• Journal: Integration, the VLSI Journal
• Print ISSN: 0167-9260
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 41
• Issue: 1
• Pages: 113-122
• DOI: https://doi.org/10.1016/j.vlsi.2007.02.001
• Keywords: Computer logic; Computer applications; Boolean algebra; Mathematical transformations
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/2550