Translator Disclaimer
17 July 1998 Minimal multiplicative complexity and fast restoration algorithm of digital signals and images
Author Affiliations +
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.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Alexander M. Krot and Helena B. Minervina "Minimal multiplicative complexity and fast restoration algorithm of digital signals and images", Proc. SPIE 3374, Signal Processing, Sensor Fusion, and Target Recognition VII, (17 July 1998); https://doi.org/10.1117/12.327118
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
Back to Top