New split-radix algorithm for the discrete Hartley transform

Author

Bi, Guoan

Author_Institution

Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore

Volume

45

Issue

2

fYear

1997

fDate

2/1/1997 12:00:00 AM

Firstpage

297

Lastpage

302

Abstract

This paper presents a split-radix algorithm that can flexibly compute the discrete Hartley transforms of various sequence lengths. Comparisons with previously reported algorithms are made in terms of the required number of additions and multiplications. It shows that the length-3*2^m DHTs need a smaller number of multiplications than the length-2^m DHTs. However, they both require about the same computational complexity in terms of the total number of additions and multiplications. Optimized computation of length-12, -16 and -24 DFTs are also provided

Keywords

Hartley transforms; computational complexity; digital arithmetic; sequences; signal processing; additions; computational complexity; discrete Hartley transform; length-12 DFT; length-16 DFT; length-24 DFT; length-2^m DHTs; length-3*2^m DHTs; multiplications; optimized computation; sequence lengths; split-radix algorithm; Bismuth; Computational complexity; Computational efficiency; Content addressable storage; Costs; Digital signal processing; Discrete transforms; Helium; Power engineering computing; Signal processing algorithms;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.554295

Filename

554295