US5339077A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Comma code generator
Assignee: Idaho Research Foundation Inc
•
Filing: 1992-08-18
•
Granted: 1994-08-16
•
Expires: 2012-08-18
Abstract
Abstract The preferred embodiment includes a method and apparatus for generating a comma code. A data word having a value m is received. A binary storage apparatus receives the data value. A storage apparatus is coupled to the output of the address calculator. The storage apparatus includes a plurality of single bit storage elements that are arranged to provide an M bit output. Each single bit storage element is initialized to a first value. The address calculator calculates the appropriate single bit storage element to be selectively inverted.
Inventors
- 👤 Jack Venbrux
- 👤 Kelly Cameron
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 13:17
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/40; H03M7/42
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
84 words
An apparatus for generating a comma code comprising: a. means for receiving a data word having a data value m; b. a storage apparatus coupled to receive the data value, the storage apparatus having a plurality of single bit storage elements arranged to provide an M bit code word output; c. means for initializing each of the single bit storage elements to a first value; and d. means for selectively inverting a logic state of an appropriate one of the single bit storage elements.
Claim 2
Independent Claim
84 words
An apparatus for generating a comma code comprising: a. means for receiving a data word having a data value m; b. a storage apparatus coupled to receive the data value, the storage apparatus having a plurality of single bit storage elements arranged to provide an M bit code word output; c. means for initializing each of the single bit storage elements to a first value; and d. means for selectively inverting a logic state of an appropriate one of the single bit storage elements.
Claim 3
Dependent Claim
29 words
The apparatus according to claim 1 wherein the means for selectively inverting comprises an address calculator for determining which of the plurality of single bit storage elements to invert.
Claim 4
Dependent Claim
22 words
The apparatus according to claim 1 further comprising means for transmitting a m+1 bit comma code word output to a receiving circuit.
Claim 5
Dependent Claim
37 words
The apparatus according to claim 3 further comprising means for concatenating two or more m+1 bit code words, where m is a variable based upon the data value m, for forming comma codes longer than M bits.
Claim 6
Dependent Claim
156 words
A comma code generator comprising: a. a shift device having an N bit barrel shifter coupled to a register, the register having a plurality of bit storage elements coupled to receive an m+1 bit comma code word, the device comprising: (1) means for receiving an m value data word; and (2) means for selectively inverting a logic state of an appropriate one of the bit storage elements determined in relation to m; b. first buffer storage means for receiving a first portion of the N bits in the barrel shifter comprising an M bit storage having an M bit output word and wherein M<N; c. second buffer storage means for receiving a second portion of the N bits in the barrel shifter comprising A remainder bits wherein A=N-M; d. means for transmitting the M bit output word to a receiving apparatus; and e. means for subsequently transmitting the A remainder bits to the means for receiving.
Claim 7
Dependent Claim
156 words
A comma code generator comprising: a. a shift device having an N bit barrel shifter coupled to a register, the register having a plurality of bit storage elements coupled to receive an m+1 bit comma code word, the device comprising: (1) means for receiving an m value data word; and (2) means for selectively inverting a logic state of an appropriate one of the bit storage elements determined in relation to m; b. first buffer storage means for receiving a first portion of the N bits in the barrel shifter comprising an M bit storage having an M bit output word and wherein M<N; c. second buffer storage means for receiving a second portion of the N bits in the barrel shifter comprising A remainder bits wherein A=N-M; d. means for transmitting the M bit output word to a receiving apparatus; and e. means for subsequently transmitting the A remainder bits to the means for receiving.
Claim 8
Dependent Claim
30 words
The apparatus according to claim 5 wherein the means for subsequently transmitting the A remainder bits comprises means for transmitting the A remainder bits to the first buffer storage means.
Claim 9
Dependent Claim
37 words
The apparatus according the claim 6 further comprising a multiplexer coupled to receive the M bit output word from the first buffer storage means and to receive the A remainder bits from the second buffer storage means.
Claim 10
Dependent Claim
100 words
A comma code generator comprising: a. means for receiving a data word having a data value m; b. an address calculator coupled to receive the data value m and calculating an address; and c. a memory array of bit storage elements arranged to have an M bit output word, the array being coupled to receive the address from the address calculator, the array comprising: (1) means for initializing the bit storage elements to a first logic state; and (2) means for selectively inverting the logic state of an appropriate one of the bit storage elements selected according to the address.
Claim 11
Dependent Claim
100 words
A comma code generator comprising: a. means for receiving a data word having a data value m; b. an address calculator coupled to receive the data value m and calculating an address; and c. a memory array of bit storage elements arranged to have an M bit output word, the array being coupled to receive the address from the address calculator, the array comprising: (1) means for initializing the bit storage elements to a first logic state; and (2) means for selectively inverting the logic state of an appropriate one of the bit storage elements selected according to the address.
Claim 12
Dependent Claim
42 words
The apparatus according to claim 8 wherein the address calculator further comprises: a. means for storing a previous address; b. means for adding the previous address to the data value m for forming a result; and c. means for incrementing the result.
Claim 13
Independent Claim
74 words
A method for generating a comma code comprising the steps of: a. receiving a data word having a data value m; b. providing a storage apparatus having a plurality of single bit storage elements arranged to provide an M bit code word output; c. initializing each of the single bit storage elements to a first binary value; and d. selectively inverting a logic state of an appropriate one of the single bit storage elements.
Claim 14
Independent Claim
74 words
A method for generating a comma code comprising the steps of: a. receiving a data word having a data value m; b. providing a storage apparatus having a plurality of single bit storage elements arranged to provide an M bit code word output; c. initializing each of the single bit storage elements to a first binary value; and d. selectively inverting a logic state of an appropriate one of the single bit storage elements.
Claim 15
Dependent Claim
22 words
The method according to claim 10 further comprising the step of transmitting the M bit code word output to a receiving circuit.
Claim 16
Dependent Claim
38 words
The method according to claim 11 further comprising the step of concatenating two or more m+1 bit code words, where m is a variable based upon the data value m for forming comma codes longer than M bits.
Claim 17
Dependent Claim
35 words
The method according to claim 10 further comprising the steps of: a. storing a previous address; b. adding the previous address to the data value m for forming a result; and c. incrementing the result.
References Cited (Backward Citations)
US5021782A
Cited
US5060242A
Cited
US4963867A
Cited
US5237701A
Cited
US5173695A
Cited
US5181031A
Cited
US5254991A
Cited
US5233348A
Cited
US5245338A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-08-15 | 1998-02-14 | 1998-08-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-08-15 | 2002-02-14 | 2002-08-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-08-15 | 2006-02-14 | 2006-08-16 | $7700.00 | Window Closed / Lapsed |