| Paper: | DISPS-P4.8 | ||
| Session: | Design and Mapping Techniques | ||
| Time: | Friday, May 21, 13:00 - 15:00 | ||
| Presentation: | Poster | ||
| Topic: | Design and Implementation of Signal Processing Systems: Algorithm Transformation and Mapping Techniques | ||
| Title: | AUTOMATIC COST MINIMIZATION FOR MULTIPLIERLESS IMPLEMENTATIONS OF DISCRETE SIGNAL TRANSFORMS | ||
| Authors: | Adam Zelinski; Carnegie Mellon University | ||
| Markus Püschel; Carnegie Mellon University | |||
| Smarahara Misra; Carnegie Mellon University | |||
| James Hoe; Carnegie Mellon University | |||
| Abstract: | The computation of linear DSP transforms consists entirely of additionsand multiplications by constants, which, in a hardware realization,can be implemented as a network of wired shifts andadditions. Thus, a light weight fixed point implementation thatapproximates an exact transform can be built from only adders. Thispaper presents an automatic approach for minimizing the numberof additions required for a given transform under the constraintof a particular quality measure. We present an evaluation of ourapproach. For example, one experiment shows that the IMDCTtransform within an MP3 decoder can be reduced from 572 additionsto 260 additions while maintaining Limited Accuracy asdefined by the MP3 ISO standard. | ||
| Back | |||
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops