Design and Performance Analysis of Fixed-point Jacobi SVD Algorithm on Reconfigurable System
Ramanarayan Mohanty, Gonnabhaktula Anirudh, Tapan Pradhan, Bibek Kabi, Aurobinda Routray
Abstract
Open-access reader
Ramanarayan Mohanty, Gonnabhaktula Anirudh, Tapan Pradhan, Bibek Kabi, Aurobinda Routray
Abstract
Open-access reader
This paper presents design and performance analysis of fixed-point two sided Jacobi Singular Value Decomposition (SVD) algorithm on reconfigurable system using pipelined state-of-the-art CORDIC architecture. The algorithm has been implemented in reconfigurable hardware with the proposed architecture to achieve faster performance for matrices with larger dimensions. This design has not only reduced the computational complexity but also exploited parallelism in data transfer methods. Various quantization modes along with their range of relative errors are discussed. A comparative study of execution time shows that FPGA implementation with increasing dimension is found to be superior to its floating-point counterpart. Accuracy of FPGA and SystemC based fixed-point implementation is compared based on number of accurate fractional bits, signal-to-quantization-noise-ratio (SQNR), orthogonality and factorization errors with respect to double precision floating-point results.
OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents design and performance analysis of fixed-point two sided Jacobi Singular Value Decomposition (SVD) algorithm on reconfigurable system using pipelined state-of-the-art CORDIC architecture. The algorithm has been implemented in reconfigurable hardware with the proposed architecture to achieve faster performance for matrices with larger dimensions. This design has not only reduced the computational complexity but also exploited parallelism in data transfer methods. Various quantization modes along with their range of relative errors are discussed. A comparative study of execution time shows that FPGA implementation with increasing dimension is found to be superior to its floating-point counterpart. Accuracy of FPGA and SystemC based fixed-point implementation is compared based on number of accurate fractional bits, signal-to-quantization-noise-ratio (SQNR), orthogonality and factorization errors with respect to double precision floating-point results.
Key concepts: CORDIC, Field-programmable gate array, Computer science, Quantization (signal processing), Singular value decomposition, Floating point, Algorithm, Orthogonality