Dynamic decode and forward for the multi-access relay channel with finite block length

PIMRC(2011)

引用 7|浏览3
暂无评分
摘要
The dynamic decode-and-forward (DDF) protocol for the multiple access relay channel (MARC) with quasi static fading is evaluated using the Zheng-Tse diversity-multiplexing tradeoff (DMT). We assume that there are two users, one half-duplex relay, and a common destination, each equipped with single antenna. For the Rayleigh fading channel, the DDF protocol is well known and has been analyzed in terms of the DMT with the infinite block length assumption by Azarian et al. However, to make the protocol feasible, the practical constraint of finite block length must be enforced, which may result in a loss in the DMT. Another practical effect not considered in the infinite block length DDF protocol is the possible decoding error at the relay. By carefully dealing with these practical issues due to finite block length, we characterize the finite block length DMT of the DDF protocol. We further consider the situation where the destination does not have a priori knowledge of the relay decision time at which the relay switches from listening to transmitting, and show that the optimal DMT is still achievable as if there is no decoding error at the relay. Therefore, the assumption of error-free decoding at the relay and additional protocol overhead to communicate the decision time are not needed for the DDF to achieve the optimal DMT.
更多
查看译文
关键词
zheng-tse diversity-multiplexing tradeoff,protocols,relays,multiaccess relay channel,decode and forward communication,finite block length,half-duplex relay,dynamic decode and forward,multiplexing,rayleigh fading channel,protocol overhead,dmt,ddfprotocol,dynamic decode-and-forward protocol,single antenna,marc,error-free decoding,ddf protocol,quasi static fading,decoding,decoding error,multiple access relay channel,rayleigh channels,network coding,fading,antennas,upper bound,a priori knowledge,relay channel
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要