Share Email Print

Proceedings Paper

Minimal multiplicative complexity and fast restoration algorithm of digital signals and images
Author(s): Alexander M. Krot; Helena B. Minervina
Format Member Price Non-Member Price
PDF $14.40 $18.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

A fast algorithm of realizing a method of inverting a long liner convolution is presented. It is based on the procedure of sectionalization combined with effective real-valued split- radix fast Fourier transformation (FFT) algorithm for solving problems of restoration digital signals (images). The minimal multiplicative complexity of such algorithm is obtained.

Paper Details

Date Published: 17 July 1998
PDF: 10 pages
Proc. SPIE 3374, Signal Processing, Sensor Fusion, and Target Recognition VII, (17 July 1998); doi: 10.1117/12.327118
Show Author Affiliations
Alexander M. Krot, Institute of Engineering Cybernetics (Belarus)
Helena B. Minervina, Institute of Engineering Cybernetics (Belarus)

Published in SPIE Proceedings Vol. 3374:
Signal Processing, Sensor Fusion, and Target Recognition VII
Ivan Kadar, Editor(s)

© SPIE. Terms of Use
Back to Top