{"title":"基于改进欧几里得算法的1/2卷积码盲识别方法","authors":"Hui Xie, Xian-ming Chai, Fenghua Wang, Zhitao Huang","doi":"10.1109/ICOSP.2012.6491816","DOIUrl":null,"url":null,"abstract":"In order to adapt the characteristic that the intercepted code sequence is not complete, the polynomial model in [6] has been amended. Based on the model, a scheme is proposed to improve the capability of classical Euclidean algorithm, and a new method for blind identification of rate 1/2 convolutional code is proposed. The validity of algorithm is verified by the simulation results, and it has less computational load compared to the references.","PeriodicalId":143331,"journal":{"name":"2012 IEEE 11th International Conference on Signal Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A method for blind identification of rate 1/2 convolutional code based on improved Euclidean algorithm\",\"authors\":\"Hui Xie, Xian-ming Chai, Fenghua Wang, Zhitao Huang\",\"doi\":\"10.1109/ICOSP.2012.6491816\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to adapt the characteristic that the intercepted code sequence is not complete, the polynomial model in [6] has been amended. Based on the model, a scheme is proposed to improve the capability of classical Euclidean algorithm, and a new method for blind identification of rate 1/2 convolutional code is proposed. The validity of algorithm is verified by the simulation results, and it has less computational load compared to the references.\",\"PeriodicalId\":143331,\"journal\":{\"name\":\"2012 IEEE 11th International Conference on Signal Processing\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE 11th International Conference on Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOSP.2012.6491816\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 11th International Conference on Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOSP.2012.6491816","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A method for blind identification of rate 1/2 convolutional code based on improved Euclidean algorithm
In order to adapt the characteristic that the intercepted code sequence is not complete, the polynomial model in [6] has been amended. Based on the model, a scheme is proposed to improve the capability of classical Euclidean algorithm, and a new method for blind identification of rate 1/2 convolutional code is proposed. The validity of algorithm is verified by the simulation results, and it has less computational load compared to the references.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
