US5386420A — Coding method for correction and detection of ske…

Claim 1

Independent Claim 264 words

A method of encoding to produce sets of codewords from sequences of digital electrical signals for asynchronous transmission over parallel communication channels without requiring acknowledgement of completion of each transmitted codeword, comprising the steps of: from four selectable non-negative integers t 1 , t 2 , s 1 , s 2 , selecting t 1 as a maximum correctable number and t 1 +s 1 as a maximum detectable number of transitions that can be missing from a first transmitted codeword when a transition from a second transmitted codeword arrives, and selecting t 2 as a maximum correctable number and t 2 +s 2 as a maximum detectable number of transitions which can arrive from the second transmitted codeword before all of the transitions of the first transmitted codeword arrive; using an encoder and a standard error correcting code (ECC), constructing ECC codewords of a word length sufficient to accommodate all information bits to be transmitted and having a minimum distance between any pair of ECC codewords of t 1 +t 2 +S+max{T,s}+1, where S=max{s 1 ,s 2 } and T=max{t 1 ,t 2 } and s=min{s 1 ,s 2 }; and using said encoder, unordering the ECC codewords by concatenating additional redundancy bits of a number sufficient that no resulting ECC codeword can be contained in another codeword in the code, said ECC codewords being capable of correcting up to t 1 or t 2 , and detecting up to t 1 +s 1 or t 2 +s 2 , skewed transitions that result from mixing of transitions from codewords transmitted in sequence.

Claim 2

Independent Claim 264 words

A method of encoding to produce sets of codewords from sequences of digital electrical signals for asynchronous transmission over parallel communication channels without requiring acknowledgement of completion of each transmitted codeword, comprising the steps of: from four selectable non-negative integers t 1 , t 2 , s 1 , s 2 , selecting t 1 as a maximum correctable number and t 1 +s 1 as a maximum detectable number of transitions that can be missing from a first transmitted codeword when a transition from a second transmitted codeword arrives, and selecting t 2 as a maximum correctable number and t 2 +s 2 as a maximum detectable number of transitions which can arrive from the second transmitted codeword before all of the transitions of the first transmitted codeword arrive; using an encoder and a standard error correcting code (ECC), constructing ECC codewords of a word length sufficient to accommodate all information bits to be transmitted and having a minimum distance between any pair of ECC codewords of t 1 +t 2 +S+max{T,s}+1, where S=max{s 1 ,s 2 } and T=max{t 1 ,t 2 } and s=min{s 1 ,s 2 }; and using said encoder, unordering the ECC codewords by concatenating additional redundancy bits of a number sufficient that no resulting ECC codeword can be contained in another codeword in the code, said ECC codewords being capable of correcting up to t 1 or t 2 , and detecting up to t 1 +s 1 or t 2 +s 2 , skewed transitions that result from mixing of transitions from codewords transmitted in sequence.

Claim 3

Dependent Claim 40 words

The method of claim 1, wherein the unordering step includes the steps of: determining the weight of each of the ECC codewords; expressing that weight in a binary representation; and complementing the binary representation to produce said additional redundancy bits.

Claim 4

Dependent Claim 66 words

The method of claim 1, wherein the step of unordering includes the steps of: using a combinational logic circuit, determining the weight of each of the ECC codewords; using a divider circuit, dividing said weight by the quantity (t 1 +t 2 +S+max{T,s}+1) and generating the integer part thereof in binary representation; and using inverter circuitry, complementing the binary representation to produce said additional redundancy bits.

Claim 5

Dependent Claim 31 words

The method of claim 1, wherein the values of s 1 and s 2 are zero and the ECC codewords merely correct up to t 1 and t 2 skewed transitions.

Claim 6

Dependent Claim 199 words

