To enable efficient low latency convolution, a Fast Fourier Transform (FFT) is presented which balances processor and memory load across incoming blocks of input. The proposed FFT transforms a large block of input data in steps spread across the arrival of smaller blocks of input, and can be used to transform large partitions of an impulse response and input data for efficiency, while facilitating convolution at very low latency. Its primary advantage over a standard FFT, as used for a non-uniform partition convolution method, is that it can be performed in the same processing thread as the rest of the convolution, thereby avoiding problems associated with the combination of multithreading and near real-time calculations on general purpose computing architectures.
Author:
Hurchalla, Jeffrey
Affiliation:
Garritan Corp., Orcas, WA, USA
AES Convention:
129 (November 2010)
Paper Number:
8257
Publication Date:
November 4, 2010
Subject:
Real-Time Audio Processing
Click to purchase paper as a non-member or you can login as an AES member to see more options.
No AES members have commented on this paper yet.
To be notified of new comments on this paper you can subscribe to this RSS feed. Forum users should login to see additional options.
If you are not yet an AES member and have something important to say about this paper then we urge you to join the AES today and make your voice heard. You can join online today by clicking here.