Timeline for Is there a systematic method for converting an even length FIR filter to odd length?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 30, 2020 at 3:44 | comment | added | robert bristow-johnson | why can't the $h[n]$ be an odd length (which is even order)? i think the OP means for $g[n]=1-h[n]$ with all of the delays lined up. isn't that what is normally done with this filterbank approach? | |
| Nov 29, 2020 at 23:33 | comment | added | TimWescott | I'm pretty sure that they don't exist, but you may want to do a deep dive into wavelets and see if there's such a thing as an odd-length one. The reason the filters associated with wavelets are even-length is because those filters pretty much are the wavelets, and wavelets tend to be $2^N$ long. I don't know if an odd-length wavelet transform can be implemented, but if it can it's probably out there. | |
| Nov 29, 2020 at 23:32 | history | answered | TimWescott | CC BY-SA 4.0 |