[1] Zhang Yuan,. Achievability of Chong-Motani-Garg relay channel capacity boundsusing forward decoding [J]. Journal of Southeast University (English Edition), 2009, 25 (1): 6-8. [doi:10.3969/j.issn.1003-7985.2009.01.002]

Copy

Achievability of Chong-Motani-Garg relay channel capacity boundsusing forward decoding()

中继信道Chong-Motani-Garg容量界的前向解码可达性

Share：

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:

25

Issue:

2009 1

Page:

6-8

Research Field:

Information and Communication Engineering

Publishing date:

2009-03-30

Info

Title:

Achievability of Chong-Motani-Garg relay channel capacity boundsusing forward decoding

中继信道Chong-Motani-Garg容量界的前向解码可达性

Author(s):

Zhang Yuan

National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China

张源

东南大学移动通信国家重点实验室, 南京 210096

Keywords:

achievable rate;  capacity;  backward decoding;  forward decoding;  mixed strategy;  relay channel

可达速率;  容量;  后向解码;  前向解码;  混合策略;  中继信道

PACS:

TN911.2

DOI:

10.3969/j.issn.1003-7985.2009.01.002

Abstract:

To reduce decoding delay of a communication scheme which is backward-decoding-based and achievable Chong-Motani-Garg capacity bounds, a novel forward-sliding-window decoding-based communication scheme is proposed.In this scheme, if w=(w₁1, w₂2)is the message to be sent in block b, the relay will decode message w₁ and generate a new message z at the end of block b, and the receiver will decode message w₁ at the end of block b+1 and decode message z and w₂ at the end of block b+2.Analysis results show that this new communication scheme can achieve the same Chong-Motani-Garg bounds and the decoding delay is only two blocks which is much shorter than that of backward decoding.Therefore, Chong-Motani-Garg bounds can be achieved by a forward decoding-based communication scheme with short decoding delay.

为了解决基于后向解码的三节点中继信道Chong-Motani-Garg容量界可达通信方案的解码延时过长问题, 提出了一种新型的基于前向解码的三节点中继信道通信方案.在该方案中, 假定在第b个分组中的发送消息为w=(w₁1, w₂2), 则中继需要在第b个分组结束时对消息w₁1进行解码并生成一个新的消息z, 而接收机需要在第b+1个分组结束时对消息w₁1进行解码, 然后在第b+2个分组结束时对消息z和w₂2进行解码.分析结果表明, 该通信方案也可以达到Chong-Motani-Garg容量界, 并且该方案的解码延时只有2个分组长度, 大大短于基于后向解码的通信方案的解码延时.因此, 三节点中继信道Chong-Motani-Garg容量界可以通过基于解码延时短的前向解码的通信方案达到.

References:

[1] Meulen E C.Three-terminal communication channels [J].Advances in Applied Probability, 1971, 3(3):120-154.
[2] Meulen E C.A survey of multiway channels in information theory:1961-1976[J].IEEE Transactions on Information Theory, 1977, 23(1):1-37.
[3] Cover T M, Gamal A A.Capacity theorems for the relay channel [J].IEEE Transactions on Information Theory, 1979, 25(5):572-584.
[4] Cover T M, Thomas J A.Elements of information theory [M].New York:Wiley, 1991.
[5] Xie L, Kumar P R.An achievable rate for the multiple-level relay channel [J].IEEE Transactions on Information Theory, 2005, 51(4):1348-1358.
[6] Kramer G, Gastpar M, Gupta P.Cooperative strategies and capacity theorems for relay networks[J].IEEE Transactions on Information Theory, 2005, 51(9):3037-3063.
[7] Chong H, Motani M, Garg H K.Generalized backward decoding strategies for the relay channel[J].IEEE Transactions on Information Theory, 2007, 53(1):394-401.
[8] Zeng C, Kuhlmann F, Buzo A.Achievability proof of some multiuser channel coding theorems using backward decoding [J].IEEE Transactions on Information Theory, 1989, 35(6):1160-1165.

Memo

Memo:

Biography: Zhang Yuan(1977—), male, doctor, lecturer, y.zhang@seu.edu.cn.
Foundation items: The Free Research Fund of National Mobile Communications Research Laboratory of Southeast University(No.2008B06), the National Basic Research Program of China(973 Program)(No.2007CB310603).
Citation: Zhang Yuan.Achievability of Chong-Motani-Garg relay channel capacity bounds using forward decoding[J].Journal of Southeast University(English Edition), 2009, 25(1):6-8.

Common functions