Multiple tunable constant multiplications algorithms and applications

The multiple constant multiplications (MCM) problem, that is defined as finding the minimum number of addition and subtraction operations required for the multiplication of multiple constants by an input variable, has been the subject of great interest since the complexity of many digital signal pro...

Full description

Saved in:
Bibliographic Details
Published in2012 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) pp. 473 - 479
Main Authors Aksoy, Levent, Costa, Eduardo, Flores, Paulo, Monteiro, José
Format Conference Proceeding
LanguageEnglish
Published New York, NY, USA ACM 05.11.2012
IEEE
SeriesACM Conferences
Subjects
Online AccessGet full text
ISBN9781450315739
1450315739
ISSN1092-3152
DOI10.1145/2429384.2429482

Cover

Abstract The multiple constant multiplications (MCM) problem, that is defined as finding the minimum number of addition and subtraction operations required for the multiplication of multiple constants by an input variable, has been the subject of great interest since the complexity of many digital signal processing (DSP) systems is dominated by an MCM operation. This paper introduces a variant of the MCM problem, called multiple tunable constant multiplications (MTCM) problem, where each constant is not fixed as in the MCM problem, but can be selected from a set of possible constants. We present an exact algorithm that formalizes the MTCM problem as a 0--1 integer linear programming (ILP) problem when constants are defined under a number representation. We also introduce a local search method for the MTCM problem that includes an efficient MCM algorithm. Furthermore, we show that these techniques can be used to solve various optimization problems in finite impulse response (FIR) filter design and we apply them to one of these problems. Experimental results clearly show the efficiency of the proposed methods when compared to prominent algorithms designed for the MCM problem.
AbstractList The multiple constant multiplications (MCM) problem, that is defined as finding the minimum number of addition and subtraction operations required for the multiplication of multiple constants by an input variable, has been the subject of great interest since the complexity of many digital signal processing (DSP) systems is dominated by an MCM operation. This paper introduces a variant of the MCM problem, called multiple tunable constant multiplications (MTCM) problem, where each constant is not fixed as in the MCM problem, but can be selected from a set of possible constants. We present an exact algorithm that formalizes the MTCM problem as a 0--1 integer linear programming (ILP) problem when constants are defined under a number representation. We also introduce a local search method for the MTCM problem that includes an efficient MCM algorithm. Furthermore, we show that these techniques can be used to solve various optimization problems in finite impulse response (FIR) filter design and we apply them to one of these problems. Experimental results clearly show the efficiency of the proposed methods when compared to prominent algorithms designed for the MCM problem.
Author Flores, Paulo
Monteiro, José
Costa, Eduardo
Aksoy, Levent
Author_xml – sequence: 1
  givenname: Levent
  surname: Aksoy
  fullname: Aksoy, Levent
  email: levent@algos.inesc-id.pt
  organization: INESC-ID, Lisboa, Portugal
– sequence: 2
  givenname: Eduardo
  surname: Costa
  fullname: Costa, Eduardo
  email: ecosta@ucpel.tche.br
  organization: Univ. Católica de Pelotas, Pelotas, Brazil
– sequence: 3
  givenname: Paulo
  surname: Flores
  fullname: Flores, Paulo
  email: pff@inesc-id.pt
  organization: INESC-ID/IST TU Lisbon, Lisboa, Portugal
– sequence: 4
  givenname: José
  surname: Monteiro
  fullname: Monteiro, José
  email: jcm@inesc-id.pt
  organization: INESC-ID/IST TU Lisbon, Lisboa, Portugal
BookMark eNqNkDtPwzAUhY0oEqVkZmDpCEPC9dseUVUeUhELzJYd21IgTarEHfj3uEomJqZP535HdzhXaNH1XUDoBkOFMeMPhBFNFatOZIqcoUJLlQVQzCXV53_yAi0xaFLmRC5RMY5fAIAxVVySJbp_O7apObRhnY6ddZl1343Jdmm9n0xT29Tk2zW6iLYdQzFzhT6fth-bl3L3_vy6edyVljCZysiV944KH0lQ3GEpPabAhIcoaFQemOJYeqdA1EEyX_PIpJIxasyDY5yu0O30twkhmMPQ7O3wYwRVQoLO9m6ytt4b1_ffo8FgTruYeRcz75Kr1T-rxg1NiPQXFwVfCg
ContentType Conference Proceeding
Copyright 2012 ACM
Copyright_xml – notice: 2012 ACM
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1145/2429384.2429482
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781450315739
1450315739
EndPage 479
ExternalDocumentID 6386709
Genre orig-research
GroupedDBID 6IE
6IF
6IG
6IH
6IK
6IL
6IM
6IN
AAJGR
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
IEGSK
IERZE
IJVOP
OCL
RIE
RIL
RIO
123
AAWTH
ABLEC
ADZIZ
CHZPO
FEDTE
M43
ID FETCH-LOGICAL-a247t-f58ddb36df2e85b177d13046d0f63f8d048517db806ce74dc5f4787ff915eb453
IEDL.DBID RIE
ISBN 9781450315739
1450315739
ISSN 1092-3152
IngestDate Wed Aug 27 03:33:05 EDT 2025
Wed Jan 31 06:45:48 EST 2024
Wed Jan 31 06:46:43 EST 2024
IsPeerReviewed false
IsScholarly true
Language English
License 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 Permissions@acm.org
LinkModel DirectLink
MeetingName ICCAD '12: The International Conference on Computer-Aided Design
MergedId FETCHMERGED-LOGICAL-a247t-f58ddb36df2e85b177d13046d0f63f8d048517db806ce74dc5f4787ff915eb453
PageCount 7
ParticipantIDs acm_books_10_1145_2429384_2429482
ieee_primary_6386709
acm_books_10_1145_2429384_2429482_brief
PublicationCentury 2000
PublicationDate 20121105
2012-Nov.
PublicationDateYYYYMMDD 2012-11-05
2012-11-01
PublicationDate_xml – month: 11
  year: 2012
  text: 20121105
  day: 05
