衰落信道下时空turbo TCM的设计

Jinhong Yuan, B. Vucetic, Zhuo Chen, W. Firmanto
{"title":"衰落信道下时空turbo TCM的设计","authors":"Jinhong Yuan, B. Vucetic, Zhuo Chen, W. Firmanto","doi":"10.1109/ITW.2001.955158","DOIUrl":null,"url":null,"abstract":"Novel code design criteria for space-time codes on slow Rayleigh fading channels are presented. It is shown that the code performance is dominated by the minimum rank r and the minimum determinant of the codeword distance matrix when the product of the minimum rank r and the number of receive antennas n/sub R/ is less than 4. However, when r/spl middot/n/sub R/ is greater than or equal to 4, the code error performance is dominated by the minimum trace of the codeword distance matrix. Furthermore, we present recursive spacetime trellis coded modulation (STTC) which outperforms feedforward STTC on slow and fast fading channels. A substantial increase in performance can be obtained by constructing spacetime turbo trellis coded modulation (ST turbo TCM) which consists of concatenated recursive STTC, decoded by iterative decoding algorithm. The proposed recursive STTC are used as constituent codes in this scheme. The proposed ST turbo TCM significantly outperforms the best known STTC on both slow and fast fading channels.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Design of space-time turbo TCM on fading channels\",\"authors\":\"Jinhong Yuan, B. Vucetic, Zhuo Chen, W. Firmanto\",\"doi\":\"10.1109/ITW.2001.955158\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Novel code design criteria for space-time codes on slow Rayleigh fading channels are presented. It is shown that the code performance is dominated by the minimum rank r and the minimum determinant of the codeword distance matrix when the product of the minimum rank r and the number of receive antennas n/sub R/ is less than 4. However, when r/spl middot/n/sub R/ is greater than or equal to 4, the code error performance is dominated by the minimum trace of the codeword distance matrix. Furthermore, we present recursive spacetime trellis coded modulation (STTC) which outperforms feedforward STTC on slow and fast fading channels. A substantial increase in performance can be obtained by constructing spacetime turbo trellis coded modulation (ST turbo TCM) which consists of concatenated recursive STTC, decoded by iterative decoding algorithm. The proposed recursive STTC are used as constituent codes in this scheme. The proposed ST turbo TCM significantly outperforms the best known STTC on both slow and fast fading channels.\",\"PeriodicalId\":288814,\"journal\":{\"name\":\"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2001.955158\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2001.955158","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

提出了一种新的慢瑞利衰落信道空时码设计准则。结果表明,当最小秩r与接收天线数n/sub r /的乘积小于4时,编码性能受最小秩r和码字距离矩阵的最小行列式的支配。然而,当r/spl中点/n/下标r/大于等于4时,码字距离矩阵的最小迹线主导码错性能。此外,我们提出了递归时空网格编码调制(STTC),它在慢速和快速衰落信道上优于前馈STTC。通过构建由串联递归STTC组成的时空turbo栅格编码调制(ST turbo TCM),采用迭代译码算法进行解码,可以大幅提高性能。在该方案中,采用所提出的递归STTC作为组成码。所提出的ST turbo TCM在慢速和快速衰落信道上都明显优于最著名的STTC。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Design of space-time turbo TCM on fading channels
Novel code design criteria for space-time codes on slow Rayleigh fading channels are presented. It is shown that the code performance is dominated by the minimum rank r and the minimum determinant of the codeword distance matrix when the product of the minimum rank r and the number of receive antennas n/sub R/ is less than 4. However, when r/spl middot/n/sub R/ is greater than or equal to 4, the code error performance is dominated by the minimum trace of the codeword distance matrix. Furthermore, we present recursive spacetime trellis coded modulation (STTC) which outperforms feedforward STTC on slow and fast fading channels. A substantial increase in performance can be obtained by constructing spacetime turbo trellis coded modulation (ST turbo TCM) which consists of concatenated recursive STTC, decoded by iterative decoding algorithm. The proposed recursive STTC are used as constituent codes in this scheme. The proposed ST turbo TCM significantly outperforms the best known STTC on both slow and fast fading channels.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impact of multiple access on uplink scheduling Using the mean reliability as a design and stopping criterion for turbo codes "Codes" on images and iterative phase unwrapping The advantages of non-binary turbo codes Analog decoding of product codes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1