A Non-Orthogonal Distributed Space-Time Coded Protocol Part I: Signal Model and Design Criteria
<|reference_start|>A Non-Orthogonal Distributed Space-Time Coded Protocol Part I: Signal Model and Design Criteria: In this two-part series of papers, a generalized non-orthogonal amplify and forward (GNAF) protocol which generalizes several known cooperative diversity protocols is proposed. Transmission in the GNAF protocol comprises of two phases - the broadcast phase and the cooperation phase. In the broadcast phase, the source broadcasts its information to the relays as well as the destination. In the cooperation phase, the source and the relays together transmit a space-time code in a distributed fashion. The GNAF protocol relaxes the constraints imposed by the protocol of Jing and Hassibi on the code structure. In Part-I of this paper, a code design criteria is obtained and it is shown that the GNAF protocol is delay efficient and coding gain efficient as well. Moreover GNAF protocol enables the use of sphere decoders at the destination with a non-exponential Maximum likelihood (ML) decoding complexity. In Part-II, several low decoding complexity code constructions are studied and a lower bound on the Diversity-Multiplexing Gain tradeoff of the GNAF protocol is obtained.<|reference_end|>
@article{rajan2006a,
    title={A Non-Orthogonal Distributed Space-Time Coded Protocol Part I: Signal
  Model and Design Criteria},
    author={G. Susinder Rajan, B. Sundar Rajan},
    journal={Proceedings of 2006 IEEE Information Theory Workshop (ITW'06),
  Oct. 22-26, 2006, Chengdu, China, pp.385-389},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0610161},
    primaryClass={cs.IT math.IT}
}