This paper proposes a novel tensor decomposition method, cooperative parallel factor (Co-PARAFAC), that is devised to achieve higher accuracy with lower computational complexity and memory requirements than the conventional PARAFAC. The rationale relies on dividing a given tensor, even with a large size, into smaller disjoint sub-tensors, which are independently and parallelly decomposed using the conventional PARAFAC. The intermediate results are then properly merged to obtain the decomposition of the original tensor. As case study, we apply Co-PARAFAC to estimate the uplink channels of RIS-assisted wireless communications. Simulation results corroborate the efficiency of the Co-PARAFAC in achieving significantly lower computational complexity and higher channel estimation accuracy than the conventional PARAFAC. Broadly, the proposed algorithm is advantageous in various fields requiring efficient and high accurate tensor decomposition.

Co-PARAFAC: A Novel Cost-Efficient Scalable Tensor Decomposition Algorithm

Farshad Shams
Co-primo
Writing – Review & Editing
;
Vincenzo Lottici
Co-primo
Writing – Review & Editing
;
2024-01-01

Abstract

This paper proposes a novel tensor decomposition method, cooperative parallel factor (Co-PARAFAC), that is devised to achieve higher accuracy with lower computational complexity and memory requirements than the conventional PARAFAC. The rationale relies on dividing a given tensor, even with a large size, into smaller disjoint sub-tensors, which are independently and parallelly decomposed using the conventional PARAFAC. The intermediate results are then properly merged to obtain the decomposition of the original tensor. As case study, we apply Co-PARAFAC to estimate the uplink channels of RIS-assisted wireless communications. Simulation results corroborate the efficiency of the Co-PARAFAC in achieving significantly lower computational complexity and higher channel estimation accuracy than the conventional PARAFAC. Broadly, the proposed algorithm is advantageous in various fields requiring efficient and high accurate tensor decomposition.
2024
Shams, Farshad; Lottici, Vincenzo; Tian, Zhi
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/1273327
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact