mirage

Information theoretic approach to complexity reduction of FIR filter design

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

Information theoretic approach to complexity reduction of FIR filter design

Show simple item record

dc.contributor.author Chang, Chip Hong
dc.contributor.author Chen, Jiajia
dc.contributor.author Vinod, Achutavarrier Prasad
dc.date.accessioned 2010-05-05T04:12:32Z
dc.date.available 2010-05-05T04:12:32Z
dc.date.copyright 2008
dc.date.issued 2010-05-05T04:12:32Z
dc.identifier.citation Chang, C. H., Chen, J., & Vinod, A. P. (2008). Information Theoretic Approach to Complexity Reduction of FIR Filter Design. IEEE Transactions on Circuits and Systems—I. 55(8), 2310-2321.
dc.identifier.issn 1549-8328
dc.identifier.uri http://hdl.handle.net/10220/6258
dc.description.abstract This paper presents a new paradigm of design.methodology to reduce the complexity of application-specific finite-impulse response (FIR) digital filters. A new adder graph data structure called the multiroot binary partition graph (MBPG) is proposed for the formulation of the multiple onstant multiplication problem of FIR filter design. The set of coefficients in any fixed point representation is partitioned into symbols so that common subexpression identification and elimination become congruent to information parsing for data compression. A minimum number of different pairs or groups of symbols and residues can be used to code a set of coefficients based on their probability and conditional probability of occurrence. This ingenious concept enables the notion of entropy to be applied as a quantitative measure to evaluate the coding density of different compositions of symbols towards a set of coefficients. The minimal vertex set MBPG synthesized by our proposed information theoretic approach results in direct correspondences between the vertices and adders, and edges and physical interconnections. Unlike the common subexpression elimination algorithms based on other graph data structures, the symbol-level information carried in each vertex and the graph isomorphism of MBPG promise further fine-grain optimization in a reduced search space. One such optimization that has been exploited in this paper is the shift-inclusive computation reordering to minimize the width of every two’s complement adder to further reduce the implementation cost and the critical path delay of the filter. Experiment results show that the proposed algorithm can contribute up to 19.30% reductions in logic complexity and up to 61.03% reduction in critical path delay over other minimization methods.
dc.format.extent 12 p.
dc.language.iso en
dc.relation.ispartofseries IEEE transactions on circuits and systems—I
dc.rights © 2008 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. http://www.ieee.org/portal/site 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.
dc.subject DRNTU::Engineering::Electrical and electronic engineering
dc.title Information theoretic approach to complexity reduction of FIR filter design
dc.type Journal Article
dc.contributor.school School of Electrical and Electronic Engineering
dc.identifier.doi http://dx.doi.org/10.1109/TCSI.2008.920090
dc.description.version Published version

Files in this item

Files Size Format View
Information the ... n of FIR filter design.pdf 1.217Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Statistics

Total views

All Items Views
Information theoretic approach to complexity reduction of FIR filter design 389

Total downloads

All Bitstreams Views
Information theoretic approach to complexity reduction of FIR filter design.pdf 288

Top country downloads

Country Code Views
United States of America 98
India 65
China 36
Taiwan 21
Russian Federation 7

Top city downloads

city Views
Mountain View 67
New Delhi 17
Beijing 14
Singapore 7
Taipei 6

Downloads / month

  2014-07 2014-08 2014-09 total
Information theoretic approach to complexity reduction of FIR filter design.pdf 0 0 6 6