Abstract
A family of generalised complex Hadamard transforms using the concept of polarity is introduced. Forward and inverse transformation kernels and methods of recursive generation of transform matrices using Kronecker products of elementary matrices are shown. Mutual relationships among transform matrices and spectra for arbitrary polarities are presented. Efficient ways of calculating spectra for logic functions through decision diagrams are also shown. The half-spectrum property is used to reduce further the computational requirements for both fast transforms and decision diagram based calculations.
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 - Vision, Image, and 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.
