Recovering Multiplexing Loss through Concurrent Decode-and-Forward (DF) Relaying

Recovering Multiplexing Loss through Concurrent Decode-and-Forward (DF) Relaying
复制标题

通过并发解码转发 (DF) 中继恢复复用损失

DOI:
--
复制
发表时间:
2009
影响因子:
2.2
通讯作者:
J. Thompson
J. Thompson
中科院分区:
计算机科学4区
文献类型:
--
作者:
Chao Wang;Yijia Fan;J. Thompson

文献摘要

被引文献

相似文献

在本文中,我们开发了一种新的数字合作分集传输协议,该协议结合了两个源的两个经典的解码转发(DF)中继步骤,并使用2L + 1时隙从每个源传输L个码字。假设中继可以完美地解码其关联的源消息,我们给出了该传输方案的信息论平均可实现容量区域。通过分集与复用的权衡分析,我们的并发DF中继协议可以有效地恢复中继中半双工操作引起的复用损失,同时仍能获得一定的分集增益。数值结果表明,与传统的DF中继协议相比,该方案具有显著的性能优势,特别是在高信噪比(SNR)和大帧长L协议下。
In this paper, we develop a novel digital cooperative diversity transmission protocol for a two-source scenario by combining the two sources’ two classic decode-and-forward (DF) relaying steps and using 2L + 1 time slots to transmit L codewords from each source. Assuming the relays can perfectly decode their associated source messages, we give an information-theoretic average achievable capacity region for this transmission scheme. Through diversity-multiplexing tradeoff analysis, we show that our so called concurrent DF relaying protocol can effectively recover the multiplexing loss induced by the half-duplex operation in the relays, while still obtaining some diversity gain. Numerical results reveal our scheme offers significant performance advantages over the classic DF relaying protocols, especially for high signal-to-noise ratio (SNR) and large frame length L regime.