Abstract
A nonlinear quantised transform called a sign transform is introduced. Besides transforming uniquely between ternary data and the ternary spectral domain, the transform also converts to and from the sign Haar and sign Walsh spectral domains. Recursive equations defining forward and inverse transforms are presented. It is possible to calculate the new transform using recursive definitions of a new type of matrix called a sign matrix. New properties of, and operations on, such a type of matrix are shown. The fast flow diagram for efficient calculation of the new transform is introduced, implemented in the form of a locally connected flexible parallel architecture. The computational advantages of new algorithms developed for sign transform, and their comparison with known fast sign Haar and fast sign Walsh transforms, are also discussed.
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 - Computers and Digital Techniques
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.
