Abstract
In the frame synchronous scrambling (FSS), the input data bitstream is scrambled by adding a pseudo-random binary sequence (PRBS) to this, and the scrambled data bitstream is descrambled by adding the same PRBS to this. In this chapter, we examine the behaviors of PRBSs in view of the sequence space theory developed in Chapter 4, and consider how to realize SRGs that generate PRBSs based on the SRG theory developed in Chapter 5. We will first define PRBS systematically using the mathematical definitions of weight, run and autocorrelation of sequences. Then, we will consider a special class of sequence spaces, namely the primitive sequence spaces, whose characteristic polynomials are primitive, showing that the sequences in the primitive sequence spaces are PRBSs. Finally, we will consider how to realize SRGs that generate PRBSs in the primitive sequence spaces.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag London Limited
About this chapter
Cite this chapter
Gi Lee, B., Kim, S.C. (1994). Serial Frame Synchronous Scrambling. In: Scrambling Techniques for Digital Transmission. Telecommunication Networks and Computer Systems. Springer, London. https://doi.org/10.1007/978-1-4471-3231-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3231-8_6
Publisher Name: Springer, London
Print ISBN: 978-1-4471-3233-2
Online ISBN: 978-1-4471-3231-8
eBook Packages: Springer Book Archive