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

DOI10.1016/S0020-0190(97)00068-9zbMath1336.94094OpenAlexW1991499304MaRDI QIDQ287075

Md. Shamsul Alam, Md. Mozammel Huq Azad Khan

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

combinatorial problemsanalysis of algorithmsdesign of algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites Work

• 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
• Minimization of Reed–Muller Canonic Expansion
• Minimisation of fixed-polarity AND/XOR canonical networks
• Easily Testable Realizations ror Logic Functions

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