Abstract
In the parallel frame synchronous scrambling (PFSS), the parallel input data bitstreams are scrambled before multiplexing, and the scrambled data bitstream is descrambled after demultiplexing. In this chapter, we discuss the behaviors of parallel scrambling sequences for use in the parallel scrambling in view of the sequence space theory developed in Chapter 4, and consider how to realize SRGs generating parallel scrambling sequences using the SRG theory developed in Chapter 5. We will first show that the parallel scrambling sequences are the decimated sequences of the serial scrambling sequence. Then, we will discuss how to decompose the serial sequence into a linear sum of the so-called irreducible sequence and power sequence, and consider how to determine the decimated sequences of the irreducible and power sequences. We will also examine how to obtain the decimated sequences of the original serial sequences decomposed into the irreducible and power sequences. Finally, we will discuss how to realize parallel SRGs to generate parallel sequences, and consider how to achieve their minimal realizations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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). Parallel 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_7
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3231-8_7
Publisher Name: Springer, London
Print ISBN: 978-1-4471-3233-2
Online ISBN: 978-1-4471-3231-8
eBook Packages: Springer Book Archive