Real transform algorithm for computing discrete circular deconvolution
@article{Lizhi1996RealTA,
title={Real transform algorithm for computing discrete circular deconvolution},
author={C. Li-zhi and Tong Li and Jiang Zeng-rong},
journal={Proceedings of Third International Conference on Signal Processing (ICSP'96)},
year={1996},
volume={1},
pages={166-169 vol.1}
}Fast computation of the discrete deconvolution is very important in image/video signal processing. We develop a real transform algorithm for calculating the discrete circular deconvolution by substituting the fast Fourier transform (FFT) defined in the complex domain. It is shown that the computational cost of the algorithm is about half of the traditional FFT. Furthermore, the algorithm has a weak numerical stability.
7 Citations
Relation between Type-II Discrete Sine Transform and Type -I Discrete Hartley Transform
- Computer Science
- 2017
- PDF
Scalable and modular memory-based systolic architectures for discrete Hartley transform
- Computer Science
- IEEE Transactions on Circuits and Systems I: Regular Papers
- 2006
- 46
- PDF
FPGA Implementation of DHT Through Parallel and Pipeline Structure
- 2021 International Conference on Computer Communication and Informatics (ICCCI)
- 2021
References
SHOWING 1-9 OF 9 REFERENCES
Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real data
- Mathematics, Computer Science
- IEEE Trans. Acoust. Speech Signal Process.
- 1987
- 127
- PDF
Implementation of "Split-radix" FFT algorithms for complex, real, and real symmetric data
- Mathematics, Computer Science
- ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing
- 1985
- 133
Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data
- Mathematics, Computer Science
- IEEE Trans. Acoust. Speech Signal Process.
- 1986
- 210
A prime factor fast W transform algorithm
- Mathematics, Computer Science
- IEEE Trans. Signal Process.
- 1992
- 25