Search algorithms for the multiple constant multiplications problem: Exact and approximate-Reference-Cited by-同舟云学术

Search algorithms for the multiple constant multiplications problem: Exact and approximate

Published:2010-08 Issue:5 Volume:34 Page:151-162
ISSN:0141-9331
Container-title:Microprocessors and Microsystems
language:en
Short-container-title:Microprocessors and Microsystems

Author:

Aksoy Levent,Güneş Ece Olcay,Flores Paulo

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Software

Reference27 articles.

1. Number-splitting with shift-and-add decomposition for power and hardware optimization in linear DSP synthesis;Nguyen;IEEE Transactions on VLSI,2000

2. Some complexity issues in digital signal processing;Cappello;IEEE Transactions on Acoustics, Speech, and Signal Processing,1984

3. Multiple constant multiplications: efficient versatile framework algorithms for exploring common subexpression elimination;Potkonjak;IEEE TCAD,1996

4. Subexpression sharing in filters using canonic signed digit multipliers;Hartley;IEEE TCAS II,1996

5. A new algorithm for elimination of common subexpressions;Pasko;IEEE TCAD,1999

Cited by 43 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bit-Level Optimized Constant Multiplication Using Boolean Satisfiability;IEEE Transactions on Circuits and Systems I: Regular Papers;2024-01

2. Multiple Constant Multiplication: From Target Constants to Optimized Pipelined Adder Graphs;2023 33rd International Conference on Field-Programmable Logic and Applications (FPL);2023-09-04

3. Multiplication by Constants;Application-Specific Arithmetic;2023-08-23

4. Hybrid Protection of Digital FIR Filters;IEEE Transactions on Very Large Scale Integration (VLSI) Systems;2023-06

5. Low Area Implementation of FIR Filter Based on FPGA Using Approximation Method;2023 3rd International Scientific Conference of Engineering Sciences (ISCES);2023-05-03