Fast Recovery of Interfered Scrambling Code Sequence
Chunwu Liu · Acta Armamentarii · 2009
The fast recovery of interfered scrambling code sequence was inguired into.A method based on the Walsh-Hadamard transformation to solve the scrambler generator polynomial was proposed,which improved the exhausted method.The initial state of the sequence was recovered with the algorithm A of fast correlation attack. With a different way of parity-check construction,the algorithm A was improved.The new algorithm is no longer restricted by the number of scrambler generator polynomial's tap,and its original advantage of low compute complexity and easy implement are retained.