Multiple constant multiplication optimizations for field programmable gate arrays. With a preface by Prof. Dr.-Ing. Peter Zipf
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)
- 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
- scientific article; zbMATH DE number 1941116 (Why is no real title available?)
- scientific article; zbMATH DE number 1941169 (Why is no real title available?)
- Digit-serial complex-number multipliers on FPGAs
- scientific article; zbMATH DE number 1849108 (Why is no real title available?)
- Efficient realization of large size two's complement multipliers using embedded blocks in FPGAs
- Algebraic methods for optimizing constant multiplications in linear systems
- scientific article; zbMATH DE number 1849106 (Why is no real title available?)
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)
