Timeline for Books/resources for implementing various mathematical functions in fixed point arithmetic for DSP purposes
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4, 2019 at 22:27 | comment | added | Jason S | Remez is superior (albeit more complex) than Chebyshev. Chebyshev just approximates the minimax condition, but usually it's good enough. | |
| Jul 3, 2019 at 1:11 | comment | added | robert bristow-johnson | Jason, i did not use Tchebyshev polynomials, but i did use a weighted MinMax error (sometimes called the "$L_\infty$ norm" on error), which is, i thought, the same as Tchebyshev approximation. the method i used was Remez Exchange Algorithm. | |
| Jul 2, 2019 at 23:10 | history | answered | Jason S | CC BY-SA 4.0 |