Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Alain Kibangou <>
Submitted on : Tuesday, June 7, 2011 - 11:44:54 AM
Last modification on : Thursday, March 25, 2021 - 9:45:01 AM
Long-term archiving on: : Friday, September 9, 2011 - 3:16:08 PM


Files produced by the author(s)


  • HAL Id : hal-00598662, version 1



Alain Kibangou, André 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⟩



Record views


Files downloads