CA1301931C

CA1301931C - Decoding method for t1 line format for ccitt 32k bit per second adpcm clear channel transmission and 64 kbps clear channel transmission

Info

Publication number: CA1301931C
Application number: CA000545521A
Authority: CA
Inventors: Ernest E. Blondeau, Jr.; Stephen J. Czarnecki
Original assignee: GTE Communication Systems Corp
Current assignee: GTE Communication Systems Corp
Priority date: 1986-09-02
Filing date: 1987-08-27
Publication date: 1992-05-26
Anticipated expiration: 2009-05-26
Also published as: BE1000144A6; US4747112A

Abstract

BIT PER SECOND ADPCM CLEAR CHANNEL TRANSMISSION

ABSTRACT OF THE INVENTION
The present method is a decoding scheme for suppressing excessive amount of zeroes transmitted via a Tl line facility. Clear channel transmission capability is provided by this scheme for 32 kb/s or 64 kb/s transmission channels. This scheme provides the proper zero bit suppression for alternating mark inversion signaling (AMI). A proper AMI signal contains no more then 15 consecutive zero bit positions. In addition to meeting the AMI signaling standards, this scheme does not induce any violations of VMR (violation monitor and removal) equipment.
Thus, this scheme is transparent to existing line equipment and error monitoring equipment. This scheme provides both a necessary and sufficient method for achieving the AMI signaling requirements during clear channel signaling.

Description

~3~
, .

A DECODING METHOD FOR Tl LINE FORMAT FOR CCITT 32K
BIT PEP~ SECOND ADPCM CLEAR CHANNEL TRANSMISSION

CROSS REFERENCE TO RELATED APPLICATIONS
The present application is related to co-pending applications Canadian Serial Nos. 545,522-7 and 545,523-5, having the same inventive entity and being assigned to the same assignee as the present application.
The present application is also related to co-pending Canadian applications Serial Nos. 552,259-5; 552,258-7; and 552,252-8, each is assigned to the same assignee as is the present application.
B~CKGROUND OF THE INVENTI0N
The present inventlon pertains to Tl transmission systems and more particularly to unrestricted 32 kb/s (32,000 bits per second) and 64 kb/s (64,000 bits per second) transmission channels which satisfy the Tl line zero suppression requirements.
Tl transmission line facilities operate at 1.544M bits per second. The Tl line transmission facilities utilize an alternating mark inversion (AMI) signaling scheme. This ANI
signal contains no more than 15 consecutive zero bit positions in a particular Tl bit stream. This requirement of not more than 15 zero bits in a string derives from the operation of repeaters in Tl transmission line systems. Commonly used repeaters may not operate within specification if more than 15 consecutive zeroes are transmitted. Repeater synchronization cannot be guaranteed for bit streams with more than 15 consecutive zeroes.
One technique used for Tl line 0 bits suppression is bipolar with 8 zeroes substitution (B8ZS). The B8ZS technique utilizes two special coding patterns containing bipolar violations which are substituted for strings of 8 zeroes in the input signal stream. Upon detecting bipolar violations with either of the two special patterns, the receiver places 8-bits of zeroes in the corresponding positions in the output bit stream.
One technical disadvantage of the B8ZS technique is that it violates the AMI signaling standard on Tl lines. Since bipolar violations normally in~icate transmission errors, the deliberate introduction of these transmission errors by B8ZS
signaling reduces the effectiveness of determining real errors 4~ which are detected by the AMI signaling scheme. Another I

3~

disadvantage of the B8ZS technique is that it detects strings of 8 zeroes and substitutes the special violation patterns more frequently than the specified Tl line operation requires. In addition to these disadvantage~, the B8ZS patterns will not propagate through standard multiplexer derived DSl facilities or protected T1 facilities.
Severe economic disadvantages obtain for the introduction of the B8ZS technique into the North American transmission network. This introduction would require a global replacement of existing multiplexers, automatic protection switches, electronic cross-connect devices (DACS), digital switch interface hardware and any other item in the network with violation monitor and removal (VMR). Such an introductlon of the B8ZS technique presents an unreasonably large capital investment requirement to change network hardware.
Another more commonly used technique for meeting the Tl line zero suppression requirement is to place restrictions on the sources of bit sequences allowed in payload channels. For example, this restriction is applied at CODECS to transform a O
bit to a 1 bit whenever an all zero 8-bit channel appears as a PCM
code word. This same technique of forcing 1 bits into all zero 8-bit channels is used to Eurther assure that no all zero 8-bit channels and therefore not more than 15 consecutive zero bits are transmitted in the Tl line format. This is a sufficient, but not a necessary condition for achieving the requirement.
The disadvantage of the technlque of Tl line zero suppression by restricting sources of bit sequences is that all zero 8 bit strings are not pe~mitted to be transmitted on any channel. This prevents the use of Tl lines for transmission of clear channel data ~which require sending all possible 8-bit strings including an all zero 8-b~t string) and standard CCITT 32K
bit per second ADPCM. This technique also requires special treatment of all payload 8-bit strings by hardware such as CODECS
and digital trunk units to force 1 bits into all zero 8-bit octets.

