[1]刘陈,吴镇扬.容量无损满分集度空时分组码[J].东南大学学报(自然科学版),2005,35(5):664-668.[doi:10.3969/j.issn.1001-0505.2005.05.002]
 Liu Chen,Wu Zhenyang.Family of capacity lossless and full-diversity space-time block codes[J].Journal of Southeast University (Natural Science Edition),2005,35(5):664-668.[doi:10.3969/j.issn.1001-0505.2005.05.002]
点击复制

容量无损满分集度空时分组码()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
35
期数:
2005年第5期
页码:
664-668
栏目:
信息与通信工程
出版日期:
2005-09-20

文章信息/Info

Title:
Family of capacity lossless and full-diversity space-time block codes
作者:
刘陈 吴镇扬
东南大学无线电工程系, 南京 210096
Author(s):
Liu Chen Wu Zhenyang
Department of Radio Engineering, Southeast University, Nanjing 210096, China
关键词:
无线通信 多输入多输出系统 空时编码 分集度 容量
Keywords:
wireless communication MIMO systems space-time codes diversity capacity
分类号:
TN929.5
DOI:
10.3969/j.issn.1001-0505.2005.05.002
摘要:
给出了线性空时码同时能达到最大分集度和信道容量的符号传输率必须满足的条件.提出了一种新的空时分组码设计方法,由该方法设计得到的空时分组码为容量无损满分集度空时码,即它能提供满发送分集度,且含空时码等价信道容量达到MIMO系统容量.证明了许多已发现的容量无损满分集度空时分组码均为该方法的特例.对新得到的分组码的性能进行了仿真,并与其他空时分组码就平均误比特率做了比较,证实了其性能的优越性.
Abstract:
Necessary condition for symbol transmit rate in which maximum diversity and channel capacity of linear space-time code are attained is given and a new systematic space-time block code design framework is proposed. The space-time block code constructed by this design framework is capacity lossless and full-diversity, that is, it can achieve the full transmit diversity and the capacity of the equivalent channel including the space-time code equals the multiple-input multiple-output(MIMO)system capacity. It is proved that the proposed design framework subsumes many of the existing capacity lossless and full-diversity space-time codes. The performance merit of the proposed block code is confirmed by simulation results and compared with other space-time block codes in terms of average bit error probability.

参考文献/References:

[1] Tarokh V, Seshadri N,Calderbank A R.Space-time codes for high data rate wireless communication:performance criterion and code construction [J].IEEE Trans Information Theory,1998,44(3):744-765.
[2] Hassibi B,Hochwald B M.High-rate codes that are linear in space-time [J]. IEEE Trans Information Theory,2002,48(7):1804-1824.
[3] Hottinen A,Tirkkonen O,Wichman R. Multi-antenna transceiver techniques for 3G and beyond [M].New York:John Wiley & Sons Ltd,2003.78-82.
[4] Alamouti S M.A simple transmit diversity technique for wireless communications [J].IEEE Journal on Selected Areas in Communications,1998,16(10):1451-1458.
[5] Tarokh V,Jafarkhani H,Calderbank A R.Space-time block codes from orthogonal designs[J]. IEEE Trans Information Theory,1999,45(7):1456-1467.
[6] Jafarkhani H.A quasi-orthogonal space-time block code [J].IEEE Trans Commun,2001,49(1):1-4.
[7] Tirkkonen O,Hottinen A.Square-matrix embeddable space-time block codes for complex signal constellations[J]. IEEE Trans Information Theory,2002,48(2):384-395.
[8] Damen M O,Abed-Meraim K,Belfiore J.Diagonal algebraic space-time block codes[J]. IEEE Trans Information Theory,2002,48(3):628-636.
[9] Gamal H,Damen M O.Universal space-time coding[J]. IEEE Trans Information Theory,2003,49(5):1097-1119.
[10] Ma X, Giannakis G B.Full-diversity full-rate complex-field space-time coding[J].IEEE Trans Signal Processing,2003,51(11):2917-2930.
[11] Telatar E.Capacity of multiantennas Gaussian channels[R].Murray Hill,NJ:AT&T Bell Laboratories,1995.
[12] Cover T M,Thomas J A.Elements of information theory[M].New York:John Wiley & Sons Ltd,1991.224-239.
[13] Damen M O,Tewfik A,Belfiore J.A construction of a space-time code based on number theory[J]. IEEE Trans Information Theory,2002,48(3):753-760.
[14] Liu Chen,Wu Zhenyang,Zhao Huaan.Diagonal block orthogonal algebraic space-time block codes[J].IEICE Trans Information and Systems,2005,88(7):451-453.
[15] Damen M O,Gamal H,Caire G C.On maximum-likelihood detection and the search for the closest lattice point[J].IEEE Trans Information Theory, 2003,49(10):2389-2402.

备注/Memo

备注/Memo:
作者简介: 刘陈(1963—),男,博士生,教授,lc@njupt.edu.cn; 吴镇扬(联系人),男,教授,博士生导师,zhenyang@seu.edu.cn.
更新日期/Last Update: 2005-09-20