Fast Conversion for Large Canonical OR-Coincidence Functions

Author

Yang, M. ; Wang, L. ; Almaini, A.E.A.

Author_Institution

Dept. of Microelectron., Fudan Univ., Shanghai

fYear

2006

fDate

4-7 Dec. 2006

Firstpage

1643

Lastpage

1646

Abstract

Fixed polarity canonical OR-coincidence (COC) expansions based on inclusive-OR and OR operations are dual forms of fixed polarity Reed-Muller expansions. Traditionally, they are obtained from maxterms of canonical products-of-sum (CPOS) expansions. Two conversion methods are proposed for generating fixed polarity COC expansions. The first proposed method called maxterm method is based on traditional maxterm method. Fast conversion speed is achieved after the coefficients were divided into several segments to reduce the duplication of the calculation. The second proposed method called minterm method generates fixed polarity COC expansions directly from programmable logic array (PLA) files. The minterm method can on average achieve 37.57% speed improvement over the maxterm method. Both algorithms outperform published work significantly

Keywords

Boolean functions; digital arithmetic; logic design; programmable logic arrays; OR operations; PLA; canonical OR-coincidence functions; canonical products-of-sum expansion; digital circuits; electronics design automation; fixed polarity Reed-Muller expansions; inclusive-OR operation; logic synthesis; maxterm method; minterm method; programmable logic array; Application specific integrated circuits; Central Processing Unit; Circuit synthesis; Circuit testing; Digital circuits; Laboratories; Logic functions; Microelectronics; Programmable logic arrays; Signal processing algorithms; digital circuits; dual form of Reed-Muller; electronics design automation; logic synthesis;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2006. APCCAS 2006. IEEE Asia Pacific Conference on

Conference_Location

Singapore

Print_ISBN

1-4244-0387-1

Type

conf

DOI

10.1109/APCCAS.2006.342080

Filename

4145724