Timeline for How to test the FIR filter in C++?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 22, 2016 at 20:54 | comment | added | Matt L. | @davidhood2: The formula is valid no matter if the impulse response (and hence the step response) is finite or infinite. Note that $y[n]$ in the above formula can converge to zero for $n\rightarrow\infty$. That would be the expected behavior of a high pass or band pass filter (i.e., a filter blocking DC). | |
| Dec 22, 2016 at 19:07 | comment | added | davidhood2 | @MattL. I'm wondering, is the step response you described valid iff the step response is infinite in length? The reason I ask is because I have designed a C++ FIR tool that stores the operands h[n] and x[n]. The resultant convolution function behaves as described above initially, but then tails back towards zero when the array reaches its end...? | |
| Feb 24, 2015 at 5:21 | vote | accept | PsychedGuy | ||
| Feb 23, 2015 at 10:15 | comment | added | Matt L. | @DigitalGeeK: Any of them will do for your task, just choose what you like. | |
| Feb 23, 2015 at 10:12 | comment | added | PsychedGuy | How about Scilab?, Its a freeware too. | |
| Feb 23, 2015 at 8:33 | comment | added | jojeck♦ | I would go for Python since you can call it's routines very easily from within C++ code. | |
| Feb 23, 2015 at 8:23 | history | answered | Matt L. | CC BY-SA 3.0 |