US4569050A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data communication system with fixed weight error correction and detection code
Assignee: Samsung Electronics Co Ltd
•
Filing: 1983-01-14
•
Granted: 1986-02-04
•
Expires: 2003-01-14
Abstract
Abstract A data communication system having improved error correction and detection capabilities includes an encoder which converts each input word containing three binary message bits to an eight-bit binary code vector which contains exactly four "1's" and four "0's", and thus has a fixed "weight" of 4. In addition, the same symbol (either a "1" or "0") is consecutively repeated in the code vector no more than two times. The code vector is transmitted from a transmitter to a receiver, and the eight-bit received vector is decoded by a decoder to produce an output word containing three message bits. The decoder detects errors in received vectors by checking the weight of the received vector, by checking syndrome based upon predetermined combinations of bits of the received vector, and by performing a parity check on two selected bits of the received vector which should be unequal. Based upon the weight, syndrome and parity checks, the decoder determines the presence of all single and double errors and detects the presence of most high multiple errors in the received vector. In some embodiments, the decoder also corrects the single errors which have been detected, so that the output word can be produced accurately despite the occurrence of single errors in the received vector.
Inventors
- 👤 Bruce W. Ohme
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 15:06
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/47; H03M13/51; H03M13/03; H03M13/05; H03M13/13; H03M13/19; H03M13/31; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145
Claims Analysis
Total Claims: 71
Claim 1
Independent Claim
222 words
A system for digital data communication between a first and a second location, the system comprising: means at the first location for converting a three-bit input word to an eight-bit code vector, wherein the eight bits of the code vector each have a different combination of first and second binary state values for each of eight possible combinations of first and second binary state values for each of the three bits of the input word, wherein the code vector has a fixed weight of first binary symbols regardless of the input word and wherein the code vector is so constituted that combination in a selected manner with a matrix characteristic of the selected code provides a syndrome; means for transmitting the code vector from the first to the second location; means at the second location for receiving a code vector in response to the transmitting means; means at the second location for checking the weight of first binary symbols of the code vector received; means at the second location for combining selected bits of the code vector received to produce a syndrome which has a predetermined value if the code vector received contains no errors; and means at the second location for providing an error detect signal as a function of the checked weight and the syndrome of the code vector received.
Claim 2
Independent Claim
222 words
A system for digital data communication between a first and a second location, the system comprising: means at the first location for converting a three-bit input word to an eight-bit code vector, wherein the eight bits of the code vector each have a different combination of first and second binary state values for each of eight possible combinations of first and second binary state values for each of the three bits of the input word, wherein the code vector has a fixed weight of first binary symbols regardless of the input word and wherein the code vector is so constituted that combination in a selected manner with a matrix characteristic of the selected code provides a syndrome; means for transmitting the code vector from the first to the second location; means at the second location for receiving a code vector in response to the transmitting means; means at the second location for checking the weight of first binary symbols of the code vector received; means at the second location for combining selected bits of the code vector received to produce a syndrome which has a predetermined value if the code vector received contains no errors; and means at the second location for providing an error detect signal as a function of the checked weight and the syndrome of the code vector received.
Claim 3
Dependent Claim
24 words
The system of claim 1 and further comprising: means at the second location for deriving a three-bit output word from the code vector received.
Claim 4
Dependent Claim
67 words
The system of claim 1 and further comprising: means at the second location for checking parity of a predetermined pair of bits of the code vector received which are unequal if the code vector received contains no errors; and wherein the means for providing an error detect signal provides the error detect signal as a function of the weight, syndrome and parity of the code vector received.
Claim 5
Dependent Claim
45 words
The system of claim 3 and further comprising: means at the second location for correcting one bit of the code vector received if the weight, syndrome and parity indicate that the code vector contains a single error and that the one bit is in error.
Claim 6
Dependent Claim
20 words
The system of claim 1 wherein the code vector contains the same binary symbol consecutively repeated no more than twice.
Claim 7
Dependent Claim
64 words
The system of claim 1 and further comprising: means for transmitting a synchronization pattern from the first to the second location, the synchronization pattern containing a string of binary bits which do not form one of the eight possible combinations of bits of the code vector; means at the second location for checking the bits received to determine the presence of the synchronization pattern.
Claim 8
Dependent Claim
39 words
The system of claim 1 wherein the code vector satisfies the matrix product CH t =0, where C is the code vector, H is the check matrix used in the Hamming (8, 4) code, and addition is modulo 2.
Claim 9
Dependent Claim
242 words
A digital data communication system comprising: encoder means for converting a three-bit input word M containing three binary message bits M1, M2 and M3 to a code vector C containing binary code bits C1, C2, C3, C4, C5, C6, C7 and C8, wherein the code vector C contains a predetermined weight of binary "1's" regardless of the binary states of message bits M1, M2 and M3; syndrome producing means wherein C5+C6+C7+C8=0, C3+C4+C7+C8=0, C2+C4+C6+C8=0, and C1+C2+C3+C4+C5+C6+C7+C8=0; parity producing means wherein a predetermined pair of code bits have opposite binary states; transmitter means for transmitting the code vector C; receiver means for receiving, in response to the transmitting of code vector C, a received vector B containing binary bits B1, B2, B3, B4, B5, B6, B7 and B8 which are equal to binary code bits C1, C2, C3, C4, C5, C6, C7 and C8, respectively, if B=C; decoder means, through logic gate correctional system, for checking the weight of the received logic vector, determining a syndrome of the received vector B by combining selected bits of the received vector B and wherein the logic gate correctional system decoder means provides an error detect signal as a function of the weight and the syndrome of the received vector B; and the decoder means also for converting the received vector B to a three-bit output word M' containing message bits M1', M2' and M3' which are equal to message bits M1, M2 and M3 if B=C.
Claim 10
Dependent Claim
242 words
A digital data communication system comprising: encoder means for converting a three-bit input word M containing three binary message bits M1, M2 and M3 to a code vector C containing binary code bits C1, C2, C3, C4, C5, C6, C7 and C8, wherein the code vector C contains a predetermined weight of binary "1's" regardless of the binary states of message bits M1, M2 and M3; syndrome producing means wherein C5+C6+C7+C8=0, C3+C4+C7+C8=0, C2+C4+C6+C8=0, and C1+C2+C3+C4+C5+C6+C7+C8=0; parity producing means wherein a predetermined pair of code bits have opposite binary states; transmitter means for transmitting the code vector C; receiver means for receiving, in response to the transmitting of code vector C, a received vector B containing binary bits B1, B2, B3, B4, B5, B6, B7 and B8 which are equal to binary code bits C1, C2, C3, C4, C5, C6, C7 and C8, respectively, if B=C; decoder means, through logic gate correctional system, for checking the weight of the received logic vector, determining a syndrome of the received vector B by combining selected bits of the received vector B and wherein the logic gate correctional system decoder means provides an error detect signal as a function of the weight and the syndrome of the received vector B; and the decoder means also for converting the received vector B to a three-bit output word M' containing message bits M1', M2' and M3' which are equal to message bits M1, M2 and M3 if B=C.
Claim 11
Dependent Claim
57 words
The data communication system of claim 8 wherein the decoder means checks parity of a predetermined pair of bits of the received vector B by compairing binary values of each bit, and wherein the decoder means provides the error detect signal as a function of the weight, the syndrome, and the parity of the received vector B.
Claim 12
Dependent Claim
36 words
The data communication system of claim 9 wherein the decoder means applies the weight, the syndrome and parity check values to inputs of correctional logic gate system to correct a selected bit of received vector B.
Claim 13
Dependent Claim
85 words
The data communication system of claim 10 wherein transmission errors are corrected by the decoder means correcting the selected bit through the correctional logic gate system if the weight, syndrome and parity indicate the presence of a single error in vector B and that the selected bit is the cause of the single error, and by the decoder means through the correctional logic gate system providing the error detect signal if the weight, syndrome and parity indicate the presence of multiple errors in vector B.
Claim 14
Dependent Claim
17 words
The data communication system of claim 9 wherein C1=M1, C2=M1, C3=M2, C4=M2, C5=M3, C6=M3, C7=(M2⊕M3)⊕M1, and C8=(M2⊕M3)⊕M1.
Claim 15
Dependent Claim
27 words
The data communication system of claim 12 wherein the syndrome determined by the decoder means is a three-bit vector S=S3 S2 S1, where S3=B5⊕B6⊕B7⊕B8, S2=B3⊕B4⊕B7⊕B8, and S1=B2⊕B4⊕B6⊕B8.
Claim 16
Dependent Claim
13 words
The data communication system of claim 13 wherein S=000 if received vector B=C.
Claim 17
Dependent Claim
33 words
The data communication system of claim 9 wherein the parity check is made through having logic gates determine if the predetermined pair of bits have opposite binary values, which will occur if B=C.
Claim 18
Dependent Claim
37 words
The data communication system of claim 15 wherein one bit of the predetermined pair of bits equals a selected bit of the message bits and the other bit equals the complement of the selected bit if B=C.
Claim 19
Dependent Claim
13 words
The data communication system of claim 8 wherein the predetermined weight is four.
Claim 20
Dependent Claim
23 words
The data communication system of claim 17 wherein the code vector C contains the same binary symbol consecutively repeated no more than twice.
Claim 21
Dependent Claim
38 words
The system of claim 8 wherein the code vector satisfies the matrix CH t =0, where C is the code vector, H is the check matrix used in the Hamming (8, 4) code and addition is modulo 2.
Claim 22
Independent Claim
251 words
A method of data communication comprising: converting an input word M including three binary message bits M1, M2 and M3 to a code vector C containing binary code bits C1, C2, C3, C4, C5, C6, C7 and C8, the code vector C having a predetermined weight of one binary value regardless of the input word; the code vector having a predetermined syndrome and the code vector having a predetermined pair of parity check bits; transmitting the code vector C; receiving in response to transmitting code vector C, a vector B containing binary bits B1, B2, B3, B4, B5, B6, B7 and B8, where received vector B is equal to code vector C if data transmission has occurred without error; checking weight of vector B to determine if vector B has the predetermined weight; checking syndrome of vector B by combining selected bits of vector B to produce a syndrome vector S which should have a predetermined value if B=C; checking parity of a predetermined pair of bits of vector B which should have a predetermined relationship if B=C; collecting by logic gate means the results of checking the weight, the syndrome and the parity for thereby determining by logic gate means if B=C; providing a signal, if B≠C, indicating that vector B is not equal to vector C as a function of the checked weight, syndrome and parity; and converting the vector B to a three-bit output word M' containing binary message bits M1', M2' and M3', where M=M' if B=C.
Claim 23
Independent Claim
251 words
A method of data communication comprising: converting an input word M including three binary message bits M1, M2 and M3 to a code vector C containing binary code bits C1, C2, C3, C4, C5, C6, C7 and C8, the code vector C having a predetermined weight of one binary value regardless of the input word; the code vector having a predetermined syndrome and the code vector having a predetermined pair of parity check bits; transmitting the code vector C; receiving in response to transmitting code vector C, a vector B containing binary bits B1, B2, B3, B4, B5, B6, B7 and B8, where received vector B is equal to code vector C if data transmission has occurred without error; checking weight of vector B to determine if vector B has the predetermined weight; checking syndrome of vector B by combining selected bits of vector B to produce a syndrome vector S which should have a predetermined value if B=C; checking parity of a predetermined pair of bits of vector B which should have a predetermined relationship if B=C; collecting by logic gate means the results of checking the weight, the syndrome and the parity for thereby determining by logic gate means if B=C; providing a signal, if B≠C, indicating that vector B is not equal to vector C as a function of the checked weight, syndrome and parity; and converting the vector B to a three-bit output word M' containing binary message bits M1', M2' and M3', where M=M' if B=C.
Claim 24
Dependent Claim
15 words
The method of claim 20 wherein C1=M2, C2=M1, C3=M2, C4=M2, C5=M3, C6=M3, C7=(M2⊕M3)⊕M1, and C8=(M2⊕M3)⊕M1.
Claim 25
Dependent Claim
20 words
The method of claim 21 wherein the syndrome vector S=S3 S2 S1, and wherein S3=B5⊕B6⊕B7⊕B8=0, S2=B3⊕B4⊕B7⊕B8=0, and S1=B2⊕B4⊕B6⊕B8=0, if B=C.
Claim 26
Dependent Claim
24 words
The method of claim 22 wherein the predetermined pair of bits are B1 and B2 and wherein B1 does not equal B2 if B=C.
Claim 27
Dependent Claim
16 words
The method of claim 23 wherein the predetermined weight of a selected binary symbol is four.
Claim 28
Dependent Claim
59 words
The method of claim 20 and further comprising: correcting one bit of vector B prior to converting vector B to output word M' by use of a logic gate correction system determining that the weight, syndrome and parity indicate that B does not equal C, that B contains only one error, and that the one bit is in error.
Claim 29
Dependent Claim
37 words
The method of claim 25 wherein providing the signal indicating that vector B is not equal to vector C is based upon checked weight, syndrome and parity which indicate the presence of multiple errors in vector B.
Claim 30
Independent Claim
167 words
A method of data communication comprising: providing a three-bit input word; converting the input word to an eight-bit code vector, wherein each bit of the code vector has a first or a second binary state value, wherein a different code vector is provided for each possible combination of the three bits of the input words, wherein each different code vector has a fixed weight of first binary values, and wherein the code vector is so constituted that combination in a selected manner with a matrix characteristic of the selected code provides a syndrome; transmitting the code vector from a first to a second location; receiving, in response to the transmitted code vector, a received vector; checking the weight of first binary symbols in the received vector at the second location by counting them to determine if an error is present in the received vector; combining selected bits of the received vector to produce a syndrome which has a predetermined value if the received vector contains no errors.
Claim 31
Independent Claim
167 words
A method of data communication comprising: providing a three-bit input word; converting the input word to an eight-bit code vector, wherein each bit of the code vector has a first or a second binary state value, wherein a different code vector is provided for each possible combination of the three bits of the input words, wherein each different code vector has a fixed weight of first binary values, and wherein the code vector is so constituted that combination in a selected manner with a matrix characteristic of the selected code provides a syndrome; transmitting the code vector from a first to a second location; receiving, in response to the transmitted code vector, a received vector; checking the weight of first binary symbols in the received vector at the second location by counting them to determine if an error is present in the received vector; combining selected bits of the received vector to produce a syndrome which has a predetermined value if the received vector contains no errors.
Claim 32
Dependent Claim
18 words
The method of claim 27 and further comprising: deriving a three-bit output word from the code vector received.
Claim 33
Dependent Claim
67 words
The method of claim 27 and further comprising: checking the weight of the received logic vector, and determining a syndrome of the received vector B by combining selected bits of the received vector B through decoder means; and providing an error detect signal indicative of presence of an error in the logic vector received as a function of the weight and syndrome of the logic vector received.
Claim 34
Dependent Claim
32 words
The method of claim 27 and further comprising: checking parity of a predetermined pair of bits of the code vector received which are unequal if the code vector received contains no errors.
Claim 35
Dependent Claim
40 words
The method of claim 30 and further comprising: providing an error detect signal indicative of presence of an error in the code vector received as a function of the weight, the syndrome, and the parity of the code vector received.
Claim 36
Dependent Claim
107 words
The method of claim 31 and further comprising: collecting in a logic gate correction system the results of the weight, the syndrome and the parity check; correcting one bit of the code vector received if the logic gate correction system determines from the weight, the syndrome and the parity that the code vector received contains a single error, and that the one bit is in error; and providing a signal indicative of a multiple error in the code vector received if the logic gate correction system determines from the weight, the syndrome and the parity that the code vector contains more than one bit which is erroneous.
Claim 37
Dependent Claim
29 words
The method of claim 31 wherein no combination of two of the different code vectors in succession results in the same binary symbol being consecutively repeated more than twice.
Claim 38
Dependent Claim
24 words
The method of claim 27 wherein in each of the different code vectors the same binary symbol is consecutively repeated no more than twice.
Claim 39
Dependent Claim
115 words
A transmitter for encoded digital data communication, the transmitter comprising: means for converting a three-bit input word to an eight-bit code vector, wherein the eight bits of the code vector have a different combination of first and second binary values for each of eight possible combinations of first and second binary values for the three bits of the input word; and means for fixing the weight of the code vector to a predetermined value regardless of the input word; means for producing a syndrome which produces a fixed value when combined with the code vector; means for generating a pair of parity bits within the code vector; and means for transmitting the eight-bit code vector.
Claim 40
Dependent Claim
115 words
A transmitter for encoded digital data communication, the transmitter comprising: means for converting a three-bit input word to an eight-bit code vector, wherein the eight bits of the code vector have a different combination of first and second binary values for each of eight possible combinations of first and second binary values for the three bits of the input word; and means for fixing the weight of the code vector to a predetermined value regardless of the input word; means for producing a syndrome which produces a fixed value when combined with the code vector; means for generating a pair of parity bits within the code vector; and means for transmitting the eight-bit code vector.
Claim 41
Dependent Claim
20 words
The transmitter of claim 35 wherein the code vector contains the same binary symbol consecutively repeated no more than twice.
Claim 42
Dependent Claim
11 words
The transmitter of claim 36 wherein the fixed weight is four.
Claim 43
Dependent Claim
27 words
The transmitter of claim 35 wherein the code vector contains binary code bits C1, C2, C3, C4, C5, C6, C7 and C8, and wherein: C5⊕C6⊕C7⊕C8=0 C3⊕C4⊕C7⊕C8=0 C2⊕C4⊕C6⊕C8=0.
Claim 44
Dependent Claim
7 words
The transmitter of claim 38 wherein: C1⊕C2⊕C3⊕C4⊕C5⊕C6⊕C7⊕C8=0.
Claim 45
Dependent Claim
7 words
The transmitter of claim 38 wherein: C1⊕C2=1.
Claim 46
Dependent Claim
29 words
The transmitter of claim 38 wherein the three-bit input word has binary message bits M1, M2 and M3, and wherein C1=M1, C2=M1, C3=M2, C4=M2, C5=M3, C6=M3, C7=(M2⊕M3)⊕M1, and C8=(M2⊕M3)⊕M1.
Claim 47
Dependent Claim
117 words
A digital data transmitter having structure for providing error detection and correction comprising: encoder means for converting a three-bit input word M containing three binary message bits M1, M2 and M3 to a code vector C containing binary code bits C1, C2, C3, C4, C5, C6, C7 and C8, wherein the code vector C contains a predetermined weight of binary "1's" regardless of the binary states of message bits M1, M2 and M3; syndrome producing means for the code vector which produces a fixed value when combined with the code vector; parity check means for generating a pair of bits with opposite binary values within the code vector; and transmitter means for transmitting the code vector C.
Claim 48
Dependent Claim
117 words
A digital data transmitter having structure for providing error detection and correction comprising: encoder means for converting a three-bit input word M containing three binary message bits M1, M2 and M3 to a code vector C containing binary code bits C1, C2, C3, C4, C5, C6, C7 and C8, wherein the code vector C contains a predetermined weight of binary "1's" regardless of the binary states of message bits M1, M2 and M3; syndrome producing means for the code vector which produces a fixed value when combined with the code vector; parity check means for generating a pair of bits with opposite binary values within the code vector; and transmitter means for transmitting the code vector C.
Claim 49
Dependent Claim
16 words
The data transmitter of claim 42 wherein C1=M1, C2=M1, C3=M2, C4=M2, C5=M3, C6=M3, C7=(M2⊕M3)⊕M1, and C8=(M2⊕M3)⊕M1.
Claim 50
Dependent Claim
11 words
The data transmitter of claim 42 wherein C5⊕C6⊕C7⊕C8,=0, C3⊕C4⊕C7⊕C8=0, and C2⊕C4⊕C6⊕C8=0.
Claim 51
Dependent Claim
8 words
The data transmitter of claim 44 wherein C1⊕C2=1.
Claim 52
Dependent Claim
12 words
The data transmitter of claim 42 wherein the predetermined weight is four.
Claim 53
Dependent Claim
22 words
The data transmitter of claim 46 wherein the code vector C contains the same binary symbol consecutively repeated no more than twice.
Claim 54
Dependent Claim
140 words
A receiver of encoded digital data particularly adapted for decoding digital data, said receiver comprising: means for receiving a vector B containing binary bits B1, B2, B3, B4, B5, B6, B7 and B8; means for checking weight of vector B to determine if vector B has a predetermined weight of one binary values; means for checking syndrome of vector B by combining selected bits of vector B to produce a syndrome vector S which should have a predetermined value; means for checking parity of a predetermined pair of bits of vector B which should have a predetermined relationship; means for providing a signal indicating that vector B contains an error as a function of the checked weight, syndrome and parity; and means for converting the vector B to a three-bit output word M' containing binary message bits M1',M2' and M3'.
Claim 55
Dependent Claim
140 words
A receiver of encoded digital data particularly adapted for decoding digital data, said receiver comprising: means for receiving a vector B containing binary bits B1, B2, B3, B4, B5, B6, B7 and B8; means for checking weight of vector B to determine if vector B has a predetermined weight of one binary values; means for checking syndrome of vector B by combining selected bits of vector B to produce a syndrome vector S which should have a predetermined value; means for checking parity of a predetermined pair of bits of vector B which should have a predetermined relationship; means for providing a signal indicating that vector B contains an error as a function of the checked weight, syndrome and parity; and means for converting the vector B to a three-bit output word M' containing binary message bits M1',M2' and M3'.
Claim 56
Dependent Claim
23 words
The receiver of claim 48 wherein the syndrome vector S=S3 S2 S1, and wherein S3=B5⊕B6⊕B7⊕B8=0, S2=B3⊕B4⊕B7⊕B8=0, and S1=B2⊕B4⊕B6⊕B8=0, if B contains no errors.
Claim 57
Dependent Claim
27 words
The receiver of claim 48 wherein the predetermined pair of bits are B1 and B2 and wherein B1 does not equal B2 if B contains no errors.
Claim 58
Dependent Claim
16 words
The receiver of claim 48 wherein the predetermined weight of a selected binary symbol is four.
Claim 59
Dependent Claim
46 words
The receiver of claim 48 and further comprising: means for correcting one bit of vector B prior to converting vector B to output word M' if the weight, syndrome and parity indicate that B contains only one error, and that the one bit is in error.
Claim 60
Dependent Claim
130 words
A receiver for receiving an eight-bit code vector and converting the code vector to a three-bit output word, the receiver comprising: means for receiving the code vector; means for checking a weight of first binary state values in the code vector received to determined if an error is present in the code vector as received, wherein an error is present if the weight is not a predetermined value; means for deriving a three-bit output word from the code vector received; means for combining selected bits of the code vector received to produce a syndrome which has a predetermined value if the code vector received contains no errors; and means for providing an error detect signal as a function of the checked weight and the syndrome of the code vector received.
Claim 61
Dependent Claim
130 words
A receiver for receiving an eight-bit code vector and converting the code vector to a three-bit output word, the receiver comprising: means for receiving the code vector; means for checking a weight of first binary state values in the code vector received to determined if an error is present in the code vector as received, wherein an error is present if the weight is not a predetermined value; means for deriving a three-bit output word from the code vector received; means for combining selected bits of the code vector received to produce a syndrome which has a predetermined value if the code vector received contains no errors; and means for providing an error detect signal as a function of the checked weight and the syndrome of the code vector received.
Claim 62
Dependent Claim
63 words
The receiver of claim 53 and further comprising: means for checking parity of a predetermined pair of bits of the code vector received which are unequal if the code vector received contains no errors; and wherein the means for providing an error detect signal provides the error detect signal as a function of the weight, syndrome and parity of the code vector received.
Claim 63
Dependent Claim
41 words
The receiver of claim 54 and further comprising: means for correcting one bit of the code vector received if the weight, syndrome and parity indicate that the code vector contains a single error and that the one bit is in error.
Claim 64
Dependent Claim
127 words
An encoded digital data receiver system comprising: transmitter means for transmitting a code vector C; receiver means for receiving, in response to transmitting code vector C, a received vector B containing binary bits B1, B2, B3, B4, B5, B6, B7 and B8, wherein the received vector B contains a predetermined fixed weight of binary "1's" if B contains no errors; and decoder means for converting the received vector B to an output word M' containing message bits M1', M2' and M3'; and wherein the decoder means determines a syndrome of the received vector B by combining selected bits of the received vector B, and wherein the decoder means provides the error detect signal as a function of the weight, and the syndrome of the received vector B.
Claim 65
Dependent Claim
127 words
An encoded digital data receiver system comprising: transmitter means for transmitting a code vector C; receiver means for receiving, in response to transmitting code vector C, a received vector B containing binary bits B1, B2, B3, B4, B5, B6, B7 and B8, wherein the received vector B contains a predetermined fixed weight of binary "1's" if B contains no errors; and decoder means for converting the received vector B to an output word M' containing message bits M1', M2' and M3'; and wherein the decoder means determines a syndrome of the received vector B by combining selected bits of the received vector B, and wherein the decoder means provides the error detect signal as a function of the weight, and the syndrome of the received vector B.
Claim 66
Dependent Claim
27 words
The receiver of claim 56 wherein the decoder means corrects a selected bit of the received vector B as a function of the weight and the syndrome.
Claim 67
Dependent Claim
66 words
The receiver of claim 57 wherein the decoder means corrects the selected bit if the weight, syndrome and parity indicate the presence of a single error in vector B and that the selected bit is the cause of the single error, and wherein the decoder means provides the error detect signal if the weight, syndrome and parity indicate the presence of multiple errors in vector B.
Claim 68
Dependent Claim
25 words
The receiver of claim 56 wherein the syndrome determined by the decoder means is a three-bit vector S=S3 S2 S1, where S3=B5⊕B6⊕B7⊕B8, S2=B3⊕B4⊕B7⊕B8, and S1=B2⊕B4⊕B6⊕B8.
Claim 69
Dependent Claim
14 words
The receiver of claim 59 wherein S=000 if received vector B contains no errors.
Claim 70
Dependent Claim
20 words
The receiver of claim 56 wherein the predetermined pair of bits have opposite binary values if B contains no errors.
Claim 71
Dependent Claim
11 words
The receiver of claim 56 wherein the predetermined weight is four.
References Cited (Backward Citations)
US3381271A
Cited
US3439327A
Cited
US4134103A
Cited
US4313105A
Cited
US4334309A
Cited
US4397022A
Cited
US4414666A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-02-03 | 1989-08-05 | 1990-02-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-02-03 | 1993-08-05 | 1994-02-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-02-03 | 1997-08-05 | 1998-02-04 | $7700.00 | Window Closed / Lapsed |