The method of claim 1, wherein the sets of transmitted codewords have a length and are constructed by the steps of: using N(X,Y) to denote the number of coordinates in which X is 1 and Y is 0 and using N(Y,X) to denote the number of coordinates in which Y is 1 and X is 0; and encoding the sequences of digital signals into a set of transmitted codewords in which one of the following criteria is met for all pairs of transmitted codewords X and Y in each said set: (a) if (t 1 -t 2 )(s 1 -s 2 )≧0 and N(X,Y)≦N(Y,X), then at least one of the following three conditions occurs: 1. N(X,Y)≧τ+1; 2. N(X,Y)≧T+1 and N(Y,X)≧ρ+1; or 3. N(X,Y)≧1 and N(Y,X)≧t 1 +t 2 +S+1; whereas if(t 1 -t 2 )(s 1 -s 2 )<0 and N(X,Y)≦N(Y,X), then at least one of the following four conditions occurs: 1. N(X,Y)≧τ+1; 2. N(X,Y)≧T+1 and N(Y,X)≧ρ+1; 3. N(X,Y)≧t+1 and N(Y,X)≧t 1 +t 2 +s+1; or 4. N(X,Y)≧1 and N(Y,X)≧t 1 +t 2 +S+1; where t=min{t 1 ,t 2 }, τ=min{t 1 +s 1 ,t 2 +s 2 }, and ρ=max{t 1 +s 1 ,t 2 +s 2 }.

Claim 7

Dependent Claim 23 words

A (t 1 ,t 2 )-skew-tolerant (t 1 +s 1 ,t 2 +s 2 )-skew,detecting code constructed by the method of claim 5.

Claim 8

Dependent Claim 42 words

The method of claim 5, including initiating a desired control protocol when the number of skewed transitions exceeds t 1 or t 2 provided the number of skewed transitions does not exceed t 1 +s 1 and t 2 +s 2 .

Claim 9

Independent Claim 231 words

A method of correcting and detecting skewed transitions in codewords transmitted asynchronously as sequences of digital electrical signals over parallel information communication channels without acknowledgement of completion of each transmission, comprising the steps of: from four selectable nonnegative integers t 1 , t 2 , s 1 , s 2 , selecting t 1 as a maximum correctable number, and t 1 +s 1 as a maximum detectable number, of transitions that can be missing from a first transmitted codeword when a transition from a second transmitted codeword arrives, and selecting t 2 as a maximum correctable number, and t 2 +s 2 as a maximum detectable number, of transitions which can arrive from the second transmitted codeword before all of the transitions of the first transmitted codeword arrive; using N(X,Y) to denote the number of coordinates in which X is 1 and Y is 0, and N(Y,X) to denote the number of coordinates in which Y is 1 and X is 0; using an encoder, creating a (t 1 ,t 2 )-skew-correcting (t 1 +s 1 ,t 2 +s 2 )-skew-detecting code by encoding codewords constituting sets in which one of the following criteria is met for all pairs of codewords X and Y in the set, assuming N(X,Y)≦N(Y,X): (a) if (t 1 -t 2 )(s 1 -s 2 )≧0, then at least one of the following three conditions occurs:

Claim 10

Independent Claim 231 words

A method of correcting and detecting skewed transitions in codewords transmitted asynchronously as sequences of digital electrical signals over parallel information communication channels without acknowledgement of completion of each transmission, comprising the steps of: from four selectable nonnegative integers t 1 , t 2 , s 1 , s 2 , selecting t 1 as a maximum correctable number, and t 1 +s 1 as a maximum detectable number, of transitions that can be missing from a first transmitted codeword when a transition from a second transmitted codeword arrives, and selecting t 2 as a maximum correctable number, and t 2 +s 2 as a maximum detectable number, of transitions which can arrive from the second transmitted codeword before all of the transitions of the first transmitted codeword arrive; using N(X,Y) to denote the number of coordinates in which X is 1 and Y is 0, and N(Y,X) to denote the number of coordinates in which Y is 1 and X is 0; using an encoder, creating a (t 1 ,t 2 )-skew-correcting (t 1 +s 1 ,t 2 +s 2 )-skew-detecting code by encoding codewords constituting sets in which one of the following criteria is met for all pairs of codewords X and Y in the set, assuming N(X,Y)≦N(Y,X): (a) if (t 1 -t 2 )(s 1 -s 2 )≧0, then at least one of the following three conditions occurs:

