A deterministic sparse FFT algorithm for vectors with small support (Q281476): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Let \(\mathbf x=(x_0,x_1,\dots,x_{N-1})\in\mathbb C^N\). The authors define the support length \(m\) of \(\mathbf x\in\mathbb C^N\) as the minimal integer \(m\) for which there exists a \(\mu\in\{0,1,\dots,N-1\}\) such that the components \(x_k\) vanish for \(k\notin I=\{(\mu+r)\mod N\), \(r=0,1,\dots, m-1\}\). The authors derive new algorithms to reconstruct a vector \(\mathbf x\in\mathbb C^N\) with support length \(m<N\) from its discrete Fourier transform \(\hat x\in\mathbb C^N\). | |||
| Property / review text: Let \(\mathbf x=(x_0,x_1,\dots,x_{N-1})\in\mathbb C^N\). The authors define the support length \(m\) of \(\mathbf x\in\mathbb C^N\) as the minimal integer \(m\) for which there exists a \(\mu\in\{0,1,\dots,N-1\}\) such that the components \(x_k\) vanish for \(k\notin I=\{(\mu+r)\mod N\), \(r=0,1,\dots, m-1\}\). The authors derive new algorithms to reconstruct a vector \(\mathbf x\in\mathbb C^N\) with support length \(m<N\) from its discrete Fourier transform \(\hat x\in\mathbb C^N\). / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: S. F. Lukomskii / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65T50 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6579005 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
discrete Fourier transform | |||
| Property / zbMATH Keywords: discrete Fourier transform / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sparse Fourier reconstruction | |||
| Property / zbMATH Keywords: sparse Fourier reconstruction / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sublinear sparse FFT | |||
| Property / zbMATH Keywords: sublinear sparse FFT / rank | |||
Normal rank | |||
Revision as of 17:39, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A deterministic sparse FFT algorithm for vectors with small support |
scientific article |
Statements
A deterministic sparse FFT algorithm for vectors with small support (English)
0 references
11 May 2016
0 references
Let \(\mathbf x=(x_0,x_1,\dots,x_{N-1})\in\mathbb C^N\). The authors define the support length \(m\) of \(\mathbf x\in\mathbb C^N\) as the minimal integer \(m\) for which there exists a \(\mu\in\{0,1,\dots,N-1\}\) such that the components \(x_k\) vanish for \(k\notin I=\{(\mu+r)\mod N\), \(r=0,1,\dots, m-1\}\). The authors derive new algorithms to reconstruct a vector \(\mathbf x\in\mathbb C^N\) with support length \(m<N\) from its discrete Fourier transform \(\hat x\in\mathbb C^N\).
0 references
discrete Fourier transform
0 references
sparse Fourier reconstruction
0 references
sublinear sparse FFT
0 references
