Bit-level multiplierless FIR filter optimization incorporating sparse filter technique
Multiplierless FIR filter optimization has been extensively studied in the past decades to minimize the number of adders. A more accurate measurement of the implementation complexity is the number of full adders counted at bit-level. However, the high computational complexity of the optimization at...
| Päätekijät: | , |
|---|---|
| Muut tekijät: | |
| Aineistotyyppi: | Journal Article |
| Kieli: | English |
| Julkaistu: |
2014
|
| Aiheet: | |
| Linkit: | https://hdl.handle.net/10356/103630 http://hdl.handle.net/10220/24502 |