Bibliography on Hadamard (Walsh) Transforms
(C) S. Samadi
Books
- W.D. Wallis, A.P. Street and J.S. Wallis,
Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices.
Lecture Notes in Mathematics, vol. 292, Springer-Verlag, 1972.
- S.S. Agaian, Hadamard Matrices and Their Applications.
Lecture Notes in Mathematics, vol. 1168, Springer-Verlag, 1985.
- R.K. Yarlagadda and J.E. Hershey, Hadamard Matrix Analysis and
Synthesis, with Applications to Communications and Signal/Image
Processing. Boston: Kluwer Academic Publishers, 1996.
Journal Articles in Chronological Order
IEEE Transactions
- J.L. Shanks, ``Computation of the fast Wlash-Fourier transform,''
IEEE Trans. Computers, pp. 457--459, May 1969.
- J.W. Carl, ``Comment on `An algorithm for a fast Hadamard matrix
transform of order twelve','' IEEE Trans. Computers,
vol. C-20, pp. 587-588, 1971.
- Y.L. Henry and C.L. Sheng, ``Fast Hadamard transform using the
H diagram,'' IEEE Trans. Computers, vol. C-22, pp. 957-960,
1973.
- H. Larsen, ``An algorithm to compute the sequency ordered
Walsh transform,'' IEEE Trans. Acoust., Speech, Signal Processing,
vol. ASSP-24, pp. 335--336, 1976.
- B.J. Fino and V.R. Algazi, ``Unified matrix treatment of the fast
Walsh-Hadamard transform,'' IEEE Trans. Computers,
pp. 1142--1146, 1976.
- Y.A. Geadah and M.J. Corinthios, ``Natural, dyadic and sequency order
algorithms and processors for the Walsh-Hadamard Transform,'' IEEE
Trans. Comput., vol. C-26, pp. 435--442, 1977.
- R.D. Brown, ``A recursive algorithm for sequency ordered fast Walsh
transform,'' IEEE Trans. Comput., vol. C-26, no. 8,
pp. 819--822, 1977.
- W.D. Lyle, Jr. and F. Forte, ``A useful property of the coefficients of
a Walsh-Hadamard transform,'' IEEE Trans. Acoustics, Speech,
Signal Processing, vol. ASSP-28, p. 479, 1980.
- H. Kitajima and T. Shimono, ``Residual correlation of the Hadamard
transforms of stationary Markov-1 signals,'' IEEE Trans.
Communications, vol. 31, no. 1, pp. 119--121, 1983.
- G.H. Hostetter, ``Recursive comuptation of Walsh-Hadamard
transformation,'' Signal Processing, vol. 8, no. 1, pp. 41--49,
Feb. 1985.
- M.H. Lee and M. Kaveh, ``Fast Hadamard transform based on a
simple matrix factorization,'' IEEE Trans. Acoust., Speech, Signal
Processing, vol. ASSP-34, no. 6, pp. 1666-1667, 1986.
- D. Hertz. ``On fast multivariable bilinear and Hadamard transforms,''
IEEE Trans. Signal Processing, vol. 39, no. 8, pp. 1788--1792, 1991.
- D. Coppersmith, E. Faig and E. Linzer, ``Hadamard transforms on
multiply/add architectures,'' IEEE Trans. Signal Processing,
vol. 42, no. 4, pp. 969--970, April 1994.
Other Resources
- S. Boussakta, J.G.A. Holt, ``Fast algorithm for calculation of both
Walsh-Hadamard and Fourier transform (FWFTs), Electron. Lett.,
vol. 25, no.20, pp. 1352-1353, 1989.
- M.M. Anguh and R.R. Martin, ``A truncation method for computing Walsh
transforms with applications to image processing,''
CGIP, vol. 55, no. 6, pp. 482--493, 1993.
- H.G. Sarukhanyan, ``Decomposition of the Hadamard matrices and fast
Hadamard transform,'' Lecture Notes in Computer Science, vol. 1296,
pp. 575--581, 1997.
Our publications
Beam me up!
Last modified: Sat Feb 19 17:04:13 JST 2000