arrow
Return

Randomized tensor decomposition using parallel reconfigurable systems

delete2025-02-25
delete0
delete
OA
AI
M
Misra, Ajita *
M
Muhammad A. A. Abdelgawad
P
Peng Jing
R
Ray C. C. Cheung
Hong Yan cover
Hong Yan (Hong Yan)
DOI:10.1007/s11227-025-07049-5delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Tensor decomposition algorithms are essential for extracting meaningful latent variables and uncovering hidden structures in real-world data tensors. Unlike conventional deterministic tensor decomposition algorithms, randomized methods offer higher efficiency by reducing memory requirements and computational complexity. This paper proposes an efficient hardware architecture for a randomized tensor decomposition implemented on a field-programmable gate array (FPGA) using high-level synthesis (HLS). The proposed architecture integrates random projection, power iteration, and subspace approximation via QR decomposition to achieve low-rank approximation of multidimensional datasets. The proposed architecture utilizes the capabilities of reconfigurable systems to accelerate tensor computation. It includes three central units: (1) tensor times matrix chain (TTMc), (2) tensor unfolding unit, and (3) QR decomposition unit to implement a three-stage algorithm. Experimental results demonstrate that our FPGA design achieves up to 14.56 times speedup compared to the well-implemented tensor decomposition using software library Tensor Toolbox on an Intel i7-9700 CPU. For a large input tensor of size 512x512x512\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$512 \times 512 \times 512$$\end{document}, the proposed design achieves a 5.55 times speedup compared to an Nvidia Tesla T4 GPU. Furthermore, we utilize our hardware-based high-order singular value decomposition (HOSVD) accelerator for two real applications: background subtraction of dynamic video datasets and data compression. In both applications, our proposed design shows high efficiency regarding accuracy and computational time.
Keywords:
High-level synthesis (HLS)
Field programmable gate array (FPGA)
Randomized algorithm
Low-rank tensor computing
High order singular value decomposition (HOSVD)

Journal

Journal of Supercomputing cover
Journal of Supercomputing
IF:
2.7
Papers:
1.2K
Citations:
1.0W

Organization

C
city univ hongkong
Scholars:
1
Papers: 1
Citations: 0
Cited Papers

Cited Papers

Array programming with NumPy
err2020-09-16
err0
errOAAI
errCharles R. Harris; K. Jarrod Millman; Stéfan J. van der Walt; Ralf Gommers; Pauli Virtanen; David Cournapeau; Eric Wieser; Julian Taylor; Sebastian Berg; Nathaniel J. Smith; Robert Kern; Matti Picus; Stephan Hoyer; Marten H. van Kerkwijk; Matthew Brett; Allan Haldane; Jaime Fernández del Río; Mark Wiebe; Pearu Peterson; Pierre Gérard-Marchant; Kevin Sheppard; Tyler Reddy; Warren Weckesser; Hameer Abbasi; Christoph Gohlke; Travis E. Oliphant
errShare
errSave
A Multilinear Singular Value Decomposition
err2000-01-01
err0
errOAAI
errLieven De Lathauwer; Bart De Moor; Joos Vandewalle
errShare
errSave
A Survey on Various Median Filtering Techniques For Removal of Impulse Noise From Digital Image
err2018-03-01
err0
PREAI
errGinu George; Rinoy Mathew Oommen; Shani Shelly; Stephie Sara Philipose; Ann Mary Varghese
errShare
errSave
errShare
errSave
Background subtraction in real applications: Challenges, current models and future directions
err2020-02-01
err202
errOAAI
errGarcia-Garcia, Belmar; Bouwmans, Thierry; Rosales Silva, Alberto Jorge
errShare
errSave
researcher View more