Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions
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....
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/90778 http://hdl.handle.net/10220/4641 |
| _version_ | 1811681082011025408 |
|---|---|
| author | Xu, Fei Chang, Chip Hong Jong, Ching Chuen |
| author2 | School of Electrical and Electronic Engineering |
| author_facet | School of Electrical and Electronic Engineering Xu, Fei Chang, Chip Hong Jong, Ching Chuen |
| author_sort | Xu, Fei |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T03:35:17Z |
| format | Journal Article |
| id | ntu-10356/90778 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T03:35:17Z |
| publishDate | 2009 |
| record_format | dspace |
| spelling | ntu-10356/907782020-03-07T14:02:39Z 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 School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering 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. Published version 2009-06-22T06:49:09Z 2019-12-06T17:53:51Z 2009-06-22T06:49:09Z 2019-12-06T17:53:51Z 2007 2007 Journal Article 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 https://hdl.handle.net/10356/90778 http://hdl.handle.net/10220/4641 10.1109/TCAD.2007.895615 en IEEE transactions on computer-aided design of integrated circuits and systems © 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. 10 p. application/pdf |
| spellingShingle | DRNTU::Engineering::Electrical and electronic engineering 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 |
| title | Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions |
| title_full | Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions |
| title_fullStr | Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions |
| title_full_unstemmed | Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions |
| title_short | Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions |
| title_sort | design of low complexity fir filters based on signed powers of two coefficients with reusable common subexpressions |
| topic | DRNTU::Engineering::Electrical and electronic engineering |
| url | https://hdl.handle.net/10356/90778 http://hdl.handle.net/10220/4641 |
| work_keys_str_mv | AT xufei designoflowcomplexityfirfiltersbasedonsignedpowersoftwocoefficientswithreusablecommonsubexpressions AT changchiphong designoflowcomplexityfirfiltersbasedonsignedpowersoftwocoefficientswithreusablecommonsubexpressions AT jongchingchuen designoflowcomplexityfirfiltersbasedonsignedpowersoftwocoefficientswithreusablecommonsubexpressions |