Distributed Khatri-Rao Space-Time coding and decoding for cooperative networks

Alain Kibangou (1, 2) , André L. F. de Almeida (3)

1 NECS - Networked Controlled Systems
2 GIPSA-lab - Grenoble Images Parole Signal Automatique
3 GTEL - Wireless Telecom Research Group [Fortaleza]

Khatri-Rao Space-Time (KRST) coding is an efficient scheme proposed in the last decade for multi-antenna communication systems. The decoding process results on a tensor decomposition with interesting blind decodability properties. In this paper, we consider its extension to cooperative networks where each node has a single antenna. For this purpose, we propose a distributed KRST coding and decoding technique. The proposed distributed decoding scheme is based on average consensus embedded in an Alternating Least Squares algorithm. Unlike standard consensus algorithms where consensus is reached asymptotically, we derive closed form solutions that allow reaching the consensus in a finite number of iterations upper-bounded by the number of collaborating nodes. The performance of the proposed method is evaluated by means of simulations.

Mots clés: Coooperative networks; Distributed signal processing; Consensus algorithms; Tensor decompositions

Domaines: Traitement du signal et de l'image [eess.SP]; Traitement du signal et de l'image [eess.SP]

Alain Kibangou, André L. F. de Almeida. Distributed Khatri-Rao Space-Time coding and decoding for cooperative networks. EUSIPCO 2011 - 19th European Signal Processing Conference, Aug 2011, Barcelone, Spain. pp.809-813. ⟨hal-00598662⟩