Claim 11

Dependent Claim 154 words

N(X,Y)≧τ+1; 2. N(X,Y)≧T+1 and N(Y,X)≧ρ+1; or 3. N(X,Y)≧1 and N(Y,X)≧t 1 +t 2 +S+1; and (b) if (t 1 -t 2 )(s 1 -s 2 )<0, then at least one of the following four conditions occurs: 1. N(X,Y)≧τ+1; 2. N(X,Y)≧T+1 and N(Y,X)≧τ+1; 3. N(X,Y)≧t+1 and N(Y,X)≧t 1 +t 2 +s+1; or 4. N(X,Y)≧1 and N(Y,X)≧t 1 +t 2 +S+1; where t=min{t 1 ,t 2 }, T=max{t 1 ,t 2 }, s=min{s 1 ,s 2 }, S=max{s 1 ,s 2 }, τ=min{t 1 +s 1 ,t 2 +s 2 }, ρ=max{t 1 +s 1 ,t 2 +s 2 }; and correcting, with a processor, skewed transitions as long as the values of t 1 and t 2 are not exceeded; and detecting with said processor skewed transitions when the value of either t 1 or t 2 is exceeded but the values of t 1 +s 1 and t 2 +s 2 are not exceeded.

Claim 12

Dependent Claim 154 words

N(X,Y)≧τ+1; 2. N(X,Y)≧T+1 and N(Y,X)≧ρ+1; or 3. N(X,Y)≧1 and N(Y,X)≧t 1 +t 2 +S+1; and (b) if (t 1 -t 2 )(s 1 -s 2 )<0, then at least one of the following four conditions occurs: 1. N(X,Y)≧τ+1; 2. N(X,Y)≧T+1 and N(Y,X)≧τ+1; 3. N(X,Y)≧t+1 and N(Y,X)≧t 1 +t 2 +s+1; or 4. N(X,Y)≧1 and N(Y,X)≧t 1 +t 2 +S+1; where t=min{t 1 ,t 2 }, T=max{t 1 ,t 2 }, s=min{s 1 ,s 2 }, S=max{s 1 ,s 2 }, τ=min{t 1 +s 1 ,t 2 +s 2 }, ρ=max{t 1 +s 1 ,t 2 +s 2 }; and correcting, with a processor, skewed transitions as long as the values of t 1 and t 2 are not exceeded; and detecting with said processor skewed transitions when the value of either t 1 or t 2 is exceeded but the values of t 1 +s 1 and t 2 +s 2 are not exceeded.

Claim 13

Dependent Claim 214 words

In an information communication system wherein digital electrical signals are transmitted asynchronously in sequences and no acknowledgement of sequence completion is required, a method of decoding vectors containing error-free information represented by said signals and capable of detecting and correcting skewed transitions which mix the information from codewords transmitted in sequence, comprising the steps of: (a) with an asynchronous receiver, receiving one vector having information bits and redundancy bits resulting from a transition received on any of n parallel channels; (b) using a set processor, generating a first set of vectors from subsets of said one vector and removing from each vector in said first set all redundancy bits to provide an estimate of information bits; (c) using an encoder, encoding and unordering all bits remaining after the redundancy bits have been removed from each vector of said first set to create a second set of vectors corresponding to the vectors of said first set; (d) using a comparator, comparing each vector of said first set with a corresponding vector of said second set; and (e) using a gate circuit conditioned when one of the vectors of the first set is the same as its corresponding vector in the second set for outputting information bits corresponding to said one vector in said first set.

Claim 14

Dependent Claim 214 words

