Block-Markov encoding with network coding for cooperative communications

被引:3
作者
Das Menghwar, Gordhan
Mecklenbraeuker, Christoph F.
机构
[1] Institute of Communications and Radio Frequency Engineering, Vienna University of Technology, 1040 Vienna
关键词
Cooperative communications; Block-Markov encoding; Network coding; Outage probability; Diversity-multiplexing tradeoff; MULTIPLE-ACCESS CHANNEL; DIVERSITY; CAPACITY;
D O I
10.1016/j.comcom.2010.07.024
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper. we propose network coding as an operational implementation of information theoretic block-Markov coding for cooperative communications. This is a transmission strategy where users act as a relay for each other to help reliable recovery of the message at the destination(s) With analytical results, we show that even with this very simple implementation, we can outperform cooperative transmission schemes using legacy space-time (ST) and the repetition codes We take outage probability and the diversity-multiplexing tradeoff curve as a performance measures to evaluate the gains offered by this so called cooperative communications using network coding scheme. The results show that, under block-fading channel, network coding based cooperative communications offers diversity order of 3 while ST and the repetition coding based cooperative transmission offers diversity order of 2 only. When the performance is compared in terms of diversity-multiplexing tradeoff, block-Markov codebook structure inspired. network coding based cooperative communications outperforms by 33%, in terms of multiplexing gain, both ST and the repetition coding based cooperative transmission schemes. (C) 2010 Elsevier B.V All rights reserved.
引用
收藏
页码:2021 / 2030
页数:10
相关论文
共 31 条
  • [1] Network information flow
    Ahlswede, R
    Cai, N
    Li, SYR
    Yeung, RW
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) : 1204 - 1216
  • [2] Adaptive network coded cooperation (ANCC) for wireless relay networks: Matching code-on-graph with network-on-graph
    Bao, Xingkai
    Li , Jing
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2008, 7 (02) : 574 - 583
  • [3] Low density parity check codes for the relay channel
    Chakrabarti, Arnab
    de Baynast, Alexandre
    Sabharwal, Ashutosh
    Aazhang, Behnaam
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2007, 25 (02) : 280 - 291
  • [4] CHEN YD, 2006, WIR COMM NETW C 2006, V3, P1681
  • [5] Cover T.M., 2006, ELEMENTS INFORM THEO, V2nd ed
  • [6] AN ACHIEVABLE RATE REGION FOR THE MULTIPLE-ACCESS CHANNEL WITH FEEDBACK
    COVER, TM
    LEUNG, CSK
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (03) : 292 - 298
  • [7] COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
  • [8] On the performance of independently designed LDPC codes for the relay channel
    Ezri, Jeremie
    Gastpar, Michael
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 977 - +
  • [9] On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas
    Foschini G.J.
    Gans M.J.
    [J]. Wireless Personal Communications, 1998, 6 (3) : 311 - 335
  • [10] KHOJASTEPOUR MA, 2004, 38 AS C SIGN SYST CO, V2, P2000