CA2020343C - Time-division multiplex communication system with a synchronizing circuit at the receiving end which responds to the coding of words inserted in the transmitted information - Google Patents
Time-division multiplex communication system with a synchronizing circuit at the receiving end which responds to the coding of words inserted in the transmitted informationInfo
- Publication number
- CA2020343C CA2020343C CA002020343A CA2020343A CA2020343C CA 2020343 C CA2020343 C CA 2020343C CA 002020343 A CA002020343 A CA 002020343A CA 2020343 A CA2020343 A CA 2020343A CA 2020343 C CA2020343 C CA 2020343C
- Authority
- CA
- Canada
- Prior art keywords
- bit
- checking
- syndrome
- bits
- groups
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
- H04J3/06—Synchronising arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L7/00—Arrangements for synchronising receiver with transmitter
- H04L7/04—Speed or phase control by synchronisation signals
- H04L7/048—Speed or phase control by synchronisation signals using the properties of error detecting or error correcting codes, e.g. parity as synchronisation signal
Abstract
There are TDM communication systems in which synchron-ization is accomplished by means of code words which are transmitted at regular time intervals and coded in a particular code. In systems where the signals are trans-mitted in packets of uniform length, each of the code words contains the information of the so-called header of a packet. The checking device according to the inven-tion successively checks all n-bit bit groups (Xj to Xj+n-1) beginning with any one (Xj) of the successive bits of the received bit sequence as to whether they are coded in a particular code. This is done by calcu-lating the syndrome (S1 to Sn-k) in several networks (N1 to Nn-k) which operate in parallel and each of which calculates one syndrome component. The received bit se-quence is delayed until the networks have calculated the syndromes for a given n-bit bit group and until a syndrome evaluation circuit (LS) indicates whether the bit group is a code word.
Description
202û~43 p 39 22 486.4 Time-Division Multiplex Communicat;on System with a Synchronizing Circuit at the Receiving End which Responds to the Coding of Words In-serted in the Transmitted Information The present invention relates to a system as set forth in thepreamble of claim 1. Such a system is disclosed in DE-A1 37 35 377.
In this system, a so-called code word is derived from in-formation referred to there as "header", which contains a logic channel number, and transmitted subsequent to the information. In common technical terms, the information (K) is coded in a linear block code to form a code word whose number of bits is equal to the number of bits of theinformation (K) augmented by the number of added bits (called "c~e word CW" there). The number of bits in the code word consisting of the k-bit information (K) and the added b;ts will hereinafter be denoted by n. In the prior art system, such code words are inserted at the transmitting end into the bit sequence at regular time intervals, namely at the beginning of each so-called packet. At the receiving end, the prior art system includes a checking device which looks for the n-bit code words in the receivedbit sequence.
It does so by selecting a sequence of k bits from the B. X. Weis 1 20203~
received bit sequence and checking whether this k-bit sequence and the subsequently received n-k bits. (n-k is the number of bits added to the information K at the transmitting end) together represents a code word which is coded in the block code. If the checking device determines that the checked bit sequence is not coded in the block code, it will stop the search for the code word in the current packet and resume it in the next packet, in which it then selects a bit sequence which, referred to the beginning of the packet, begins one bit later than the bit sequence selected in the previously checked packet.
This means that considerable time may elapse until the n-bit word looked for is found in any packet. This, in turn, has the disadvantage that the synchronization of the receiver with the transmitter takes a long time, thus causing considerable information losses.
It is therefore the object of the invention to provide a time-division multiplex communication system of the above kind in which the synchronizing device at the receiving end finds the n-bit word faster, thus ensuring faster synchronization.
According to one aspect, the invention provides a time-division multiplex communication system comprising: a transmitting device which regularly encodes an n-bit word in a linear block code into a bit sequence to be transmitted and a checking device at a receiving end which looks for the n-bit word in the receiving bit sequence by checking groups of n successive bits as to whether they are coded in the block code, wherein the checking device (SRl, SR2, Nl, to Nn k~ LS) checks all n-bit groups (Xj to Xj+n 1) which begin with any one of (Xj) of the n successive bits of the received bit sequence by successively checking in parallel n-bit groups and by independently checking each n-bit group.
According to another aspect, the invention provides a method in a time-division multiplex communication system having a transmitting device which regularly encodes an n-bit word in a linear block code into a bit sequence to be transmitted, and a checking device at a receiving end, for checking for an n-bit word coded in a linear block code in a received bit sequence by checking groups of n successive bits, comprising the steps of: checking all n-bit groups (Xj to Xj+n 1) which begin with any one (Xj) of the successive bits in the bit sequence, by successively checking in parallel n-bit groups and by independently checking each n-bit group.
According to yet another aspect, the present invention provides a method for checking for an n-bit word coded in a linear block code in a bit sequence by checking groups of n successive bits, comprising the steps of: storing a selected number of the bit sequence; calculating each component of the syndrome (Sl to Sn k) from an n-bit group to be checked; determining a magnitude from the calculated components of the syndrome; successively and independently checking all n-bit groups (Xj to Xj+n 1) which begin with any one (Xj) of the successive bits in the bit sequence; and delaying the received bit sequence until the check of an n-bit group (Xj to Xj+n 1) is completed.
- 2a -~02~343 According to a further aspect, the present invention provides a checking device for time-division multiplex communication system having a transmitting device which regularly inserts an n-bit word coded in a linear block code into a bit sequence to be transmitted comprising: storage means, responsive to the transmitted bit sequence, for storing the bits thereof for providing the stored bits; and checking means, responsive to selected stored bits, for checking groups of n successive bits as to whether they are coded in the block code by checking all n-bit groups (Xj to Xj+n 1) which begin with any one (Xj) of the successive bits, by successively checking in parallel n-bit groups and by independently checking each n-bit group.
Aside from making it possible to quickly find the n-bit words coded in the block code, the invention has the advantage that none of the parts of the check circuit - 2b -~ 2020343 requires a processing clock frequency which is higher than the bit rate of the received bit sequence. Therefore, the checking device can be implemented in CMOS technology and, thus, at low cost even at a high bit rate of 150 Mb/s. Any circuit operating at higher clock frequencies could only be implemented in a more expensive technology , e.g., ECL.
Before the invention is described with reference to the accompanying drawings, it will be briefly explained what kind of mathematical check is used to determine whether the bit group is coded in the linear block code. Such a block code is commonly referred to as an (n,k)- block code, where n is the total number of bits per block, and k is the number of information bits per block.
According to a particular embodiment of the invention the checking of an n-bit group as to whether it is coded in the linear block code is done by calculating the syndrome on the basis of the parity check matrix of the linear block code used. That is not the case with the above-mentioned prior art checking device. As is well known, the syndrome, hereinafter denoted S, is a vector of dimension n-k and is calculated by multiplying the transpose of the parity check matrix H of the block code by the received block, hereinafter denoted X. Further details are described in a book by W.W. Peterson, "Error-Correcting Codes", Massachusetts Institute Of Technology and John Wiley & Sons, Inc., New York, London, 1961, pp. 30-36.
In this system, a so-called code word is derived from in-formation referred to there as "header", which contains a logic channel number, and transmitted subsequent to the information. In common technical terms, the information (K) is coded in a linear block code to form a code word whose number of bits is equal to the number of bits of theinformation (K) augmented by the number of added bits (called "c~e word CW" there). The number of bits in the code word consisting of the k-bit information (K) and the added b;ts will hereinafter be denoted by n. In the prior art system, such code words are inserted at the transmitting end into the bit sequence at regular time intervals, namely at the beginning of each so-called packet. At the receiving end, the prior art system includes a checking device which looks for the n-bit code words in the receivedbit sequence.
It does so by selecting a sequence of k bits from the B. X. Weis 1 20203~
received bit sequence and checking whether this k-bit sequence and the subsequently received n-k bits. (n-k is the number of bits added to the information K at the transmitting end) together represents a code word which is coded in the block code. If the checking device determines that the checked bit sequence is not coded in the block code, it will stop the search for the code word in the current packet and resume it in the next packet, in which it then selects a bit sequence which, referred to the beginning of the packet, begins one bit later than the bit sequence selected in the previously checked packet.
This means that considerable time may elapse until the n-bit word looked for is found in any packet. This, in turn, has the disadvantage that the synchronization of the receiver with the transmitter takes a long time, thus causing considerable information losses.
It is therefore the object of the invention to provide a time-division multiplex communication system of the above kind in which the synchronizing device at the receiving end finds the n-bit word faster, thus ensuring faster synchronization.
According to one aspect, the invention provides a time-division multiplex communication system comprising: a transmitting device which regularly encodes an n-bit word in a linear block code into a bit sequence to be transmitted and a checking device at a receiving end which looks for the n-bit word in the receiving bit sequence by checking groups of n successive bits as to whether they are coded in the block code, wherein the checking device (SRl, SR2, Nl, to Nn k~ LS) checks all n-bit groups (Xj to Xj+n 1) which begin with any one of (Xj) of the n successive bits of the received bit sequence by successively checking in parallel n-bit groups and by independently checking each n-bit group.
According to another aspect, the invention provides a method in a time-division multiplex communication system having a transmitting device which regularly encodes an n-bit word in a linear block code into a bit sequence to be transmitted, and a checking device at a receiving end, for checking for an n-bit word coded in a linear block code in a received bit sequence by checking groups of n successive bits, comprising the steps of: checking all n-bit groups (Xj to Xj+n 1) which begin with any one (Xj) of the successive bits in the bit sequence, by successively checking in parallel n-bit groups and by independently checking each n-bit group.
According to yet another aspect, the present invention provides a method for checking for an n-bit word coded in a linear block code in a bit sequence by checking groups of n successive bits, comprising the steps of: storing a selected number of the bit sequence; calculating each component of the syndrome (Sl to Sn k) from an n-bit group to be checked; determining a magnitude from the calculated components of the syndrome; successively and independently checking all n-bit groups (Xj to Xj+n 1) which begin with any one (Xj) of the successive bits in the bit sequence; and delaying the received bit sequence until the check of an n-bit group (Xj to Xj+n 1) is completed.
- 2a -~02~343 According to a further aspect, the present invention provides a checking device for time-division multiplex communication system having a transmitting device which regularly inserts an n-bit word coded in a linear block code into a bit sequence to be transmitted comprising: storage means, responsive to the transmitted bit sequence, for storing the bits thereof for providing the stored bits; and checking means, responsive to selected stored bits, for checking groups of n successive bits as to whether they are coded in the block code by checking all n-bit groups (Xj to Xj+n 1) which begin with any one (Xj) of the successive bits, by successively checking in parallel n-bit groups and by independently checking each n-bit group.
Aside from making it possible to quickly find the n-bit words coded in the block code, the invention has the advantage that none of the parts of the check circuit - 2b -~ 2020343 requires a processing clock frequency which is higher than the bit rate of the received bit sequence. Therefore, the checking device can be implemented in CMOS technology and, thus, at low cost even at a high bit rate of 150 Mb/s. Any circuit operating at higher clock frequencies could only be implemented in a more expensive technology , e.g., ECL.
Before the invention is described with reference to the accompanying drawings, it will be briefly explained what kind of mathematical check is used to determine whether the bit group is coded in the linear block code. Such a block code is commonly referred to as an (n,k)- block code, where n is the total number of bits per block, and k is the number of information bits per block.
According to a particular embodiment of the invention the checking of an n-bit group as to whether it is coded in the linear block code is done by calculating the syndrome on the basis of the parity check matrix of the linear block code used. That is not the case with the above-mentioned prior art checking device. As is well known, the syndrome, hereinafter denoted S, is a vector of dimension n-k and is calculated by multiplying the transpose of the parity check matrix H of the block code by the received block, hereinafter denoted X. Further details are described in a book by W.W. Peterson, "Error-Correcting Codes", Massachusetts Institute Of Technology and John Wiley & Sons, Inc., New York, London, 1961, pp. 30-36.
2~2~43 The ith component of the syndrome must be calculated from an n-bit block and the transpose of the parity check matrix as the scalar product of the ith row hi and the received block X, i.e., Sj=hjX=hj1X1+hj2X2+hi3X3 in n These components of the vector S are calculated by the check circuit according to the invention for each n-bit bit group which begins with any one of the successively received bits, i.e., for the first bit of the b;t sequence and the next n-1 bits, one bit period later for the second bit of the received bit sequence and the next n-1 bits, etc.
The syndrome calculation is commonly used for error de-tection. A given data word is examined as to whether it contains a code error, as in DE-A1 37 07 143, for example.
There, the syndrome calculation is not used to find out at what point a bit sequence transmitted at a high bit rate contains a word coded in the block code. The implementation of the circuit disclosed in that publi-cation also would be unsuitable for the present appli-cation, since it uses memories in which partial syn-dromes are stored, and since such a circuit, because of the memory access times and the EXCLUSIVE-OR gates folLowing the memories, would require too long a pro-cessing time for the present application.
In the following, it will be explained with the aid of the accompanying drawings how the calculation and B. X. Weis 1 2 0 2 ~ 3 1 3 checking of the syndrome S are performed for each n-bit bit group beginning with a bit of the received bit se-quence.
The invention will now be explained in greater detail, by way of example, with reference to the accompany;ng drawings, in which:
Fig. 1 is a block diagram of the checking deYice at the receiving end of the system accord-ing to the invention;
Fig. Z shows an embodiment of one of the networks N1 to Nn-k of Fig- 1;
Fig. 3 shows the logic diagram of one of the ele-ments E1 of Fig. 2, and Fig. 4 shows the logic diagram of one of the elements E2 of Fig. 2.
In the checking device shown in Fig. 1, the received bit sequence is applied to the serial input of a shift re-gister R1 having a length of n-1, i.e., n-1 series-con-nected flip-flops, if the code word to be found contains n-bits. Such a shift register has n-2 parallel outputs, so that n successively received bits of the bit sequence are made available in parallel for further processing.
If the bit appearing at the output of the shift register SR1 at any defined point of time is denoted Xj, the sub-sequent bits of the n-bit bit group beginning with the B. X. Weis 1 - 6 - 2~03 q3 bit Xj will appear simultaneously at the paralLel outputs of the shift register SR1, where they are denoted xj+1 to Xj+n-2' and at the input of the shift register SR1, with the bit appearing at the input of the shift register denoted xj+n 1. Since the shift reg;ster is controlled by a clock signal C whose frequency is equal to the re-ceived bit frequency, the n-bit word beginning with the bit xj+1 is made available for further processing in the next bit period.
The n-bit bit group made available for further processing in any bit period of the received bit sequence is applied in parallel to a bus designated n, of which selected conductors are connected to the inputs of networks N1 to Nn_k which are arranged and operated in parallel.
For each syndrome component Sj to be calculated as de-scribed above, there is one network, i.e., n-k networks, because the syndrome has n-k components, as mentioned above.
Of the n bits of the n-bit bit group to be checked, only those bits are entered into a network N; for which the associated value hjl is nonzero (above equation for Sj).
In the above equation for Sj, this means, for example, that in the network N;, which calculates the component S; of the syndrome if the values hj2 and hj3 are zero, only the first, fourth, and subsequent bits of the n-bit bit group are entered, while the bits appearing in the second and third positions of an n-bit bit group, no matter what binary vaLue they represent, are omitted.
Thus, based on the parity check matrix, a particular B. X. Weis 1 2~1ft" Q3f~3 selection of the n bits of an n-bit bit group to be checked is entered into each of the n-k networks N1 to N k for each component of the syndrome. The networks calculate their component of the syndrome by the above equati~on for S; in several stages.and, as will be explained w th the aid of Fig. 2, deliver their components Si of the syndrome simultaneously at their outputs, which are de-signated S1 to Sn_k.
Since the h;l of the parity check matrix can only have the value O or 1, and the additions given in the above equation are modulo-2 additions, the calculation to be performed consists of EXCLUSIVE-ORing the input bits severaltimes, which, as is well known, yields a 1 as a syndrome component in the presence of an odd number of ones and a O in the presence of an even number of ones.
The EXCLUSIVE-ORing of the input bits of one of the net-works, which is performed in several stages, takes place at the bit rate C of the received bit sequence. After a given number of bit periods, the syndrome for the n-bit bit group being checked is present at the outputs of the networks. Its bits pass through a logic circuit LS, which produces an output signal if the syndrome is zero (all components), thus indicating the detection of an n-bit code word.
B. X. Weis 1 . - 8 -2~2~3 From the output of the shift register SR1, the bit se-quence is applied to the serial input of a shift register SR2, which, too, is operated at the bit rate of the bit sequence and delays the bit sequence until the networks Nj have calculated the syndrome for an n-bit bit group beginning with the bit Xj. Thus, the first bit of a bit group will appear at the output of SR2 when the logic circuit LS indicates at its output whether this bit group is a code word or not. The logic circuit LS introduces no appreciable delay. If its delay should be too long, it may be compensated by lengthening the shift register SR2 corresDondingly.
The advantage of the checking device described so far lies in the fact that it checks the received bit se-quence bit by bit without any delay and does not re-quire a processing clock frequency which is higher than the bit frequency.
An embodiment of one of the networks N; of Fig. 1 will now be explained with the aid of Fig. 2. Fig. 2 shows a network N; for calculating a component Sj(j) from a bit group beginning with a bit Xj. The example assumes that nine of the n bits of the n-bit bit group to be checked, which begins with the bit Xj, have to be used for calculating the component Sj(j) of the syndrome.
(For the other bits, the associated h;l are nonzero).
The bits to be used for the calculation are denoted at the parallel inputs of N; by X(j-io) to X(j-i8).
In a stage ST1 of Nj, the input bits to be summed by modulo-2 additions are combined into arbitrary pairs, with each bit permitted to occur in only one pair. In the B. X. Weis 1 2~2~3~3 -_ 9 _ example shown, therefore, there are four pairs and one remaining bit, because the number of bits is odd. Each pair of bits is added modulo 2 in one of network ele-ments of a first type E1 in a first clock period and stored until the next clock period. The remaining bit is stored in a network element of a second type E2 until the next clock period.
The functi~s of the elements of the type E1 and type E2 are shown in Figs. 3 and 4~ respectively. An ele-ment E1 contains an EXCLUSIVE-OR gate A1, which forms the EXCLUSIVE-OR of two input bits applied at the in-puts x and y, i.e., adds them modulo 2, and a succeeding D flip-flop D1, which stores the result until receipt of the next clock pulse. The D flip-flop is controlled by the bit-rate clock C indicated in Figs. 1 and 2.
An element E2 serves to store a single bit applied at its input X in a D flip-flop D2 until receipt of the next clock pulse. It is also controlled by the clock C.
After the input bits of N; have been combined in pairs and the results and the remaining input bits have been temporarily stored in the first stage ST1 of N; in a first clock period, the temporarily stored results and the temporarily stored remaining bit of the stage ST
are processed in a corresponding manner in a stage ST2 upon receipt of the next clock putse. The input bits are again combined in pairs by elements E1, and the re-maining bit is stored in an element E2. Upon receipt of the next clock pulse, the results of stage ST2 are pro-cessed in a corresponding manner in a stage ST3, and upon receipt of a further clock pulse, a last stage ST4 ~B. X. Weis 1 2023~ ~3 calculates, in an element E1, the result bit, i.e., the component Sj(j) of the syndrome, from the results of stage ST3. In the example shown, i.e., with nine inputs, four stages are needed, so that four bit periods after the first bit Xj of an n-bit bit group beginning with this bit appeared at the output of the shift registers SR1 of Fig. 1, the network Ni has calculated the component Sj(j) of the syndrome of this bit group.
Each of the networks N; to N k has an individual number of input bits to be combined and a corresponding number Mj of stages necessary for this purpose. In order for the entire syndrome S(j) of an n-bit bit group be-ginning with the bit group Xj to appear at the outputs of the network N; simultaneously, those networks whose necessary number of stages M; is less than the greatest M; occurring in any one of the networks have additional stages including elements of type E2, so that all net-works will make available their components Sj(j) of the syndrome S(j) at their outputs at the same instant.
This instant is M bit periods ~ater than the in-stant at which Xj appears at the output of the shift register SR1 of Fig. 1, where M is the maximum number of stages required in any of the networks N;. The delay of the shift register SR2, mentioned above in connection with Fig. 1, is thus M bit periods~ Thus, the shift register SR2 delays the bit sequence until it has ~. X. Weis 1 2~2~3~3 been decided whether a particular bit group is a code word or not.
It should be added that instead of a shift register SR1, any other memory circuit can be used to make available the n-bit bit groups to be checked. This may also be a memory in which the bits of a received bit sequence are stored other than serially provided that it is possible to output successively received bits simultaneously as one n-bit bit group.
To optimize the circuit, the networks Ni may be inter-connected to permit the transfer of intermediate re-sults from one network to another, thus reducing the amount of circuit elements required.
B. X. Weis 1
The syndrome calculation is commonly used for error de-tection. A given data word is examined as to whether it contains a code error, as in DE-A1 37 07 143, for example.
There, the syndrome calculation is not used to find out at what point a bit sequence transmitted at a high bit rate contains a word coded in the block code. The implementation of the circuit disclosed in that publi-cation also would be unsuitable for the present appli-cation, since it uses memories in which partial syn-dromes are stored, and since such a circuit, because of the memory access times and the EXCLUSIVE-OR gates folLowing the memories, would require too long a pro-cessing time for the present application.
In the following, it will be explained with the aid of the accompanying drawings how the calculation and B. X. Weis 1 2 0 2 ~ 3 1 3 checking of the syndrome S are performed for each n-bit bit group beginning with a bit of the received bit se-quence.
The invention will now be explained in greater detail, by way of example, with reference to the accompany;ng drawings, in which:
Fig. 1 is a block diagram of the checking deYice at the receiving end of the system accord-ing to the invention;
Fig. Z shows an embodiment of one of the networks N1 to Nn-k of Fig- 1;
Fig. 3 shows the logic diagram of one of the ele-ments E1 of Fig. 2, and Fig. 4 shows the logic diagram of one of the elements E2 of Fig. 2.
In the checking device shown in Fig. 1, the received bit sequence is applied to the serial input of a shift re-gister R1 having a length of n-1, i.e., n-1 series-con-nected flip-flops, if the code word to be found contains n-bits. Such a shift register has n-2 parallel outputs, so that n successively received bits of the bit sequence are made available in parallel for further processing.
If the bit appearing at the output of the shift register SR1 at any defined point of time is denoted Xj, the sub-sequent bits of the n-bit bit group beginning with the B. X. Weis 1 - 6 - 2~03 q3 bit Xj will appear simultaneously at the paralLel outputs of the shift register SR1, where they are denoted xj+1 to Xj+n-2' and at the input of the shift register SR1, with the bit appearing at the input of the shift register denoted xj+n 1. Since the shift reg;ster is controlled by a clock signal C whose frequency is equal to the re-ceived bit frequency, the n-bit word beginning with the bit xj+1 is made available for further processing in the next bit period.
The n-bit bit group made available for further processing in any bit period of the received bit sequence is applied in parallel to a bus designated n, of which selected conductors are connected to the inputs of networks N1 to Nn_k which are arranged and operated in parallel.
For each syndrome component Sj to be calculated as de-scribed above, there is one network, i.e., n-k networks, because the syndrome has n-k components, as mentioned above.
Of the n bits of the n-bit bit group to be checked, only those bits are entered into a network N; for which the associated value hjl is nonzero (above equation for Sj).
In the above equation for Sj, this means, for example, that in the network N;, which calculates the component S; of the syndrome if the values hj2 and hj3 are zero, only the first, fourth, and subsequent bits of the n-bit bit group are entered, while the bits appearing in the second and third positions of an n-bit bit group, no matter what binary vaLue they represent, are omitted.
Thus, based on the parity check matrix, a particular B. X. Weis 1 2~1ft" Q3f~3 selection of the n bits of an n-bit bit group to be checked is entered into each of the n-k networks N1 to N k for each component of the syndrome. The networks calculate their component of the syndrome by the above equati~on for S; in several stages.and, as will be explained w th the aid of Fig. 2, deliver their components Si of the syndrome simultaneously at their outputs, which are de-signated S1 to Sn_k.
Since the h;l of the parity check matrix can only have the value O or 1, and the additions given in the above equation are modulo-2 additions, the calculation to be performed consists of EXCLUSIVE-ORing the input bits severaltimes, which, as is well known, yields a 1 as a syndrome component in the presence of an odd number of ones and a O in the presence of an even number of ones.
The EXCLUSIVE-ORing of the input bits of one of the net-works, which is performed in several stages, takes place at the bit rate C of the received bit sequence. After a given number of bit periods, the syndrome for the n-bit bit group being checked is present at the outputs of the networks. Its bits pass through a logic circuit LS, which produces an output signal if the syndrome is zero (all components), thus indicating the detection of an n-bit code word.
B. X. Weis 1 . - 8 -2~2~3 From the output of the shift register SR1, the bit se-quence is applied to the serial input of a shift register SR2, which, too, is operated at the bit rate of the bit sequence and delays the bit sequence until the networks Nj have calculated the syndrome for an n-bit bit group beginning with the bit Xj. Thus, the first bit of a bit group will appear at the output of SR2 when the logic circuit LS indicates at its output whether this bit group is a code word or not. The logic circuit LS introduces no appreciable delay. If its delay should be too long, it may be compensated by lengthening the shift register SR2 corresDondingly.
The advantage of the checking device described so far lies in the fact that it checks the received bit se-quence bit by bit without any delay and does not re-quire a processing clock frequency which is higher than the bit frequency.
An embodiment of one of the networks N; of Fig. 1 will now be explained with the aid of Fig. 2. Fig. 2 shows a network N; for calculating a component Sj(j) from a bit group beginning with a bit Xj. The example assumes that nine of the n bits of the n-bit bit group to be checked, which begins with the bit Xj, have to be used for calculating the component Sj(j) of the syndrome.
(For the other bits, the associated h;l are nonzero).
The bits to be used for the calculation are denoted at the parallel inputs of N; by X(j-io) to X(j-i8).
In a stage ST1 of Nj, the input bits to be summed by modulo-2 additions are combined into arbitrary pairs, with each bit permitted to occur in only one pair. In the B. X. Weis 1 2~2~3~3 -_ 9 _ example shown, therefore, there are four pairs and one remaining bit, because the number of bits is odd. Each pair of bits is added modulo 2 in one of network ele-ments of a first type E1 in a first clock period and stored until the next clock period. The remaining bit is stored in a network element of a second type E2 until the next clock period.
The functi~s of the elements of the type E1 and type E2 are shown in Figs. 3 and 4~ respectively. An ele-ment E1 contains an EXCLUSIVE-OR gate A1, which forms the EXCLUSIVE-OR of two input bits applied at the in-puts x and y, i.e., adds them modulo 2, and a succeeding D flip-flop D1, which stores the result until receipt of the next clock pulse. The D flip-flop is controlled by the bit-rate clock C indicated in Figs. 1 and 2.
An element E2 serves to store a single bit applied at its input X in a D flip-flop D2 until receipt of the next clock pulse. It is also controlled by the clock C.
After the input bits of N; have been combined in pairs and the results and the remaining input bits have been temporarily stored in the first stage ST1 of N; in a first clock period, the temporarily stored results and the temporarily stored remaining bit of the stage ST
are processed in a corresponding manner in a stage ST2 upon receipt of the next clock putse. The input bits are again combined in pairs by elements E1, and the re-maining bit is stored in an element E2. Upon receipt of the next clock pulse, the results of stage ST2 are pro-cessed in a corresponding manner in a stage ST3, and upon receipt of a further clock pulse, a last stage ST4 ~B. X. Weis 1 2023~ ~3 calculates, in an element E1, the result bit, i.e., the component Sj(j) of the syndrome, from the results of stage ST3. In the example shown, i.e., with nine inputs, four stages are needed, so that four bit periods after the first bit Xj of an n-bit bit group beginning with this bit appeared at the output of the shift registers SR1 of Fig. 1, the network Ni has calculated the component Sj(j) of the syndrome of this bit group.
Each of the networks N; to N k has an individual number of input bits to be combined and a corresponding number Mj of stages necessary for this purpose. In order for the entire syndrome S(j) of an n-bit bit group be-ginning with the bit group Xj to appear at the outputs of the network N; simultaneously, those networks whose necessary number of stages M; is less than the greatest M; occurring in any one of the networks have additional stages including elements of type E2, so that all net-works will make available their components Sj(j) of the syndrome S(j) at their outputs at the same instant.
This instant is M bit periods ~ater than the in-stant at which Xj appears at the output of the shift register SR1 of Fig. 1, where M is the maximum number of stages required in any of the networks N;. The delay of the shift register SR2, mentioned above in connection with Fig. 1, is thus M bit periods~ Thus, the shift register SR2 delays the bit sequence until it has ~. X. Weis 1 2~2~3~3 been decided whether a particular bit group is a code word or not.
It should be added that instead of a shift register SR1, any other memory circuit can be used to make available the n-bit bit groups to be checked. This may also be a memory in which the bits of a received bit sequence are stored other than serially provided that it is possible to output successively received bits simultaneously as one n-bit bit group.
To optimize the circuit, the networks Ni may be inter-connected to permit the transfer of intermediate re-sults from one network to another, thus reducing the amount of circuit elements required.
B. X. Weis 1
Claims (17)
1. Time-division multiplex communication system comprising:
a transmitting device which regularly encodes an n-bit word in a linear block code into a bit sequence to be transmitted and a checking device at a receiving end which looks for the n-bit word in the receiving bit sequence by checking groups of n successive bits as to whether they are coded in the block code, wherein the checking device (SR1, SR2, N1, to Nn-k, LS) checks all n-bit groups (Xj to Xj+n-1) which begin with any one of (Xj) of the n successive bits of the received bit sequence by successively checking in parallel n-bit groups and by independently checking each n-bit group.
a transmitting device which regularly encodes an n-bit word in a linear block code into a bit sequence to be transmitted and a checking device at a receiving end which looks for the n-bit word in the receiving bit sequence by checking groups of n successive bits as to whether they are coded in the block code, wherein the checking device (SR1, SR2, N1, to Nn-k, LS) checks all n-bit groups (Xj to Xj+n-1) which begin with any one of (Xj) of the n successive bits of the received bit sequence by successively checking in parallel n-bit groups and by independently checking each n-bit group.
2. A system as claimed in claim 1, wherein the checking device (SR1, SR2, N1 to Nn-k, LS) calculates a syndrome (S1 to Sn-k) for each of the n-bits groups (Xj to Xj+n-1) on the basis of a parity check matrix of the linear block code used and, if the syndrome (S1 to Sn-k) is zero, provides a signal indicating the presence of one of the n-bit words.
3. Time-division multiplex communication system comprising:
a transmitting device which regularly encodes an n-bit word in linear block code into a bit sequence to be transmitted, and a checking device (SR1, SR2, N1 to Nn-k, LS) at a receiving end which looks for the n-bit word in the received bit sequence by checking groups of n successive bits as to whether they are coded in the block code, wherein the checking device (SR1, SR2, N1 to Nn-k, LS) successively checks all n-bit groups (Xj to Xj+n-1) which begin with any one (Xj) of the n successive bits of the received bit sequence, wherein the checking device (SR1, SR2, N1 to Nn-k, LS) calculates a syndrome (S1 to Sn-k) is zero;
provides a signal indicating the presence of one of the n-bit words, and wherein the checking device (SR1, SR2, N1 to Nn-k, LS) contains a network (Ni) for each component (Si) of the syndrome (S1 to Sn-k) which calculates one component (Si) of the syndrome (S1 to Sn-k) from the n-bit group (Xj to Xj+n-1) to be checked, a logic (LS) which determines from the calculated components of the syndrome (S1 to Sn-k) whether the syndrome (S1 to Sn-k) is zero, and a delay circuit (SR2) which delays the received bit sequence until the check of an n-bit group is completed.
a transmitting device which regularly encodes an n-bit word in linear block code into a bit sequence to be transmitted, and a checking device (SR1, SR2, N1 to Nn-k, LS) at a receiving end which looks for the n-bit word in the received bit sequence by checking groups of n successive bits as to whether they are coded in the block code, wherein the checking device (SR1, SR2, N1 to Nn-k, LS) successively checks all n-bit groups (Xj to Xj+n-1) which begin with any one (Xj) of the n successive bits of the received bit sequence, wherein the checking device (SR1, SR2, N1 to Nn-k, LS) calculates a syndrome (S1 to Sn-k) is zero;
provides a signal indicating the presence of one of the n-bit words, and wherein the checking device (SR1, SR2, N1 to Nn-k, LS) contains a network (Ni) for each component (Si) of the syndrome (S1 to Sn-k) which calculates one component (Si) of the syndrome (S1 to Sn-k) from the n-bit group (Xj to Xj+n-1) to be checked, a logic (LS) which determines from the calculated components of the syndrome (S1 to Sn-k) whether the syndrome (S1 to Sn-k) is zero, and a delay circuit (SR2) which delays the received bit sequence until the check of an n-bit group is completed.
4. A system as claimed in claim 3, wherein the checking device (SR1, SR2, N1 to Nn-k, LS) processes the received bit sequence at the bit rate (C).
5. A system as claimed in claim 4, wherein in the checking device (SR1, SR2, N1 to Nn-k, LS), each bit of an n-bit group (Xj to Xj+n-1) to be checked is fed into each of the networks (Ni) in parallel, and that each of the networks (Ni) calculates its component (Si) of the syndrome (S1 to Sn-k) in several successive stages by exclusive-ORing its input bits in accordance with the parity check matrix.
6. A system as claimed in claim 5, wherein the received bit sequence passes through an (N-1)-bit shift register (SR1) which provides an n-bit group (Xj to Xj+n-1) to the networks (N1 to Nn-k) on each pulse of the bit rate (C).
7. A system as claimed in claim 6, wherein each network (Ni) is fed only with those bits of the n-bit bit group (Xj to Xj+n-1) for which the associated parity check matrix components to be used in the network (Ni) are non-zero.
8. A system as claimed in claim 7, wherein those networks (Ni) whose number (Mi) of stages (ST1 to ST4) is less than the maximum number of stages required in any of the networks have additional stages including delay elements (E2), so that all the networks (N1 to Nn-k) provide their components (Si) of the syndrome (S1 to Sn-k) at their outputs simultaneously.
9. A method in a time-division multiplex communication system having a transmitting device which regularly encodes an n-bit word in a linear block code into a bit sequence to be transmitted, and a checking device at a receiving end, for checking for an n-bit word coded in a linear block code in a received bit sequence by checking groups of n successive bits, comprising the steps of:
checking all n-bit groups (Xj to xj+n-1) which begin with any one (Xj) of the successive bits in the bit sequence, by successively checking in parallel n-bit groups and by independently checking each n-bit group.
checking all n-bit groups (Xj to xj+n-1) which begin with any one (Xj) of the successive bits in the bit sequence, by successively checking in parallel n-bit groups and by independently checking each n-bit group.
10. A method of claim 9, wherein the successively checking step comprises the steps of:
calculating a syndrome (S1 to Sn-k) for each of the n-bit groups on the basis of a parity check matrix of the linear block code; and if the syndrome is zero, providing a signal indicating the presence of the n-bit words.
calculating a syndrome (S1 to Sn-k) for each of the n-bit groups on the basis of a parity check matrix of the linear block code; and if the syndrome is zero, providing a signal indicating the presence of the n-bit words.
11. A method for checking for an n-bit word coded in a linear block code in a bit sequence by checking groups of n successive bits, comprising the steps of:
storing a selected number of the bit sequence;
calculating each component of the syndrome (S1 to Sn-k) from an n-bit group to be checked;
determining a magnitude from the calculated components of the syndrome;
successively and independently checking all n-bit groups (Xj to Xj+n-1) which begin with any one (Xj) of the successive bits in the bit sequence; and delaying the received bit sequence until the check of an n-bit group (Xj to Xj+n-1) is completed.
storing a selected number of the bit sequence;
calculating each component of the syndrome (S1 to Sn-k) from an n-bit group to be checked;
determining a magnitude from the calculated components of the syndrome;
successively and independently checking all n-bit groups (Xj to Xj+n-1) which begin with any one (Xj) of the successive bits in the bit sequence; and delaying the received bit sequence until the check of an n-bit group (Xj to Xj+n-1) is completed.
12. A checking device for time-division multiplex communication system having a transmitting device which regularly inserts an n-bit word coded in a linear block code into a bit sequence to be transmitted comprising:
storage means, responsive to the transmitted bit sequence, for storing the bits thereof for providing the stored bits; and checking means, responsive to selected stored bits, for checking groups of n successive bits as to whether they are coded in the block code by checking all n-bit groups (Xj to Xj+n-1) which begin with any one (Xj) of the successive bits, by successively checking in parallel n-bit groups and by independently checking each n-bit group.
storage means, responsive to the transmitted bit sequence, for storing the bits thereof for providing the stored bits; and checking means, responsive to selected stored bits, for checking groups of n successive bits as to whether they are coded in the block code by checking all n-bit groups (Xj to Xj+n-1) which begin with any one (Xj) of the successive bits, by successively checking in parallel n-bit groups and by independently checking each n-bit group.
13. The checking device of claim 12, wherein the checking means calculates a syndrome (S1 to Sn-k) for each of the n-bit groups on the basis of a parity check matrix of the linear block code used and, if the syndrome is zero, provides a signal indicative of the presence of one of the n-bit words.
14. A system as claimed in claim 12, wherein processing within the checking means takes place at a bit rate (C) of the received bit sequence.
15. The checking device of claim 12, wherein in the checking means, an n-bit group (Xj to Xj+n-1) to be checked is fed into each of a plurality of networks (Ni) in parallel, and that each of the networks calculates its component (Si) of the syndrome (S1 to Sn-k) in several successive stages by exclusive-ORing its input bits in accordance with a parity check matrix.
16. A checking device for a time-division multiplex communication system having a transmitting device which regularly inserts an n-bit word coded in a linear block code into a bit sequence to be transmitted, comprising:
storage means, responsive to the transmitted bit sequence for storing the bits thereof for providing the stored bits;
checking means, responsive to selected stored bits, for checking groups of n successive bits as to whether they are coded in the block code by successively checking all n-bit groups (Xj to Xj+n-1) which begin with any one (Xj) of the successive bits;
a network (Ni) for each component (Si) of the syndrome (S1 to Sn-k) which calculates one component (Si) of the syndrome (S1 to Sn-k) from the n-bit group (Xj to Xj+n-1) to be checked;
a logic means (LS) which determines from the calculated components of the syndrome (S1 to Sn-k) whether the syndrome is zero; and a delay circuit (SR2) which delays the received bit sequence until the check of an n-bit bit group is completed.
storage means, responsive to the transmitted bit sequence for storing the bits thereof for providing the stored bits;
checking means, responsive to selected stored bits, for checking groups of n successive bits as to whether they are coded in the block code by successively checking all n-bit groups (Xj to Xj+n-1) which begin with any one (Xj) of the successive bits;
a network (Ni) for each component (Si) of the syndrome (S1 to Sn-k) which calculates one component (Si) of the syndrome (S1 to Sn-k) from the n-bit group (Xj to Xj+n-1) to be checked;
a logic means (LS) which determines from the calculated components of the syndrome (S1 to Sn-k) whether the syndrome is zero; and a delay circuit (SR2) which delays the received bit sequence until the check of an n-bit bit group is completed.
17. A checking device for a time-division multiplex communication system having a transmitting device which regularly inserts an n-bit word coded in a linear block code into a bit sequence to be transmitted, comprising:
storage means, responsive to the transmitted bit sequence, for storing the bits thereof for providing the stored bits; and checking means, responsive to selected stored bits, for checking groups of n successive bits as to whether they are coded in the block code by successively checking all n-bit groups (Xj to Xj+n-1) which begin with any one (Xj) of the successive bits;
wherein the received bit sequence passes through the storage means comprising an (n-1)-bit shift register (SR1), which provides an n-bit bit group (Xj to Xj+n-1) to a plurality of networks (N1 to Nn-k) on each pulse of a bit clock (C);
wherein each network (Ni) is fed only with those bits of the n-bit group (Xj to Xj+n-1) for which the associated parity check matrix components to be used in the network (Ni) are non-zero;
wherein the network (Ni) whose number (Mi) of stages (ST1 to ST4) is less than the maximum number of stages required in any of the networks of additional stages, including delay elements (E2), so that all networks (N1 to Nn-k) provide their components (Si) of the syndrome (S1 to Sn-k) at their outputs simultaneously.
storage means, responsive to the transmitted bit sequence, for storing the bits thereof for providing the stored bits; and checking means, responsive to selected stored bits, for checking groups of n successive bits as to whether they are coded in the block code by successively checking all n-bit groups (Xj to Xj+n-1) which begin with any one (Xj) of the successive bits;
wherein the received bit sequence passes through the storage means comprising an (n-1)-bit shift register (SR1), which provides an n-bit bit group (Xj to Xj+n-1) to a plurality of networks (N1 to Nn-k) on each pulse of a bit clock (C);
wherein each network (Ni) is fed only with those bits of the n-bit group (Xj to Xj+n-1) for which the associated parity check matrix components to be used in the network (Ni) are non-zero;
wherein the network (Ni) whose number (Mi) of stages (ST1 to ST4) is less than the maximum number of stages required in any of the networks of additional stages, including delay elements (E2), so that all networks (N1 to Nn-k) provide their components (Si) of the syndrome (S1 to Sn-k) at their outputs simultaneously.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| DEP3922486.4 | 1989-07-08 | ||
| DE3922486A DE3922486A1 (en) | 1989-07-08 | 1989-07-08 | TIME MULTIPLEX MESSAGE TRANSMISSION SYSTEM WITH A RECEIVING-SIDE RECORDING SYSTEM RESPECTING THE CODING OF WORDS INSERTED INTO THE TRANSMITTED MESSAGE |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2020343A1 CA2020343A1 (en) | 1991-01-09 |
| CA2020343C true CA2020343C (en) | 1996-05-21 |
Family
ID=6384556
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002020343A Expired - Fee Related CA2020343C (en) | 1989-07-08 | 1990-07-03 | Time-division multiplex communication system with a synchronizing circuit at the receiving end which responds to the coding of words inserted in the transmitted information |
Country Status (10)
| Country | Link |
|---|---|
| EP (1) | EP0407903B1 (en) |
| JP (1) | JP2555213B2 (en) |
| KR (1) | KR0162647B1 (en) |
| AT (1) | ATE134465T1 (en) |
| AU (1) | AU633109B2 (en) |
| CA (1) | CA2020343C (en) |
| DE (2) | DE3922486A1 (en) |
| DK (1) | DK0407903T3 (en) |
| ES (1) | ES2086333T3 (en) |
| HU (1) | HU208772B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5632727A (en) * | 1988-10-03 | 1997-05-27 | Atrix Laboratories, Inc. | Biodegradable film dressing and method for its formation |
| US5267249A (en) * | 1991-05-09 | 1993-11-30 | Codex Corporation | Device and method for asynchronous cyclic redundancy checking for digital receivers |
| DE19736434C3 (en) | 1997-08-21 | 2002-08-22 | Nokia Mobile Phones Ltd | Methods and devices for recognizing the position of data packets lying in a serial data reception stream |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US3678469A (en) * | 1970-12-01 | 1972-07-18 | Ibm | Universal cyclic division circuit |
| IT1006135B (en) * | 1973-12-27 | 1976-09-30 | Sits Soc It Telecom Siemens | CIRCUIT ARRANGEMENTS FOR CORRECTION OF THE SLIDING ERROR IN DATA TRANSMISSION SYSTEMS USING CYCLIC CODES |
| JPS51113506A (en) * | 1975-03-31 | 1976-10-06 | Hitachi Ltd | Synchronizing equipment for digital code transmission |
| US4755993A (en) * | 1986-07-16 | 1988-07-05 | Northern Telecom Limited | Transmission system using forward error correction |
| US4847877A (en) * | 1986-11-28 | 1989-07-11 | International Business Machines Corporation | Method and apparatus for detecting a predetermined bit pattern within a serial bit stream |
| DE3707143A1 (en) * | 1987-03-06 | 1988-09-15 | Blaupunkt Werke Gmbh | DEVICE FOR RECEIVING DATA |
| DE3735377A1 (en) * | 1987-10-19 | 1989-04-27 | Siemens Ag | Method for synchronizing a time-division multiplex system for a transmission of packets of uniform length |
-
1989
- 1989-07-08 DE DE3922486A patent/DE3922486A1/en not_active Withdrawn
-
1990
- 1990-06-29 AU AU58011/90A patent/AU633109B2/en not_active Ceased
- 1990-07-03 HU HU904068A patent/HU208772B/en not_active IP Right Cessation
- 1990-07-03 CA CA002020343A patent/CA2020343C/en not_active Expired - Fee Related
- 1990-07-06 AT AT90112908T patent/ATE134465T1/en not_active IP Right Cessation
- 1990-07-06 ES ES90112908T patent/ES2086333T3/en not_active Expired - Lifetime
- 1990-07-06 DE DE59010143T patent/DE59010143D1/en not_active Expired - Lifetime
- 1990-07-06 EP EP90112908A patent/EP0407903B1/en not_active Expired - Lifetime
- 1990-07-06 DK DK90112908.0T patent/DK0407903T3/en active
- 1990-07-06 JP JP2177622A patent/JP2555213B2/en not_active Expired - Lifetime
- 1990-07-07 KR KR1019900010262A patent/KR0162647B1/en not_active IP Right Cessation
Also Published As
| Publication number | Publication date |
|---|---|
| KR0162647B1 (en) | 1998-12-01 |
| JP2555213B2 (en) | 1996-11-20 |
| CA2020343A1 (en) | 1991-01-09 |
| EP0407903A2 (en) | 1991-01-16 |
| AU5801190A (en) | 1991-01-10 |
| ATE134465T1 (en) | 1996-03-15 |
| ES2086333T3 (en) | 1996-07-01 |
| KR910003963A (en) | 1991-02-28 |
| JPH03139033A (en) | 1991-06-13 |
| EP0407903B1 (en) | 1996-02-21 |
| DE3922486A1 (en) | 1991-01-17 |
| EP0407903A3 (en) | 1992-12-02 |
| AU633109B2 (en) | 1993-01-21 |
| HU208772B (en) | 1993-12-28 |
| DK0407903T3 (en) | 1996-06-10 |
| HU904068D0 (en) | 1990-12-28 |
| HUT57967A (en) | 1991-12-30 |
| DE59010143D1 (en) | 1996-03-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP0448074B1 (en) | Synchronization circuit for ATM cells | |
| US5781129A (en) | Adaptive encoder circuit for multiple data channels and method of encoding | |
| US4506372A (en) | Method and apparatus for recognizing in a receiver the start of a telegram signal consisting of a bit impulse sequence | |
| US5566193A (en) | Method and apparatus for detecting and preventing the communication of bit errors on a high performance serial data link | |
| US5251215A (en) | Modifying check codes in data packet transmission | |
| US5844923A (en) | Fast framing of nude ATM by header error check | |
| EP0539567B1 (en) | Device and method for asynchronous cyclic redundancy checking for digital receivers | |
| US4105999A (en) | Parallel-processing error correction system | |
| EP0600380B1 (en) | Method and device for detection and correction of errors in ATM cell headers | |
| JPH04284753A (en) | Crc arithmetic method and hec synchronization device in atm exchange system | |
| US4667327A (en) | Error corrector for a linear feedback shift register sequence | |
| JPS592416B2 (en) | digital correlation receiver | |
| US4302831A (en) | Method and circuit arrangement for clock synchronization in the transmission of digital information signals | |
| US4646329A (en) | Recovery of frame alignment word having bits distributed in a digital transmission signal | |
| EP0596736B1 (en) | Split channel data transmission | |
| US3938086A (en) | Circuit arrangement for correcting slip errors in pcm receivers | |
| US5852639A (en) | Resynchronization apparatus for error correction code decoder | |
| CA2020343C (en) | Time-division multiplex communication system with a synchronizing circuit at the receiving end which responds to the coding of words inserted in the transmitted information | |
| US5280484A (en) | Time-division multiplex communication system with a synchronizing circuit at the receiving end which responds to the coding of words inserted in the transmitted information | |
| US4481648A (en) | Method and system for producing a synchronous signal from _cyclic-redundancy-coded digital data blocks | |
| US6041434A (en) | Code generator for selectively producing cyclic redundancy check data codes different in data length | |
| US4538271A (en) | Single parity bit generation circuit | |
| US4285047A (en) | Digital adder circuit with a plurality of 1-bit adders and improved carry means | |
| US6832231B1 (en) | Multiple width random number generation | |
| US20050025191A1 (en) | Pseudorandom data pattern verifier with automatic synchronization |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |