Full-diversity group space-time-frequency (GSTF) codes from cyclic codes

U. Sripati, B. Rajan, V. Shashidhar
{"title":"Full-diversity group space-time-frequency (GSTF) codes from cyclic codes","authors":"U. Sripati, B. Rajan, V. Shashidhar","doi":"10.1109/ISIT.2005.1523712","DOIUrl":null,"url":null,"abstract":"It is known that multi-antenna transmissions over frequency-selective channels can provide a diversity gain that is product of the number of transmit antennas, the receive antennas and the length of the channel impulse response. Liu, Xin and Giannakis have studied multi-antenna orthogonal frequency division multiplexing (OFDM) through frequency-selective Rayleigh-fading channels and have introduced the concept of space-time frequency (STF) coding to enable maximum diversity and high coding gains. It is known that under some conditions, an n-length cyclic code C over Fqm (n|qm - 1, and m les n) can have fullrank i.e Rankq(C) = m. Designs for space-time codes suitable for both quasi-static fading channels and block-fading channels have been derived from n length cyclic codes over Fqm. In this paper, we present a simplified design of STF codes using designs derived from cyclic codes to obtain group space-time-frequency (GSTF) codes for frequency selective Rayleigh fading channels. These codes achieve maximum diversity gain","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523712","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

It is known that multi-antenna transmissions over frequency-selective channels can provide a diversity gain that is product of the number of transmit antennas, the receive antennas and the length of the channel impulse response. Liu, Xin and Giannakis have studied multi-antenna orthogonal frequency division multiplexing (OFDM) through frequency-selective Rayleigh-fading channels and have introduced the concept of space-time frequency (STF) coding to enable maximum diversity and high coding gains. It is known that under some conditions, an n-length cyclic code C over Fqm (n|qm - 1, and m les n) can have fullrank i.e Rankq(C) = m. Designs for space-time codes suitable for both quasi-static fading channels and block-fading channels have been derived from n length cyclic codes over Fqm. In this paper, we present a simplified design of STF codes using designs derived from cyclic codes to obtain group space-time-frequency (GSTF) codes for frequency selective Rayleigh fading channels. These codes achieve maximum diversity gain
全分集群空时频(GSTF)码从循环码
众所周知,在频率选择信道上的多天线传输可以提供分集增益,该分集增益是发射天线数量、接收天线数量和信道脉冲响应长度的乘积。Liu, Xin和Giannakis通过频率选择瑞利衰落信道研究了多天线正交频分复用(OFDM),并引入了时空频率(STF)编码的概念,以实现最大的分集和高编码增益。已知在某些条件下,Fqm上的n长循环码C (n|qm - 1, m les n)可以具有全秩,即Rankq(C) = m。基于Fqm上的n长循环码,已经设计出适合准静态衰落信道和块衰落信道的空时码。在本文中,我们提出了一种简化的STF码设计,使用循环码的设计来获得频率选择性瑞利衰落信道的群空时频(GSTF)码。这些码实现了最大的分集增益
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信