{"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}
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.