System and method for detecting character boundaries in a serial coded data stream

Abstract: The present invention relates to a system for detecting a character boundary in a data stream encoded in a serial code comprising means (11) responsive to the transmitted data stream for coupling a number of character bits to a utilisation means, the coupling means being responsive to a skip bit signal for moving the character boundary by one bit, means (17, 21) coupled to the coupling means and responsive to the number of character bits for detecting if there is a zero character disparity and a code error, skip signal providing means (27) responsive to a code error for providing a skip signal to the coupling means in the presence of a detected code error, and means (23), coupled to the skip signal providing means, and responsive to detection of a zero disparity character for inhibiting said skip signal. The present invention also relates to a method for detecting a character boundary in a data stream encoded in a serial code comprising the steps of determining the absence of a zero disparity character, detecting code errors, and shifting the character boundary of the serial data stream by one bit when there is absence of a zero disparity character and presence of detected code errors.

Description: This invention relates to character synchronisation of a data stream encoded in a serial code and more particularly to determining the character boundaries in the data stream. The primary purpose of transmission codes is to transform the frequency spectrum of a serial data stream so that clocking can be recovered readily and a.c. coupling is possible. The code must also provide special characters outside the data alphabet for a function such as character synchronisation, frame delimiters and perhaps abort, reset, idle, diagnostics, etc. Codes are also used, often in combination with signal waveform shaping, to adapt the signal spectrum more closely to the specific channel requirements. In most cases a reduction in bandwidth by constraints on both the high and low frequency components is desirable to reduce distortion in the transmission media, especially electromagnetic cables, or in the band limited receiver, and reduce the effects on intrinsic noise. For fibre optic links and wire links, interest centres for many reasons on the family of two-level codes. For wire links one prefers the code with no d.c. and little low frequency content in order to d.c. isolate the transmission line for the driver and receiver circuitry, usually by transformers, and to reduce signal distortion on the line. Although these factors do not apply to fibre optic links, good low frequency characteristics of the code are helpful for a number of reasons. The high gain fibre optic receivers need an a.c. coupling stage near the front end. The control of the drive level, receiver gain, and equalisation is simplified and the precision of control is improved, if it can be based on the average signal power, especially at top rates. D.C. restore circuits tend to lose precision with rising data rates and cease to operate properly below the maximum rates for other circuits required in a transceiver. Finally, if the time constants associated with the parasitic capacitances at the front end of a receiver are comparable to or longer than a baud interval, a signal with reduced low frequency content will suffer less distortion and will enable many links to operate without an equalising circuit. The Manchester and related codes are simple two-level codes and solve the clocking and low frequency problems as well. They translate each bit into two bits for transmission and are a good choice whenever the high clocking rates cause no problems in logic or analog circuits, the transducers or on the transmission line. They also reduce the data transmission rate by a factor of two since they encode 2 bits for every data bit. Simple 5 bit/6 bit codes translate 5 binary bits into 6 binary bits and raise the number of information bits transmitted per baud interval to 0.833. Unfortunately, the implementation of a 5 bit/6 bit code in a byte-oriented (8 bit) system causes burdens in complexity. It is for this reason that an 8-bit/10-bit (8/10) partitioned block transmission code invented by Franaczek et al. and described in US-A-4,486,739 is highly desirable when dealing with an 8-bit byte system. In this patent a binary d.c. balance code encoder circuit for effecting the same is described which translates the 8-bit byte of information into 10 binary bits for transmission over electromagnetic or optical transmission lines subject to timing and low frequency constraints. The significance of this code is that it combines the low circuit count for implementation with excellent performance near the limits and measured with respect to the criteria. The 8-bit/10-bit code is partitioned into a 5-bit/6-bit block plus a 3-bit/4-bit block code which, when used in concert, allow a byte of data plus a control bit called the "K" bit to be encoded into 10 bits. In applications where the resulting encoded data is put into a serial data stream, the data is put into the serial data stream with the least significant bit going first. The receiver of this serial data will have to figure out where each of the 10 bits of the code lies in the serial data stream. It turns out there are ten possible places - which are referred to as "character boundaries" - where each of the group of 10 bits may lie. If this character boundary is incorrectly determined then the receiver of the serial data will build its ten bits to decode from the bits of two different 8/10 characters. Consequently, incorrect data will be received and many errors will result since the incorrectly acquired 8/10 character will not follow the rules of the 8/10 code in a consistent fashion. In codes such as biphase, Manchester or NRZI the bits are encoded bit by bit, not in groups. The concept of character boundary does not mean anything for biphase, Manchester, and other bit oriented codes. In the 8/10 code, one must establish a character boundary before one can successfully decode 8/10 characters. Therefore, special attention must be paid to how the appropriate character boundary can be found in a reliable fashion. The arrangement described in US-A-4,486,739 finds the 8/10 code boundary by looking for five contiguous l's in the serial data stream. There are two valid 8/10 characters that have five contiguous 1's in them called K28.5 and K28.7. The circuit required to achieve character synchronisation on five contiguous l's has proved to be troublesome from a timing perspective and it consumed considerable power and/or considerable circuitry depending on which of several implementations were pursued. IBM Technical Disclosure Bulletin, vol. 27, no. 9, Feb. 1985, pages 5272 to 5279 discloses a code for a sequence of data bits which can be used for detecting errors in words in the sequence by checking the parity of bits in the sequence. The object of the present invention is to provide an improved system and method for detecting character boundaries in a data stream encoded in a serial code. The present invention provides a system for detecting a character boundary in a data stream of sequential character bits encoded in a serial code comprising a utilisation means, coupling means supplied with the data stream for coupling a group of sequential character bits to the utilisation means, detection means in the utilisation means for detecting a character boundary in the group of sequential character bits coupled to the utilisation means, generating means in the utilisation means for generating a control signal if a character boundary cannot be detected in the group of sequential character bits coupled to the utilisation means, and character bit group changing means in the utilisation means responsive to the control signal for changing the group of sequential character bits, wherein the detection means comprises means coupled to the coupling means and responsive to the group of character bits for detecting if there is a zero character disparity and a code error, the character bit group changing means comprises means for deleting the first character bit in the group and for adding at the end of the group the next character bit in the sequence, the generating means is responsive to the detection of a code error for generating the control signal when a code error is detected, and the generating means is responsive to the detection of a zero disparity for inhibiting the control signal. The present invention also provides a method of detecting a character boundary in a data stream of sequential character bits encoded in a serial code, the method comprising the steps of coupling a group of sequential character bits to a utilisation means, detecting a character boundary in the group of sequential character bits coupled to the utilisation means, generating a control signal if a character boundary cannot be detected in the group of sequential character bits coupled to the utilisation means, and, responsive to the control signal, changing the group of sequential character bits, wherein the detection operation comprises detecting if there is a zero character disparity and a code error, the changing operation comprises deleting the first character bit in the group and adding at the end of the group the next character bit in the sequence, responsive to the detection of a code error generating the control signal when a code error is detected, and, responsive to the detection of a zero disparity, inhibiting the control signal. In order that the invention may be more readily understood an embodiment will now be described with reference to the accompanying drawings, in which: Fig. 1 is a chart indicting the ten possible character boundaries for a serial data stream encoded in the 8/10 code, Fig. 2 is a block diagram of a character synchronisation system, Fig. 3 is a skip control circuit for the system illustrated in Fig. 2, Fig. 4 is a logic block diagram for detecting 5/6 and 3/4 bit blocks which have character disparity of zero, Fig. 5 is a flow chart useful for describing the operation of the system illustrated in Fig. 2, and Figs. 6 and 7 are the logic and flow chart, respectively, of the character synchronisation decision system of Fig. 2. In a serial data stream encoded in the 8/10 code there are ten possible character boundaries. In a code such as biphase, Manchester or NRZI the bits are encoded bit-by-bit (not in groups). In 8/10 code, bits are encoded a byte at a time. A byte in this case consists of eight data bits plus a control bit defined in the 8/10 code as the "K" bit. In the 8/10 code it is necessary to establish a character boundary before 8/10 characters can be successfully decoded. Since encoded 8/10 characters are ten bits long, the appropriate character boundary can lie in any one of ten positions in the serial data stream. The ten bits of an 8/10 encoded data stream are referred to as: a b c d e i f g h j where a is the least significant bit and the first to arrive at the deserialiser and j is the most significant bit and the last to arrive at the deserialiser. Fig. 1 shows the ten ways these bits can be arranged in the serial data stream in any 20-bit snapshot of the serial data stream. For an 8/10 character to be correctly decoded and checked cut as a valid character in a consistent fashion, the 8/10 decoder needs to receive the 10 bits with the "a" bit in the least significant bit position and the other nine bits alongside it and in their correct positions with respect to "a". In the arrangement to be described, the character synchronisation boundary is determined by hunting through all of the ten possible character boundaries one at a time until a boundary is found where error-free 8/10 data has been seen for an extended period. In implementing this technique, each new character boundary is reached by moving the 10 bits decoded over by 1 bit in the incoming data stream. The new character is tested for a zero disparity character and error code violations. As mentioned previously these 10 bit characters are partitioned into blocks of 6 bits followed by 4 bits. A character's disparity is determined by the number of logic l's compared to the number of logic 0's in each block. A block with equal logic l's and 0's has zero disparity except for the D.7 6-bit sub-block and the D/K.X.3 4-bit sub-block. A block with more logic l's than logic 0's has positive disparity and a block with less logic l's than logic 0's has negative disparity. The character disparity is zero if both its 6-bit and 4-bit blocks taken individually have an equal number of ones and zeros and the 6-bit block is not equal to D.7 and the 4-bit block is not equal to D/K.X.3. Block disparity is represented by D0 in Table 1 of US-A-4,486,739. Running disparity is the disparity after each bit, and can vary within the range of -3 to +3 to avoid a disparity error. The running disparity after both the 6-bit and 4-bit blocks must equal +1 or -1 to avoid a disparity error. Running disparity at the beginning of each block or character is represented by D-1 in Tables 1, 2 and 3 of US-A-4,486,739. Referring to Fig. 2, the deserialiser 11 is of the type which has a skip function input which changes its character boundary one bit at a time when a skip pulse is applied as shown. For more details of such a deserialiser, see United States patent application serial number 07/114,178 filed 29 October 87 (European Patent application number EP-A-0313875). The output of the deserialiser is coupled to two parallel five place parallel registers 13 which in turn are coupled to a ten bit parallel register 15. The output from register 15 is then coupled to the 8/10 bit decoder 17 producing 8 bit and K bit outputs. The output of the decoder is passed to unit 19 which produces conventional bus and tag control bits which can be coupled, for example, to a control unit. In the system described above the serial signals to the deserialiser 11 may be sent, for example, from a serial bus line of the electromagnetic or optical type and the input of the deserialiser may include an optical electromagnetic receiver of conventional type. The input signals may be sent for example from a computer which itself transmits serial signals or, in the alternative, may be on conventional parallel bus and tag bits which are serialised by a serialiser well known in the state of the art. Such serialisers and deserialisers are well known in the state of the art. One such serialiser system using serialisers and deserialisers is the 3044 Fiber-Optic Channel Extended Link Models C01 and D01 product of IBM Corporation. Also US-A-4,366,478 or US-A-4,642,629, describe systems using serialisers and deserialisers. The output of register 15 is also coupled to an 8/10 error detector 21. The output of the 8/10 error detector is held in latch 22. The output from the register 15 is also coupled to an 8/10 bit disparity computation unit 23. The running disparity is coupled or held in a disparity latch 25. The outputs from the error detector and the disparity computation are coupled to skip control signal generator 27. The output from the skip control signal generator is applied as the skip control signal to the skip control input of the deserialiser 11. The skip control generator circuit is shown in Fig. 3. Referring to Fig. 3, the skip control generator circuit 27 includes a counter 30 and comparator 31 for producing a logic 1 level signal when the counter 30 has detected a predetermined number of machine cycles (x cycles) following reset which occurs when a new skip signal is provided to the deserialiser. The number of cycles (x) is equal to the number of system clock pulses it takes to flush out the bits from the old character boundary so that the circuitry is using bits from the new character boundary. This may take for example three system clock pulses. This logic "1" level from comparator 31 provides one input to AND gate 33. Referring to Fig. 2, the disparity computation circuit 23 has two outputs. This first output provides a running disparity to latch 25. The second output presents a signal (stop skip) if there is a zero disparity character. Referring to Fig. 3, the output from disparity computation is inverted at inverter 32 and applied to the AND gate 33 to enable the AND gate 33 when there is not a zero disparity character, in other words when the character disparity is positive or negative. The enabled output from AND gate 33 sets latch 35 to provide an enable signal to AND gate 37. AND gate 37 when enabled couples any error signal from 8/10 error detector to enable skip latch 39 and provide a skip signal to the deserialiser, reset the counter 30 and reset the allow skip latch 35 via OR gate 40. As shown in Fig. 2, the system includes a character synchronisation decision circuit 29 which, when this decision circuit decides that the character boundary is lost, provides a "hunt for sync" signal to Fig. 3. The "hunt for sync" is inverted by inverter 41, degating OR gate 40, which stops resetting latch 35, allowing latch 35 to set to permit the skip function. This character synchronisation circuit 29 is described by Leon Skarshinski in IBM Technical Disclosure Bulletin Vol. 28, No. 12, May 1986 entitled "Character Synchronization Method". The referenced "allow character sync" signal is the "hunt for sync" signal. Figs. 6 and 7 of this Application are from the above Technical Disclosure Bulletin. A problem in implementing a serial protocol with run-length-limited code is to determine reliably when character synchronisation is lost, and when it is reacquired. This is because the high-speed logic, if allowed, will reset the character clock every time that a predetermined character is encountered, potentially slivering character clocks and producing unexpected results in low speed logic. A loss of character synchronisation poses a problem only when a frame is being received and processed by a port; this loss of sync at the beginning of a long frame will not be noticed until a frame trailer or an idle sequence is encountered. The method being described uses code violation statistics to recognise when the character clock is aligned with the incoming characters. Misalignment of the character clock and the data will produce code violations with a probability p(cv). An examination of a few characters shows that this probability is about 0.5 for a string of data and is close to 1.0 for an idle string. The method discussed will work well with a long string of data and, therefore, will also work for any other string in a selected code. Given N and M counters, the N counter will count up to N character clock cycles when started by a code violation. If no additional code violations are detected during this time, the M counter would be incremented; if a code violation is encountered, the N counter is reset and the M counter is decremented. (The M counter cannot increment through the all '1' state and cannot decrement through the all '0' state.) The state of the M counter will indicate in or out of character synchronism, as shown below: all 0's --------out of sync / data error some '1's ------sync ?? / Code Violation error / when changed from all / '1's all '1's -------in sync / data OK Whenever the M counter decrements from the all '1' state, a code violation error is signalled to a controller and the state of the port logic is frozen while it is read out and logged by the controller. No additional requests to the matrix controller will be generated by the port in this state. The port will be freed when the M counter returns to the all '1' state and the controller resets the code violation indicator Whenever the M counter reaches the all '0' state, the high speed character clock counter will be permitted to reset on idle characters, thereby resynchronising the character clock. Alternatively, the character counter may be allowed either to skip or to add one count; then the M and N counters would again test for character synchronisation. When the M counter reaches the all '1' state, this permission will be removed. This method ensures that the character clock will not sliver until resynchronisation is allowed. It would appear that M = 3 and N = 7 will be sufficient to allow reliable character synchronisation. N = 15 would be marginally better in detecting and acquiring character synchronisation but at the expense of longer acquisition time (45 characters vs. 21). Use of M = 15 allows p(cv) to be as low as 0.26 and still produce the same performance as shown above for M = 7 and p(cv) = 0.5. The ten bits of the 8/10 encoded data stream are referred to as a, b, c, d, e, i, f, g, h, j where a is the least significant bit and the first to arrive at the deserialiser 11 and j is the most significant bit and the last to arrive at the deserialiser. The disparity computation unit 23 determines disparity according to the following symbols. & = logical AND . = OR + = arithmetic add : = not The disparity computation may be made using logic circuits to perform these functions directly or may be provided by a program in a microprocessor in connection with a processor that performs these computations. Note also that the output from running disparity positive (+) or negative (-) is coupled back to the input of the 8/10 error detector 21 and the disparity computation circuit 23. The running disparity computation circuit or program is built with the following definitions: d7000111 = (:a) & (:b) & (:c) & (d) & (e) & (i); d7111000 = (a) & (b) & (c) & (:d) & (:e) & (:i); dkx3p = (:f) & (:g) & (h) & (j); dkx3m = (f) & (g) & (:h) & (:j); positive = disp; negative = :disp; sumai = a + b + c + d + e + i; sumfj = f + g + h + k; disp = (sumfj=3) . (sumfj=4) . (dkx3p) ., ((sumfj=2) & :dkx3m & d7000111) ., ((sumfj=2) & ((sumai=4) . (sumai=5) . (sumai=6)) & :dkx3m) ., (positive & (sumai=3) & (sumfj=2) & :d7111000). These definitions with logic AND's (&), logic OR's (.), arithmetic add (+) and not (:) may be in a program form following what is written or by circuits designed following these definitions and logic. For example, ":a" means "not a". Similarly, 8/10 error detector detects errors on the basis of positive and negative running disparity from said running disparity and the 8 bit code according to the following definitions and logic: k28p = (:a) & (:b) & (c) & (d) & (e) & (i); k28m = (a) & (b) & (:c) & (:d) & (:e) & (:i); k23p = (a) & (b) & (c) & (:d) & (e) & (:i); k23m = (:a ) & (:b) & (:c) & (d) & (:e) & (i); k27p = (a) & (b) & (:c) & (d) & (e) & (:i); k27m = (:a) & (:b) & (c) & (:d) & (:e) & (i); k29p = (a) & (:b) & (c) & (d) & (e) & (:i); k29m = (:a) & (b) & (:c) & (:d) & (:e) & (i); k30p = (:a) & (b) & (c) & (d) & (e) & (:i); k30m = (a) & (:b) & (:c) & (:d) & (:e) & (i); d000111 = (:a) & (:b) & (:c) & (d) & (e) & (i); d111000 = (a) & (b) & (c) & (:d) & (:e) & (:i); i111100 = (a) & (b) & (c) & (d) & (:e) & (:i); i000011 = (:a) & (:b) & (:c) & (:d) & (e) & (i); dxp7p = (f) & (g) & (h) & (:j); dxp7m = (:f) & (:g) & (:h) & (j); dkya7p = (:f) & (g) & (h) & (j); dkya7m = (f) & (:g) & (:h) & (:j); dkx3p = (:f) & (:g) & (h) & (j); dkx3m = (f) & (g) & (:h) & (:j); d20 = (:a) & (:b) & (c) & (:d) & (e) & (i); d17 = (a) & (:b) & (:c) & (:d) & (e) & (i); d18 = (:a) & (b) & (:c) & (:d) & (e) & (i); d13 = (a) & (:b) & (c) & (d) & (:e) & (:i); d14 = (:a) & (b) & (c) & (d) & (:e) & (:i) ; d11 = (a) & (b) & (:c) & (d) & (:e) & (:i); positive = disp; negative = :disp; s1 = negative & (d17.d18.d20); s2 = positive & (d11.d13.d14); sumai = a + b + c + d + e + i; sumfj = f + g + h + j; error = i1111000 . i000011; error = (k28p & dxp7m) . k28m & dxp7p) . error; error = (negative & d000111) . positive & d111000) . error; error = (:s1 & dkya7p &:(k28m.k23m.k27m.k29m.k30m)) . error; error = (:s2 & dkya7m &:(k28p.k23p.k27p.k29p.k30p)) . error; error = (s1 & dxp7p) . error; error = (s2 & dxp7m) . error; error = (negative & (sumai=3) & dkx3p) . error; error = (negative & (sumai=4) & dkx3m) . error; error = (positive & (sumai=3) & dkx3m) . error; error = (positive & (sumai=2) & dkx3p) . error; error = (sumai=0) . (sumai=1) . (sumai=5) . (sumai=6) . error; error = (sumfj=0) . (sumfj=4) . error; error = ((sumai=2) & (sumfj=1)) . error; error = ((sumai=4) & (sumfj=3)) . error; error = ((sumai=4) & positive) . error; error = ((sumai=2) & negative) . error; error = ((sumai=3) & (sumfj=3) & positive) . error; error = ((sumai=3) & (sumfj=1) & Negative) . error. The detection of zero character disparity which produces the stop skip signal is based on the following definitions and equations. They can be represented by programs in a processor or, as shown in Fig. 4, by logic circuits following the equations. d7000111 = (:a) & (:b) & (:c) & (d) & (e) & (i); d7111000 = (a) & (b) & (c) & (:d) & (:e) & (:i); dkx3p = (:f) & (:g) & (h) & (j); dkx3m = (f) & (g) & (:h ) & (:j); sumai = a + b + c + d + e + i; sumfj = f + g + h + j; stopskp = ((sumai=3) & (sumfj=2) & :(dkx3m.d7111000, .dkx3p.d7000111)). The following is the operation of the system described above with the aid of the flow chart of Fig. 5. When the character synchronisation decision circuit 29 detects the presence of detected errors from error detector 21 it provides a "hunt for sync" signal to the skip control circuit 27 which enables the skip control circuit. When the "hunt for sync" is not present the inverted signal always provides a reset to latch 35 which disables code error signal at AND gate 37. The counter 30 is reset to start the count and the counter begins to count machine clock signals. When the number of clock pulses after reset equals X or the number required to flush out the old character boundary and present a new character boundary the comparator 31 holds the counter and provides an input signal to AND gate 33. This is represented by the Y output of decision block 50 of Fig. 5. In accordance with the arrangement described herein, a test for zero disparity character is made using a zero disparity character detection circuit. If there is true positive or negative disparity the latch 35 is set to present an enable signal to AND gate 37. This is represented in Fig. 5 by decision block 51. When the character disparity is known and is positive or negative the 8/10 code violation represented by Y at decision block 52 produces a skip pulse to the deserialiser. If there is not an 8/10 violation, there is no skipping as represented by decision N in block 52.