PublicationDecade 2010
PublicationPlace New York, NY, USA
PublicationPlace_xml – name: New York, NY, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle 2012 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
PublicationTitleAbbrev ICCAD
PublicationYear 2012
Publisher ACM
IEEE
Publisher_xml – name: ACM
– name: IEEE
SSID ssj0001138572
ssj0020286
Score 1.8671935
Snippet The multiple constant multiplications (MCM) problem, that is defined as finding the minimum number of addition and subtraction operations required for the...
SourceID ieee
acm
SourceType Publisher
StartPage 473
SubjectTerms Adders
Algorithm design and analysis
Applied computing -- Arts and humanities -- Architecture (buildings) -- Computer-aided design
Applied computing -- Physical sciences and engineering -- Engineering -- Computer-aided design
Cost function
Finite impulse response filter
Hardware -- Integrated circuits -- Logic circuits -- Arithmetic and datapath circuits
Hardware -- Robustness
Logic gates
Signal processing algorithms
Subtitle algorithms and applications
Title Multiple tunable constant multiplications
URI https://ieeexplore.ieee.org/document/6386709
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjZ3fS8MwEMePbU_64o9NnL-oIPhityZN2tQ3EccQJj442FtpmouKrpOtffGvN2m7H4qgTy2llJCk3OXuvp8DuGCSJglLPBe1hy5LOHMFlcSV0guQEEWjMqM7egiGY3Y_4ZMGXK20MIhYFp9hz96WuXw1SwsbKuubvWJxY01ohiKotFrreArxBQ9X6Chzpi-7PBIvslA-TmusD2G8b6xS5AvWs1dmCXzNJJ1-665SGpfBDoyWw6pqSt56RS576ecPYuN_x70LnbWMz3lcGag9aGC2D9sbBMI2DEZ1QaGTF6WKykkrhzF36lLDZUzv2rl5f57NX_OX6cJJMuVspr47MB7cPd0O3bq1gptQFuau5kIp6QdKUxTcIqgUsTlS5enA10KZ_5qTUEnhBSmGTKVcW4qP1hHhKBn3D6CVzTI8BMdqdX2qjOvHIxYxKVF5Cs1XRRQmIbIunJvpje2ZYRFXMmge10sQ10vQhcs_34nl_BV1F9p2fuOPisUR11N79PvjY9gyDg6ttIMn0MrnBZ4aJyKXZ-Xu-QJJ-b8f
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjZ1LS8NAEMcHrQf14qOK9RlB8GJqNpnNw5uIpWorHlrwFrLZWS3aVtr04qd3N0kfiqCnhBDCsrthZmfm_xuAMxRukmDi2KQcsjHhaIeuYLYQjk-MSTfKM7rtR7_Zxftn_rwEFzMtDBHlxWdUN7d5Ll8O04kJlV3qvWJwY8uwwhGRF2qteUSFeSEPZvAofarP-zwyJzJYPu6WYB-G_FLbpcgLsW6uaBh8y0na_9ZfJTcvjQ1oTwdWVJW81SeZqKefP5iN_x35JuzMhXzW08xEbcESDbZhfYFBWIVGuywptLJJrqOy0sJlzKyy2HAa1buyrt9fhqNe9tofW8lAWovJ7x3oNm47N027bK5gJy4Gma14KKXwfKlcCrmBUElmsqTSUb6nQqn_bM4CKULHTylAmXJlOD5KRYyTQO7tQmUwHNAeWEat67lSO388wgiFIOlI0l8NoyAJCGtwqqc3NqeGcVwIoXlcLkFcLkENzv98JxajHqkaVM38xh8FjSMup3b_98cnsNrstFtx6-7x4QDWtLvjFkrCQ6hkowkdaZciE8f5TvoCgBjCbA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2012+IEEE%2FACM+International+Conference+on+Computer-Aided+Design+%28ICCAD%29&rft.atitle=Multiple+tunable+constant+multiplications%3A+Algorithms+and+applications&rft.au=Aksoy%2C+L.&rft.au=Costa%2C+E.&rft.au=Flores%2C+P.&rft.au=Monteiro%2C+J.&rft.date=2012-11-01&rft.pub=IEEE&rft.issn=1092-3152&rft.spage=473&rft.epage=479&rft_id=info:doi/10.1145%2F2429384.2429482&rft.externalDocID=6386709
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1092-3152&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1092-3152&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1092-3152&client=summon