{"title":"面向空时块编码空间置换调制(STBC-SPM)的低复杂度最大似然解码器","authors":"Hsu-Hsuan Tu, C. Lee, I-Wei Lai","doi":"10.1109/ISPACS48206.2019.8986394","DOIUrl":null,"url":null,"abstract":"Space-time block coded spatial permutation modulation (STBC-SPM) is a new MIMO technique that integraes the STBC-spatial modulation (STBC-SM) and the recently-proposed spatial permutation modulation (SPM). Specifically, SPM exploits the permutation vector to achieve diversity gain by dispersing the signal along the time coordinate. In this work, we examine the STBC-SPM in more details and propose a low-complexity decoder for STBC-SPM by utilizing the orthogonality of the STBC Alamouti code. The numerical simulations demonstrate the superior performance of the STBC-SPM from various aspects. Moreover, the proposed decoder structure achieves up to 90.6% ~99. 9 % complexity saving without sacrificing the error rate performance, compared with the optimal maximum likelihood (ML) decoder implemented by the exhaustive search.","PeriodicalId":6765,"journal":{"name":"2019 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"37 1","pages":"1-2"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Low-Complexity Maximum Likelihood (ML) Decoder for Space-Time Block Coded Spatial Permutation Modulation (STBC-SPM)\",\"authors\":\"Hsu-Hsuan Tu, C. Lee, I-Wei Lai\",\"doi\":\"10.1109/ISPACS48206.2019.8986394\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Space-time block coded spatial permutation modulation (STBC-SPM) is a new MIMO technique that integraes the STBC-spatial modulation (STBC-SM) and the recently-proposed spatial permutation modulation (SPM). Specifically, SPM exploits the permutation vector to achieve diversity gain by dispersing the signal along the time coordinate. In this work, we examine the STBC-SPM in more details and propose a low-complexity decoder for STBC-SPM by utilizing the orthogonality of the STBC Alamouti code. The numerical simulations demonstrate the superior performance of the STBC-SPM from various aspects. Moreover, the proposed decoder structure achieves up to 90.6% ~99. 9 % complexity saving without sacrificing the error rate performance, compared with the optimal maximum likelihood (ML) decoder implemented by the exhaustive search.\",\"PeriodicalId\":6765,\"journal\":{\"name\":\"2019 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)\",\"volume\":\"37 1\",\"pages\":\"1-2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPACS48206.2019.8986394\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPACS48206.2019.8986394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Low-Complexity Maximum Likelihood (ML) Decoder for Space-Time Block Coded Spatial Permutation Modulation (STBC-SPM)
Space-time block coded spatial permutation modulation (STBC-SPM) is a new MIMO technique that integraes the STBC-spatial modulation (STBC-SM) and the recently-proposed spatial permutation modulation (SPM). Specifically, SPM exploits the permutation vector to achieve diversity gain by dispersing the signal along the time coordinate. In this work, we examine the STBC-SPM in more details and propose a low-complexity decoder for STBC-SPM by utilizing the orthogonality of the STBC Alamouti code. The numerical simulations demonstrate the superior performance of the STBC-SPM from various aspects. Moreover, the proposed decoder structure achieves up to 90.6% ~99. 9 % complexity saving without sacrificing the error rate performance, compared with the optimal maximum likelihood (ML) decoder implemented by the exhaustive search.