DocumentCode
3072732
Title
An FPGA based Walsh Hadamard transforms
Author
Amira, A. ; Bouridane, A. ; Milligan, P.
Author_Institution
Sch. of Comput. Sci., Queen´´s Univ., Belfast, UK
Volume
2
fYear
2001
fDate
6-9 May 2001
Firstpage
569
Abstract
The Walsh-Hadamard transforms are important in many image processing applications including compression, filtering and code design. This paper presents a novel architecture for the fast Hadamard transform, using distributed arithmetic techniques. The mathematical model for the algorithm proposed, the associated design using both a distributed arithmetic ROM and accumulator structure and a sparse matrix factorisation technique, together with the implementation of the algorithm on a Xilinx FPGA board are described. The design has O(2n) computation time complexity, where n is the input data wordlength, requires less area when compared with existing systolic architectures and is suitable for FPGA implementations
Keywords
Hadamard transforms; Walsh functions; computational complexity; distributed arithmetic; field programmable gate arrays; image processing equipment; matrix decomposition; sparse matrices; DSP; FPGA based Walsh Hadamard transforms; FPGA implementations; Xilinx FPGA board; accumulator structure; computation time complexity; distributed arithmetic ROM; distributed arithmetic techniques; fast Hadamard transform; image processing applications; mathematical model; sparse matrix factorisation technique; Algorithm design and analysis; Arithmetic; Computer architecture; Field programmable gate arrays; Filtering; Image coding; Image processing; Mathematical model; Read only memory; Sparse matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on
Conference_Location
Sydney, NSW
Print_ISBN
0-7803-6685-9
Type
conf
DOI
10.1109/ISCAS.2001.921134
Filename
921134
Link To Document