Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/90778
Full metadata record
DC FieldValueLanguage
dc.contributor.authorXu, Feien
dc.contributor.authorChang, Chip Hongen
dc.contributor.authorJong, Ching Chuenen
dc.date.accessioned2009-06-22T06:49:09Zen
dc.date.accessioned2019-12-06T17:53:51Z-
dc.date.available2009-06-22T06:49:09Zen
dc.date.available2019-12-06T17:53:51Z-
dc.date.copyright2007en
dc.date.issued2007en
dc.identifier.citationXu, 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.en
dc.identifier.issn0278-0070en
dc.identifier.urihttps://hdl.handle.net/10356/90778-
dc.description.abstractIn 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.en
dc.format.extent10 p.en
dc.language.isoenen
dc.relation.ispartofseriesIEEE transactions on computer-aided design of integrated circuits and systemsen
dc.rights© 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.en
dc.subjectDRNTU::Engineering::Electrical and electronic engineeringen
dc.titleDesign of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressionsen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.identifier.doi10.1109/TCAD.2007.895615en
dc.description.versionPublished versionen
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:EEE Journal Articles
Files in This Item:
File Description SizeFormat 
Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions.pdfPublished version523.82 kBAdobe PDFThumbnail
View/Open

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.