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

被引:0
作者
Krot, AM [1 ]
Minervina, HB [1 ]
机构
[1] Natl Acad Sci Belarus, Inst Engn Cybernet, Minsk 220012, BELARUS
来源
SIGNAL PROCESSING, SENSOR FUSION, AND TARGET RECOGNITION VII | 1998年 / 3374卷
关键词
signal (image) restoration; direct and inverse convolution; overlap-add method; fast algorithms; multiplicative complexity; field of constants;
D O I
10.1117/12.327118
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
A fast algorithm of realising 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.
引用
收藏
页码:426 / 435
页数:10
相关论文
empty
未找到相关数据