In an information communication system wherein digital electrical signals are transmitted asynchronously in sequences and no acknowledgement of sequence completion is required, a method of decoding vectors containing error-free information represented by said signals and capable of detecting and correcting skewed transitions which mix the information from codewords transmitted in sequence, comprising the steps of: (a) with an asynchronous receiver, receiving one vector having information bits and redundancy bits resulting from a transition received on any of n parallel channels; (b) using a set processor, generating a first set of vectors from subsets of said one vector and removing from each vector in said first set all redundancy bits to provide an estimate of information bits; (c) using an encoder, encoding and unordering all bits remaining after the redundancy bits have been removed from each vector of said first set to create a second set of vectors corresponding to the vectors of said first set; (d) using a comparator, comparing each vector of said first set with a corresponding vector of said second set; and (e) using a gate circuit conditioned when one of the vectors of the first set is the same as its corresponding vector in the second set for outputting information bits corresponding to said one vector in said first set.

Claim 15

Dependent Claim 19 words

The method of claim 9, including repeating steps (b)-(e) for each said one vector received in successive steps (a).

Claim 16

Independent Claim 147 words

An apparatus employing parallel asynchronous communication for transmitting codewords over parallel channels from a transmitter to a receiver without acknowledgement of transmission completion, comprising: (i) an encoder for constructing a set of codewords such that, for t=min{t 1 ,t 2 }, T=max{t 1 ,t 2 }, s=min{s 1 ,s 2 }, S=max{s 1 ,s 2 }, τ=min{t 1 +s 1 ,t 2 +s 2 }, and ρ=max{t 1 +s 1 ,t 2 +s 2 }, one of the following criteria is met for all pairs of codewords X and Y, assuming N(X,Y)≦N(Y,X) in the set, where N(X,Y) denotes the number of coordinates in which X is 1 and Y is 0, and N(Y,X) denotes the number of coordinates in which Y is 1 and X is 0: (a) if(t 1 -t 2 )(s 1 -s 2 )≧0, then at least one of the following three conditions occurs:

Claim 17

Independent Claim 147 words

An apparatus employing parallel asynchronous communication for transmitting codewords over parallel channels from a transmitter to a receiver without acknowledgement of transmission completion, comprising: (i) an encoder for constructing a set of codewords such that, for t=min{t 1 ,t 2 }, T=max{t 1 ,t 2 }, s=min{s 1 ,s 2 }, S=max{s 1 ,s 2 }, τ=min{t 1 +s 1 ,t 2 +s 2 }, and ρ=max{t 1 +s 1 ,t 2 +s 2 }, one of the following criteria is met for all pairs of codewords X and Y, assuming N(X,Y)≦N(Y,X) in the set, where N(X,Y) denotes the number of coordinates in which X is 1 and Y is 0, and N(Y,X) denotes the number of coordinates in which Y is 1 and X is 0: (a) if(t 1 -t 2 )(s 1 -s 2 )≧0, then at least one of the following three conditions occurs:

Claim 18

Dependent Claim 225 words

N(X,Y)≧τ+1; 2. N(X,Y)≧T+1 and N(Y,X)≧ρ+1; or 3. N(X,Y)≧1 and N(Y,X)≧t 1 +t 2 +S+1; whereas (b) if(t 1 -t 2 )(s 1 -s 2 )<0, then at least one of the following four conditions occurs: 1. N(X,Y)≧τ+1; 2. N(X,Y)≧T+1 and N(Y,X)≧ρ+1; 3. N(X,Y)≧t+1 and N(Y,X)≧t 1 +t 2 +s+1; or 4. N(X,Y)≧1 and N(Y,X)≧t 1 +t 2 +S+1; where t 1 , t 2 , s 1 , and s 2 are selectable nonnegative integers, t 1 is a preselected maximum correctable number and t 1 +s 1 is a preselected maximum detectable number of transitions that can be missing from a first transmitted codeword when a transition from a second transmitted codeword arrives, t 2 is a preselected maximum correctable number and t 2 +s 2 is a preselected maximum detectable number of transitions that can arrive from the second transmitted codeword before all the transitions of the first transmitted codeword arrive; and (ii) a decoder for decoding said codewords upon reception and (a) correcting up to one preselected number of skewed transitions in codewords transmitted in sequence when both t 1 and t 2 are not exceeded, and (b) detecting up to another preselected number of skewed transitions when said one preselected number of skewed transitions has been exceeded but both t 1 +s 1 and t 2 +s 2 are not exceeded.

