US4295124A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Communication method and system
Assignee: National Semiconductor Corp
•
Filing: 1979-08-13
•
Granted: 1981-10-13
•
Expires: 1999-08-13
Abstract
Abstract This communication system reduces required data transmission channel capacity by encoding source words into encoded words with usually less binary bits for transmission. Features of the invention include a hashing algorithm which transforms the source words into psuedorandom code words used for both transmission and addresses in a vocabulary memory. Before transmission each source word and its hash code is checked against a pre-recorded vocabulary memory to decide which should be transmitted.
Inventors
- 👤 Philip M. Roybal
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 15:00
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H04; H04L; H04L25/00; H04L25/02; H04L25/05
Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
130 words
A method of encoding input words for transmission, each of said input words being coded character by character in a first binary digit code, comprising the steps of: generating from each of said input words a second code to serve as a memory address, entering the address in a first memory to derive the word stored at that address in said first memory, comparing for identity the stored, addressed word with the input word, transmitting the address if, and only if, identity is found in the comparison, receiving the transmitted address, entering the received address in a second memory having like words stored at like addresses to those in said first memory, and reading out from said second memory the word stored at the address entered in the second memory.
Claim 2
Independent Claim
130 words
A method of encoding input words for transmission, each of said input words being coded character by character in a first binary digit code, comprising the steps of: generating from each of said input words a second code to serve as a memory address, entering the address in a first memory to derive the word stored at that address in said first memory, comparing for identity the stored, addressed word with the input word, transmitting the address if, and only if, identity is found in the comparison, receiving the transmitted address, entering the received address in a second memory having like words stored at like addresses to those in said first memory, and reading out from said second memory the word stored at the address entered in the second memory.
Claim 3
Dependent Claim
34 words
A method as claimed in claim 1, wherein said step of generating a second code from each of the input words comprises generating a second binary digit code from each of said input words.
Claim 4
Dependent Claim
28 words
A method as claimed in claim 1, wherin the step of generating a second code comprises generating said second code from said first code by a hashing algorithm.
Claim 5
Dependent Claim
52 words
A method as claimed in claim 1, further including the steps of: generating if, and only if, identity is not found, a unique character signifying character by character transmission, and thereafter transmitting the input word character by character while inhibiting transmission of any address of a word stored in said first memory.
Claim 6
Dependent Claim
25 words
A method as claimed in claim 4, comprising the further step of generating a second unique character to signify termination of character by character transmission.
Claim 7
Dependent Claim
75 words
A method as claimed in claim 1, further comprising the steps of: generating a unique character if, and only if, identity is not found in the comparison, said unique character signifying character by character transmissions, then transmitting the word character by character until all characters in the word have been transmitted, then generating and transmitting a second unique character signifying termination of character by character transmission, and receiving the words so transmitted character by character.
Claim 8
Dependent Claim
63 words
A communication system for encoding and transmitting a message comprising words each one of which is composed of characters coded in a first code, comprising: a first register for receiving entry of a word to be transmitted, said entry being coded character by character in said first code, a code generation means for generating from the word entered in said register an address,
Claim 9
Dependent Claim
63 words
A communication system for encoding and transmitting a message comprising words each one of which is composed of characters coded in a first code, comprising: a first register for receiving entry of a word to be transmitted, said entry being coded character by character in said first code, a code generation means for generating from the word entered in said register an address,
Claim 10
Dependent Claim
120 words
a first memory being addresses and having words stored at said addresses, said memory being connected to receive the generated address and to read out the corresponding word stored at said address, means for comparing for identity the word read out by said first memory and the word received in said register, means for transmitting the memory address of said word if, and only if, the comparing means indicates identity, means including a second register for receiving said transmitted address, a second memory having like addresses and like words stored at said addresses as those of said first memory, and connected to receive from said second register the transmitted address and to read out the word stored at said address.
Claim 11
Dependent Claim
120 words
a first memory being addresses and having words stored at said addresses, said memory being connected to receive the generated address and to read out the corresponding word stored at said address, means for comparing for identity the word read out by said first memory and the word received in said register, means for transmitting the memory address of said word if, and only if, the comparing means indicates identity, means including a second register for receiving said transmitted address, a second memory having like addresses and like words stored at said addresses as those of said first memory, and connected to receive from said second register the transmitted address and to read out the word stored at said address.
Claim 12
Dependent Claim
28 words
A communication system as claimed in claim 7, said code generation means including means for executing a hashing algorithm for determining addresses from words in said word code.
Claim 13
Dependent Claim
63 words
A communication system as claimed in claim 7, further comprising: means for recognizing one or more characters of a word entered in said first register, means for generating in response to the recognition a unique character, and means responsive to said unique character for causing said trasmitting means to transmit character by character, the characters of the word entered in said first register.
Claim 14
Dependent Claim
28 words
A communication system as claimed in claim 9, said generating means further including means for generating a further unique character indicating termination of the character by character transmission.
Claim 15
Independent Claim
83 words
A method of encoding input words for transmission, each of said words being composed of characters coded in a first code, comprising the steps of: generating from each of said input words a second code to serve as a memory address, entering the address in a memory to derive the word stored at that address in the memory, comparing for identity the stored, addressed word with the input word, and transmitting the address if, and only if, identity is found in the comparison.
Claim 16
Independent Claim
83 words
A method of encoding input words for transmission, each of said words being composed of characters coded in a first code, comprising the steps of: generating from each of said input words a second code to serve as a memory address, entering the address in a memory to derive the word stored at that address in the memory, comparing for identity the stored, addressed word with the input word, and transmitting the address if, and only if, identity is found in the comparison.
Claim 17
Dependent Claim
14 words
A method as claimed in claim 11, said second code being a binary code.
Claim 18
Dependent Claim
41 words
A method as claimed in claim 12, further including the steps of: recognizing one or more characters of an input word as signifying character by character transmission, and in response to said character recognition transmitting the input word character by character.
Claim 19
Dependent Claim
24 words
A method as claimed in claim 13, further including the steps of generating a unique character to signify termination of character by character transmission.
Claim 20
Dependent Claim
44 words
A method as claimed in claim 11, further comprising the step of comparing in the first code the word in said memory at said address for identity with the input word before transmitting the address, and transmitting the address only if identity is found.
Claim 21
Dependent Claim
49 words
A method as claimed in claim 15, comprising the further steps, if identity is not found, of incrementing the address, entering the incremented address in memory to derive the word stored at the incremented address, and again comparing the word derived from memory for identity with the input word.
Claim 22
Dependent Claim
30 words
A method as claimed in claim 16, wherein the incrementing, entering and comparing steps are repeated until identity is found or a maximum number of incrementing steps have been performed.
Claim 23
Dependent Claim
22 words
A method as claimed in claim 17, in which, if identity is not found, the word is transmitted in the first code.
Claim 24
Independent Claim
126 words
A system for encoding and transmitting messages comprising words which are composed of characters coded in a code, comprising: a register for receiving entry of a word to be encoded and transmitted, said entry being coded character by character in said code, a code generation means for generating from the word entered in said register an address, a memory having addresses and having words stored at said addresses, said memory being connected to receive the generaed address and to read out the corresponding word stored at said address, means for comparing for identity the word read out by said memory and the word received in said register, and means for transmitting the memory address of said word, if, and only if, the comparing means indicates identity.
Claim 25
Independent Claim
126 words
A system for encoding and transmitting messages comprising words which are composed of characters coded in a code, comprising: a register for receiving entry of a word to be encoded and transmitted, said entry being coded character by character in said code, a code generation means for generating from the word entered in said register an address, a memory having addresses and having words stored at said addresses, said memory being connected to receive the generaed address and to read out the corresponding word stored at said address, means for comparing for identity the word read out by said memory and the word received in said register, and means for transmitting the memory address of said word, if, and only if, the comparing means indicates identity.
Claim 26
Dependent Claim
28 words
A transmitting system as claimed in claim 19, said code generation means including means for executing a hashing algorithm for determining addresses from words in said word code.
Claim 27
Dependent Claim
61 words
A transmitting system as claimed in claim 19, further comprising: means for recognizing one or more characters of a word entered in said register, means for generating in response to the recognition a unique character, and means responsive to said unique character for causing said transmitting means to transmit character by character the characters of the word entered in said register.
Claim 28
Dependent Claim
28 words
A transmitting system as claimed in claim 21, said generating means further including means for generating a further unique character indicating termination of the character by character transmission.
References Cited (Backward Citations)
US3016422A
Cited
US3229047A
Cited
US3334335A
Cited
US3400380A
Cited
US3778617A
Cited
US3750147A
Cited
US3662347A
Cited
US3668647A
Cited
US3717851A
Cited
US3810154A
Cited
US4032913A
Cited
US4140873A
Cited
US4107457A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1984-10-12 | 1985-04-13 | 1985-10-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1988-10-12 | 1989-04-13 | 1989-10-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1992-10-12 | 1993-04-13 | 1993-10-13 | $7700.00 | Window Closed / Lapsed |