Original structure for Walsh–Hadamard transform on sliding window
Open Access
- 1 November 2015
- journal article
- circuits and-systems
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 51 (23) , 1850-1852
Abstract
The N th‐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 2 N −2 additions for each projection. The resources used for a parallel field programmable gate array implementation are presented.Keywords
This publication has 7 references indexed in Scilit:
- Fast Algorithm for Walsh Hadamard Transform on Sliding WindowsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2009
- The Gray-Code Filter KernelsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2007
- Real-time pattern matching using projection kernelsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- Hardware structure for Walsh-Hadamard transformsElectronics Letters, 1998
- The use of switching functions and Walsh series to calculate waveform distortion in thyristor controlled compensated power circuitsIEEE Transactions on Power Delivery, 1998
- A Recursive Algorithm for Sequency-Ordered Fast Walsh TransformsIEEE Transactions on Computers, 1977
- A sequency-ordered fast Walsh transformIEEE Transactions on Audio and Electroacoustics, 1972