Title :
Fast algorithms for generalized discrete Hartley transform of composite sequence lengths
Author :
Bi, Guoan ; Chen, Yan Qiu ; Zeng, Yonghong
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
fDate :
9/1/2000 12:00:00 AM
Abstract :
This paper presents fast algorithms for type-II, type-III, and type-IV generalized discrete Hartley transform. In particular, new odd-factor algorithms are derived to support transforms whose sequence length contains multiple odd factors. By jointly using the odd-factor and radix-2 algorithms, fast computation for arbitrarily composite sequence length can be achieved. Compared to other reported algorithms, the proposed ones have a regular computational structure, achieve a substantial reduction of computational complexity, and support a wider range of choices on the sequence length
Keywords :
computational complexity; discrete Hartley transforms; composite sequence lengths; computational complexity; generalized discrete Hartley transform; odd-factor algorithms; radix-2 algorithms; regular computational structure; sequence length; type-II transforms; type-III transforms; type-IV transforms; Bismuth; Computational complexity; Computational efficiency; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Filter bank; Fourier transforms; Frequency domain analysis; Signal processing algorithms;
Journal_Title :
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on