Anzeige
Erschienen in:
2016 | OriginalPaper | Buchkapitel
A Heuristic for the Constant Matrix Multiplication Problem
verfasst von : Martin Kumm
Erschienen in: Multiple Constant Multiplication Optimizations for Field Programmable Gate Arrays
Verlag: Springer Fachmedien Wiesbaden
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This chapter deals with the problem of optimizing the multiplication of a constant matrix with a vector, the constant matrix multiplication (CMM) operation in a pipelined fashion (for an introduction of the CMM problem, see Section 2.3). Finding a PAG with minimum adder count for this kind of problem, in the following denoted as the PCMM problem, is a generalization of the PMCM problem. As the search space of the PCMM problem is much larger compared to the PMCM problem, the aim is to heuristically solve the problem by extending the RPAG algorithm of Chapter 4.