~3~1~3~

It is an object of the present invention to enable unrestricted transmisslon on T1 line facilities for 32 kb/s and 64 kb/s channels efficiently without changing transmission network hardware or circumventing violation monitor and removal hardware.
S SUMMARY OF THE INVENTION
. .
In a data transmission system, first and second digital switching systems are connected to each other via T1 line transmission facilities. These T1 line transmission facilities provide for bidirectional data transmission between tha switching systems. These switching systems included decoding method for T1 line zero bit suppression.
The decoding method for T1 line zero bit suppression first recelves an encoded T1 line frame which has a plurality of bundled channels. Ne~t, indicator bits of the received T1 line frame are tested to determine whether any channel of the frame has been altered for the transmission. Indicator bits are tested to make this determination. If the indicator bits show that no alteration has been performed, the T1 line frame is transferred exactly as it was received.
If some channels of the T1 line frame have been altered, mapping bits of the line frame are decoded to determine which chamlels of a bundle have been altered for the transmission.
Next, the contents of each altered channel of the bundle are replaced with zero contents. Next, the process of decoding and replacing ls iterated for each of the bundles which comprise the received T1 line frame. Lastly, the T1 line frame which has had the altered channels replaced with zeroes is transferred for further pr~cessing.
A BRIEF DRSCRIPTION OF THE DRAWINGS
Figure 1 is a layout diagram of typical T1 frame data for~at.
Figure 2 is a layout diagram of channel 23 of each frame.
Figure 3 is a layout diagram of ~he bundling arrangement of ~he present invention.

?3~

Figure 4 is a flowchart of the bundle encode logic of the present invention.
Figure 5 is a flowchart of the bundle encode logic.
Figure 6 is a flowchart of the bundle decode logic of the present invention.
Figure 7 is a flowchart of the bundle decode loglc.
DESCRIPTION OF THE PREFERRED EMBODIMENT
The structure of th~ Tl line format is based on the standard 1.544M bits per second DSl digital signal format. This structure is shown in Figure 1. The DSl frame contains 193 bits of info~mation. This information is organized into a single bit of synchronization or framing data plus 192 bits of payload data.
The 192 bits of payload data are organized into 24 channels, each channel containing 8-bits and can be referred to as an octet.
In the DS1 signaling~ the least significant bit, PCM 7, of each octet in every sixth frame is commonly ussd as a robbed or stolen signaling bit to indicate the signaling states of the active channels. These signaling bits are transmitted at a rate of 24 bits per 6 frames or 4 bits per frame.
A new Tl line format may be constructed to replace the robbed signaling scheme. Four bits of signaling information, bits A, B, C and D shown in Figure 2 are transmitted with each frame.
The receiving end of the transmission system receives four signaling bits with each frame. Therefore, proce~sing of the functions associated with these bits may proceed more uniformly.
Furthermore, by moving signaling bits ~o channel 23, true clear channel transmission capability is provided. These four bits reside in the first 4 bits of channel 23. The last four bits are ~ero octet indicator bits. Over the span of six frames, the new format does obtain all 24 signaling bits (one bit per channel).
This arrangement provides for 46 unrestricted 32 kb/s channels or 23 unrestricted 64 kb/s (clear) channels. These bits are assigned a sequenc~ which is indexed by reference to the signaling frame.
For example, bit A ls channel 0 signaling information in frame 1;
channel 4 signaling information in frame 5; channel 8 signaling information in frame 9, etc.

" ~V~L~3~

