GRMIN: a heuristic simplification algorithm for generalized Reed-Muller expressions

Author

Debnath, Debatosh ; Sasao, Tsutomu

Author_Institution

Dept. of Comput. Sci. & Electron., Kyushu Inst. of Technol., Iizuka, Japan

fYear

1995

fDate

29 Aug-1 Sep 1995

Firstpage

341

Lastpage

347

Abstract

A generalized Reed-Muller expression (GRM) is a type of AND-EXOR expressions. In a GRM, each variable may appear both complemented and uncomplemented. Networks realized using GRMs are easily tested. This paper presents GRMIN, a heuristic simplification algorithm for GRMs of multiple-output functions. GRMIN uses eight rules. As the primary objective, it reduces the number of products, and as the secondary objective, it reduces the number of literals. Experimental results show that, in most cases, GRMs require fewer products than conventional sum-of-products expressions (SOPs). GRMIN outperforms existing algorithms

Keywords

combinational circuits; logic CAD; logic design; AND-EXOR expression; GRM; GRMIN; generalized Reed-Muller expression; heuristic simplification algorithm; multiple-output functions; Arithmetic; Circuit testing; Computer science; Concatenated codes; Error correction; Heuristic algorithms; Integrated circuit interconnections; Logic design; Logic functions; Minimization;

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.486243

Filename

486243