Abstract
A new formulation of the multi-polarity generalized Walsh transform has been introduced. The formulation allows a uniform representation of Boolean functions by a set of orthogonal and generalized Walsh spectral coefficients. Forward and inverse transformation kernels and the method of recursive generation of transform matrices by using Kronecker products of elementary matrices have been given. Mutual relations among transform matrices and spectra for arbitrary polarities have been investigated. Fast forward and inverse generalized Walsh transforms have been developed. An algorithm to calculate the generalized Walsh transform from a cube array specification of incompletely specified Boolean functions has been shown. The transform algorithm makes use of the properties of an array of disjoint cubes and allows the determination of the spectral coefficients in an independent way. The computer implementation drastically reduces the required time of computation by allowing calculation of only chosen coefficients in specified polarity. The entire spectrum-if required-can be computed incrementally for groups of coefficients.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
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.
