论文信息 - Efficient systolic solution for a new prime factor discrete Hartley transform algorithm

Efficient systolic solution for a new prime factor discrete Hartley transform algorithm

Recently, a novel systolic structure has been proposed for the computation of DFT for transform length N=4M, M being prime to 4. This paper proposes a similar structure for the computation of DHT by prime factor decomposition. A new recursive algorithm is also proposed for computing DHT using a linear systolic array of cordic processing elements. The proposed structure has nearly the same hardware requirement as that of the corresponding DFT structure for real-valued data; but it yields significantly higher throughput.

Ganapati Panda | P. K. Meher | J. K. Satapathy

[1] K. J. Jones. 2D systolic solution to discrete Fourier transform , 1989 .

[2] T. Kailath,et al. VLSI and Modern Signal Processing , 1984 .

[3] K. J. Jones. High-throughput, reduced hardware systolic solution to prime factor discrete Fourier transform algorithm , 1990 .

[4] Tariq S. Durrani,et al. Systolic implementations for deconvolution, DFT and FFT , 1985 .

[5] R. Bracewell. Discrete Hartley transform , 1983 .

[6] Said Boussakta,et al. Calculation of the discrete Hartley transform via the Fermat number transform using a VLSI chip , 1988 .

[7] C. Burrus. Index mappings for multidimensional formulation of the DFT and convolution , 1977 .

[8] Chaitali Chakrabarti,et al. Systolic Architectures for the Computation of the Discrete Hartley and the Discrete Cosine Transforms Based on Prime Factor Decomposition , 1990, IEEE Trans. Computers.