1 August 1997 Fast Hartley transform and truncated singular value algorithm for circular deconvolution
Author Affiliations +
Optical Engineering, 36(8), (1997). doi:10.1117/1.601429
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, "Fast Hartley transform and truncated singular value algorithm for circular deconvolution," Optical Engineering 36(8), (1 August 1997). http://dx.doi.org/10.1117/1.601429
JOURNAL ARTICLE
6 PAGES


SHARE
KEYWORDS
Deconvolution

Fourier transforms

Algorithm development

Algorithms

Convolution

Optical engineering

Data conversion

RELATED CONTENT


Back to Top