A methodology for designing processor architectures oriented to matrix-vector operations is proposed in this paper. The methodology is based on high-radix multiplication where first a list of potential partial products (PPs) of one operand with all possible t-bit numbers (t ∈ {2,3,4}) are computed by simple shifts and additions, then selected PPs from this list are shifted and added according to t-bit slices of the other operand. Main advantage of the proposed method is that the list of potential PPs may be reused whenever one multiplicand is to be multiplied with several multipliers. Another advantage is that the hardware blocks involved for high-radix multiplication may also be used independently to implement other tasks such as parallel addition/subtractions, accumulations. This allows introducing a group of modifications to high-radix multiplier structures making them reconfigurable so that single devices having two-fold functionalities of either programmable processors or reconfigurable hardware accelerators may be designed. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Guevorkian, D., Liuha, P., Launiainen, A., & Lappalainen, V. (2004). A family of accelerators for matrix-vector arithmetics based on high-radix multiplier structures. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3133, 118–127. https://doi.org/10.1007/978-3-540-27776-7_13
Mendeley helps you to discover research relevant for your work.