Audio signal processing often requires modeling of large rooms (e.g. churches) with impulse responses of several seconds duration. Direct convolution of the sound stream with such long responses exceeds the capacity of common signal processors by far. Using the Fast Fourier Transform instead reduces the number of operations logarithmically, but introduces unacceptable latency. Segmenting the processing into initial short blocks and subsequent longer ones lets one trade latency vs. computation power as presented in previous AES papers. Hardware-wise the reduction of operations comes at the cost of large storage with high memory bandwidths. Dedicated application specific integrated circuits (ASIC) are predestined to perform the rather regular processing, freeing the processors for other tasks. This paper shows suitable architectures for integration on silicon of optimized fast-convolution algorithms. Possible optimizations for fast-convolution algorithms are examined. Based on these findings different architectures for integration on ASIC/FPGA (Field Programmable Gate Array) of such algorithms are developed, analysed and compared. The paper is concluded by presenting an exemplary ASIC implementation.
Authors:
Anderegg, Rolf; Felber, Norbert; Fichtner, Wolfgang; Franke, Ulrich
Affiliations:
Weiss Engineering LTD., Uster, Switzerland ; Integrated Systems Laboratory, Swiss Federal Institute of Technology Zurich (ETH), Switzerland(See document for exact affiliation information.)
AES Convention:
117 (October 2004)
Paper Number:
6304
Publication Date:
October 1, 2004
Subject:
Signal 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.