skip to main content
10.1145/1150343.1150387acmconferencesArticle/Chapter ViewAbstractPublication PagessbcciConference Proceedingsconference-collections
Article

Exploiting general coefficient representation for the optimal sharing of partial products in MCMs

Published: 28 August 2006 Publication History

Abstract

We propose a new algorithm that maximizes he sharing of partial terms in Multiple Cons an Multiplication (MCM) operations under a general number representation for the coefficients. MCM operations are required by many algorithms in digital signal processing and have been the subject of extensive research. By making no assumptions as to the number representation, the algorithm described in his paper is able to perform a better search for the optimal sharing of partial terms than previous methods based on MSD or CSD representations. We have applied our algorithm for the hardware minimization of FIR filers.The results show that we can ob ain solutions that require between 20% to 50% less hardware when compared agains he solutions using he MSD representation.

References

[1]
H. Nguyen and A. Chatterjee. Number-Splitting with Shif -and-Add Decomposition for Power and Hardware Optimization in Linear DSP Synthesis. IEEE Transactions on Very Large Scale Integration (VLSI) Systems.8 (4): 419--424, August 2000.
[2]
E. da Costa, P. Flores, and J. Monteiro. Maximal Sharing of Partial Terms in MCM under Minimal Signed Digit Representation.In European Conference on Circuits Theory and Design pages 468--473, 2005.
[3]
M. Mehendale, S. Sherlekar, and G. Venkatesh. Techniques for Low Power Realization of FIR Filters. In Design Automation Conference pages 404--416, 1995.
[4]
H. Samueli. An Improved Search Algorithm for he Design of Multiplierless FIR Filters with Power-of-Two Coefficients. In IEEE Transactions on Circuits and Systems pages 1044--1047, 1989.
[5]
A. Nannarelli, M. Re, and G. Cardarilli. Tradeoffs be ween residue number system and raditional FIR Filters. In IEEE International Symposium on Circuits and Systems May 2001.
[6]
M. Potkonjak, M. Srivastava, and A. Chandrakasan. Efficient substitution of multiple constan multiplication by shifts and additions using iterative pairwise matching. In Proceedings of the 31st ACM/IEEE Design Automation Conference pages 189--194, 1994.
[7]
R. Hartley. Subexpression sharing in filters using canonic signed digit multipliers. IEEE Transactions on Circuits and Systems II.43 (10): 677--688, 1996.
[8]
R. Pasko, P. Schaumon, V. Derudder, S. Vernalde, and D. Durackova. A New Algorithm for Elimination of Common Subexpressions. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.18: 58--68, January 1999.
[9]
A. Dempster and M. Macleod. Use of Minimum-Adder Multiplier Blocks in FIR Digital Filters. IEEE Trans. on CAS-II 42 (9): 596--577, September 1995.
[10]
I-C. Park and H-J. Kang. Digital Filter Synthesis Based on Minimal Signed Digit Representation. In Design Automation Conference pages 468--473, 2001.

Cited By

View all
  • (2010)Search algorithms for the multiple constant multiplications problemMicroprocessors & Microsystems10.1016/j.micpro.2009.10.00134:5(151-162)Online publication date: 1-Aug-2010
  • (2009)Design flow for the generation of optimized FIR filters2009 16th IEEE International Conference on Electronics, Circuits and Systems - (ICECS 2009)10.1109/ICECS.2009.5410839(1000-1003)Online publication date: Dec-2009
  • (2008)An approximate algorithm for the multiple constant multiplications problemProceedings of the 21st annual symposium on Integrated circuits and system design10.1145/1404371.1404395(58-63)Online publication date: 1-Sep-2008
  • Show More Cited By

Index Terms

  1. Exploiting general coefficient representation for the optimal sharing of partial products in MCMs

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SBCCI '06: Proceedings of the 19th annual symposium on Integrated circuits and systems design
      August 2006
      248 pages
      ISBN:1595934790
      DOI:10.1145/1150343
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 28 August 2006

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. common subexpression elimination (CSE)
      2. digital filter design
      3. minimal signed digit (MSD)
      4. multiple constant multiplication (MCM)

      Qualifiers

      • Article

      Conference

      SBCCI06
      Sponsor:
      SBCCI06: 19th Symposium on Integrated Circuits and System Design
      August 28 - September 1, 2006
      MG, Ouro Preto, Brazil

      Acceptance Rates

      Overall Acceptance Rate 133 of 347 submissions, 38%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 07 Mar 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2010)Search algorithms for the multiple constant multiplications problemMicroprocessors & Microsystems10.1016/j.micpro.2009.10.00134:5(151-162)Online publication date: 1-Aug-2010
      • (2009)Design flow for the generation of optimized FIR filters2009 16th IEEE International Conference on Electronics, Circuits and Systems - (ICECS 2009)10.1109/ICECS.2009.5410839(1000-1003)Online publication date: Dec-2009
      • (2008)An approximate algorithm for the multiple constant multiplications problemProceedings of the 21st annual symposium on Integrated circuits and system design10.1145/1404371.1404395(58-63)Online publication date: 1-Sep-2008
      • (2008)VHDL generation of optimized FIR filters2008 2nd International Conference on Signals, Circuits and Systems10.1109/ICSCS.2008.4746944(1-5)Online publication date: Nov-2008

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media