Techniques for dual forms of Reed-Muller expansion conversion

被引：9

作者：

Yang, M.

Wang, L. ^{[1
]}

Tong, J. R.

Almaini, A. E. A.

机构：

[1] Fudan Univ, Microelect Dept, State Key Lab ASIC & Syst, Shanghai 201203, Peoples R China

[2] Napier Polytech, Sch Engn, Edinburgh EH10 5DT, Midlothian, Scotland

来源：

INTEGRATION-THE VLSI JOURNAL | 2008年 / 41卷 / 01期

基金：

中国国家自然科学基金;

关键词：

tabular technique; map technique; reed-muller; canonical OR coincidence;

D O I：

10.1016/j.vlsi.2007.02.001

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：113 / 122

页数：10