Blind estimation of scrambler offset using encoder redundancy
A self-recovering receiver for encoded and scrambled binary data streams is proposed in this paper. The generating polynomial of the scrambling sequence is known, as well as the encoder structure and coefficients, but the scrambler time offset is unknown. Taking profit of redundancy introduced by th...
Saved in:
Published in | Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002 Vol. 1; pp. 626 - 630 vol.1 |
---|---|
Main Authors | , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
2002
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A self-recovering receiver for encoded and scrambled binary data streams is proposed in this paper. The generating polynomial of the scrambling sequence is known, as well as the encoder structure and coefficients, but the scrambler time offset is unknown. Taking profit of redundancy introduced by the encoder, we proposed a method which is able to estimate the scrambling sequence offset from the observed scrambled stream. The method is based on the projection of the observed data on the encoder orthogonal subspace. Once the offset has been estimated, classical data descrambling and decoding can be used to recover the information stream. |
---|---|
ISBN: | 0780375769 9780780375765 |
ISSN: | 1058-6393 2576-2303 |
DOI: | 10.1109/ACSSC.2002.1197256 |