{"title":"Viterbi-like解码的排列码再同步","authors":"Ling Cheng, T. Swart, H. C. Ferreira","doi":"10.1109/ISPLC.2009.4913400","DOIUrl":null,"url":null,"abstract":"In this paper, we present a fast re-synchronization algorithm for permutation coded sequences. The new algorithm combines the dynamic algorithm and a Viterbi-like decoding algorithm for trellis codes. The new algorithm has a polynomial time complexity O(N), where N denotes the length of the sequence. A possible application to M-ary FSK for the CENELEC A band power-line communications (PLC) is considered.","PeriodicalId":321296,"journal":{"name":"2009 IEEE International Symposium on Power Line Communications and Its Applications","volume":"35 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Re-synchronization of permutation codes with Viterbi-like decoding\",\"authors\":\"Ling Cheng, T. Swart, H. C. Ferreira\",\"doi\":\"10.1109/ISPLC.2009.4913400\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a fast re-synchronization algorithm for permutation coded sequences. The new algorithm combines the dynamic algorithm and a Viterbi-like decoding algorithm for trellis codes. The new algorithm has a polynomial time complexity O(N), where N denotes the length of the sequence. A possible application to M-ary FSK for the CENELEC A band power-line communications (PLC) is considered.\",\"PeriodicalId\":321296,\"journal\":{\"name\":\"2009 IEEE International Symposium on Power Line Communications and Its Applications\",\"volume\":\"35 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Power Line Communications and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPLC.2009.4913400\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Power Line Communications and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPLC.2009.4913400","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Re-synchronization of permutation codes with Viterbi-like decoding
In this paper, we present a fast re-synchronization algorithm for permutation coded sequences. The new algorithm combines the dynamic algorithm and a Viterbi-like decoding algorithm for trellis codes. The new algorithm has a polynomial time complexity O(N), where N denotes the length of the sequence. A possible application to M-ary FSK for the CENELEC A band power-line communications (PLC) is considered.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
