Log in
Register
Home
Forums
New posts
Search forums
What's new
Featured content
New posts
New profile posts
Latest activity
News
Members
Current visitors
New profile posts
Search profile posts
Features
Log in
Register
What's new
Search
Search titles only
By:
Search titles only
By:
New posts
Search forums
Menu
Install the app
Install
Reply to thread
Home
Forums
Pro Audio
Varsity
FIR filters
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Message
<blockquote data-quote="Michael John" data-source="post: 148001" data-attributes="member: 830"><p>Re: FIR filters</p><p></p><p></p><p></p><p>One way to think of it is that the OLA and OLS convolution methods - links above - aren't really frequency domain methods. They just exploit properties of the Fourier transform (and it's fast implementation, the FFT) to reduce the number of multiplies it takes to compute the convolution. Direct convolution costs ~N multiplies per sample, where N is the FIR filter length. OLA and OLS transform methods take roughly log2(N) multiplies per sample. For a 512 length FIR, that's 512 multiplies per sample versus ~9 multiplies. For a processor (and ignoring parallel operations) that's about 25 mega cycles per second versus ~0.5 mega cps (and versus ~0.25 mega cps for a biquad) - all for ~48 kHz audio. (Adds and memory moves move these numbers around a bit but they're roughly in the ball park.)</p><p></p><p>As for examples of using transforms for convolution in audio, many convolutional reverbs use them, as does some signal processing in TV's, AVR's, portable devices....</p><p></p><p>Cheers,</p><p>----</p><p></p><p>Edit: Numbers corrected above.</p></blockquote><p></p>
[QUOTE="Michael John, post: 148001, member: 830"] Re: FIR filters One way to think of it is that the OLA and OLS convolution methods - links above - aren't really frequency domain methods. They just exploit properties of the Fourier transform (and it's fast implementation, the FFT) to reduce the number of multiplies it takes to compute the convolution. Direct convolution costs ~N multiplies per sample, where N is the FIR filter length. OLA and OLS transform methods take roughly log2(N) multiplies per sample. For a 512 length FIR, that's 512 multiplies per sample versus ~9 multiplies. For a processor (and ignoring parallel operations) that's about 25 mega cycles per second versus ~0.5 mega cps (and versus ~0.25 mega cps for a biquad) - all for ~48 kHz audio. (Adds and memory moves move these numbers around a bit but they're roughly in the ball park.) As for examples of using transforms for convolution in audio, many convolutional reverbs use them, as does some signal processing in TV's, AVR's, portable devices.... Cheers, ---- Edit: Numbers corrected above. [/QUOTE]
Insert quotes…
Verification
Post reply
Home
Forums
Pro Audio
Varsity
FIR filters
Top
Bottom
Sign-up
or
log in
to join the discussion today!