Share Email Print

Optical Engineering

Fast Hartley transform and truncated singular value algorithm for circular deconvolution
Author(s): Lizhi Cheng
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 1 August 1997
PDF: 6 pages
Opt. Eng. 36(8) doi: 10.1117/1.601429
Published in: Optical Engineering Volume 36, Issue 8
Show Author Affiliations
Lizhi Cheng, National Univ. of Defence Technology (China)

© SPIE. Terms of Use
Back to Top