arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0610161cs.ITmath.IT
收藏

一种非正交分布式空时编码协议I:信号模型与设计准则

A Non-Orthogonal Distributed Space-Time Coded Protocol Part I: Signal Model and Design Criteria

G. Susinder Rajan, B. Sundar Rajan

摘要:

在这两部分的系列论文中,提出了一个广义的非正交放大和转发(GNAF)协议,推广了几个已知的合作分集协议。GNAF协议中的传输包括两个阶段-广播阶段和协作阶段。在广播阶段,源将其信息广播到中继站以及目的地。在协作阶段,源和中继站一起以分布式方式发送空时码。GNAF协议放松了Jing和Hassibi协议对代码结构的约束。在本文的第一部分中,得到了一个码的设计准则,并表明GNAF协议是延迟有效的,以及编码增益有效的。此外,GNAF协议使得能够在目的地使用具有非指数最大似然(ML)解码复杂度的球形解码器。在第二部分中,研究了几种低译码复杂度的码构造,并得到了GNAF协议分集复用增益折衷的下界。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