Multiplierless multiple constant multiplication

DOI10.1145/1240233.1240234MaRDI QIDQ2944548zbMATH OpenOpenAlexWikidataFDO

Authors Yevgen Voronenko, Markus Püschel

Publication date 2 September 2015

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1240233.1240234

zbMATH Keywords

addition chainsdirected graphFIR filterfixed-point arithmeticstrength reduction

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• Constant integer multiplication using minimum adders
• Multiplierless implementation of rotators and FFTs
• Simplified design of constant coefficient multipliers
• Low-power constant-coefficient multiplier generator
• Strength of the reversible, garbage-free \(2^{k } \pm 1\) multiplier

Cited in

(9)

• Low-power constant-coefficient multiplier generator
• Optimization of linear phase FIR filters in dynamically expanding subexpression space
• Algebraic methods for optimizing constant multiplications in linear systems
• Simplified design of constant coefficient multipliers
• A fast fixed point signed multiplication algorithm
• An optimal algorithm for grouping in NEDA
• Constant integer multiplication using minimum adders
• Constant number serial pipeline multipliers
• Reconfigurable multiplier blocks: Structures, algorithm and applications

This page was built for publication: Multiplierless multiple constant multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944548)