{"title":"编码V-BLAST的最优检测排序","authors":"Alain U. Toboso, S. Loyka, F. Gagnon","doi":"10.1109/cwit.2013.6621587","DOIUrl":null,"url":null,"abstract":"Optimum ordering strategies for the coded V-BLAST with capacity achieving temporal codes on each stream are analytically studied in this paper, including optimal power and/or rate allocations among data streams. A compact closed-form solution is obtained for the case of two transmit antennas and necessary optimality conditions are found for the general case. The optimal rate allocation is shown to have a major impact (stronger streams are detected last) while the optimal power allocation does not alter the original Foschini ordering (stronger streams are detected first). A sub-optimal ordering is proposed based on the necessary optimality conditions, which performs very close to the optimal one but has much smaller computational complexity. An SNR gain of ordering is introduced and studied. All the results also apply to a multiple-access channel under successive interference cancelation.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"On optimal detection ordering for coded V-BLAST\",\"authors\":\"Alain U. Toboso, S. Loyka, F. Gagnon\",\"doi\":\"10.1109/cwit.2013.6621587\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimum ordering strategies for the coded V-BLAST with capacity achieving temporal codes on each stream are analytically studied in this paper, including optimal power and/or rate allocations among data streams. A compact closed-form solution is obtained for the case of two transmit antennas and necessary optimality conditions are found for the general case. The optimal rate allocation is shown to have a major impact (stronger streams are detected last) while the optimal power allocation does not alter the original Foschini ordering (stronger streams are detected first). A sub-optimal ordering is proposed based on the necessary optimality conditions, which performs very close to the optimal one but has much smaller computational complexity. An SNR gain of ordering is introduced and studied. All the results also apply to a multiple-access channel under successive interference cancelation.\",\"PeriodicalId\":398936,\"journal\":{\"name\":\"2013 13th Canadian Workshop on Information Theory\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 13th Canadian Workshop on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/cwit.2013.6621587\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 13th Canadian Workshop on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/cwit.2013.6621587","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimum ordering strategies for the coded V-BLAST with capacity achieving temporal codes on each stream are analytically studied in this paper, including optimal power and/or rate allocations among data streams. A compact closed-form solution is obtained for the case of two transmit antennas and necessary optimality conditions are found for the general case. The optimal rate allocation is shown to have a major impact (stronger streams are detected last) while the optimal power allocation does not alter the original Foschini ordering (stronger streams are detected first). A sub-optimal ordering is proposed based on the necessary optimality conditions, which performs very close to the optimal one but has much smaller computational complexity. An SNR gain of ordering is introduced and studied. All the results also apply to a multiple-access channel under successive interference cancelation.