Abstract
A common measure of Boolean function complexity is transformed to the Rademacher/Walsh spectral domain. The resulting spectral measure has an appealing visual interpretation not found in the functional domain. The relevance of this spectral measure to spectral translation and to the testability of certain classes of combinational networks is examined.
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 callDisclaimer: 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.
