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 条
[31]   Space-time block codes from orthogonal designs [J].
Tarokh, V ;
Jafarkhani, H ;
Calderbank, AR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (05) :1456-1467
[32]   Asymptotic performance of space-frequency codes over broadband channels [J].
Wang, JB ;
Biglieri, E ;
Yao, K .
IEEE COMMUNICATIONS LETTERS, 2002, 6 (12) :523-525
[33]   A new family of unitary space-time codes with a fast parallel sphere decoder algorithm [J].
Chen, XJ ;
Zhou, KM ;
Aravena, JL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (01) :115-140
[34]   Performance of concatenated channel codes and orthogonal space-time block codes [J].
Shah, Harsh ;
Hedayat, Ahmadreza ;
Nosratinia, Aria .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2006, 5 (06) :1406-1414
[35]   Reducing Complexity with Less than Minimum Delay Space-Time Lattice Codes [J].
Vehkalahti, Roope ;
Hollanti, Camilla .
2011 IEEE INFORMATION THEORY WORKSHOP (ITW), 2011,
[36]   REDUCED COMPLEXITY TREE-SEARCH DETECTOR FOR HYBRID SPACE-TIME CODES [J].
Gonzalez, Griselda ;
Cortez, Joaquin ;
Bazdresch, Miguel .
2019 IEEE WESTERN NEW YORK IMAGE AND SIGNAL PROCESSING WORKSHOP (WNYISPW), 2019,
[37]   Improved Perfect Space-Time Block Codes [J].
Srinath, Pavan K. ;
Rajan, B. Sundar .
2013 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2013, :3192-3197
[38]   Iterative detection of interleaver-based space-time codes [J].
Wu, KY ;
Leung, WK ;
Liu, LH ;
Ping, L .
IEICE TRANSACTIONS ON COMMUNICATIONS, 2004, E87B (11) :3173-3179
[39]   Orthogonal Space-Time Block Codes with Feedback [J].
Girish Ganesan ;
Petre Stoica ;
Erik G. Larsson .
Wireless Personal Communications, 2004, 28 :287-312
[40]   Improved Perfect Space-Time Block Codes [J].
Srinath, K. Pavan ;
Rajan, B. Sundar .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (12) :7927-7935
12345