{"title":"带天线选择的空时分组码的性能边界","authors":"X. Zeng, A. Ghrayeb","doi":"10.1109/ISIT.2004.1365376","DOIUrl":null,"url":null,"abstract":"In this paper, we derive upper bounds on the bit error rate performance of orthogonal space-time block codes (STBCs) with receive antenna selection. We show that the diversity order is maintained as that of the full complexity system, whereas the deterioration in SNR is upper bounded by 10 log10(M/L) dB where M is the number of available receive antennas and L is the number of selected antennas","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Performance bounds for space-time block codes with antenna selection\",\"authors\":\"X. Zeng, A. Ghrayeb\",\"doi\":\"10.1109/ISIT.2004.1365376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we derive upper bounds on the bit error rate performance of orthogonal space-time block codes (STBCs) with receive antenna selection. We show that the diversity order is maintained as that of the full complexity system, whereas the deterioration in SNR is upper bounded by 10 log10(M/L) dB where M is the number of available receive antennas and L is the number of selected antennas\",\"PeriodicalId\":269907,\"journal\":{\"name\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2004.1365376\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2004.1365376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Performance bounds for space-time block codes with antenna selection
In this paper, we derive upper bounds on the bit error rate performance of orthogonal space-time block codes (STBCs) with receive antenna selection. We show that the diversity order is maintained as that of the full complexity system, whereas the deterioration in SNR is upper bounded by 10 log10(M/L) dB where M is the number of available receive antennas and L is the number of selected antennas
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
