Original structure for Walsh–Hadamard transform on sliding window

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 compu...

Full description

Saved in:

Bibliographic Details
Published in:	Electronics letters Vol. 51; no. 23; pp. 1850 - 1852
Main Authors:	Tisserand, E, Berviller, Y
Format:	Journal Article
Language:	English
Published:	The Institution of Engineering and Technology 05.11.2015 IET
Subjects:	Algorithms ascending order Circuits and systems coefficient computation comb filters Delay delay value descending order digital arithmetic Electronics Engineering Sciences Field programmable gate arrays Hadamard order Hadamard transforms Micro and nanotechnologies Microelectronics parallel field programmable gate array implementation Projection RIF filters sequency order Signal and Image processing Sliding sliding window Synthesis transfer functions Transforms Trees Walsh‐Hadamard transform Hadamard transforms descending order field programmable gate arrays Walsh-Hadamard transform parallel field programmable gate array implementation coefficient computation sliding window delay value Hadamard order sequency order digital arithmetic RIF filters comb filters ascending order transfer functions
ISSN:	0013-5194, 1350-911X, 1350-911X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!