2017
DOI: 10.1049/cje.2016.06.033
|View full text |Cite
|
Sign up to set email alerts
|

Fast Implementation for the Singular Value and Eigenvalue Decomposition Based on FPGA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(8 citation statements)
references
References 16 publications
0
8
0
Order By: Relevance
“…Many methods exist for finding the eigenvalues of the incident signal covariance matrix like the Exact Jacobi method, the Jacobi method [14], [15], and the algebraic method [16]. Some other techniques for fast computation of SVD (Singular Value Decomposition) and EVD have also been proposed in [17]. Among all these techniques [16] is found to be the most efficient and has less computational requirements.…”
Section: Eigen Value Decompositionmentioning
confidence: 99%
“…Many methods exist for finding the eigenvalues of the incident signal covariance matrix like the Exact Jacobi method, the Jacobi method [14], [15], and the algebraic method [16]. Some other techniques for fast computation of SVD (Singular Value Decomposition) and EVD have also been proposed in [17]. Among all these techniques [16] is found to be the most efficient and has less computational requirements.…”
Section: Eigen Value Decompositionmentioning
confidence: 99%
“…The implementation managed to compute the SVD of an 32 × 127 matrix in 13 ms while occupying 20% and 67% slice registers and LUTs respectively on a Virtex-6 FPGA. Fast and efficient FPGA implementation for computing the singular and eigen value decomposition based on a simplified CORDIC-like algorithm is presented in [21]. The implementation uses fixed-point arithmetic for sequential and parallel operations leading about 3× faster computation in an image denoising application compared to computations via an Intel CPU based PC.…”
Section: A Literature Reviewmentioning
confidence: 99%
“…We develop a unitary transformation 33 to further transform the pertinent persymmetric Hermitian matrix into a real symmetric matrix. In this way, the classic Jacobi rotation method 34 can thus be exploited to perform orthogonal similarity transformation on this real symmetric matrix. When all the non‐diagonal elements in the square matrix are close to zero, we can obtain an approximate diagonal matrix, and its diagonal elements are the desired eigenvalues.…”
Section: Noise Variance Estimationmentioning
confidence: 99%