DocumentCode
1855349
Title
A 2D extension of the sampling algorithm for sparse Fourier representations
Author
Nishimura, Kazutaka ; Takei, Yoshinori ; Yoshikawa, Toshinori ; Zhang, Xi
Author_Institution
Dept. Electr. Eng., Nagaoka Univ. of Technol., Niigata, Japan
Volume
2
fYear
2004
fDate
25-28 July 2004
Abstract
Recently, a very efficient sampling algorithm for finding a B-term Fourier representation of given 1D discrete signal is presented (Gilbert et al., 2002). In this paper, we present a modified version of the algorithm, which can be applied to 2D signals. As in the original algorithm, dependence of the running time on the signal length is polylogarithmic.
Keywords
computational complexity; discrete Fourier transforms; signal representation; signal sampling; B-term Fourier representation; discrete signal; polylogarithmic dependence; sampling algorithm; sparse Fourier representations; Approximation algorithms; Computational complexity; Cost function; Databases; Discrete Fourier transforms; Fast Fourier transforms; Fourier transforms; Frequency; Sampling methods; Sorting;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2004. MWSCAS '04. The 2004 47th Midwest Symposium on
Print_ISBN
0-7803-8346-X
Type
conf
DOI
10.1109/MWSCAS.2004.1354108
Filename
1354108
Link To Document