loading...
Fast and Blind Restoration Scheme for the Initial States of LFSRs
Hangzhou, Zhejiang, China June 20-June 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IMSCCS.2006.622006 First International Multi-Sympos ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Xiangyang Luo, Information Engineering University, China
Ping Wang, Information Engineering University, China
Peizhong Lu, Information Engineering University, China
Fenlin Liu, Information Engineering University, China
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.
Citation:
Xiangyang Luo, Ping Wang, Peizhong Lu, Fenlin Liu, "Fast and Blind Restoration Scheme for the Initial States of LFSRs," imsccs, vol. 1, pp.192-198, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006
Usage of this product signifies your acceptance of the Terms of Use.