{"title":"基于非相干PPM的超低功耗通信的类瓦格纳解码","authors":"Peng Zhang, F. Willems, Li Huang","doi":"10.1109/PIMRC.2013.6666271","DOIUrl":null,"url":null,"abstract":"Noncoherent pulse-position modulation (PPM) with simple channel codes has the potential to realize ultra-low power (ULP) wireless design. In this paper, we develop a Wagnerlike decoding rule for single-parity-check and high-rate Reed-Solomon (RS) coded PPM schemes by simply `flipping' the most unreliable received PPM symbol(s) to obtain a good balance between performance and coding complexity. The proposed algorithm can be considered as a list decoding algorithm that first generates a candidate codeword list based on the algebraic structure of the code before applying soft decisions to decode. This approach can result in more power-efficient realizations of the studied schemes. It is shown that our decoding approach can achieve near maximum likelihood decoding performance based on the trellis, while having a significantly lower decoding complexity. In addition, by exploiting the inherent advantage of PPM transmission, it is possible to reduce the candidate list to further simplify the decoding for RS-coded PPM without losing coding gain. This makes the proposed scheme more attractive for ULP communications.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"196 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Wagner-like decoding for noncoherent PPM based ultra-low-power communications\",\"authors\":\"Peng Zhang, F. Willems, Li Huang\",\"doi\":\"10.1109/PIMRC.2013.6666271\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Noncoherent pulse-position modulation (PPM) with simple channel codes has the potential to realize ultra-low power (ULP) wireless design. In this paper, we develop a Wagnerlike decoding rule for single-parity-check and high-rate Reed-Solomon (RS) coded PPM schemes by simply `flipping' the most unreliable received PPM symbol(s) to obtain a good balance between performance and coding complexity. The proposed algorithm can be considered as a list decoding algorithm that first generates a candidate codeword list based on the algebraic structure of the code before applying soft decisions to decode. This approach can result in more power-efficient realizations of the studied schemes. It is shown that our decoding approach can achieve near maximum likelihood decoding performance based on the trellis, while having a significantly lower decoding complexity. In addition, by exploiting the inherent advantage of PPM transmission, it is possible to reduce the candidate list to further simplify the decoding for RS-coded PPM without losing coding gain. This makes the proposed scheme more attractive for ULP communications.\",\"PeriodicalId\":210993,\"journal\":{\"name\":\"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"volume\":\"196 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2013.6666271\",\"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 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2013.6666271","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Wagner-like decoding for noncoherent PPM based ultra-low-power communications
Noncoherent pulse-position modulation (PPM) with simple channel codes has the potential to realize ultra-low power (ULP) wireless design. In this paper, we develop a Wagnerlike decoding rule for single-parity-check and high-rate Reed-Solomon (RS) coded PPM schemes by simply `flipping' the most unreliable received PPM symbol(s) to obtain a good balance between performance and coding complexity. The proposed algorithm can be considered as a list decoding algorithm that first generates a candidate codeword list based on the algebraic structure of the code before applying soft decisions to decode. This approach can result in more power-efficient realizations of the studied schemes. It is shown that our decoding approach can achieve near maximum likelihood decoding performance based on the trellis, while having a significantly lower decoding complexity. In addition, by exploiting the inherent advantage of PPM transmission, it is possible to reduce the candidate list to further simplify the decoding for RS-coded PPM without losing coding gain. This makes the proposed scheme more attractive for ULP communications.