构造时空编码的最优除法代数

R. Vehkalahti
{"title":"构造时空编码的最优除法代数","authors":"R. Vehkalahti","doi":"10.1109/ITWITWN.2007.4318042","DOIUrl":null,"url":null,"abstract":"In [1] the authors suggested that in order to derive energy efficient space-time MIMO codes from orders of the division algebras one should use maximal orders instead of natural ones. They also described the division algebras that have the best maximal orders in terms of minimum determinant vs. average power. However, they were able to construct division algebras that were optimal only in few separate cases. In this paper we are addressing this problem and giving an explicit construction for optimal division algebras of arbitrary degree in the case when the center is Q(i). We note that all the results of this paper can be found from [2]. The goal of this paper is to give a simple representation of construction methods of [2].","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Constructing Optimal Division Algebras for Space-Time Coding\",\"authors\":\"R. Vehkalahti\",\"doi\":\"10.1109/ITWITWN.2007.4318042\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In [1] the authors suggested that in order to derive energy efficient space-time MIMO codes from orders of the division algebras one should use maximal orders instead of natural ones. They also described the division algebras that have the best maximal orders in terms of minimum determinant vs. average power. However, they were able to construct division algebras that were optimal only in few separate cases. In this paper we are addressing this problem and giving an explicit construction for optimal division algebras of arbitrary degree in the case when the center is Q(i). We note that all the results of this paper can be found from [2]. The goal of this paper is to give a simple representation of construction methods of [2].\",\"PeriodicalId\":257392,\"journal\":{\"name\":\"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITWITWN.2007.4318042\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITWITWN.2007.4318042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在[1]中,作者提出,为了从除法代数的阶数推导出节能的空时MIMO码,应该使用最大阶数而不是自然阶数。他们还描述了在最小行列式和平均幂方面具有最佳最大阶的除法代数。然而,他们能够构造的除法代数只在少数个别情况下是最优的。本文讨论了这一问题,并给出了中心为Q(i)时任意次最优除法代数的一个显式构造。我们注意到本文的所有结果都可以从[2]中找到。本文的目标是给出[2]的构造方法的简单表示。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Constructing Optimal Division Algebras for Space-Time Coding
In [1] the authors suggested that in order to derive energy efficient space-time MIMO codes from orders of the division algebras one should use maximal orders instead of natural ones. They also described the division algebras that have the best maximal orders in terms of minimum determinant vs. average power. However, they were able to construct division algebras that were optimal only in few separate cases. In this paper we are addressing this problem and giving an explicit construction for optimal division algebras of arbitrary degree in the case when the center is Q(i). We note that all the results of this paper can be found from [2]. The goal of this paper is to give a simple representation of construction methods of [2].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信