论文信息 - Generalized discrete Hartley transforms

Generalized discrete Hartley transforms

The discrete Hartley transform is generalized into four classes in the same way as the generalized discrete Fourier transform. Fast algorithms for the resulting transforms are derived. The generalized transforms are expected to be useful in applications such as digital filter banks, fast computation of the discrete Hartley transform for any composite number of data points, fast computations of convolution, and signal representation. The fast computation of skew-circular convolution by the generalized transforms for any composite number of data points is discussed in detail. >

Neng-Chung Hu | Hong-I Chang | Okan K. Ersoy

[1] R. Bracewell. The fast Hartley transform , 1984, Proceedings of the IEEE.

[2] H. Nussbaumer. Fast Fourier transform and convolution algorithms , 1981 .

[3] B. Arambepola,et al. Discrete transforms over polynomial rings with applications in computing multidimensional convolutions , 1980 .

[4] Okan K. Ersoy. Semisystolic Array Implementation of Circular, Skew Circular, and Linear Convolutions , 1985, IEEE Transactions on Computers.

[5] O. K. Ersoy,et al. Fast computation of real discrete Fourier transform for any number of data points , 1991 .

[6] Martin Vetterli,et al. Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real data , 1987, IEEE Trans. Acoust. Speech Signal Process..