Escolar Documentos
Profissional Documentos
Cultura Documentos
Multiplexing methods
Capacity Allocation
Bitwise Wordwise
Capacity Allocation
In Bitwise interleaving, the frame size is equal to the number of channels multiplexed while in wordwise interleaving, it is equal to the product of the word-size and the number of channels. Bitwise interleaving is natural if delta modulator coders/decoders are used and wordwise interleaving is natural if PCM codecs are used for digitization.
Framing
Frame Synchronization
Main considerations in choosing a framing procedure are: Time required to establish framing Effects of channel errors in maintaining frame synchronization Relationships between line clock and sample clocks derived from line clock Transmission overhead Complexity of framing circuitry
Framing
The severity of a loss of framing and time required to re-establish frame synchronization depend on the nature of traffic. For voice traffic, infrequent misframes can be tolerated if frame synchronization is reestablish rapidly enough to minimize the duration of glitch in the output speech
A loss of framing is determined when the occurrence of framing pattern violations exceeds some short term density threshold. Considerable redundancy in the framing pattern is required to minimize the probability of false misframes.
Frame Sync.
Frame synchronization may be done in number of ways. In all the ways, there are one or more framing bits with an identifiable data sequence. Frame bits may be added additionally to data bits or some of the data bits may be used as frame bits.
Added-Digit framing
The framing bit is added once for every frame and alternates in value. Framing is established at receiver by monitoring first one bit position within N-bit frame and then another, until the alternating pattern is located.
To synchronize with the bit stream, the receiver picks a random bit, and then examines every 193rd bit for the presence of the special framing pattern. If too many received bits differ from the pattern, it delays one bit and begins the search again.
Frame Time
With added-digit framing strategy, the expected framing time from a random starting point with random data is
average number of bit positions Frame Time = before framing bit is found average number of bits to determine that an information position is not a framing position
Frame Time
If we denote p by the probability of a 1 and q = 1- p the probability that a 0 is received first, the average number of frames required to receive a mismatch is A0.
A0
Frame time
If 1s and 0s are equally likely (p = q = 0.5), A = 2 so frame time = N2 + N bit times. For N = 193, framing time is 37346 bits, or 24.188 msec.
Also of interest is maximum framing time. Unfortunately there is no absolute maximum framing time for a T1 system with random data. It is very unlikely, however, that the framing time would ever exceed the average search time for all bit positions, or 48.25 ms. This latter measure of framing time is referred to as the maximum average frame time.
Monitoring all bit positions simultaneously for the framing pattern (Parallel search).
10
11
12
13