The DSl signal contains 23 full channels of 8-bits in length (PCM~ - PCM7) as shown in Figure 1. As shown in Figure 2, the new format of the 24th channel (channel 23) may contain a 1/2 payload channel (4-bits) of unrestricted information or 4 bits of signaling information (A, B, C and D) in the first four bits of channel 23. The remaining 4-bits of channel 23 are the zero octet indicator blts. For CCITT 32 kb/s ADPCM there are either 46 or 47 unrestricted channels of 4 bits in length. In order to meet the Tl line zero suppression requiraments, the unrestricted payload signal is transformed to a non-zero octet wherever an all zero octet (channel) is detected within the frame.
Referring to Figure 3, a typical 24 channel frame of DSl signaling is shown. The channels of the frame are shown grouped into 4 bundles, 1 through 4. Each bundle contains 6 channels of unrestricted data, except for channel 23 which has only a 4-bit payload. ~undle 1 contains channels O through 5;
bundle 2 contains channels 6 through 11; bundle 3 contains channels 12 through 17; and bundle 4 contains channels 18 through 23. Channel 23 is only a one-half payload chamlel. The other 4-bits of channel 23 contain the zero octet indicator bits as shown in Figure 2.
Each of ~he 4 zero octet indicator bits corresponds to an associated bundle as shown in Figure 3. If any of the channels of a particular bundle contains an all zero octet, then the indicator bit, shown in Figure 2, corresponding to that bundle is set to a logic 1. Otherwise, the indicator bit is always set to logic 0.
The zero octet indicator bit for bundle 4 is always set last. The bundle 4 zero octet lndicator bit is handled in a special manner. First, the bundle 4 bit is set to a binary logic 0. Next, each channel in bundle 4 is examined to determine whether any oc~et 1~ all zero. If any octet in bundle 4 is all zero, then the bundle 4 bit is set to logic 1.

3L3il~3~a The scheme disclosed herein may be implemented via the firmware of a digital signal processor. One such digital signal processor that may be employed is a Fujitsu digital signal processor part number MB-8764-DSP. The transmltting station will contain a digital signal processor and the necessary encode logic.
The receiving station contains the digital signal processor with the decode logic.
~ eferring to Figures 4 and 5, the encode logic for the Tl line format for CCITT 32 kb/s ADPCM and 64 kb/s clear channel transmiæsion is shown. This logic begins at block 10 and first initializes the 4 indicator bits contained in the last half of channel 23 each to 0, block 20. Next, a 4-bit indicator register is initialized to 0, block 30. This register corresponds to the 4 indicator bits in channel 23 and at the end of the process, the register will be written into the 23rd channel.
An internal counter k is set equal to 1, block 40.
This is the b~mdle co~mter. Next, a mapping register is initialized to the binary value 00000011, block 50. This register will locate the zero octets. Another internal counter i is said equal to 1, block 60. This is the octet counter.
Next, block 70 asks whether the i-tb octet is equal to 0. If the particular octet or channel contains 8-bits of 0, the bit corresponding to that octet within the mapping register is set equal to 1, block 72. Next, the bundle indicator bit of the indicator register is set equal to 1 corresponding to the value of the internal octet counter k, block 74. The bundle indicator bits (zero octet lndicator bits) are shown in Figure 2.
Block 80 determines whether the internal octet counter i is equal to 6. If i is equal to 6, then control is passed to block 90 of Figure 5. This indicates that all 6 octets of a particular bundle have been e~amined for a contents of zero. If the internal indicator i is not equal to 6, then all of the octets or channels of that particular bundle have not been examined. As a result, the internal octet counter i is incremented by 1, bloc~
82. Then9 processing control is transferrPd to block 70. This L93~
", .

processing continues until all octets or channels of tbe particular bundle have been examined.
Block 90 determines whether the indicator register corresponding to the bundle of octets which were just examined is equal to 0. If the lndicator register for this particular bundle is not equal to 0, this indicates that at least one all zero octet exists within the bundle and the first octet or channel of that bundle is temporarily saved in a displacement register, block 92.
Next, the contents of the displacement register are transferred to the first zero octet, block 94. It is important to note that the first zero octet ~ay not necessarily be octet number 1. Each additional zero octet within the particular bundle is set to binary 11111111, block 96. Since all zero octets will be recreated at the receiving end of the transmission system, the bits are altered to logic ones in order to provide additional synchronization for thP repeaters and transmission equipment. As previously mentioned, the repeaters and transmission equipment require a minimum density of logic ones in order to maintain synchronization.
Next, the contents of the mapping register are copied into octet number 1 J block 98. The mapping register contains a 1 in each bit position corresponding to the location of a zero octet in the bundle of 6 octets. Since only the first 6 bits of the mapping register are required for the informa~ion about the 6 octets, the other 2 bi~s o~ the mapping register may be arbitrarily set. Again, to aid the transmission equipment and repeaters, these bits are arbitrarily set to logic 1.
~fter the above processing has been complete for the detection of a zero octet within the bundle or if the indicator register showed that no all zero octet was found, block 90, then the bundle counter k is examined to determine whether it is equal to 4, block 100. if the bundle counter k is less then 4, it is incre~ented by 1 block 102, and processing is transferred to block 50 for the processing of the next bundla of octets. if the bundle counter k is equal to 4, all 4 bundles have been processed and processing control is transferred to block 110.