Claim 19

Dependent Claim 225 words

N(X,Y)≧τ+1; 2. N(X,Y)≧T+1 and N(Y,X)≧ρ+1; or 3. N(X,Y)≧1 and N(Y,X)≧t 1 +t 2 +S+1; whereas (b) if(t 1 -t 2 )(s 1 -s 2 )<0, then at least one of the following four conditions occurs: 1. N(X,Y)≧τ+1; 2. N(X,Y)≧T+1 and N(Y,X)≧ρ+1; 3. N(X,Y)≧t+1 and N(Y,X)≧t 1 +t 2 +s+1; or 4. N(X,Y)≧1 and N(Y,X)≧t 1 +t 2 +S+1; where t 1 , t 2 , s 1 , and s 2 are selectable nonnegative integers, t 1 is a preselected maximum correctable number and t 1 +s 1 is a preselected maximum detectable number of transitions that can be missing from a first transmitted codeword when a transition from a second transmitted codeword arrives, t 2 is a preselected maximum correctable number and t 2 +s 2 is a preselected maximum detectable number of transitions that can arrive from the second transmitted codeword before all the transitions of the first transmitted codeword arrive; and (ii) a decoder for decoding said codewords upon reception and (a) correcting up to one preselected number of skewed transitions in codewords transmitted in sequence when both t 1 and t 2 are not exceeded, and (b) detecting up to another preselected number of skewed transitions when said one preselected number of skewed transitions has been exceeded but both t 1 +s 1 and t 2 +s 2 are not exceeded.

Claim 20

Dependent Claim 30 words

The apparatus of claim 11, including means operative if the number of skewed transitions exceeds the value of either t 1 or t 2 to initiate a desired control operation.

Claim 21

Dependent Claim 189 words

In a system for transmitting codewords in the form of sequences of digital electrical signals asynchronously over n parallel communication channels without requiring acknowledgement of completion of transmission of each sequence, decoding apparatus capable of detecting and correcting skewed transitions which mix signals from codewords transmitted in sequence, comprising: means for generating a first set of vectors from subsets of a vector having information bits and redundancy bits resulting from a transition received on any of said n parallel channels; means for removing from each vector in said first set all redundancy bits to provide an estimate of information bits; means for reencoding the bits remaining after the redundancy bits have been removed from each vector of said first set to create a second set of vectors corresponding to those of said first set; means for unordering said reencoded remaining bits; means for comparing each vector of said first set with a corresponding vector of said second set; and means for outputting information bits corresponding to one of the vectors in said first set if and when it is the same as its corresponding vector in the second set.

Claim 22

Dependent Claim 189 words

In a system for transmitting codewords in the form of sequences of digital electrical signals asynchronously over n parallel communication channels without requiring acknowledgement of completion of transmission of each sequence, decoding apparatus capable of detecting and correcting skewed transitions which mix signals from codewords transmitted in sequence, comprising: means for generating a first set of vectors from subsets of a vector having information bits and redundancy bits resulting from a transition received on any of said n parallel channels; means for removing from each vector in said first set all redundancy bits to provide an estimate of information bits; means for reencoding the bits remaining after the redundancy bits have been removed from each vector of said first set to create a second set of vectors corresponding to those of said first set; means for unordering said reencoded remaining bits; means for comparing each vector of said first set with a corresponding vector of said second set; and means for outputting information bits corresponding to one of the vectors in said first set if and when it is the same as its corresponding vector in the second set.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1998-01-30	1998-08-01	1999-01-31	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2002-01-30	2002-08-01	2003-01-31	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2006-01-30	2006-08-01	2007-01-31	$7700.00	Window Closed / Lapsed

Coding method for correction and detection of skewed transitions in parallel asynchronous communication systems

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag