Fast Conversion for Large Canonical OR-Coincidence Functions

• Published in: APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems pp. 1643 - 1646
• Main Authors: Yang, M., Wang, L., Almaini, A.E.A.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2006
• Subjects: Application specific integrated circuits; Central Processing Unit; Circuit synthesis; Circuit testing; Digital circuits; dual form of Reed-Muller; electronics design automation; Laboratories; Logic functions; logic synthesis; Microelectronics; Programmable logic arrays; Signal processing algorithms
• ISBN: 9781424403868; 9781424403875; 1424403871; 1424403863
• DOI: 10.1109/APCCAS.2006.342080

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