最小冗余最大鲁棒线性预编码器

J. Manton
{"title":"最小冗余最大鲁棒线性预编码器","authors":"J. Manton","doi":"10.1109/IDC.2002.995404","DOIUrl":null,"url":null,"abstract":"Precoding data prior to its transmission over a fading channel can improve performance. When the channel is unknown, it may be desirable to use a linear precoder whose worst case performance is no worse than that of any other linear precoder. Such a precoder is said to be maximally robust. This paper derives necessary and sufficient conditions for a linear precoder to be maximally robust. It is proved that maximally robust linear precoders eliminate fading completely. Also derived is an explicit expression for a maximally robust linear precoder which introduces the least amount of redundancy possible.","PeriodicalId":385351,"journal":{"name":"Final Program and Abstracts on Information, Decision and Control","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimally redundant maximally robust linear precoders\",\"authors\":\"J. Manton\",\"doi\":\"10.1109/IDC.2002.995404\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Precoding data prior to its transmission over a fading channel can improve performance. When the channel is unknown, it may be desirable to use a linear precoder whose worst case performance is no worse than that of any other linear precoder. Such a precoder is said to be maximally robust. This paper derives necessary and sufficient conditions for a linear precoder to be maximally robust. It is proved that maximally robust linear precoders eliminate fading completely. Also derived is an explicit expression for a maximally robust linear precoder which introduces the least amount of redundancy possible.\",\"PeriodicalId\":385351,\"journal\":{\"name\":\"Final Program and Abstracts on Information, Decision and Control\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Final Program and Abstracts on Information, Decision and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IDC.2002.995404\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Final Program and Abstracts on Information, Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IDC.2002.995404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在数据通过衰落信道传输之前对其进行预编码可以提高性能。当信道未知时,可能希望使用线性预编码器,其最坏情况性能不低于任何其他线性预编码器。这样的预编码器被认为是最大鲁棒的。本文导出了线性预编码器具有最大鲁棒性的充分必要条件。证明了最大鲁棒线性预编码器完全消除了衰落。还推导了一个显式表达式,用于最大鲁棒线性预编码器,它引入了尽可能少的冗余。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Minimally redundant maximally robust linear precoders
Precoding data prior to its transmission over a fading channel can improve performance. When the channel is unknown, it may be desirable to use a linear precoder whose worst case performance is no worse than that of any other linear precoder. Such a precoder is said to be maximally robust. This paper derives necessary and sufficient conditions for a linear precoder to be maximally robust. It is proved that maximally robust linear precoders eliminate fading completely. Also derived is an explicit expression for a maximally robust linear precoder which introduces the least amount of redundancy possible.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信