实现分集-复用折衷的多块空时码的低复杂度结构

Hsiao-feng Lu
{"title":"实现分集-复用折衷的多块空时码的低复杂度结构","authors":"Hsiao-feng Lu","doi":"10.1109/GLOCOM.2007.332","DOIUrl":null,"url":null,"abstract":"A construction of low complexity multi-block space- time codes that is optimal with respect to the diversity- multiplexing tradeoff (DMT) when the coding is applied over any number of independent fading blocks is presented in this paper. Specifically, for a MIMO system over a quasi-static Rayleigh block fading channel with quasi-static interval T, the present construction requires a number field that is cyclic Galois over Q(i) of degree only T, while the previously known construction requires a number field of degree mT, where m is the number of coded fading blocks. Thus, the present construction provides a great reduction on both the encoding and decoding complexities of multi-block space-time codes comparing to earlier constructions, and it achieves complexity at the same level as that of the conventional DMT-optimal single block space-time codes.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Low Complexity Constructions of Multi-Block Space-Time Codes Achieving Diversity-Multiplexing Tradeoff\",\"authors\":\"Hsiao-feng Lu\",\"doi\":\"10.1109/GLOCOM.2007.332\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A construction of low complexity multi-block space- time codes that is optimal with respect to the diversity- multiplexing tradeoff (DMT) when the coding is applied over any number of independent fading blocks is presented in this paper. Specifically, for a MIMO system over a quasi-static Rayleigh block fading channel with quasi-static interval T, the present construction requires a number field that is cyclic Galois over Q(i) of degree only T, while the previously known construction requires a number field of degree mT, where m is the number of coded fading blocks. Thus, the present construction provides a great reduction on both the encoding and decoding complexities of multi-block space-time codes comparing to earlier constructions, and it achieves complexity at the same level as that of the conventional DMT-optimal single block space-time codes.\",\"PeriodicalId\":370937,\"journal\":{\"name\":\"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2007.332\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2007.332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种低复杂度的多块空时码结构,当编码应用于任意数量的独立衰落块时,该结构在分集-复用权衡(DMT)方面是最优的。具体而言,对于拟静态区间为T的准静态瑞利块衰落信道上的MIMO系统,目前的构造需要一个仅为T次的Q(i)上的循环伽罗瓦数域,而先前已知的构造需要一个mT次的数域,其中m为编码衰落块的个数。因此,与以前的结构相比,本结构大大降低了多块空时码的编码和解码复杂性,并达到了与传统dmt最优单块空时码相同的复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Low Complexity Constructions of Multi-Block Space-Time Codes Achieving Diversity-Multiplexing Tradeoff
A construction of low complexity multi-block space- time codes that is optimal with respect to the diversity- multiplexing tradeoff (DMT) when the coding is applied over any number of independent fading blocks is presented in this paper. Specifically, for a MIMO system over a quasi-static Rayleigh block fading channel with quasi-static interval T, the present construction requires a number field that is cyclic Galois over Q(i) of degree only T, while the previously known construction requires a number field of degree mT, where m is the number of coded fading blocks. Thus, the present construction provides a great reduction on both the encoding and decoding complexities of multi-block space-time codes comparing to earlier constructions, and it achieves complexity at the same level as that of the conventional DMT-optimal single block space-time codes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信