mirage

Contention resolution : a new approach to versatile subexpressions sharing in multiple constant multiplications

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

Contention resolution : a new approach to versatile subexpressions sharing in multiple constant multiplications

Show simple item record

dc.contributor.author Xu, Fei
dc.contributor.author Chang, Chip Hong
dc.contributor.author Jong, Ching Chuen
dc.date.accessioned 2010-05-19T03:53:48Z
dc.date.available 2010-05-19T03:53:48Z
dc.date.copyright 2008
dc.date.issued 2010-05-19T03:53:48Z
dc.identifier.citation Fei, X., Chang, C. H., & Jong, C. C. (2008). Contention Resolution : a New Approach to Versatile Subexpressions Sharing in Multiple Constant Multiplications. IEEE Transactions on Circuits and Systems Part 1 Regular Papers, 55(2), 559-571.
dc.identifier.issn 1549-8328
dc.identifier.uri http://hdl.handle.net/10220/6285
dc.description.abstract Multiple constant multiplications (MCM) have been a core operation in many digital signal processing applications. In this paper, an efficient generalized contention resolution algorithm (CRA) is proposed to eliminate three broad categories of reusable common subexpressions in MCM. The idea is to revert a precedential decision of suboptimal common subexpressions by a localized cost function evaluation when there is a conflict between two competitive subexpressions. The proposed derivatives of the basic CRA are versatile in that they are capable of satisfying search for both intra- and intercoefficient subexpressions, in any legitimate composition of horizontal, vertical and oblique subexpressions. As the algorithms expand the common subexpressions to higher-weight only when there is cost saving, the logic depth can be controlled by constraining the weights of the subexpressions. The variants of CRA follow an important tenet of good heuristic that significant improvement in the solution quality is attained with increased problem size but the computational time remains well bounded. Experimental results with both benchmark filters and randomly generated coefficient sets are analyzed and compared with a number of well known common subexpression elimination methods to demonstrate the effectiveness and efficiency of our proposed approach.
dc.format.extent 13 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 Contention resolution : a new approach to versatile subexpressions sharing in multiple constant multiplications
dc.type Journal Article
dc.contributor.school School of Electrical and Electronic Engineering
dc.identifier.openurl http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4400044
dc.identifier.doi http://dx.doi.org/10.1109/TCSI.2007.913707
dc.description.version Published version
dc.contributor.organization Xilinx Asia Pacific Pte Ltd

Files in this item

Files Size Format View
Contention Reso ... nstant Multiplications.pdf 837.7Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Statistics

Total views

All Items Views
Contention resolution : a new approach to versatile subexpressions sharing in multiple constant multiplications 433

Total downloads

All Bitstreams Views
Contention Resolution - A New Approach to Versatile Subexpressions Sharing in Multiple Constant Multiplications.pdf 336

Top country downloads

Country Code Views
China 139
United States of America 86
India 23
Singapore 18
Korea 16

Top city downloads

city Views
Beijing 59
Mountain View 48
Singapore 17
Seoul 16
New Delhi 5