What is it about?
A multi-precision floating-point matrix multiplier design on FPGA, which can be reconfigured at run-time as per the accuracy requirements.
Featured Image
Why is it important?
In today’s world, high-power computing applications such as image processing, digital signal processing, graphics, robotics require enormous computing power. These applications use matrix operations, especially matrix multiplication. Multiplication operations require a lot of computational time and are also complex in design. We can use field-programmable gate arrays as low-cost hardware accelerators along with a low-cost general-purpose processor instead of a high-cost application-specific processor for such applications. In this work, we employ an efficient Strassen’s algorithm for matrix multiplication and a highly efficient run-time-reconfigurable floating-point multiplier for matrix element multiplication. The run-time-reconfigurable floating-point multiplier is implemented with custom floating-point format for variable-precision applications. A very efficient combination of Karatsuba algorithm and Urdhva-Tiryagbhyam algorithm is used to implement the binary multiplier. This design can effectively adjust the power and delay requirements according to different accuracy requirements by reconfiguring itself during run time.
Perspectives
This work is helpful in low precision computer-vision applications where matrix multiplication is used as the main computational block.
Arish Sateesan
Katholieke Universiteit Leuven
Read the Original
This page is a summary of: Run-Time-Reconfigurable Multi-Precision Floating-Point Matrix Multiplier Intellectual Property Core on FPGA, Circuits Systems and Signal Processing, May 2016, Springer Science + Business Media,
DOI: 10.1007/s00034-016-0335-2.
You can read the full text:
Contributors
The following have contributed to this page