~3~

Block 110 tests the 4 bit indicator register to determine whether it is equal to the binary value 0001. This indicates that there is at least one all zero octet contained in the 4th bundle, if the result of the test is positive. Block 120 interrogates the mapping register to determine whether it is equal to the binary pattern 00000111. If the result of this test i8 also positive, this indicates that the all zero octet is the 6th octet of the bundle. Special processing must occur for this situation.
Since it is known that only the 6th octet of this bundle is all zero, the contents of the displacement register is copied back into the first octet of bundle ~, block 122. This is necessary since block 92 copied the contents of octet number 1 to the displacement register. The contents of octet 1 must be moved back to avoid losing these contents since i~ is known that these contents are non-zero.
Next, the binary value 00000000 is moved to the 6th octe~ of bundle 4~ block 124. Again, it is known that this octet was zero because the mapping register had a 1 set in the bit position corresponding to this octet. The last 4-bits of this octet are a don~t care function and were set to 0 arbitrarily, since the indicator register will be written into these bits in order to form the zero octet indicator bits as shown in Figure 2.
The value of the zero octet indicator bits is guaranteed to be non-zero at this time.
At the completion of the processing of block 124 or if either of the tests of blocks 110 or 120 were answered in the negative, block 130 copies the indicator register to the last 4 ~its of octet number 6 of bundle number 4. If octet number 6 was zeroed by block 124, it was known that the indicator register contained a 1 in the bundle 4 position. Therefore, this indicator register is written over the last 4 bits of octet number 6 of bundle 4. As a result, this octet will be guaranteed to have at least one logic 1.

The zero octet processing for this frame has been complete. The frame is then transmitted to the conversion logic which places the frame in the AMI format, block 140. The processing for this frame is then ended, block 150.
Referring to Figures 6 and 7, the framelbundle decode logic is shown. The decode logic process is initiated at block 200. Block 210 moves the indicator bits from bits 5 through 8 of channel 6 of bundle 4 to an indicator register. Next, the indicator register is examined ~o determine whether all 4 of the zero octet indica~or bits are equal to zero. If all four zero octet indicator bits are zero, no channel within the particular frame contains an all zero octet. As a result, the frame is transferred for further processing exactly as it was received. No bi~ modification is required. Therefore, processing control is transferred to block 290, which ends the frame/bundle decode logic for this particular frame.
If the zero octet indicator bits contained in the indicator register are not all zero, processing control is passed to block 240. Block 240 interrogates the 23rd channel or octet 6 of bundle 4 to deteI~ine whether the value of this channel is equal to the binary value 00000001. For a positive result of the test of block 240, i~ is known that only channel 6 of bundle 4 was a zero octet in the particular frame. The bundle 4 zero octet indicator bit had previously been set to logic l. Since this particular logic 1 in the bundle 4 zero octet indicator bit position is not a payload signal, no modification of the frame need occur. ~s a result, control is transferred to block 230 which transmits the frame exactly as received for further processing. This processing handles the special case of channel 23 being the only octet with an all zero value. Then, the decode logic processing is ended, block 290.
If the test of block 240 was answered in the negative, block 250 sets an internal bundle counter k equal to 1. ~ext, the indicator register is examined to de~ermine whether thP k-th zero octet indicator bit is equal to 1. I~ should be remembered that if a particular zero octet indicator bit is equal to I there is at least 1 all zero channel or octet in that particular bundle. If this particular zero octet indicator bit is equal to 1, then block 262 copies the first octet of that bundle to the mapping register.
For bundles in which there is at least one zero octet the first channel or octet contains the mapping for the locations of these octets. Next, the first octet whose mapping register bit is equal to 1 is copied to the displacement register, block 264. Then each octet of the bundle whose mapping register bit is equal to a 1 will have the binary value 00000000 written into that octet, block 280. ~ext, block 282 determines whether the mapping register bit for the first octet is equal to zero. If the mapping reglster bit for the first octet is zero, then the displacement register is copied back into the first octet, block 284. This indicates that the first octet of the bundle was non-zero and must be replaced with its original value which was displaced to another location so that the mapping bits could be placed in the first octet of each bundle.
After the displacement reg~ster has been copied by block 2~4 or if the question of block 282 is answered in a negative or if the question of block 260 is answered in the ne~ative, then processing control is given to block 270. Block 270 determines whether the value of the internal bundle counter k is equal to 4. If this test is answered in the negative, the bundle counter k is incremented by 1, block 272. Then, processing control is begun again at block 260. If k is less then 4, processing for all 4 bundles comprising the particular frame ~s not yet comple~e. If the bundle counter k is equal to 4, then all octets which were originally zero before the transmission have been reconstructed to be zero. Las~ly, block 274 transfers the decoded frame for ~urther processing and the decoding process is ended, block 290.

