Abstract | ||
---|---|---|
It was shown that sinusoid synthesis can be implemented efficiently by an inverse Fourier transform on consecutive frames where all but a small number of coefficients per oscillator are dropped. This leads to a compromise between computational complexity and approximation accuracy. The method can be improved by two approaches. First, optimal coefficients can be found by minimizing the average approximation error. Second, the optimal window function can be found through an iterative process. The gain in signal-to-noise ratio (SNR) is between 10 and 40 dB and can be used to reduce computational complexity while satisfying required synthesis quality. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/TASL.2008.2004292 | IEEE Transactions on Audio, Speech & Language Processing |
Keywords | Field | DocType |
optimized sinusoid synthesis,optimal window function,sinusoid synthesis,inverse fourier,iterative process,consecutive frame,average approximation error,optimal coefficient,inverse truncated fourier transform,approximation accuracy,inverse truncated fourier,computational complexity,synthesis quality,fourier transforms,fourier transform,windows,approximation theory,audio signal processing,satisfiability,approximation error,oscillations,inverse problems,signal to noise ratio,oscillators,interpolation | Iterative method,Signal-to-noise ratio,Approximation theory,Speech recognition,Fourier transform,Inverse problem,Mathematics,Approximation error,Computational complexity theory,Window function | Journal |
Volume | Issue | ISSN |
17 | 2 | 1558-7916 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rade Kutil | 1 | 61 | 8.80 |