Abstract
The Nth-order Walsh–Hadamard transform on a sliding window is described here by means of FIF filters. Factoring the transfer functions of the filters allows for a synthesis of the transform as a tree of comb filters. The trees built in ascending or descending order of the delay value allow the computation of the coefficients, respectively, in the sequency order and in the Hadamard order. The proposed algorithm requires 2N−2 additions for each projection. The resources used for a parallel field programmable gate array implementation are presented.
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 callDisclaimer: 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.
