Space-Frequency Codes Based on the Space-Time Codes With Very Low Complexity for the Decoder

被引：1
|
作者：
Shahabinejad, Mostafa [1 ,2 ]
Hosseini, Fatemeh G. [1 ,2 ]
Talebi, Siamak [1 ,2 ]
机构：
[1] Shahid Bahonar Univ Kerman, Dept Elect Engn, Kerman, Iran
[2] Sharif Univ Technol, Adv Commun Res Inst, Tehran, Iran
来源：
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY | 2013年 / 62卷 / 09期
关键词：
Fading channels; frequency-selective channels; multi-input-multi-output orthogonal frequency-division multiplexing (MIMO-OFDM)systems; space-frequency coding; wireless communication; DIVERSITY;
D O I：
10.1109/TVT.2013.2263289
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
In this paper, we introduce a family of full-diversity space-frequency codes (SFCs) for the multi-input-multi-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems. The most important feature of the proposed SFCs is that they can be swiftly decoded. More precisely, the decoding complexity on the order of O (M) or O(M-2) can be attained for the proposed full-diversity SFCs, where M is the constellation size. Simulation results have also verified that the proposed SFCs display outstanding performance in comparison with the latest SFC model published in the literature.
引用
收藏
页码：4678 / 4684
页数：8
相关论文
共 50 条
  • [41] Space-time codes based on Hadamard matrices
    Bossert, M
    Gabidulin, EM
    Lusina, P
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 283 - 283
  • [42] A novel decoder for unknown diversity channels employing space-time codes
    Erez, E
    Feder, M
    EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING, 2002, 2002 (03) : 267 - 274
  • [43] Space-time block codes based on precoding
    Hong, ZH
    Sayeed, AM
    GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 636 - 640
  • [44] Searching good space-time trellis codes of high complexity
    Kang, GX
    Elena, C
    Qi, BH
    Jin, XG
    Zhang, P
    WCNC 2002: IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE RECORD, VOLS 1 & 2, 2002, : 109 - 113
  • [45] Computational Complexity of Decoding Orthogonal Space-Time Block Codes
    Ayanoglu, Ender
    Larsson, Erik G.
    Karipidis, Eleftherios
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2011, 59 (04) : 936 - 941
  • [46] Computational Complexity of Decoding Orthogonal Space-Time Block Codes
    Ayanoglu, Ender
    Larsson, Erik G.
    Karipidis, Eleftherios
    2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [47] Space-Time Codes Based on Rank-Metric Codes and Their Decoding
    Puchinger, Sven
    Stern, Sebastian
    Bossert, Martin
    Fischer, Robert F. H.
    2016 13TH INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATION SYSTEMS (ISWCS), 2016, : 125 - 130
  • [48] Maximum rank distance codes as space-time codes
    Lusina, P
    Gabidulin, E
    Bossert, M
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) : 2757 - 2760
  • [49] Performance of space-frequency codes in MIMO channels with frequency offset
    Dao, DN
    Tellambura, C
    CONFERENCE RECORD OF THE THIRTY-EIGHTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1 AND 2, 2004, : 702 - 706
  • [50] Low complexity decoding of a class of linear space-time block codes by subspace partitioning
    Kuhn, M
    Wittneben, A
    IEEE 56TH VEHICULAR TECHNOLOGY CONFERENCE, VTC FALL 2002, VOLS 1-4, PROCEEDINGS, 2002, : 2182 - 2186
12345