DocumentCode :
1616927
Title :
A fast DSP circuit based on FHT
Author :
Piazza, F. ; Marchesi, M. ; Orlandi, G.
Author_Institution :
Dept. of Electron. & Autom., Ancona Univ., Italy
fYear :
1989
Firstpage :
216
Abstract :
The discrete Hartley transform (DHT) is a real-valued transform closely related to the discrete Fourier transform (DFT) of a real-valued sequence. Several fast algorithms for the computation of the DHT (FHTs) have been proposed. A new cascade circuit for computing the DHT is presented in two versions, which implement, respectively, the radix-2 decimation-in-time and decimation-in-frequency FHT algorithms. The circuit makes use of CORDIC processors and allows an easy computation of the DFT, the amplitude and phase spectra, and the cyclic convolution and correlation of two sequences. Some architectures to perform such operations are also presented
Keywords :
computerised signal processing; parallel architectures; transformers; CORDIC processors; DFT; DHT; FHT algorithms; amplitude spectra; architectures; cascade circuit; cyclic convolution; cyclic correlation; decimation-in-frequency; digital signal processors; discrete Fourier transform; discrete Hartley transform; fast DSP circuit; parallel processing; phase spectra; radix-2 decimation-in-time; real-valued sequence; real-valued transform; Circuits; Computer architecture; Convolution; DH-HEMTs; Digital signal processing; Discrete Fourier transforms; Discrete transforms; Fourier transforms; Modems; Signal processing algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1989., IEEE International Symposium on
Conference_Location :
Portland, OR
Type :
conf
DOI :
10.1109/ISCAS.1989.100330
Filename :
100330
Link To Document :
بازگشت