Claims: A system for detecting a character boundary in a data stream of sequential character bits encoded in a serial code comprising a utilisation means, coupling means (11) supplied with said data stream for coupling a group of sequential character bits to said utilisation means, detection means in said utilisation means for detecting a character boundary in said group of sequential character bits coupled to said utilisation means, generating means (27) in said utilisation means for generating a control signal if a character boundary cannot be detected in said group of sequential character bits coupled to said utilisation means, and character bit group changing means in said utilisation means responsive to said control signal for changing said group of sequential character bits, wherein said detection means comprises means (21, 23) coupled to said coupling means and responsive to said group of character bits for detecting if there is a zero character disparity and a code error, said character bit group changing means comprises means for deleting the first character bit in said group and for adding at the end of said group the next character bit in the sequence, said generating means (27) is responsive to the detection of a code error for generating said control signal when a code error is detected, and said generating means (27) is responsive to the detection of a zero disparity for inhibiting said control signal. A method of detecting a character boundary in a data stream of sequential character bits encoded in a serial code comprising the steps of : coupling a group of sequential character bits (11) to a utilisation means, detecting a character boundary in said group of sequential character bits coupled to said utilisation means, generating a control signal (27) if a character boundary cannot be detected in said group of sequential character bits coupled to said utilisation means, and, responsive to said control signal, changing said group of sequential character bits, wherein said detection operation (21,23) comprises detecting if there is a zero character disparity and a code error, said changing operation comprises deleting the first character bit in said group and adding at the end of said group the next character bit in the sequence, responsive to the detection of a code error, generating said control signal (27) when a code error is detected, and, responsive to the detection of a zero disparity, inhibiting said control signal (27).

Inventors: MIRACLE GERALD HOLT, NEUNER RICHARD ANDREW, WILSON LEE HARDY, MIRACLE, GERALD HOLT, NEUNER, RICHARD ANDREW, WILSON, LEE HARDY
Applicants: IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1989
Main classification: H04L25
IPC codes: H04L25, H04L7