ridm@nrct.go.th   ระบบคลังข้อมูลงานวิจัยไทย   รายการโปรดที่คุณเลือกไว้

Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions

หน่วยงาน Nanyang Technological University, Singapore

รายละเอียด

ชื่อเรื่อง : Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions
นักวิจัย : Xu, Fei , Chang, Chip Hong , Jong, Ching Chuen
คำค้น : DRNTU::Engineering::Electrical and electronic engineering
หน่วยงาน : Nanyang Technological University, Singapore
ผู้ร่วมงาน : -
ปีพิมพ์ : 2550
อ้างอิง : Xu, F., Chang, C. H., & Jong, C.C. (2007). Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 26(10), 1898-1907. , 0278-0070 , http://hdl.handle.net/10220/4641 , http://dx.doi.org/10.1109/TCAD.2007.895615
ที่มา : -
ความเชี่ยวชาญ : -
ความสัมพันธ์ : IEEE transactions on computer-aided design of integrated circuits and systems
ขอบเขตของเนื้อหา : -
บทคัดย่อ/คำอธิบาย :

In this paper, a new efficient algorithm is proposed for the synthesis of low-complexity finite-impulse response (FIR) filters with resource sharing. The original problem statement based on the minimization of signed-power-of-two (SPT) terms has been reformulated to account for the sharable adders. The minimization of common SPT (CSPT) terms that were considered in our proposed algorithm addresses the optimization of the reusability of adders for two major types of common subexpressions, together with the minimization of adders that are needed for the spare SPT terms. The coefficient set is synthesized in two stages. In the first stage, CSPT terms in the vicinity of the scaled and rounded canonical signed digit(CSD) coefficients are allocated to obtain a CSD coefficient set, with the total number of CSPT terms not exceeding the initial coefficient set. The balanced normalized peak ripple magnitude due to the quantization error is fulfilled in the second stage by a local search method. The algorithm uses a common-subexpression-based hamming weight pyramid to seek for low-cost candidate coefficients with preferential consideration of shared common subexpressions. Experimental results demonstrate that our algorithm is capable of synthesizing FIR filters with the least CSPT terms compared with existing filter synthesis algorithms.

บรรณานุกรม :
Xu, Fei , Chang, Chip Hong , Jong, Ching Chuen . (2550). Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions.
    กรุงเทพมหานคร : Nanyang Technological University, Singapore.
Xu, Fei , Chang, Chip Hong , Jong, Ching Chuen . 2550. "Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions".
    กรุงเทพมหานคร : Nanyang Technological University, Singapore.
Xu, Fei , Chang, Chip Hong , Jong, Ching Chuen . "Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions."
    กรุงเทพมหานคร : Nanyang Technological University, Singapore, 2550. Print.
Xu, Fei , Chang, Chip Hong , Jong, Ching Chuen . Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions. กรุงเทพมหานคร : Nanyang Technological University, Singapore; 2550.