Minimal multiplicative complexity and fast restoration algorithm of digital signals and images

Alexander M. Krot, Helena B. Minervina · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1998

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.

Read the paper · More papers on PaperTik