FPGA implementation of floating-point complex matrix inversion based on GAUSS-JORDAN elimination

Author(s):  
Sherif Moussa ◽  
Ahmed M. Abdel Razik ◽  
Adel Omar Dahmane ◽  
Habib Hamam
Author(s):  
Siavash Amin-Nejad ◽  
Katayoon Basharkhah ◽  
Tayyebeh Asgari Gashteroodkhani

A wide variety of digital communication systems are encountered with high computational tasks. QR decomposition is one of such algorithms that can be implemented on FPGAs as a solution to large complex matrix inversion problems. A flexible vector processing architecture for the fixed and floating point implementations of the QR decomposition is presented. The design is implemented on the StratixIV device with 230K logic elements and verified with the SignalTap II built-in logic analyzer. Throughputs of 2.4M and 2.11M decompositions per second with maximum clock frequency of 340 MHz and 360 MHz are achieved for 4×4 matrices with the fixed and floating point designs respectively. The FPGA resource utilizations of the two data type implementations are also compared for different matrix sizes for the StratixIV and Arria10 devices.


2014 ◽  
Vol 1008-1009 ◽  
pp. 668-671
Author(s):  
Hai Ke Liu ◽  
Xin Gna Kang ◽  
Shun Wang

A design of single precision floating point adder based on FPGA is presented,by analysing the form of real number formed on IEEE 754 and the storage format of IEEE 754 single-precision floating point,the addition arithmetic process which is easy to realized by using FPGA is put forward,the split of module based on the arithmetic process facilitates the realization of pipeline designing,so the single precision floating point adder introduce by this paper has powerful operation process ability.


Sign in / Sign up

Export Citation Format

Share Document