APPLICATIONS OF SEQUENCE SPACE AND SRG THEORIES TO DISTRIBUTED SAMPLESCRAMBLING

In this paper, we consider how to apply the sequence space and the shi ft register generator (SRG) theories to distributed sample scrambling (DSS), which exhibits the best performance in scrambling of small fram e sized signals, We first consider how to predict scrambling sequences using their samples, which is a basic problem for a proper synchroniz ation within the DSS systems, Then for DSS scramblers, we consider how to determine the scrambler SRG's and the sampling times for conveying information on the scrambling sequence; and for DSS descramblers, we consider how to determine the descrambler SRG's, the correction times, and the correction vectors far a proper synchronization. We further e xamine how to realize the scramblers and the descramblers with minimiz ed circuit complexity, Finally, we demonstrate how to apply the result s to DSS scramblers and descramblers for application in cell-based asy nchronous transfer mode (ATM) transmission.