Constructions of Fast-Decodable Distributed Space-Time Codes
Information Theory
2015-04-21 v1 math.IT
Abstract
Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [1] to the N -relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time codes for more than one antenna per user. Explicit constructions are provided alongside with a performance comparison to non-iterated (non-) fast-decodable codes.
Keywords
Cite
@article{arxiv.1504.05058,
title = {Constructions of Fast-Decodable Distributed Space-Time Codes},
author = {Amaro Barreal and Camilla Hollanti and Nadya Markin},
journal= {arXiv preprint arXiv:1504.05058},
year = {2015}
}
Comments
Presented at the Fourth International Meeting on Coding Theory and Applications. To appear in CIM Series in Mathematical Sciences, Springer Verlag