Low-latency real-time FIR filtering is often realized using partitioned convolution algorithms, which split the filter impulse responses into a sequence of sub filters and process these sub filters efficiently using frequency-domain methods (e.g., FFT-based convolution). Methods that split both, the signal and the filter, into uniformly-sized sub filters define a fundamental class of algorithms known as uniformly-partitioned convolution techniques. In these methods both operands, signal and filter, are usually partitioned with the same granularity. This contribution introduces uniformly-partitioned algorithms with independent partitions (block lengths) in both operands and regards viable transform sizes resulting from these. The relations of the algorithmic parameters are derived and the performance of the approach is evaluated.
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.
