This paper presents a novel architecture for the Singular Value Decomposition (SVD) algorithm. The architecture embraces the reductions offered by the use of Approximate Computing (AxC) as a trade-off between complexity and accuracy. A shallow Neural Network (NN) consisting of three layers is used to compute the SVD of an input matrix, offering a comparable Mean Squared Error (MSE) with exact computations. The NN is implemented using High-Level Synthesis (HLS) on a Virtex7 FPGA device. When compared to an exact implementation of the SVD algorithm, the proposed architecture achieves a computational speedup between 5 imes and 19 imes with an average reduced hardware area of up to 80% with a noticeable 6 imes reduction in the DSP usage.
Efficient FPGA Implementation of Approximate Singular Value Decomposition based on Shallow Neural Networks
Younes H.;Ibrahim A.;Valle M.
2021-01-01
Abstract
This paper presents a novel architecture for the Singular Value Decomposition (SVD) algorithm. The architecture embraces the reductions offered by the use of Approximate Computing (AxC) as a trade-off between complexity and accuracy. A shallow Neural Network (NN) consisting of three layers is used to compute the SVD of an input matrix, offering a comparable Mean Squared Error (MSE) with exact computations. The NN is implemented using High-Level Synthesis (HLS) on a Virtex7 FPGA device. When compared to an exact implementation of the SVD algorithm, the proposed architecture achieves a computational speedup between 5 imes and 19 imes with an average reduced hardware area of up to 80% with a noticeable 6 imes reduction in the DSP usage.File | Dimensione | Formato | |
---|---|---|---|
2021062708.pdf
accesso chiuso
Descrizione: Articolo su rivista
Tipologia:
Documento in Post-print
Dimensione
501.47 kB
Formato
Adobe PDF
|
501.47 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.