CA1048178A - Digital multiplexing - Google Patents

Abstract

Abstract of the Disclosure There is disclosed an integrated multiplexer and code translator and an integrated demultiplexer and code translator for two binary data streams. The integrated multiplexer and code translator first multiplexes the two binary data streams. The multiplexed data stream is divided into groups each containing four binary bits which in turn are translated into groups each containing three ternary bits. The three ternary bit groups are transmitted to the integrated demultiplexer and code translator where the three ternary bit groups are trans-lated back to the four binary bit groups. Then the resultant multiplexed binary bit stream are demultiplexed to provide the original two binary data streams.

Description

Ao Jessop-J.R. Dawson - 4-1 (Revision) Background of the Invention This in~rention relates to digital data communica-tion systems and more particularly to digital multiplexing and demultiplexing arrangements therefore .
- 5 Summary of the Invention An object of the present invention is to provide an improved digital multiplexing arrangement and a digital demultiplexing arrangement sui-table for employment in a binary coded digital data communication system .
A feature of the present invention is the provision of a digital data communication system comprising. -transmitter means including a plurality of sources of serial digital data streams, each of the streams .` having data encoded according to a first digital code; first means coupled to the sources to select from each of the streams a sub-group of suc-cessive digits; second means coupled to the first means for transferring ;~, the sub-groups collectively to form a first group of digits; third means '~
- coupled to the second means for translating the first group of digits into a second group of digits encoded according to a second digital code;
and fourth means coupled to the third means for transmitting the second group of digits; and receiver means including fifth means coupled to the fourth means to receive the second group of digits; sixth means coupled to the fifth means for retranslating the second group of digits back into the first group of digits; seventh means coupled to the sixth means for dividing the retranslated first group of digits into the sub-groups; and eighth means coupled to the seventh means for recreating from the sub-groups -the streams.

,i .
. ~IL

-2-s ,., : .
.. , , ~ .

~7~ (Revlsion) Another feature of the present invention is the provision of a digital . data transmitter comprising: a plurality of sources of serial digital data streams, each of the streams having data encoded according to a firs-t digital code; first means coupled to the sources to select from each of -the streams a sub-group of successive digits; second means coupled to the first means for transferring the sub-groups collectively ~:- to form a first group of digits; third means coupled to the second means for translating the first group of digits into a second group of digits encoded according to a second digital code; and fourth means coupled :~ 10 to the third means for transmitting the second group of digits.
Still another feature of the present invention is the provision oi a digital data receiver comprising: first means to receive a first group of digits encoded according to a first digital code derived from a second group of digits encoded according to a second digital code, the second group of digits being derived from a sub-group of successive digits ~i of each of a plurality of serial digital data streams; second means coupled to the first means for translating the first group of digits back to the second group of digits; third means coupled to the second means for dividing the second group of digits into the sub-groups; and :Eourth means coupled to the -third means for recreating from the sub-groups the streams.
A iurther feature of the present invention is the provislon of a method of digital data communication for a plurality of serial digital data streams, each of the streams having data encoded according to a first digital code, comprising the steps of selecting from each of the streams a sub-group of successive digits; transferring the sub-groups collectively to form a first group of digits; translating the first group , . ~ .

A. Jes sop-J . R . Dawson ~
- ~48~735~ (Revision) of digits into a second group of digits encoded according to a second , ~ digital code; transmitting the second group of digits; receiving the second group of digits; retranslating the second group of digits back into the - ~ first grouP of digits; dividing the relranslated first group of digits into the sub-groups; and recreating from the sub-groups the streams.
Still a further feature of the present invention is the provision of a method of digital data transmission for a plurality of serial digital data streams, each oE the streams having da-ta encoded according to a first digital code; selecting from each of the streams a sub-group of successive digits; transferring the sub-groups collectively to form a first group of digits; translating the first group of digits into a second - group of digits encoded according to a second digital code; and trans-mitting the second group of digits.
Another feature of the present invention is the provision of a method of digital data reception for a first group of digits encoded according to a first digital code derived from a second group of digits encoded according to a second digital code, the second group of digits being derived from a sub-group of successive digits of each of a plurality of serial digital data streams; comprising the steps of receiving the first group of digits;
translating the first group of digits back to the second group of digits;
dividing the second group of digits into the sub-groups; and recreating from the sub-groups the streams.
- Digital data is usually generated in binary form. However, such asignal may not be optimum for transmission which has the desired properties. These desired properties include:
1) Radix optimized to the transmission media;

:

A. Jessop-J.R. Dawson - 4-1 ~48~7~ ( Revision) ' 2) Reduced low frequency content;

3) Increased timing content; and

4) Means of detecting errors.
These requirements lead to the choice of a code which frames the binary information into words. The information ~- in these words is then conveyed by other words of different number of digits and/or radix. A common translation is :
tne representation of words of four binary digits by words of three ternary digits. Such an arrangement is -~ 10 disclosed in U.S. Patent No. 3,611,141.
It is common for these transmission codes to have a large percentage of redundancy, usually in the range 10%
to 40~. In the foregoing example, the percentage redundancy is 1 - 4 log 2 x 100 = 16%
3 log 3 This redundancy is necessary to achieve the desired properties stated above, especially to enable the low frequency content to be made small. Because of the redundancy there is usually some property in a code that can be used to enable the words to be correctly framed at the receiving end of the transmission link and, hence, the originai binary recovered~ ~ethods of correctly framing such codes are well known and include:
checking for violations in translation rules which occur when the framing is mis-aligned, as described in U.S. Patent No. 3,646,517, derivation of framing from the digital sum variation, and looking for code words that cannot occur with correct framing. Because of the high redundancy, the reframing time can be very small.

-5-.

A. Jessop~J. R . Dawson - ~ 1 8 (Revision) This property is exploited in this invention.
In many applications, multiplexing (otherwise known as combining) of digital signals is required in addition -to code translation. A feature of the present invention is the inteyration of these two functions. In current practice multiplexing and code translation are performed inde-pendently in that the digit streams to be multiplexed are first processed to form a serial binary digit stream which is then further processed in the code translator. When code translations are used in which binary words of 'n' digits are regularly conveyed by 'm' digit words of radix 'r', then the code translator can also act as a digital multiplexer. In the case where the signals to be multiplexed all have the same digit frequency and are bit synchronous, multiplexing can be achieved:-i) Directly if the number of signals to be multiplexed equals 'n';
ii) By serial to parallel conversion in each input digit stream if the number of inputs is an exact sub-multiple of 'n';
iii) By serializing groups of inputs if the number of inputs is an exact multiple of 'n'; and iv) By a combination of ii) and iii) if there is no common fac~or between the number of inputs and 'n' .
In the case where the signals to be multiplexed do not all have the same digit frequency, but nevertheless are harmonically related, multiplexing can be achieved:-. A. Jessop-J.R. Dawson- 4-1 : ~48~L78 (Revision) v) By serial to parallel conversion of the higher - digit frequency signals if the aggregate digit frequency is exactly 'n' times the lowest digit frequency; and vi) By a combination of serial to parallel ~onversion and parallel to serial conversion for all other cases.
All the operations described in cases (i) to (vi) can be performed without generating a digit stream at the aggregate digit frequency.
At the receiving end of the transmission link the 'n' digit binary words -- 10 can be reconstructed by the receiving code translator using its own frame aligning mechanism. In cases i), ii) and v) above the original signals can then be recovered without identifying information in the binary digit : streams. In the other cases additional information may be required in the ''; :
` binary digit streams if a multi-word frame cannot be obtained from the receiving code translator. Even in the cases where additional binary multi-frame information is necessary the time to align the multi-frame from a nonalogned state can be signi~icantly reduced if the multi-frame information is mad~ coherent with the code translation frame, since the number of checks on the multi-frame search is reduced which reduces the time lost through simulation of the multi-frame information.
All the de-multiplexing operations can be performed by ~he inverse ; operation -to that at the multiplexer; that is without generating a serial binary digit stream or clock at the aggregate binary digit rate~ Initially the only timing signal at the receiving demultiplexer is usually a clock at the transmission digit rate t. The aggregate binary digit rate is t x n, m where n is usually ~reater than unity. Without integration of the receiving m .
. . ' ' ' ' ' ' . ' . Jessop-J.R. Dawson ~-1 ` (Revision) 8~7~
code translator and the demultiplexer, a clock frequency t x n would have to be synthesized involving frequency mul-tiplication. With integration all the necessary digit frequencies can be derived from the transmission rate clock by division, provided no frequency is greater than t.
In the previously mentioned cases (i) to (iv) where all multiplexed signals have the same digit frequency, the signals can be demultiplexed and an associated clock of the correct digit frequency derived by dividing the transmission rate clock by a factor ~ , where p is the number of multiplexed signals. In cases where n is an integer, a regular clock pm can be generated; in other cases the clock will in general be irregular.
In the previously mentioned cases (v) and (vi) where all multiplexed signals do not have the same digit frequency, the various clocks can be individually synthesized by dividing the transmission rate clock by - a iactor if n, v~here f is the digit frequency of the particular tributary - 15 signal and fa is the aggregate digit frequency of all the tributary signals.
Although in some of the cases described the reconstructed clocks at the demultiplexer are irregular, in many instances this is of little cQlsequence. For example, when asynchronous signals are multiplexed, it is common to use the technique of pulse stufEing to achieve bit syn-chronism at the multiplexer - by adding redundant digits~ ~t the demultiplexer these redundant digits are removed giving a signal with an lrregular clock. The mechanism for smoothing the clock irregularities due to pulse stuffing can also smooth the irregularities due to the integrated multiplexing and code translation~

