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 metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00598662
Contributor : Alain Kibangou <>
Submitted on : Tuesday, June 7, 2011 - 11:44:54 AM
Last modification on : Tuesday, October 9, 2018 - 1:15:11 AM
Long-term archiving on : Friday, September 9, 2011 - 3:16:08 PM

File

Distrib_KST_eusipco2011.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00598662, version 1

Collections

Citation

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

Share

Metrics

Record views

464

Files downloads

191