In-place and in-order algorithms for Paley- and sequency-ordered Walsh-Hadamard transforms

Author

Wang, Zhongde

Author_Institution

Dept. of Electr. Telecommun., Beijing Univ. of Posts & Telecommun., China

fYear

1990

fDate

21-23 Aug 1990

Firstpage

90

Lastpage

94

Abstract

The in-place algorithms for the Hadamard-, Paley-, and sequency-ordered Walsh-Hadamard transform (WHT) are first reviewed. All these algorithms possess the FFT (fast Fourier transform) type butterfly structure. The in-place algorithms for the Paley- and sequency-ordered WHT require a pre- or post-bit reversal operation. By combining the bit reversal with the butterfly structure, in-place and in-order algorithms for the Paley- and sequency-ordered WHT are obtained. A FORTRAN subroutine for implementing both Paley- and sequency-ordered WHT is listed

Keywords

FORTRAN listings; mathematics computing; signal processing; transforms; FORTRAN subroutine; Hadamard-ordered transform; Paley-ordered transform; butterfly structure; in-order algorithms; in-place algorithms; post-bit reversal operation; pre-bit reversal; sequency-ordered Walsh-Hadamard transform; signal processing; Discrete transforms; Power generation; Signal processing algorithms; Sparse matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Electromagnetic Compatibility, 1990. Symposium Record., 1990 IEEE International Symposium on

Conference_Location

Washington, DC

Print_ISBN

0-7803-7264-6

Type

conf

DOI

10.1109/ISEMC.1990.252737

Filename

252737