A. Jessop-J.R. Dawson - 4-1 l78 (Revision) Brief De~?tion of the Drawing Above-mentioned and other features and objects of this invention will become more apparent by reference to the following description taken in conjunction with the accompanying drawing, in which:
Fig. 1 illustrates a block diagram of a typical digi-tal data com-- munication system in accordance with the principles of the present ; invention;
Fig. 2 illustrates a pulse stuEfed tributary frame structure;
` Fig. 3 illustrates in block form the integrated multiplexer/code -translator portion of Fig~ l;
Fig. 4 illustrates the 4B3T code translation used in the code trans-lator of Fig. 3;
Fig. 5 illustrates in block form the integrated code translator/
demultiplexer portion of Fig. l; and ' 15 Fig. 6 illustrates irregular tributary clock and data waveforms.~- Description of the Preferred Embodiment In the general arrangement shown in Fig. 1 two asynchronous binary - data streams A and B, each at a normal bit rate of 1.544 Mb/s, are multiplexed and transmitted over a common channel. By means of added digits in a superimposed frame, each of the two tributary digit streams is bought up to a common digit frequency using the pulse stuffing circuits 10 and 11; the stuffing frame generator 12 being common to both tributaries.
The two, now synchronous, stuffed tributaries are combined in the multiplexer/code translator 14 which transmits a single digit stream to line. The receiving terminal performs the reverse operation, redundancy in the line code is used by the code translator/demultiplexer 15 to define ' ' . ' ' :, :

-Ao Jessop-J.R. Dawson - 4-1 (Revision) : `
the division into the two stuffed tributaries. Common stuffing frame alignment circuits 16 detects the stuffing frame and the tributaries then have the added stuffing and framing digits removed in the destuffing circuits 17 and 18.
A smoothed clock is generated at each of the tribu-tary binary digit rates to clock out the two 1.544 Mb/s signals.
Fig. 2 shows diagrammatically the iden-tical frame structures used for the stufEed tributaries. Each frame - consists of six sub-frames of 47 bits, giving a total frame ::.
length of 282 bits. The sub-frames have 46 information bits and one framing bit which are allocated as follows.
denotes a time slot for a data (information) bit.
The frame alignment signal is when bits FAl and FBl are A2 B2 are 00 . Bits DAl, DA2 and DA3 form the stuffing indicator for tributary A. "000"
indicates "no stuffing" and "111" indicates "stuffing" in that frame. Similarly bits DBl, DB2 and DB3 form the ~, stuffing indicator for tributary B. The actual time slot available for stuffing in each frame is the first ~ time slot following the third D bit in the frame. Bits XA and XB are used for two alarm or signalling channels. This frame structure results in a stuffed tributary bit rate of 1.580 ~/s and a frame rate of 5.6028 kHz.
Fig. 3 shows a functional block diagram for an integrated multiplexer and code translator for the application outlined~
above, the line code employed is 4B3T, an example of the four binary to three ternary class of translation already mentioned. The two stuffed tributaries are first scrambled in a ten stage, two line parallel scrambler 30. A suitable scrambler is disclosed in a first U.S. copending applica-tion, Serial No. 553,349 filed February 26, 1975, now U.S.
Patent No. 3,988,538. The two scrambled streams are then - A. Jessop-J~R. Dawson - 4-1 , (Revi sion) 7~
~- deserialized in two 2-bit shift registers 31 and 32 so that data is pre-sented to the -translator 34 as 4-bit words. Translator 34 may be imple-mented as disclosed in the above-cited U.S. Patent No. 3,611,141. The translator generates six outputs; one each for positive and negative marks for the first, second and third time slo-ts of the 3-digit ternary word. The translation of the labelled inputs Al, A2, Bl, B2 into their - ternary equivalents is shown in Fig. 4.
The code translator also monitors the running digital sum of the output ternary signal and this is used to control the choice of a ternary word - 10 where alternative ternary words are available for a particular input binary word. The translator outputs are serialized in two groups of three in serializers 35 and 36 and the resultant two binary streams at ternary digit rate T control the output stage 37 which drives a single ternary digit stream to lineu Clocks at line digit rate T, stuffed tributary digit rate ST, and word rate W are all generated by division of a common source in the clock generator 33.
A functional block diagram for an integrated demultiplexer and code translator 15 of Fig~ 1 is shown in Fig. 5. The regenerator 50 recovers a clock from the ternary digit stream at the ternary digit frequency and detects positive and negative marks which are represented by two binary digit streams identical to those existing in the transmitting terminal before the output stage. These two binary streams are deserialized in two 3-bit , shift registers 51 and 52 and the ensuing 6-bit words constitute the input `- to the code translator 53 which may be implemented as disclosed in the above-cited U.S. Patent No~ 3,611,141. The translator output is four parallel binary digit streams Al, A2 ~ Bl, ~2 as origina]ly labelled in ) A. Jessop-J.R. Dawson - 4-1 ~ 78 (Revision) ... .
; the multiplexer. These streams are serialized by serializing : .
circuits 54 and 55 in two groups of two digits. These are then descrambled in a ten-stage, two-line parallel descram-bler 56, thus recovering the two original stuffed tributaries : 5 A and B. Descrambler 56 may be implemented as disclosed- in the above-cited first copending application.
Some aspec-t of the line code redundancy is used in the , word alignment detector 59 to control the phase of the word :~ rate clock output W of the divide by three circuit 57. In the case of 4B3T, line code word alignment can be found using the technique described in a second U.S. copending applica-, .
. tion Serial No. 436,301, filed January 24, 1974, now U.S.
Patent No. 3,902,117. A typical implementation of this ,~1 technique gives a mean time to find word alignment with worst case start of 75 words for random input data. This time is very short compared to many asynchronous multiplexers owing to the very higher redundancy in the line code (16~), compared to that normally added to the data stream (aboutl~).
The clock division circuit 58 generates a clock at the stuffed tributary digit rate ST which is two thirds of the ternary digit rate T. This is accomplished by gating of the word rate clock W with the ternary digit rate clock and in consequence this clock is irregular. A timing diagram ; (Fig. 6) shows the relationship between -the line digit rate and stuffed tributary bit rate clocks, and a typical output data waveform.
While we have described above the principles of our invention in connection with specific apparatus it is to be clearly understood that this description is made only by way of example and not as a limitation to the scope of our invention as set forth in the objects thereof and in the accompanying claims.
ACH:vm

Claims

The embodiments of the invention in which an exclusive property or privilege is claimed are defined as follows:
1. A digital data communication system comprising:
transmitter means including a plurality of sources of serial digital data streams, each of said streams having data encoded according to a first multidigit digital code;
first means coupled to said sources to select from each of said streams a sub-group of successive digits;
second means coupled to said first means for transferring said sub-groups collectively to form a first group of digits;
third means coupled to said second means for translating said first group of digits into a second group of digits encoded according to a second multidigit digital code different than said first code; and fourth means coupled to said third means for transmitting said second group of digits; and receiver means including fifth means coupled to said fourth means to receive said second group of digits;
sixth means coupled to said fifth means for retranslating said second group of digits back into said first group of digits;
seventh means coupled to said sixth means for dividing said retranslated first group of digits into said sub-groups;
and eighth means coupled to said seventh means for recreating from said sub-groups said streams;
said first means including a plurality of shift registers, each of said shift registers having a different one of said streams coupled thereto in serial form, each of said shift registers having a number of stages equal to the number of digits in the associated one of said sub-groups.
2. A system according to claim 1, wherein said second means includes ninth means for transferring simultaneously the contents of each of said shift registers in a parallel mode to said third means.
3. A system according to claim 2, wherein said first group of digits are binary coded digits;
said second group of digits are ternary coded digits; and said third means translates said first group of binary coded digits to said second group of ternary coded digits.

4. A system according to claim 3, wherein said first group of binary coded digits number four binary coded digits;
said second group of ternary coded digits number three ternary coded digits; and said third means translates said first group of four binary coded digits into said second group of three ternary coded digits.
5. A system according to claim 4, wherein said third means includes tenth means for monitoring a running digital sum of said group of ternary coded digits; and eleventh means coupled to said tenth means for controlling the choice of alternate ternary coded words when such words are available to maintain said running digital sum within prede-termined limits.
6. A system according to claim 1, wherein said first group of digits are binary coded digits;
said second group of digits are ternary coded digits; and said third means translates said first group of binary coded digits to said second group of ternary coded digits.
7. A system according to claim 6, wherein said first group of binary coded digits number four binary coded digits;
said second group of ternary coded digits number three ternary coded digits; and said third means translates said first group of four binary coded digits into said second group of three ternary coded digits.
8. A system according to claim 7, wherein said third means includes ninth means for monitoring a running digital sum of said group of ternary coded digits; and tenth means coupled to said ninth means for controlling the choice of alternate ternary coded words when such words are available to maintain said running digital sum within predetermined limits.
9. A system according to claim 1, wherein said first group of digits are binary coded digits;
said second group of digits are ternary coded digits; and said third means translates said first group of binary coded digits to said second group of ternary coded digits.
10. A system according to claim 9, wherein said first group of binary coded digits number four binary coded digits;
said second group of ternary coded digits number three ternary coded digits; and said third means translates said first group of four binary coded digits into said second group of three ternary coded digits.
11. A system according to claim 10, wherein said third means includes ninth means for monitoring a running digital sum of said group of ternary coded digits; and tenth means coupled to said ninth means for controlling the choice of alternate ternary coded words when such words are available to maintain said running digital sum within predetermined limits.
12. A system according to claim 1, wherein said transmitter means further includes ninth means coupled between said sources and said first means to scramble each of said streams; and said receiving means further includes tenth means coupled to the output of said eighth means to de-scramble each of said recreated streams.
13. A system according to claim 1, wherein said transmitter means further includes ninth means coupled to said sources to synchronize said streams which are initially asynchronous.
14. A system according to claim 13, wherein said ninth means includes tenth means coupled to said sources for adding stuffing digits to each of said streams; and said receiver means further includes eleventh means coupled to said eighth means for removing from said recreated streams said stuffing digits added at said transmitter means.
15. A digital data transmitter comprising:
a plurality of sources of serial digital data streams, each of said streams having data encoded according to a first digital code;
first means coupled to said sources to select from each of said streams a sub-group of successive digits;
second means coupled to said first means for transferring said sub-groups collectively to form a first group of digits;
third means coupled to said second means for translating said first group of digits into a second group of digits encoded according to a second digital code different than said first code;
and fourth means coupled to said third means for transmitting said second group of digits;
said first means including a plurality of shift registers, each of said shift registers having a different one of said streams coupled thereto in serial form, each of said shift registers having a number of stages equal to the number of digits in the associated one of said sub-groups.
16. A transmitter according to claim 15, wherein said second means includes fifth means for transferring simultaneously the contents of each of said shift registers in a parallel mode to said thixd means.
7. A transmitter according to claim 16, wherein said first group of digits are binary coded digits, said second group of digits are ternary coded digits, and said third means translates said first group of binary coded digits to said second group of ternary coded digits.
8. A transmitter according to claim 17, wherein said first group of binary coded digits number four binary coded digits, said second group of ternary coded digits number three ternary coded digits, and said third means translates said first group of four binary coded digits into said second group of three ternary coded digits.
9. A transmitter according to claim 18, wherein said third means includes sixth means for monitoring a running digital sum of said group of ternary coded digits r and seventh means coupled to said sixth means for controlling the choice of alternate ternary coded words when such words are available to maintain said running digital sum within predetermined limits.
0. A transmitter according to claim 15, wherein said first group of digits are binary coded digits, said second group of digits are ternary coded digits, and said third means translates said first group of binary coded digits to said second group of ternary coded digits.
21. A transmitter according to claim 20, wherein said first group of binary coded digits number four binary coded digits, said second group of ternary coded digits number three ternary coded digits, and said third means translates said first group of four binary coded digits into said second group of three ternary coded digits.
22. A transmitter according to claim 21, wherein said third means includes fifth means for monitoring a running digital sum of said group of ternary coded digits, and sixth means coupled to said fifth means for controlling the choice of alternate ternary coded words when such words are available to maintain said running digital sum within predetermined limits.
23. A transmitter according to claim 15, wherein said first group of digits are binary coded digits, said second group of digits are ternary coded digits, and said third means translates said first group of binary coded digits to said second group of ternary coded digits.

24. A transmitter according to claim 23, wherein said first group of binary coded digits number four binary coded digits, said second group of ternary coded digits number three ternary coded digits, and said third means translates said first group of four binary coded digits into said second group of three ternary coded digits.
25. A transmitter according to claim 24, wherein said third means includes fifth means for monitoring a running digital sum of said group of ternary coded digits, and sixth means coupled to said fifth means for controlling the choice of alternate ternary coded words when such words are available to maintain said running digital sum within predetermined limits.
26. A transmitter according to claim 15, wherein said transmitter means further includes fifth means coupled between said sources and said first means to scramble each of said streams.
27. A transmitter according to claim 15, wherein said transmitter means further includes fifth means coupled to said sources to synchronize said streams which are initially asynchronous.