Unique word-based distributed space-time block codes for two-hop wireless relay networks

被引:1
|
作者
Tran, L-N [1 ]
Vien, Q-T [2 ]
Hong, E-K [3 ]
机构
[1] KTH Royal Inst Technol, Signal Proc Lab, ACCESS Linnaeus Ctr, Stockholm, Sweden
[2] Glasgow Caledonian Univ, Sch Engn & Built Environm, Glasgow G4 0BA, Lanark, Scotland
[3] Kyung Hee Univ, Sch Elect & Informat, Yongin 446701, Geonggi, South Korea
基金
新加坡国家研究基金会;
关键词
FREQUENCY-DOMAIN EQUALIZATION; DECISION-FEEDBACK EQUALIZATION; COOPERATIVE DIVERSITY; SYSTEMS; TRANSMISSION; PROTOCOLS; CHANNEL; SCHEME;
D O I
10.1049/iet-com.2010.0957
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Distributed space-time block codes (DSTBCs) have been developed to exploit diversity gains in cooperative communications systems. In this paper, we propose a new DSTBC based on unique word (UW) extension, referred to as the D-UW-STBC. The D-UW-STBC is devised for wireless relay networks with the amplify-and-forwarcl protocol and frequency selective fading channels. The data is transmitted from the source to the destination by a block-wise manner, resembling the block level of the Alamouti scheme. At the source, a UW is padded to the tail of each data block, which plays as a cyclic prefix, and thus allows for low-complexity implementation in the frequency domain. The additional purpose of using UW in this paper is to estimate the channels. However, the introduction of UWs makes it difficult to decouple the detection of data blocks. To achieve the orthogonality of the equivalent space-time channel, we carefully cancel the interference induced by the UWs. Also, a least square (LS) channel estimation approach is proposed, in which, the relay is transparent to the source and destination. The optimal UWs arc designed to minimise the effect of additive noise. Bit-crror-ratc (BER) performance comparison of various receiver schemes is carried out by computer simulations.
引用
收藏
页码:715 / 723
页数:9
相关论文
共 50 条
  • [1] Distributed space-time block codes for two-hop wireless relay networks
    Harshan, J.
    Sundar Rajan, B.
    [J]. Journal of Communications, 2010, 5 (04): : 282 - 296
  • [2] Distributed space-time codes in wireless relay networks
    Jing, YD
    Hassibi, B
    [J]. 2004 IEEE SENSOR ARRAY AND MULTICHANNEL SIGNAL PROCESSING WORKSHOP, 2004, : 249 - 253
  • [3] Cascaded orthogonal space-time block codes for wireless multi-hop relay networks
    Vaze, Rahul
    Heath, Robert W., Jr.
    [J]. EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2013,
  • [4] On the performance of distributed space-time block codes in cooperative relay networks
    Unger, Timo
    Klein, Anja
    [J]. IEEE COMMUNICATIONS LETTERS, 2007, 11 (05) : 411 - 413
  • [5] An algebraic family of distributed space-time codes for wireless relay networks
    Oggier, Frederique
    Hassibi, Babak
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 538 - +
  • [6] Fast Distributed Space-Time Block Code in Wireless Relay Networks
    Song, Wei
    Lee, Moon Ho
    [J]. IWSDA'09: PROCEEDINGS OF THE FOURTH INTERNATIONAL WORKSHOP ON SIGNAL DESIGN AND ITS APPLICATIONS IN COMMUNICATIONS, 2009, : 145 - 148
  • [7] Distributed orthogonal space-time block coding in wireless relay networks
    Hoc Phan
    Duong, Trung Q.
    Zepernick, Hans-Jurgen
    Tsiftsis, Theodoros A.
    [J]. IET COMMUNICATIONS, 2013, 7 (16) : 1825 - 1835
  • [8] Two Schemes of Orthogonal Space-Time Block Codes for Relay Networks
    Ren, Tianpeng
    Zhu, Jiang
    Zhang, Eryang
    [J]. 2008 INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, VOLS 1-4, 2008, : 1252 - 1257
  • [9] Synchronization-aware distributed space-time codes in wireless relay networks
    Seddik, Karlin G.
    Sadek, Ahmed K.
    Ibrahim, Ahmed S.
    Liu, K. J. Ray
    [J]. GLOBECOM 2007: 2007 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-11, 2007, : 3452 - +
  • [10] Cyclic Distributed Space-Time Codes for Wireless Relay Networks With No Channel Information
    Oggier, Frederique
    Hassibi, Babak
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (01) : 250 - 265