A new algorithm to find an optimal filter partition for efficient long convolution with low input/output delay is presented. For a specified input/output delay and filter length, our algorithm finds the non-uniform filter partition that minimizes computational cost of the convolution. We perform a detailed cost analysis of different block convolution schemes, and show that our optimal-partition finder algorithm allows for significant performance improvement. Furthermore, when several long convolutions are computed in parallel and their outputs are mixed down (as is the case in multiple-source 3-D audio rendering), the algorithm finds an optimal partition (common to all channels) that allows for further performance optimization.

Author: Garcia, Guillermo
Affiliations: Creative Advanced Technology Center, Scotts Valley, CA ; Center for Computer Research in Music and Acoustics (CCRMA), Stanford University, CA(See document for exact affiliation information.)
AES Convention: 113 (October 2002) Paper Number: 5660
Publication Date: October 1, 2002 Import into BibTeX
Subject: Signal Processing
Permalink: https://www.aes.org/e-lib/browse.cfm?elib=11275

Click to purchase paper as a non-member or login as an AES member. If your company or school subscribes to the E-Library then switch to the institutional version. If you are not an AES member and would like to subscribe to the E-Library then Join the AES!

This paper costs $33 for non-members and is free for AES members and E-Library subscribers.

Learn more about the AES E-Library

E-Library Location: (CD aes19)   /pp2002/pp0210/000198.pdf

Start a discussion about this paper!