Multiple constant multiplication optimizations for field programmable gate arrays. With a preface by Prof. Dr.-Ing. Peter Zipf

DOI10.1007/978-3-658-13323-8zbMATH Open1336.68004OpenAlexW2484728328MaRDI QIDQ2808231FDOQ2808231

Martin Kumm

Publication date: 20 May 2016

Full work available at URL: https://doi.org/10.1007/978-3-658-13323-8

Recommendations

• scientific article; zbMATH DE number 1941169
• scientific article; zbMATH DE number 1849107
• scientific article; zbMATH DE number 1849106
• Efficient realization of large size two's complement multipliers using embedded blocks in FPGAs
• Algebraic methods for optimizing constant multiplications in linear systems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Approximation methods and heuristics in mathematical programming (90C59) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Integer programming (90C10) Applications of graph theory to circuits and networks (94C15) Mathematical problems of computer architecture (68M07) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Digit-serial complex-number multipliers on FPGAs
• Title not available (Why is that?)
• Algebraic methods for optimizing constant multiplications in linear systems
• Title not available (Why is that?)

This page was built for publication: Multiple constant multiplication optimizations for field programmable gate arrays. With a preface by Prof. Dr.-Ing. Peter Zipf

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