Paper Info
Title
Fast computing position of maximum of circulant convolution.
Abstract
Computing the position of maximum of circulant convolution has been used for many applications in image and signal processing, and it usually is time-critical. Given the signal length N and the template size K, the conventional procedure requires O(KN) operations. With K≫log⁡N, this has been speeded by Fast Fourier Transform (FFT) with computation cost O(Nlog⁡N).
Year
DOI
Venue
2018
10.1016/j.dsp.2018.08.009
Digital Signal Processing
Keywords
Field
DocType
Aliasing,Circulant matrix,Convolution,Cross-correlation,Time delay estimation
Signal processing,Alias,Heuristic,Synchronization,Pattern recognition,Convolution,Algorithm,Circulant matrix,Fast Fourier transform,Artificial intelligence,Mathematics,Computation
Journal
Volume
ISSN
Citations 
83
1051-2004
0
PageRank 
References 
Authors
0.34
25
3
Name
Order
Citations
PageRank
Sung-Hsien Hsieh14813.71
Chun-shien Lu21238104.71
Soo-Chang Pei32054241.11