完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, TJen_US
dc.contributor.authorYang, THen_US
dc.contributor.authorJen, CWen_US
dc.date.accessioned2014-12-08T15:26:19Z-
dc.date.available2014-12-08T15:26:19Z-
dc.date.issued2003en_US
dc.identifier.isbn0-7803-7965-9en_US
dc.identifier.urihttp://hdl.handle.net/11536/18705-
dc.description.abstractThis paper presents the systematic synthesis of multiplier-less FIR filters with a novel complexity-aware quantization algorithm. Both signed-digit representations and common subexpression elimination (CSE) are investigated to reduce the computational complexity at the bit level. For comparable filter responses, the simulation shows that our approach requires only half (49.06%similar to50.94%) additions of the straightforward quantized filters. Both with CSE, our FIR synthesizer has comparable results with the CSD-encoded coefficients, which have the theoretically minimum non-zero terms. Moreover, our approach outperforms CSD in most cases because of the direct control over additions and the zero-overhead insertion of non-zero terms.en_US
dc.language.isoen_USen_US
dc.titleCoefficient optimization for area-effective multiplier-less FIR filtersen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2003 INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, VOL I, PROCEEDINGSen_US
dc.citation.spage125en_US
dc.citation.epage128en_US
dc.contributor.department電子工程學系及電子研究所zh_TW
dc.contributor.departmentDepartment of Electronics Engineering and Institute of Electronicsen_US
dc.identifier.wosnumberWOS:000184737900032-
顯示於類別:會議論文