Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa

DOI10.1016/S0020-0190(97)00068-9MaRDI QIDQ287075zbMATH OpenOpenAlexFDO

Authors Md. Mozammel Huq Azad Khan, M. Shamsul Alam

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00068-9

zbMATH Keywords

analysis of algorithmscombinatorial problemsdesign of algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functions
• Generalized partially-mixed-polarity Reed-Muller expansion and its fast computation
• Fast OFDD-based minimization of fixed polarity Reed-Muller expressions
• Quaternary fixed-polarity Reed--Muller expansion computation through operations on disjoint cubes and its comparison with other methods
• scientific article; zbMATH DE number 1446803

Cites work

• Easily Testable Realizations ror Logic Functions
• Efficient and fast algorithm to generate minimal Reed-Muller exclusive-OR expansions with mixed polarity for completely and incompletely specified functions and its computer implementation
• Minimisation of fixed-polarity AND/XOR canonical networks
• Minimization of Reed–Muller Canonic Expansion

Cited in

(2)

• Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functions
• Input irredundancy of mixed-polarity Reed-Muller equations

This page was built for publication: Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287075)