1 August 1997 Fast Hartley transform and truncated singular value algorithm for circular deconvolution
Author Affiliations +
Abstract
The fast Hartley transform (FHT) algorithm for solving wellconditioned circular deconvolution is suggested. The arithmetic operations save about half compared to the fast Fourier transform (FFT) deconvolution algorithm. The Moore-Penrose generalized inverse of the circulant matrix connection to FHT matrices is investigated, then the least-squares solution for circular deconvolution is developed. An efficient numerical stable circular deconvolution algorithm is suggested by using FHT and truncated singular value decomposition (TSVD) techniques. An open problem is partially solved.
Lizhi Cheng, Lizhi Cheng, } "Fast Hartley transform and truncated singular value algorithm for circular deconvolution," Optical Engineering 36(8), (1 August 1997). https://doi.org/10.1117/1.601429 . Submission:
JOURNAL ARTICLE
6 PAGES


SHARE
RELATED CONTENT

Optical Crossbar Signal Processor
Proceedings of SPIE (January 03 1986)
Fast diffraction computation algorithms based on FFT
Proceedings of SPIE (December 03 2010)

Back to Top