{"title":"lfsr初始状态的快速盲恢复方案","authors":"Xiangyang Luo, Ping Wang, Peizhong Lu, Fenlin Liu","doi":"10.1109/IMSCCS.2006.62","DOIUrl":null,"url":null,"abstract":"A fast and blind restoration scheme for LFSR (linear feedback shift register) sequences with high error ratio is proposed. This scheme combines searching-offline and decoding-online to restore the initial state of a LFSR sequence. During the restoring process, two key steps are included: one is to quickly find as many parity-check equations as possible to construct the convolutional code with low rate and high correcting capability, and the other is to decode the convolutional codes based on the improved Viterbi algorithm","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast and Blind Restoration Scheme for the Initial States of LFSRs\",\"authors\":\"Xiangyang Luo, Ping Wang, Peizhong Lu, Fenlin Liu\",\"doi\":\"10.1109/IMSCCS.2006.62\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A fast and blind restoration scheme for LFSR (linear feedback shift register) sequences with high error ratio is proposed. This scheme combines searching-offline and decoding-online to restore the initial state of a LFSR sequence. During the restoring process, two key steps are included: one is to quickly find as many parity-check equations as possible to construct the convolutional code with low rate and high correcting capability, and the other is to decode the convolutional codes based on the improved Viterbi algorithm\",\"PeriodicalId\":202629,\"journal\":{\"name\":\"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMSCCS.2006.62\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMSCCS.2006.62","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast and Blind Restoration Scheme for the Initial States of LFSRs
A fast and blind restoration scheme for LFSR (linear feedback shift register) sequences with high error ratio is proposed. This scheme combines searching-offline and decoding-online to restore the initial state of a LFSR sequence. During the restoring process, two key steps are included: one is to quickly find as many parity-check equations as possible to construct the convolutional code with low rate and high correcting capability, and the other is to decode the convolutional codes based on the improved Viterbi algorithm