Name
Abstract | ||
|---|---|---|
Sparse fast Fourier transform (FFT) is a promising technique that can significantly reduce computational complexity. However, only a handful of research has been conducted on precisely analyzing the performance of this new scheme. Accurate theoretical results are important for new techniques to avoid numerous simulations when applying them in various applications. In this study, we analyze several... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TSP.2017.2740198 | IEEE Transactions on Signal Processing |
Keywords | Field | DocType |
Time-domain analysis,Frequency-domain analysis,Closed-form solutions,Estimation,Computational complexity,Simulation | Frequency domain,Mathematical optimization,Expression (mathematics),Performance enhancement,Computer science,Sparse approximation,Algorithm,Fast Fourier transform,Interference (wave propagation),Computational complexity theory | Journal |
Volume | Issue | ISSN |
65 | 21 | 1053-587X |
Citations | PageRank | References |
3 | 0.44 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guilin Chen | 1 | 6 | 3.56 |
| Shang-ho Tsai | 2 | 188 | 24.44 |
| Kai-Jiun Yang | 3 | 42 | 4.71 |