3~1 Although the preferred embodiment of the invention has been illustrated, and that form described in detail, it will be readily apparent to those skilled in the art that various modifications may be made therein without departing from the spirit of the invention or from the scope of the appended claims.

Claims

1. In a data transmission system having first and second digital switching systems connected via Tl line transmission facilities for bidirectional data transmission, a decoding method for Tl line zero bit suppression comprising the steps of:
receiving an encoded Tl line frame including a plurality of bundled channels;
testing indicator bits of said received Tl line frame to determine whether any channel of said Tl line frame has been altered for said transmission;
first transferring said received Tl line frame as received, performed in response to said indicator bits showing that no alteration have been made to said received Tl line frame;
decoding mapping bits of said received Tl line frame to determine which channels of one said bundle of said received Tl line frame have been altered for said encoded transmission;
replacing the contents of each said altered channel of said bundle with zeroes;
iterating said steps of decoding and replacing for each of said bundles of said received Tl line frame; and second transferring said received Tl line frame with said altered channels being replaced with zeroes.

2. A decoding method for Tl line zero bit suppression as claimed in claim 1, said step of testing including the steps of:
moving said indicator bits from said received Tl line frame to an indicator register;
comparing said indicator register to a predefined value; and performing said step of first transferring for an equality condition of said comparison of said indicator register with said predefined value.

3. A decoding method for Tl line zero bit suppression as claimed in claim 2, said indicator bits being located in a first four low order bits of a last channel of said received Tl line frame.

4. A decoding method for Tl line zero bit suppression as claimed in claim 2, said predefined value being equal to the binary value 0000.

5. A decoding method for Tl line zero bit suppression as claimed in claim 2, said step of testing further including the steps of:
second comparing said last channel of said received Tl line frame with a second predefined value; and performing said step of first transferring for equality of said comparison of said last channel with said second predefined value.

6. A decoding method for Tl line zero bit suppression as claimed in claim 5, said second predefined value being equal to the binary value 00000001.

7. A decoding method for Tl line zero bit suppression as claimed in claim 5, wherein there is further included the step of initializing a bundle counter to a predefined value.

8. A decoding method for Tl line zero bit suppression as claimed in claim 7, said step of decoding including the steps of:
determining whether a bundle of said channels contains any channels with zero contents;
copying a first channel of said bundle to a mapping register, and second copying the contents of the first channel of said bundle, whose mapping register bit indicating a zero channel, to a displacement register.

9. A decoding method for Tl line zero bit suppression as claimed in claim 8, said step of replacing including the steps of:
setting the contents of a channel to the binary value 00000000 for said channel whose mapping register bit is equal to the binary value 1; and second iterating said step of setting for each of said channels with a corresponding mapping register bit equal to the binary value 1.

10. A decoding method for Tl line zero bit suppression as claimed in claim 9, said step of replacing further including the steps of:
second testing said mapping register bit corresponding to the first channel of said bundle to determine if said mapping register bit is equal to the binary value 0; and third copying said contents of said displacement register to said first channel of said bundle for equality of said second testing of said mapping register bit with said binary value 0.

11. A decoding method for T1 line zero bit suppression as claimed in claim 10, said step of iterating including the step of third testing to determine whether all bundles of said plurality of bundles of said received T1 line frame have been decoded.

12. A decoding method for T1 line zero bit suppression as claimed in claim 11, said step of third testing including the step of incrementing said bundle counter by one for said third testing indicating that all bundles of said received T1 line frame have not been decoded.

13. A decoding method for Tl line zero bit suppression as claimed in claim 12, wherein there is further included the step of performing said step of second transferring for an indication of said third testing that all said bundles of said plurality of said received Tl line frame have been decoded.

14. A decoding method for Tl line zero bit suppression as claimed in claim 13, said bundle including from one (1) to six (6) of said channels.

15. A decoding method for Tl line zero bit suppression as claimed in claim 14, said bundle including from seven (7) to forty-seven (47) of said channels.

16. A decoding method for Tl line zero bit suppression as claimed in claim 15, said encoded Tl line frame including from one (1) to four (4) of said bundles.

17. A decoding method for Tl line zero bit suppression as claimed in claim 16, said encoded Tl line frame including from five (5) to twelve (12) of said bundles.