Abstract
Identification of disjunctive decomposition in a balanced Boolean function through Walsh spectra is performed. Balanced Boolean functions occur frequently in common logic circuits such as adders, parity checkers and multiplexers. Various types of decomposition of the balanced functions are considered and the corresponding Walsh spectral conditions that have to be satisfied for their existence are listed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEE Proceedings - Computers and Digital Techniques
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
