US4545032A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for character code compression and expansion
Assignee: MAK STEPHEN M 980 STANFORD IRVINE CA 92714
•
Filing: 1982-03-08
•
Granted: 1985-10-01
•
Expires: 2002-03-08
Abstract
Abstract A method for compressing and expanding binary coded alphanumeric information is practiced in conjunction with a memory wherein user transparent, coded bytes are stored at address locations assigned to recognized permutations of the alphanumeric information. Information, stored in a plurality of input registers, is compressed by generating a memory address based upon the input information or using the input information directly as an address, and then determining from the memory whether or not the permutation represented by the information in the input registers is recognized. If recognized, a coded word is read from the memory which is representative of the permutation and is transmitted. Compression of the units of information per units of code used is achieved by reaccessing the memory with an indexed address generated from the contents stored in additional ones of the input registers or by addressing separate memory modules. Compressed information is expanded by generating addresses from the compressed code or using the compressed character directly as an address and then accessing a memory. If the compressed code represents a recognized permutation the address is indexed or separate memory modules addressed until the output indicates that no further expansion of the compressed code is recognized. The output generated on each memory access is the fully expanded code representing one of the constituent parts of compressed input code.
Inventors
- 👤 Stephen M. Mak
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 18:03
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/00007
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
283 words
A method for data compression comprising the steps of: storing a plurality of character codes of fixed bit length indicative of character symbols in a corresponding plurality of registers, said character codes having an arbitrary format and being user transparent in that said character codes are specific to a memory and independent of a user of said memory; directly addressing a memory with a first column address and first row address, said column address being at least a bit segment of a first one of said character codes stored in one of said plurality of registers, and said row address being at least a portion of a second one of said character codes stored in another one of said registers; and reading a first compressed character code of fixed bit length from a first address location within said memory corresponding to the permutation of said first and second ones of said plurality of character codes and indicative of the permutation of the corresponding character symbols; addressing said memory with a second column address and a second row address, said second row address being at least a bit segment of a third one of said character codes, said second column address being at least a bit segment of said compressed character code just read; and reading a second compressed character code of fixed bit length from a second location in said memory addressed by said second column and row address, said compressed character code indicative of a three character symbol permutation, said second column address being indexed to address a distinct portion of said memory, whereby character codes representative of groups of character symbols are generated to compress character symbol density per unit code.
Claim 2
Independent Claim
283 words
A method for data compression comprising the steps of: storing a plurality of character codes of fixed bit length indicative of character symbols in a corresponding plurality of registers, said character codes having an arbitrary format and being user transparent in that said character codes are specific to a memory and independent of a user of said memory; directly addressing a memory with a first column address and first row address, said column address being at least a bit segment of a first one of said character codes stored in one of said plurality of registers, and said row address being at least a portion of a second one of said character codes stored in another one of said registers; and reading a first compressed character code of fixed bit length from a first address location within said memory corresponding to the permutation of said first and second ones of said plurality of character codes and indicative of the permutation of the corresponding character symbols; addressing said memory with a second column address and a second row address, said second row address being at least a bit segment of a third one of said character codes, said second column address being at least a bit segment of said compressed character code just read; and reading a second compressed character code of fixed bit length from a second location in said memory addressed by said second column and row address, said compressed character code indicative of a three character symbol permutation, said second column address being indexed to address a distinct portion of said memory, whereby character codes representative of groups of character symbols are generated to compress character symbol density per unit code.
Claim 3
Independent Claim
241 words
A method for expansion of compressed character codes comprising the steps of: storing an input character code of fixed bit length contingently indicative of a permutation of character symbols in a register, said character codes having an arbitrary format and being user independent in that said character code is specific to a memory and independent of a user of said memory; directly addressing a first section of a memory with a first row address, said first row address being at least a portion of said input character code stored in said register and directly addressing said first portion of said memory with a first column address, said first column address being a second bit segment of said input character code; reading from a first location of fixed bit length in said first section of said memory into a first output register; directly addressing a second section of said memory with said first row address and with a second column address, said second column address being in part at least a second bit segment of said input character code, said first and second column addresses being distinct; and reading from a second location of fixed bit length in said second section of said memory into a second output register; whereby compressed data may be expanded, and whereby the contents of said second output register is indicative of whether said input character code corresponds to a permutation of a plurality of character symbols.
Claim 4
Independent Claim
241 words
A method for expansion of compressed character codes comprising the steps of: storing an input character code of fixed bit length contingently indicative of a permutation of character symbols in a register, said character codes having an arbitrary format and being user independent in that said character code is specific to a memory and independent of a user of said memory; directly addressing a first section of a memory with a first row address, said first row address being at least a portion of said input character code stored in said register and directly addressing said first portion of said memory with a first column address, said first column address being a second bit segment of said input character code; reading from a first location of fixed bit length in said first section of said memory into a first output register; directly addressing a second section of said memory with said first row address and with a second column address, said second column address being in part at least a second bit segment of said input character code, said first and second column addresses being distinct; and reading from a second location of fixed bit length in said second section of said memory into a second output register; whereby compressed data may be expanded, and whereby the contents of said second output register is indicative of whether said input character code corresponds to a permutation of a plurality of character symbols.
Claim 5
Dependent Claim
56 words
The method of claim 2 further comprising the steps of: testing the contents of said second output register to determine whether said second read location is indicative of more than one character symbol; and transferring the contents of said first register to an output if said second read location is indicative of a single character symbol.
Claim 6
Dependent Claim
79 words
The method of claim 3 further comprising the steps of: directly addressing a third section of said memory with said row address and with a third column address, said third column address being at least a portion of said second bit segment of said input character code and being distinct from said first and second column addresses; and reading from a third location of fixed bit length in said third section of said nemory into a third output register.
Claim 7
Dependent Claim
60 words
The method of claim 4 further comprising the steps of: testing the contents of said third output register to determine whether the contents of said third read location is indicative of more than two character symbols; and transferring the contents of said first and second registers to said output if said input character code is indicative of two character symbols.
Claim 8
Dependent Claim
35 words
The method of claim 5 further comprising the step of transferring the contents of said first, second and third output registers to said output if said third read location is indicative of three character symbols.
Claim 9
Dependent Claim
38 words
The method of claim 2 wherein the steps of directly addressing, reading, testing and transferring are repeated a multiple of cycles until the step of testing indicates said last read location is indicative of a single character symbol.
Claim 10
Dependent Claim
20 words
The method of claim 7 wherein the step of reading each cycle reads from a distinct section of said memory.
References Cited (Backward Citations)
US3432811A
Cited
US3646524A
Cited
US3662347A
Cited
US3694813A
Cited
US3726993A
Cited
US4064489A
Cited
US3976844A
Cited
US4054951A
Cited
US4232375A
Cited
US4382286A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-09-30 | 1989-04-01 | 1989-10-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-09-30 | 1993-04-01 | 1993-10-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-09-30 | 1997-04-01 | 1997-10-01 | $7700.00 | Window Closed / Lapsed |