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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) s. 473 - 479
Hlavní autoři: Aksoy, Levent, Costa, Eduardo, Flores, Paulo, Monteiro, José
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 05.11.2012
IEEE
Edice:ACM Conferences
Témata:
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
ISBN:9781450315739, 1450315739
ISSN:1092-3152
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:9781450315739
1450315739
ISSN:1092-3152
DOI:10.1145/2429384.2429482