{"title":"一种新的具有低复杂度ML解码的双发射天线信息无损STBC","authors":"P. Rabiei, N. Al-Dhahir","doi":"10.1109/VETECF.2007.171","DOIUrl":null,"url":null,"abstract":"A new information lossless, full-rate space-time block code is presented for 2 transmit antennas over 2 symbol periods. We show that our code is capacity-achieving and exploit its special algebraic structure to derive a reduced-complexity maximum-likelihood (ML) decoding algorithm. When the number of receive antennas is greater than 1, our code outperforms the Alamouti code. Comparing the performance of our code with state-of-the-art B2Phi and Golden codes in [4] and [7], demonstrates competitive performance for practical low-to-medium SNR ranges, for high spectral efficiencies, and as the number of receive antennas increases while requiring much lower ML decoding complexity.","PeriodicalId":261917,"journal":{"name":"2007 IEEE 66th Vehicular Technology Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A New Information Lossless STBC for 2 Transmit Antennas with Reduced-Complexity ML Decoding\",\"authors\":\"P. Rabiei, N. Al-Dhahir\",\"doi\":\"10.1109/VETECF.2007.171\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new information lossless, full-rate space-time block code is presented for 2 transmit antennas over 2 symbol periods. We show that our code is capacity-achieving and exploit its special algebraic structure to derive a reduced-complexity maximum-likelihood (ML) decoding algorithm. When the number of receive antennas is greater than 1, our code outperforms the Alamouti code. Comparing the performance of our code with state-of-the-art B2Phi and Golden codes in [4] and [7], demonstrates competitive performance for practical low-to-medium SNR ranges, for high spectral efficiencies, and as the number of receive antennas increases while requiring much lower ML decoding complexity.\",\"PeriodicalId\":261917,\"journal\":{\"name\":\"2007 IEEE 66th Vehicular Technology Conference\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE 66th Vehicular Technology Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VETECF.2007.171\",\"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 66th Vehicular Technology Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VETECF.2007.171","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Information Lossless STBC for 2 Transmit Antennas with Reduced-Complexity ML Decoding
A new information lossless, full-rate space-time block code is presented for 2 transmit antennas over 2 symbol periods. We show that our code is capacity-achieving and exploit its special algebraic structure to derive a reduced-complexity maximum-likelihood (ML) decoding algorithm. When the number of receive antennas is greater than 1, our code outperforms the Alamouti code. Comparing the performance of our code with state-of-the-art B2Phi and Golden codes in [4] and [7], demonstrates competitive performance for practical low-to-medium SNR ranges, for high spectral efficiencies, and as the number of receive antennas increases while requiring much lower ML decoding complexity.