DocumentCode
2571706
Title
An efficient transformation method for DFRM expansions
Author
Xu, H. ; Yang, M. ; Wang, L. ; Tong, J.R. ; Almaini, A.E.A.
Author_Institution
Tianjin Vocational Coll. of Mech. & Electr., Tianjin
fYear
2007
fDate
22-25 Oct. 2007
Firstpage
1158
Lastpage
1161
Abstract
Dual Form of Reed-Muller (DFRM) expansions with fixed polarity are derived from Reed-Muller (RM) expansions by using the operation of Kronecker matrix products. An efficient decomposition method is proposed based on the formulation. The method can be used for the transformation between from DFRM expansions to RM expansions within the same fixed polarity as well. Hence, the proposed method is bidirectional. After decomposition, the calculation of the duplicated matrix is avoided, resulting in less computation time. Time complexity of the algorithm is 0(21.5n). The time used for small variables is virtual zero for the tested MCNC benchmarks. For large variable, it still works very well and achieves less than 20 seconds for 25-variable benchmark. In the implementation, only on-set coefficients are used. Consequently, the space complexity is O(M), where M is the number of on-set coefficients. It makes simultaneous optimization in both RM and DFRM expansions possible.
Keywords
logic circuits; network synthesis; DFRM expansions; Kronecker products; decomposition method; dual form of Reed-Muller expansions; fixed polarity; Algebra; Arithmetic; Benchmark testing; Circuit synthesis; Circuit testing; Electronic design automation and methodology; Logic circuits; Logic design; Logic testing; Matrix decomposition; Canonical; EDA; Logic synthesis; OR-coincidence; Reed-Muller;
fLanguage
English
Publisher
ieee
Conference_Titel
ASIC, 2007. ASICON '07. 7th International Conference on
Conference_Location
Guilin
Print_ISBN
978-1-4244-1132-0
Electronic_ISBN
978-1-4244-1132-0
Type
conf
DOI
10.1109/ICASIC.2007.4415839
Filename
4415839
Link To Document