Flexible optimization of fixed polarity Reed-Muller expansions for multiple output completely and incompletely specified Boolean functions

Author

Chang, Chip-Hong ; Falkowski, Bogdan J.

Author_Institution

Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore

fYear

1995

fDate

29 Aug-1 Sep 1995

Firstpage

335

Lastpage

340

Abstract

A new algorithm that generates optimal fixed polarity Reed-Muller expansions based on user specified optimization criteria is shown. The algorithm accepts reduced representation of Boolean functions in form of an array of cubes and operates on an Algebraic Ternary Decision Tree together with lookup tables of flexible sizes. Allocation of don´t care minterms is performed in an non exhaustive way by a heuristic approach based on the properties of Reed-Muller expansions

Keywords

Boolean functions; Reed-Muller codes; logic CAD; logic design; minimisation of switching nets; table lookup; Algebraic Ternary Decision Tree; Boolean functions; Reed-Muller expansions; fixed polarity; lookup tables; multiple output; optimization; Boolean functions; Circuit synthesis; Circuit testing; Decision trees; Electrical fault detection; Graph theory; Logic circuits; Minimization methods; Phase change materials; Table lookup;

fLanguage

English

Publisher

ieee

Conference_Titel

Design Automation Conference, 1995. Proceedings of the ASP-DAC '95/CHDL '95/VLSI '95., IFIP International Conference on Hardware Description Languages. IFIP International Conference on Very Large Scal

Conference_Location

Chiba

Print_ISBN

4-930813-67-0

Type

conf

DOI

10.1109/ASPDAC.1995.486242

Filename

486242