Patent US5034968A successfully refreshed from Google Patents.
US5034968A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Algorithmic data compression
Assignee: Individual
•
Filing: 1989-07-03
•
Granted: 1991-07-23
•
Expires: 2009-07-03
Abstract
Abstract The present invention is for an algorithmic method for compressing data. The data is compressed one cycle at a time and stores a data block each cycle. The method includes the steps of forming a storage array of binary bits. The array has a first plurality of columns, a second plurality of rows, a third plurality of right diagonals and a fourth plurality of left diagonals. In the preferred embodiment the array has 30 rows, 30 columns, 59 left diagonals and 59 right diagonals. The array also has a data entry site. The array is also segmented into a plurality of morsels each comprising a collection of a binary bits. A new data block is entered into the data entry site. A fifth plurality of sums is formed representing the sum of binary 1's in each column, each row, each right diagonal and each left diagonal. Each sum is right diagonal and each left diagonal. Each sum is stored into a morsel thereby forming a summation array. Each summation array contains sufficient information to decompress the parent array and a compressed bit of information.
Inventors
- 👤 Gene Willey
- 👤 John Wakefield
- 👤 Chris Radcliffe
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 07:47
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
311 words
An algorithmic method for compressing data one cycle at a time for storing data blocks for each said cycle into an array of binary bits having (1) a first plurality of rows; (2) a second plurality of columns; (3) a third plurality of right diagonals; (4) a fourth plurality of left diagonals; (5) a fifth plurality of morsels, each said morsel comprising a unique collection of binary bits; and (6) a data entry site comprising one of the morsels, the method comprising the steps of: a. entering a new data block into the data entry site; b. forming a first plurality of sums representing the sums of binary 1's in each row wherein at least one of the rows includes the data entry site; c. forming a second plurality of sums representing the sums of binary 1's in each column wherein at least one of the columns includes the data entry site; d. forming a third plurality of binary 1's in each right diagonal wherein at least one of the right diagonals includes the data entry site; e. forming a fourth plurality of sums representing the sums of binary 1's in each left diagonal wherein at least one of the left diagonals includes the data entry site; and f. storing each of the sums into an appropriate one of the fifth plurality of morsels excepting the data entry site so that a first plurality of the morsels each represents one of the sums of binary 1's in each row, a second plurality of the morsels each represents one of the sums of binary 1's in each column, a third plurality of the morsels each represents one of the sums of binary 1's in each right diagonal and a fourth plurality of the morsels each represents one of the sums of binary 1's in each left diagonal, thereby forming a compressed array.
Claim 2
Dependent Claim
311 words
An algorithmic method for compressing data one cycle at a time for storing data blocks for each said cycle into an array of binary bits having (1) a first plurality of rows; (2) a second plurality of columns; (3) a third plurality of right diagonals; (4) a fourth plurality of left diagonals; (5) a fifth plurality of morsels, each said morsel comprising a unique collection of binary bits; and (6) a data entry site comprising one of the morsels, the method comprising the steps of: a. entering a new data block into the data entry site; b. forming a first plurality of sums representing the sums of binary 1's in each row wherein at least one of the rows includes the data entry site; c. forming a second plurality of sums representing the sums of binary 1's in each column wherein at least one of the columns includes the data entry site; d. forming a third plurality of binary 1's in each right diagonal wherein at least one of the right diagonals includes the data entry site; e. forming a fourth plurality of sums representing the sums of binary 1's in each left diagonal wherein at least one of the left diagonals includes the data entry site; and f. storing each of the sums into an appropriate one of the fifth plurality of morsels excepting the data entry site so that a first plurality of the morsels each represents one of the sums of binary 1's in each row, a second plurality of the morsels each represents one of the sums of binary 1's in each column, a third plurality of the morsels each represents one of the sums of binary 1's in each right diagonal and a fourth plurality of the morsels each represents one of the sums of binary 1's in each left diagonal, thereby forming a compressed array.
Claim 3
Dependent Claim
22 words
The method according to claim 1 wherein the array contains 30 rows, and 30 columns, 59 left diagonals and 59 right diagonal.
Claim 4
Dependent Claim
16 words
The method according to claim 1 wherein the data entry site comprises a single bit location.
Claim 5
Dependent Claim
12 words
The method according to claim 1 wherein each morsel contains 5 bits.
Claim 6
Dependent Claim
37 words
The method according to claim 4 further comprising two blank morsels, wherein a summation vector having the same dimensions as the array is formed by bringing together all of the summation morsels and the two blank morsels.
Claim 7
Dependent Claim
18 words
The method according to claim 5 wherein the data entry site is within one of the blank morsels.
Claim 8
Dependent Claim
239 words
The method according to claim 1 further comprising a method for extracting the data one cycle at a time from the compressed array comprising the steps of: a. placing an appropriate number of bits into each row to achieve one constraint closure; b. performing two bit transpositions within each row to achieve two constraint closure comprising the step of interchanging a one bit in a column having too many 1's with a zero bit in a column having too few 1's.; c. performing four bit transpositions to achieve three constraint closure comprising the steps of: 1) identifying each single rectangle within the compressed array having 1's in opposite corners and 0's in the other corners; and 2) interchanging the 1's in the corners of the single rectangle with the 0's.; d. performing eight bit transpositions to achieve four constraint closure comprising the steps of: 1) identifying pairs of identically sized paired rectangles within the compressed array having 1's in opposite corners and 0's in the other corners wherein the two paired rectangles of the pair are mirror images of each other; and 2) interchanging the 1's in the corners of the paired rectangles with the 0's.; and e. performing octagon rotations to achieve final closure comprising the steps of: 1) identifying equilateral octagons within the compressed array having alternating 1's and 0's in its corners; and 2) interchanging the 1's in the corners of the octagon with the 0's.
Claim 9
Dependent Claim
225 words
An algorithmic method for decompressing data from a compressed array comprising the steps of: a. placing an appropriate number of bits into each row to achieve one constraint closure; b. performing two bit transpositions within each row to achieve two constraint closure comprising the step of interchanging a one bit in a column having too many 1'swith a zero bit in a column having too few 1's; c. performing four bit transpositions to achieve three constraint closure comprising the steps of: 1) identifying each single rectangle within the compressed array having 1's in opposite corners and 0's in the other corners; and 2) interchanging the 1's in the corners of the single rectangle with the 0's.; d. performing eight bit transpositions to achieve four constraint closure comprising the steps of: 1) identifying pairs of identically sized pair rectangles within the compressed array having 1's in opposite corners and 0's in the other corners wherein the two paired rectangles of the pair are mirror images of each other; and 2) interchanging the 1's in the corners of the paired rectangles with the 0's.; and e. performing octagon rotations to achieve final closure comprising the steps of: 1) identifying equilateral octagons within the compressed array having alternating 1's and 0's in its corners; and 2) interchanging the 1's in the corners of the octagon with the 0's.
Claim 10
Dependent Claim
225 words
An algorithmic method for decompressing data from a compressed array comprising the steps of: a. placing an appropriate number of bits into each row to achieve one constraint closure; b. performing two bit transpositions within each row to achieve two constraint closure comprising the step of interchanging a one bit in a column having too many 1'swith a zero bit in a column having too few 1's; c. performing four bit transpositions to achieve three constraint closure comprising the steps of: 1) identifying each single rectangle within the compressed array having 1's in opposite corners and 0's in the other corners; and 2) interchanging the 1's in the corners of the single rectangle with the 0's.; d. performing eight bit transpositions to achieve four constraint closure comprising the steps of: 1) identifying pairs of identically sized pair rectangles within the compressed array having 1's in opposite corners and 0's in the other corners wherein the two paired rectangles of the pair are mirror images of each other; and 2) interchanging the 1's in the corners of the paired rectangles with the 0's.; and e. performing octagon rotations to achieve final closure comprising the steps of: 1) identifying equilateral octagons within the compressed array having alternating 1's and 0's in its corners; and 2) interchanging the 1's in the corners of the octagon with the 0's.
References Cited (Backward Citations)
US4204227A
Cited
US4222076A
Cited
US4768082A
Cited
US4849812A
Cited
US4772956A
Cited
US4821119A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-07-22 | 1995-01-21 | 1995-07-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-07-22 | 1999-01-21 | 1999-07-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-07-22 | 2003-01-21 | 2003-07-23 | $7700.00 | Window Closed / Lapsed |