A Family of Fast Walsh Hadamard Algorithms With Identical Sparse Matrix Factorization

In this letter, we present a family of fast Walsh Hadamard transform algorithms that have an identical and iterative stage factorization. We show the transform factorization in terms of identical sparse matrices that implement the stages of general radix-R factorization, where R is a power of 2

[1]  R. Yarlagadda,et al.  Hadamard matrix analysis and synthesis: with applications to communications and signal/image processing , 1996 .

[2]  H. Andrews,et al.  Hadamard transform image coding , 1969 .

[3]  J. Magnus,et al.  Matrix Differential Calculus with Applications in Statistics and Econometrics , 1991 .

[4]  George Miel,et al.  Constant Geometry Fast Fourier Transforms on Array Processors , 1993, IEEE Trans. Computers.

[5]  Jaakko Astola,et al.  Architecture-oriented regular algorithms for discrete sine and cosine transforms , 1999, IEEE Trans. Signal Process..

[6]  Y. Yasuda,et al.  Simple systolic array algorithm for Hadamard transform , 1990 .

[7]  M. O. Ahmad,et al.  Fast computation of the discrete Walsh and Hadamard transforms , 1998, IEEE Trans. Image Process..

[8]  Li Ping,et al.  Low-rate turbo-Hadamard codes , 2001, IEEE Trans. Inf. Theory.

[9]  Francisco Argüello,et al.  A VLSI Constant Geometry Architecture for the Fast Hartley and Fourier Transforms , 1992, IEEE Trans. Parallel Distributed Syst..

[10]  Yuh-Ming Huang,et al.  Block Diagonal Structure in Discrete Transforms , 1989, J. Inf. Sci. Eng..

[11]  Marshall C. Pease,et al.  An Adaptation of the Fast Fourier Transform for Parallel Processing , 1968, JACM.

[12]  A. Holt,et al.  Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs) , 1989 .

[13]  Martin Bossert,et al.  Space-time codes based on Hadamard matrices , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[14]  E. Ziegel.  Matrix Differential Calculus With Applications in Statistics and Econometrics , 1989 .

[15]  M. Serra,et al.  IFFT-FFT core architecture with an identical stage structure for wireless LAN communications , 2004, IEEE 5th Workshop on Signal Processing Advances in Wireless Communications, 2004..

[16]  V. M. Smolyaninov,et al.  Use of fast Walsh-Hadamard transformation for optimal symbol-by-symbol binary block-code decoding , 1998 .

[17]  Yair Be'ery,et al.  Optimal soft decision block decoders based on fast Hadamard transform , 1986, IEEE Trans. Inf. Theory.

[18]  J.E. Whelchel,et al.  The systolic phase rotation FFT-a new algorithm and parallel processor architecture , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[19]  Abbes Amira,et al.  Novel FPGA implementations of Walsh-Hadamard transforms for signal processing , 2001 .

[20]  Moon Ho Lee,et al.  Fast Hadamard transform based on a simple matrix factorization , 1986, IEEE Trans. Acoust. Speech Signal Process..

[21]  Andreas Karlsson,et al.  Matrix Analysis for Statistics , 2007, Technometrics.