The classification of Boolean functions using the Rademacher-Walsh transform

The classification of Boolean functions using the Rademacher-Walsh transform

When considering Boolean switching functions with n input variables, there are 2^(2^n) possible functions that can be realized by enumerating all possible combinations of input values and arrangements of output values. As is expected with double exponential growth, the number of functions becomes un...

Full description

Bibliographic Details
Main Author: Anderson, Neil Arnold
Other Authors: Muzio, Jon C.
Language:English
en
Published: 2007
Subjects:
Spectral Classification
Rademacher-Walsh Transform
Digital Logic
Boolean Functions
NPN Classes
UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science
Online Access:http://hdl.handle.net/1828/221

Internet

http://hdl.handle.net/1828/221

Similar Items