高级搜索

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

一种复正交空时分组编码矩阵的设计方法

周立刚 苗建松 李新 丁炜

周立刚, 苗建松, 李新, 丁炜. 一种复正交空时分组编码矩阵的设计方法[J]. 电子与信息学报, 2007, 29(10): 2422-2425. doi: 10.3724/SP.J.1146.2006.00311
引用本文: 周立刚, 苗建松, 李新, 丁炜. 一种复正交空时分组编码矩阵的设计方法[J]. 电子与信息学报, 2007, 29(10): 2422-2425. doi: 10.3724/SP.J.1146.2006.00311
Zhou Li-gang, Miao Jian-song, Li Xin, Ding Wei. A Design Method of Complex Orthogonal Space-Time Block Code Matrix[J]. Journal of Electronics & Information Technology, 2007, 29(10): 2422-2425. doi: 10.3724/SP.J.1146.2006.00311
Citation: Zhou Li-gang, Miao Jian-song, Li Xin, Ding Wei. A Design Method of Complex Orthogonal Space-Time Block Code Matrix[J]. Journal of Electronics & Information Technology, 2007, 29(10): 2422-2425. doi: 10.3724/SP.J.1146.2006.00311

一种复正交空时分组编码矩阵的设计方法

doi: 10.3724/SP.J.1146.2006.00311
基金项目: 

国家自然科学基金(60372101)资助课题

A Design Method of Complex Orthogonal Space-Time Block Code Matrix

  • 摘要: 为了获得高码率低时延的多天线复正交空时分组编码矩阵,该文提出了一种未对信号进行线性处理的复正交空时分组编码矩阵的迭代式设计方法。利用该矩阵良好的正交性发射的信号,在接受端可以通过简单的最大似然解码算法来准确还原。借助计算机的帮助,得到该方法设计的多天线复正交空时分组编码矩阵的数据,与其他设计方法得到的复正交空时分组编码矩阵的数据进行了比较,结果显示该矩阵在最大码率和最小解码时延上封闭。
  • Alamouti S. A simple transmit diversity technique for wireless communication [J].IEEE J. Select. Areas Communications.1998, 16(8):1451-1458[2]Tarokh V, Seshadri N, and Cclderbank A R. Space-time codes for high data rate wireless communications: performance criterion and code construction [J].IEEE Trans. on Inform. Theory.1998, 44(3):744-765[3]Liang X B and Xia X G. On the nonexistence of rate-one generalized complex orthogonal designs [J].IEEE Trans.on Inform. Theory.2003, 49(11):2984-2989[4]Wang H and Xia X G. Upper bounds of rates of space-time block codes from complex orthogonal designs [J].IEEE Trans. on Inform. Theory.2003, 49(10):2788-2796[5]Liang X B. Orthogonal designs with maximal rates [J].IEEE Trans. on Inform. Theory.2003, 49(10):2468-2503[6]Su W, Xia X G, and Lu K J. A systemntic design of high-rate complex orthogonal space-time block codes[J] IEEE Commun. Lett, 2004, 8(6): 380-382.[7]Kan H and Shen H. A counter example for the conjecture on the minimal delays of orthogonal design with maximal rates [J].IEEE Trans. on Inform. Theory.2005, 51(1):355-359[8]Liang X B. A Complex orthogonal space-time block code for 8 transmit antennas [J].IEEE Commun. Lett.2005, 9(2):115-117[9]Lu K .J, Fu S L, and Xia X CClosed-form designs of complex orthogonal space-time block codes of rates (k+1)/(2k) for 2k-1 or 2k transmit antennas[J].. IEEE Trans. on Inform. Thcory.2005, 51(12):4340-4347[10]Zhou L G, Sun D D, Li X, Miao J S, and Ding W. Prove the minimal delays of complex orthogonal space-time block codes by Hadamard matrix [J].The Journal of China Universities of Posts and Tclecommunications.2006, 13(1):25-28
  • 加载中
计量
  • 文章访问数:  3473
  • HTML全文浏览量:  101
  • PDF下载量:  655
  • 被引次数: 0
出版历程
  • 收稿日期:  2006-03-20
  • 修回日期:  2006-06-19
  • 刊出日期:  2007-10-19

目录

    /

    返回文章
    返回