Patent US4134103A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4134103A Expired / Lapsed US ⏱️ 0.0 years remaining

Error-rejecting data transmission system

Assignee: Caterpillar Inc
•
Filing: 1977-08-11
•
Granted: 1979-01-09
•
Expires: 1997-08-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A system for transmitting binary-bit words from a sending station to a receiving station wherein each word has the same number N of binary bits and wherein each different word has the same number M of binary 1's and the same number (N-M) of binary O's as every other word but in a different arrangement. The number of binary 1's in each word received is counted, and if such count is not exactly equal to M, the word is rejected as inaccurately received.

Inventors

  • 👤 James T. Huxtable
  • 👤 Robert G. Miller
  • 👤 Tommy E. Robinson

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 23:37
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/47; H03M13/51

Claims Analysis

Total Claims: 32
Claim 1
Independent Claim 210 words
Apparatus for transmitting words composed of binary bits, comprising: a sending station, a receiving station, transmission means comprising a cable connecting said sending and receiving stations and having N number of transmission lines, word-selection means at said sending station for selecting one of up to [N!/M!(N-M)!] different words to send, wherein M is an integer and N>M>O, coding means associated with said transmission lines and said word-selection means and having means at said receiving station for normally impressing a voltage corresponding to a binary 1 on each of said transmission lines and having means for individually grounding a selected (N-M) number of said transmission lines at said sending station in accordance with the word selected by said word-selection means, the distribution of 1's and 0's on said transmission lines being uniquely different for each different word selected by said word-selection means, counter means for counting the number of binary 1's on said transmission lines at said receiving station, means at said receiving station and responsive to the count of said counter means for enabling binary data impressed on said transmission lines to be used at said receiving station if the count of 1's is equal to M and for inhibiting such use if said count is not equal to M.
Claim 2
Dependent Claim 210 words
Apparatus for transmitting words composed of binary bits, comprising: a sending station, a receiving station, transmission means comprising a cable connecting said sending and receiving stations and having N number of transmission lines, word-selection means at said sending station for selecting one of up to [N!/M!(N-M)!] different words to send, wherein M is an integer and N>M>O, coding means associated with said transmission lines and said word-selection means and having means at said receiving station for normally impressing a voltage corresponding to a binary 1 on each of said transmission lines and having means for individually grounding a selected (N-M) number of said transmission lines at said sending station in accordance with the word selected by said word-selection means, the distribution of 1's and 0's on said transmission lines being uniquely different for each different word selected by said word-selection means, counter means for counting the number of binary 1's on said transmission lines at said receiving station, means at said receiving station and responsive to the count of said counter means for enabling binary data impressed on said transmission lines to be used at said receiving station if the count of 1's is equal to M and for inhibiting such use if said count is not equal to M.
Claim 3
Dependent Claim 105 words
Apparatus as set forth in claim 1 wherein said means responsive to the count of said counter means for enabling or inhibiting use of binary data impressed on said transmission lines includes: a transmission gate means having a plurality of inputs each of which is connected to a selected one of said transmission lines and an output associated with each of said inputs, said transmission gate means being operable when energized to connect said inputs to said outputs, and means for energizing said transmission gate means if, and only if, the count of binary 1's by said counter means is equal to the number M.
Claim 4
Dependent Claim 99 words
Apparatus as set forth in claim 2, wherein said transmission gate means has latchable outputs and said transmission gate means is energizable by a clock pulse to latch said outputs in a binary state in conformity with the binary state of said inputs during said clock pulse, and wherein said means for energizing said transmission gate includes means for generating a clock pulse in response to a count of binary 1's by said counter means if, and only if, the couunt is equal to the number M, and means for applying said clock pulse to said transmission gate means.
Claim 5
Dependent Claim 131 words
Apparatus as set forth in claim 2, wherein said coding means includes means for ungrounding all of said transmission lines at said sending station if the selection of a word by said word-selection means is changed, wherein said transmission gate means has latchable outputs and said transmission gate means is energizable by a clock pulse to latch said outputs in a binary state in conformity with the binary state of said inputs during said clock pulse, and wherein said means for energizing said transmission gate means includes means for generating a clock pulse of predetermined duration and for applying said clock pulse to said transmission gate means if, and only if, the count of binary 1's by said counter means is first other than M and is subsequently equal to M.
Claim 6
Dependent Claim 131 words
Apparatus as set forth in claim 2, wherein said coding means includes means for ungrounding all of said transmission lines at said sending station if the selection of a word by said word-selection means is changed, wherein said transmission gate means has latchable outputs and said transmission gate means is energizable by a clock pulse to latch said outputs in a binary state in conformity with the binary state of said inputs during said clock pulse, and wherein said means for energizing said transmission gate means includes means for generating a clock pulse of predetermined duration and for applying said clock pulse to said transmission gate means if, and only if, the count of binary 1's by said counter means is first equal to N and is subsequently equal to M.
Claim 7
Dependent Claim 146 words
Apparatus as set forth in claim 2, wherein said coding means includes means for ungrounding all of said transmission lines at said sending station if the selection of a word by said word-selection means is changed, wherein said transmission gate means has latchable outputs and said transmission gate means is energizable by a clock pulse to latch said outputs in a binary state in conformity with the binary state of said inputs during said clock pulse, and wherein said means for energizing said transmission gate means includes flip-flop means settable in response to a count of binary 1's by said counter means equal to N and means responsive to a setting of said flip-flop means and also to a count of binary 1's by said counter means equal to M for generating said clock pulse and for applying said clock pulse to said transmission gate means.
Claim 8
Dependent Claim 24 words
Apparatus as set forth in claim 6 and further including: means responsive to the generation of said clock pulse for resetting said flip-flop means.
Claim 9
Dependent Claim 204 words
Apparatus for transmitting words composed of binary bits, comprising: a sending station, a receiving station, transmission means connecting said sending and receiving stations and comprising N number of transmission lines, word-selection means at said sending station for selecting one of up to [N!/M!(N-M)!] different words to send, wherein M is an integer and N>M>O, said word-selection means comprising a multi-position switch having up to [N!/M!(N-M)!] terminals and a grounded switch member movable into individual engagement with any one of said terminals, said switch member being out of engagement with all of said terminals during movement from one terminal to another, coding means for normally impressing a voltage individually on all of said transmission lines and including a diode array connecting a different set of (N-M) number of transmission lines to each of said switch terminals, counter means for counting the number of binary 1's on said transmission lines at said receiving station, means at said receiving station and responsive to the count of said counter means for enabling binary data impressed on said transmission lines to be used at said receiving station if the count of 1's is equal to M and for inhibiting such use if said count is not equal to M.
Claim 10
Dependent Claim 204 words
Apparatus for transmitting words composed of binary bits, comprising: a sending station, a receiving station, transmission means connecting said sending and receiving stations and comprising N number of transmission lines, word-selection means at said sending station for selecting one of up to [N!/M!(N-M)!] different words to send, wherein M is an integer and N>M>O, said word-selection means comprising a multi-position switch having up to [N!/M!(N-M)!] terminals and a grounded switch member movable into individual engagement with any one of said terminals, said switch member being out of engagement with all of said terminals during movement from one terminal to another, coding means for normally impressing a voltage individually on all of said transmission lines and including a diode array connecting a different set of (N-M) number of transmission lines to each of said switch terminals, counter means for counting the number of binary 1's on said transmission lines at said receiving station, means at said receiving station and responsive to the count of said counter means for enabling binary data impressed on said transmission lines to be used at said receiving station if the count of 1's is equal to M and for inhibiting such use if said count is not equal to M.
Claim 11
Dependent Claim 25 words
Apparatus as set forth in claim 8 wherein said means normally impressing voltage on each of said transmission lines is situated at said receiving station.
Claim 12
Dependent Claim 105 words
Apparatus as set forth in claim 8, wherein said means responsive to the count of said counter means for enabling or inhibiting use of binary data impressed on said transmission lines includes: a transmission gate means having a plurality of inputs each of which is connected to a selected one of said transmission lines and an output associated with each of said inputs, said transmission gate means being operable when energized to connect said inputs to said outputs, and means for energizing said transmission gate means if, and only if, the count of binary 1's by said counter means is equal to the number M.
Claim 13
Dependent Claim 102 words
Apparatus as set forth in claim 10, wherein said transmission gate means has latchable outputs and said transmission gate means is energizable by a clock pulse to latch said outputs in a binary state in conformity with the binary state of said inputs during said clock pulse and wherein said means for energizing said transmission gate means includes means for generating a clock pulse of predetermined length and for applying said clock pulse to said transmission gate means if, and only if, the count of binary 1's by said counter means is first other than M and is subsequently equal to M.
Claim 14
Dependent Claim 102 words
Apparatus as set forth in claim 10, wherein said transmission gate means has latchable outputs and said transmission gate means is energizable by a clock pulse to latch said outputs in a binary state in conformity with the binary state of said inputs during said clock pulse and wherein said means for energizing said transmission gate means includes means for generating a clock pulse of predetermined length and for applying said clock pulse to said transmission gate means if, and only if, the count of binary 1's by said counter means is first equal to N and is subsequently equal to M.
Claim 15
Dependent Claim 78 words
Apparatus as set forth in claim 12, and wherein said means for energizing said transmission gate means includes flip-flop means settable in response to, and only to, a count of binary 1's by said count means equal to N and means responsive to a setting of said flip-flop and also to a count of binary 1's by said counter means equal to, and only to, M for generating and applying a clock pulse to said transmission gate means.
Claim 16
Dependent Claim 24 words
Apparatus as set forth in claim 13 and further including: means responsive to the generation of said clock pulse for resetting said flip-flop means.
Claim 17
Independent Claim 193 words
The method of sending binary coded words to a remotely located data-handling means comprising: sending serially a plurality of different words each having the same number N of binary bits and each different word having the same number M of binary 1's and the same number (N-M) of binary 0's as any other word but in a different arrangement, sending a binary coded signal in between the sending of consecutive of said words, said signal having N number of binary bits and a number of binary 1's therein which is other than the number M, receiving said words and said signals at the remote location of said data-handling means, allowing selected bits of any of said received words to be applied to said data-handling means if said received word has a count of binary 1's therein equal to the number M and if such count is preceded by a count of binary 1's not equal to the number M, inhibiting said selected bits of a received word from being applied to said data-handling means if such received word has a count of binary 1's therein which is not equal to the number M.
Claim 18
Independent Claim 193 words
The method of sending binary coded words to a remotely located data-handling means comprising: sending serially a plurality of different words each having the same number N of binary bits and each different word having the same number M of binary 1's and the same number (N-M) of binary 0's as any other word but in a different arrangement, sending a binary coded signal in between the sending of consecutive of said words, said signal having N number of binary bits and a number of binary 1's therein which is other than the number M, receiving said words and said signals at the remote location of said data-handling means, allowing selected bits of any of said received words to be applied to said data-handling means if said received word has a count of binary 1's therein equal to the number M and if such count is preceded by a count of binary 1's not equal to the number M, inhibiting said selected bits of a received word from being applied to said data-handling means if such received word has a count of binary 1's therein which is not equal to the number M.
Claim 19
Dependent Claim 71 words
The method as set forth in claim 15 wherein the steps of sending binary coded signals in between the sending or words includes sending such signals each with N number of binary 1's therein, and wherein the steps of allowing selected bits of received words to be applied to said data-handling means includes that the count of binary 1's not equal to the number M be equal to the number N.
Claim 20
Dependent Claim 46 words
The method as set forth in claim 15 and further including: maintaining the application of the selected bits of an allowed received word to said data-handling means until a subsequent word is received which has a count of binary 1's therein equal to the number M.
Claim 21
Dependent Claim 224 words
Apparatus for transmitting words composed of binary bits, comprising: a sending station, a receiving station, word-selection means at said sending station for sequentially selecting one of up to [N!/M!(N-M)!] different words to be sent, wherein M is an integer and N>M>O, coding and transmission means associated with said word-selection means for normally causing binary coded words to be received at said receiving station with a uniquely different binary code for each different word selected by said word-selection means but each having M number of binary 1's and N-M number of binary 0's, and for normally causing a binary coded word to be received at said receiving station during the time between each change of word selected by said word-selection means and with such word having other than M number of binary 1's. counter means at said receiving station for counting the number of binary 1's in each binary coded word received at said receiving station, means at said receiving station and responsive to the count of said counter means for enabling a binary coded word to be used at said receiving station if, and only if, the count of binary 1's in said word by said counter means is equal to M and such count of said counter means has been preceded by a count of binary 1's which is not equal to M.
Claim 22
Dependent Claim 224 words
Apparatus for transmitting words composed of binary bits, comprising: a sending station, a receiving station, word-selection means at said sending station for sequentially selecting one of up to [N!/M!(N-M)!] different words to be sent, wherein M is an integer and N>M>O, coding and transmission means associated with said word-selection means for normally causing binary coded words to be received at said receiving station with a uniquely different binary code for each different word selected by said word-selection means but each having M number of binary 1's and N-M number of binary 0's, and for normally causing a binary coded word to be received at said receiving station during the time between each change of word selected by said word-selection means and with such word having other than M number of binary 1's. counter means at said receiving station for counting the number of binary 1's in each binary coded word received at said receiving station, means at said receiving station and responsive to the count of said counter means for enabling a binary coded word to be used at said receiving station if, and only if, the count of binary 1's in said word by said counter means is equal to M and such count of said counter means has been preceded by a count of binary 1's which is not equal to M.
Claim 23
Dependent Claim 131 words
Apparatus as set forth in claim 18 wherein the binary coded word of said coding and transmission means, which is normally received at said receiving station during the time between each change of word selected by said word-selection means and has other than M number of binary 1's, is a word in which all bits thereof are of the same binary state, and wherein said means responsive to the count of said counter means is only operable to enable a binary coded word to be used at said receiving station if the count of binary 1's in said word by said counter means has been preceded by a count of binary 1's indicating the reception of said binary coded word in which all bits thereof are of the same binary state.
Claim 24
Dependent Claim 125 words
Apparatus as set forth in claim 18 wherein the binary coded word of said coding and transmission means, which is normally received at said receiving station during the time between each change of word selected by said word-selection means and has other than M number of binary 1's, is a word in which all bits thereof are binary 1's, and wherein said means responsive to the count of said counter means is only operable to enable a binary coded word to be used at said receiving station if the count of binary 1's in said word by said counter means has been preceded by a count of binary 1's indicating the reception of a binary coded word in which all bits thereof are binary 1's.
Claim 25
Dependent Claim 98 words
Apparatus as set forth in claim 18 wherein the binary coded word of said coding and transmission means, which is normally received at said receiving station during the time between each change of word selected by said word-selection means, has N number of binary 1's and wherein said means responsive to the count of said counter means is only operable to enable a binary coded word to be used at said receiving station if the count of binary 1's in said word by said counter means has been preceded by a count of N number of binary 1's.
Claim 26
Dependent Claim 234 words
Apparatus for transmitting words composed of binary bits, comprising: a sending station, a receiving station, word-selection means at said sending station for sequentially selecting one of up to [N!/M!(N-M)!] different words to be sent, wherein M is an integer and N>M>O, coding and transmission means associated with said word-selection means for normally causing binary coded words to be received at said receiving station with a uniquely different binary code for each word selected by said word-selection means but each having M number of binary 1's and N-M number of binary 0's, counter means at said receiving station for counting the number of binary 1's in each binary coded word received at said receiving station, a transmission gate means at said receiving station and having a plurality of inputs each of which is continuously connected for reception of a selected bit of said words received by said receiving station, said transmission gate means having a latchable output associated with each of said inputs, said transmission gate means being energizable by a clock pulse to latch said outputs in a binary state in conformity with the binary state of said inputs during said clock pulse, means for generating a gate pulse in response to a count of binary 1's by said counter means if, and only if, the count is equal to the number M, and for applying said clock pulse to said transmission gate means.
Claim 27
Dependent Claim 234 words
Apparatus for transmitting words composed of binary bits, comprising: a sending station, a receiving station, word-selection means at said sending station for sequentially selecting one of up to [N!/M!(N-M)!] different words to be sent, wherein M is an integer and N>M>O, coding and transmission means associated with said word-selection means for normally causing binary coded words to be received at said receiving station with a uniquely different binary code for each word selected by said word-selection means but each having M number of binary 1's and N-M number of binary 0's, counter means at said receiving station for counting the number of binary 1's in each binary coded word received at said receiving station, a transmission gate means at said receiving station and having a plurality of inputs each of which is continuously connected for reception of a selected bit of said words received by said receiving station, said transmission gate means having a latchable output associated with each of said inputs, said transmission gate means being energizable by a clock pulse to latch said outputs in a binary state in conformity with the binary state of said inputs during said clock pulse, means for generating a gate pulse in response to a count of binary 1's by said counter means if, and only if, the count is equal to the number M, and for applying said clock pulse to said transmission gate means.
Claim 28
Dependent Claim 94 words
Apparatus as set forth in claim 22, wherein said coding and transmission means includes means for normally causing a binary coded word to be received at said receiving station during the time between each change of word selected by said word-selection means, such word having other than M number of binary 1's, and wherein said means for generating a gate pulse and for applying said gate pulse to said transmission means is operable if, and only if, the count of said counter means is first other than M and is subsequently equal to M.
Claim 29
Dependent Claim 56 words
Apparatus as set forth in claim 23, wherein said means for generating said clock pulse includes means for limiting the length of said pulse to a predetermined value, and further including delay means for delaying the generation of said clock pulse until a predetermined time after the count of said counter means equals the number M.
Claim 30
Dependent Claim 100 words
Apparatus as set forth in claim 22, wherein said coding and transmission means includes means for normally causing a binary coded word to be received at said receiving station during the time between each change of word selected by said word-selection means, such word having N number of binary 1's, and wherein said means for generating a gate pulse and for applying said gate pulse to said transmission gate means is operable if, and only if, the count of binary 1's by said counter means is first equal to the number N and is subsequently equal to the number M.
Claim 31
Dependent Claim 119 words
Apparatus as set forth in claim 22, wherein said coding and transmission means include means for normally causing a binary coded word to be received at said receiving station during the time between each change of word selected by said word-selection means, such word having N number of binary 1's, and wherein said means for generating a gate pulse and for applying said gate pulse to said transmission gate means includes flip-flop means settable in response to a count of binary 1's by said counter means equal to N and means responsive to a setting of said flip-flop means and also to a count of binary 1's by said counter means equal to M for generating said clock pulse.
Claim 32
Dependent Claim 24 words
Apparatus as set forth in claim 26 and further including: means responsive to the generation of said clock pulse for resetting said flip-flop means.

References Cited (Backward Citations)

USRE22394E Cited
US2706215A Cited
US3055978A Cited
US3005871A Cited
US3461238A Cited
US3381271A Cited
US3688261A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1982-01-08 1982-07-10 1983-01-09 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1986-01-08 1986-07-10 1987-01-09 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1990-01-08 1990-07-10 1991-01-09 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag