Cart (Loading....) | Create Account
Close category search window
 

Boolean Function Matching using Walsh Spectral Decision Diagrams

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Moore, J. ; Southern Methodist Univ., Dallas, TX ; Fazel, K. ; Thornton, M.A. ; Miller, D.M.

This paper investigates two approaches for Boolean matching using NPN equivalence matching. Luks' hypergraph method is implemented and compared to the Walsh spectral decision diagram (SDD) method that we propose here. Both methods determine a canonical representation for each NPN equivalence class. The target functions are then transformed into a canonical representation and compared to the representative canonical forms for the NPN classes. This paper presents the implementation and results of the spectral method in detail. It is shown that the spectral method compares favorably to Luks' method and is better in terms of computational requirements for large functions

Published in:

Design, Applications, Integration and Software, 2006 IEEE Dallas/CAS Workshop on

Date of Conference:

Oct. 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.