Patent US3861648A successfully refreshed from Google Patents.
Patent US4319225A successfully refreshed from Google Patents.
US4319225A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Methods and apparatus for compacting digital data
Assignee: United States Department of the Army
•
Filing: 1974-05-17
•
Granted: 1982-03-09
•
Expires: 1994-05-17
Abstract
Abstract Apparatus is disclosed for implementing a unique data compaction technique which is capable of significantly reducing the storage requirements for alpha-numeric data-sets. The results of a computer simulation which demonstrates the power of this technique are provided. In addition, the logic circuitry required to implement this data compaction technique for the transmission of data over a communications link is given.
Inventors
- 👤 Dirk R. Klose
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 20:31
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/40
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
128 words
Apparatus for compacting an alpha-numeric data file, said file comprising m unique records, each of said records containing n symbols with each of said symbols being encoded in a fixed-length j-bit binary code, which comprises: a data buffer memory unit, said memory unit having a storage capacity sufficient to store said entire data file; first gating means for gating the bit stream comprising the data file to be compacted into said memory unit for temporary storage therein; a controller, having an input lead receiving synchronization signals from said bit stream, for counting the number of bits in said bit stream, thereby to generate timing signals on a first and second output lead respectively corresponding to the end of each symbol and each data record; a j-stage shift register;
Claim 2
Dependent Claim
128 words
Apparatus for compacting an alpha-numeric data file, said file comprising m unique records, each of said records containing n symbols with each of said symbols being encoded in a fixed-length j-bit binary code, which comprises: a data buffer memory unit, said memory unit having a storage capacity sufficient to store said entire data file; first gating means for gating the bit stream comprising the data file to be compacted into said memory unit for temporary storage therein; a controller, having an input lead receiving synchronization signals from said bit stream, for counting the number of bits in said bit stream, thereby to generate timing signals on a first and second output lead respectively corresponding to the end of each symbol and each data record; a j-stage shift register;
Claim 3
Dependent Claim
116 words
second gating means, connected to and actuated by the first output of said controller, for gating bits of said bit stream which correspond to a data symbol into said j-stage shift register; an encoding/decoding key buffer memory; a binary-to-"k" converter, connected to said j-stage shift register, for addressing a particular row of said encoding buffer memory; a y-stage shift register, connected to said controller, for counting the number of symbols which have been stored in said encoding buffer memory, where y≧log 2 n; and a binary-to-"n" converter, connected to said y-stage shift register, to address a particular column of said encoding buffer memory, whereby said encoding buffer memory successively stores the bits of an encoding/decoding key.
Claim 4
Dependent Claim
116 words
second gating means, connected to and actuated by the first output of said controller, for gating bits of said bit stream which correspond to a data symbol into said j-stage shift register; an encoding/decoding key buffer memory; a binary-to-"k" converter, connected to said j-stage shift register, for addressing a particular row of said encoding buffer memory; a y-stage shift register, connected to said controller, for counting the number of symbols which have been stored in said encoding buffer memory, where y≧log 2 n; and a binary-to-"n" converter, connected to said y-stage shift register, to address a particular column of said encoding buffer memory, whereby said encoding buffer memory successively stores the bits of an encoding/decoding key.
Claim 5
Dependent Claim
16 words
The apparatus according to claim 1 wherein said controller includes n serially connected j-stage shift registers.
Claim 6
Dependent Claim
48 words
The apparatus according to claim 1 further comprising: a second controller connected to said encoding buffer memory; a data transmission buffer; and means, connected to and controlled by said second controller, for transferring the encoding key stored in said encoding key buffer memory to said data transmission buffer.
Claim 7
Dependent Claim
208 words
The apparatus according to claim 3 further comprising: a second data buffer memory unit, said second memory unit having a storage capacity sufficient to store said entire data file; a j-stage character position shift register connected to said second data buffer memory and receiving therefrom successive j-bit binary symbols; a k-stage key-buffer shift register connected to said encoding key buffer memory unit and receiving therefrom that portion of the encoding key corresponding to the binary symbol currently stored in said j-bit shift-register, said counter being successively incremented by said second controller from l to k for each of said n records and simultaneously advancing the count in said j-stage counter; a base counter connected to said k-stage shift register for counting the number of first binary conditions in the output thereof; a coding counter connected to said base counter; a bistable gate, connected to and controlled by said second controller, for gating the output of said k-stage shift register into said coding counter whereby said coding counter successively converts each j-bit binary coded symbol into an x-bit binary coded symbol; and means for gating said converted symbols, one at a time, into said data transmission buffer for subsequent transmission, together with said encoding key, to a remote location.
Claim 8
Dependent Claim
344 words
Apparatus for restoring a compacted data file to its original form, said data file comprising m unique records, each of said records containing n symbols, each of said symbols having originally been encoded in a j-bit binary code but having been compacted into an x-bit binary code at a remote location, where 2 j >2 x , said compacted data file and a q-bit decoding key mapping the relationship between particular symbol-to-binary relationships in said j-bit and x-bit binary codes having been transmitted to a receiving location, which comprises: a receiving buffer memory unit having a capacity sufficient to store the entire data record as it is received from said remote location; a controller connected to said buffer memory and receiving synchronizing signals from the incoming bit stream; a decoding key buffer having a capacity sufficient to store said decoding key; first gating means, connected to and controlled by said controller, for gating said decoding key word from said receiving buffer memory unit to said decoding key buffer, prior to decoding said data record; a k-stage shift register connected to said decoding key buffer; a j-stage shift register connected to and controlled by said controller; second gating means, connected to and controlled by said controller, for gating successive symbols in each of said n records from said receiving buffer memory unit into said j-stage bit register; means for transferring from said decoding key buffer to said k-stage shift register the portion of said decoding key corresponding to the symbol currently stored in said j-stage shift register; a bistable gate, connected to and controlled by said controller, and receiving as its input the output of said j-stage shift register and said k-stage shift register; a character decoder, connected to and controlled by said controller, and receiving as its input the output of said bistable gate, whereby the x-bit binary code of said symbol is converted into a j-bit binary code; and a utilization data buffer connected to the output of said character decoder for receiving, seriatim, the decoded symbols of each of said n records.
Claim 9
Dependent Claim
344 words
Apparatus for restoring a compacted data file to its original form, said data file comprising m unique records, each of said records containing n symbols, each of said symbols having originally been encoded in a j-bit binary code but having been compacted into an x-bit binary code at a remote location, where 2 j >2 x , said compacted data file and a q-bit decoding key mapping the relationship between particular symbol-to-binary relationships in said j-bit and x-bit binary codes having been transmitted to a receiving location, which comprises: a receiving buffer memory unit having a capacity sufficient to store the entire data record as it is received from said remote location; a controller connected to said buffer memory and receiving synchronizing signals from the incoming bit stream; a decoding key buffer having a capacity sufficient to store said decoding key; first gating means, connected to and controlled by said controller, for gating said decoding key word from said receiving buffer memory unit to said decoding key buffer, prior to decoding said data record; a k-stage shift register connected to said decoding key buffer; a j-stage shift register connected to and controlled by said controller; second gating means, connected to and controlled by said controller, for gating successive symbols in each of said n records from said receiving buffer memory unit into said j-stage bit register; means for transferring from said decoding key buffer to said k-stage shift register the portion of said decoding key corresponding to the symbol currently stored in said j-stage shift register; a bistable gate, connected to and controlled by said controller, and receiving as its input the output of said j-stage shift register and said k-stage shift register; a character decoder, connected to and controlled by said controller, and receiving as its input the output of said bistable gate, whereby the x-bit binary code of said symbol is converted into a j-bit binary code; and a utilization data buffer connected to the output of said character decoder for receiving, seriatim, the decoded symbols of each of said n records.
Claim 10
Dependent Claim
40 words
The apparatus according to claim 5 wherein said transferring means comprises: a character bit counter; and a binary-to-k converter, connected to and driven by said character bit counter, for addressing a particular row in said decoding key buffer memory unit.
Claim 11
Dependent Claim
40 words
The apparatus according to claim 6 wherein said transferring means further comprises: a character position counter; and a binary-to-n converter, connected to and driven by said character position counter, for addressing a particular column in said decoding key buffer memory.
Claim 12
Independent Claim
205 words
A method of compacting electronically stored digital signals representing a data file of m records, each said record containing n symbols and each said symbol encoded in a fixed-length j-bit digital code of base r, which comprises the steps of: (a) storing said digital signals in an electronic storage device having a plurality of r-state storage cells to functionally establish therein an n×m symbol matrix of said data file, each of the rows of said matrix corresponding to a different one of said m records; (b) testing the digital signals in a column of said symbol matrix to determine the number k of unique symbols contained therein; (c) comparing signals representative of the number k and a number p, where p=r j , and if k<p, generating an x-bit code for encoding said k unique symbols where x is the smallest integer that satisfies the relationship r x ≧k; (d) storing in said storage device a new column of said m symbols encoded in accordance with said x-bit code; (e) performing method steps (b) through (c), for each of the remaining (n-1) columns in said matrix; and (f) constructing in said storage device an encoding key of all said x-bit codes generated in step (c).
Claim 13
Independent Claim
205 words
A method of compacting electronically stored digital signals representing a data file of m records, each said record containing n symbols and each said symbol encoded in a fixed-length j-bit digital code of base r, which comprises the steps of: (a) storing said digital signals in an electronic storage device having a plurality of r-state storage cells to functionally establish therein an n×m symbol matrix of said data file, each of the rows of said matrix corresponding to a different one of said m records; (b) testing the digital signals in a column of said symbol matrix to determine the number k of unique symbols contained therein; (c) comparing signals representative of the number k and a number p, where p=r j , and if k<p, generating an x-bit code for encoding said k unique symbols where x is the smallest integer that satisfies the relationship r x ≧k; (d) storing in said storage device a new column of said m symbols encoded in accordance with said x-bit code; (e) performing method steps (b) through (c), for each of the remaining (n-1) columns in said matrix; and (f) constructing in said storage device an encoding key of all said x-bit codes generated in step (c).
Claim 14
Dependent Claim
14 words
A method in accordance with claim 8 and wherein r is equal to two.
Claim 15
Independent Claim
224 words
A method of compacting an electronically stored digital data file, said file comprising m records, each said record containing n symbols with each said symbol being encoded in a fixed-length j-bit code comprising: (a) storing said file in a data buffer memory unit made up of a plurality of r-state memory cells; (b) shifting said file through a shift register having at least j stages; (c) successively reading symbols from said shift register each time said register contains a j-bit signal associated with a different one of each said coded symbols to determine the kind of symbol stored in said shift register; (d) storing the results of said reading step (c) in an encoding/decoding-key buffer memory using signals indicating the kind of symbol read and the number k of unique symbols associated with a given symbol position in each of said m records; and (e) changing the data in said data buffer memory unit by recoding said data with n variable-length codes each code associated with a given symbol position of all said m records and each code having a length x, wherein x is the smallest integer that satisfies the relationship, r.sup.x ≧k, where r is the number of states in each said memory cell and k is the number of unique symbols in said m records associated with a given symbol position.
Claim 16
Independent Claim
224 words
A method of compacting an electronically stored digital data file, said file comprising m records, each said record containing n symbols with each said symbol being encoded in a fixed-length j-bit code comprising: (a) storing said file in a data buffer memory unit made up of a plurality of r-state memory cells; (b) shifting said file through a shift register having at least j stages; (c) successively reading symbols from said shift register each time said register contains a j-bit signal associated with a different one of each said coded symbols to determine the kind of symbol stored in said shift register; (d) storing the results of said reading step (c) in an encoding/decoding-key buffer memory using signals indicating the kind of symbol read and the number k of unique symbols associated with a given symbol position in each of said m records; and (e) changing the data in said data buffer memory unit by recoding said data with n variable-length codes each code associated with a given symbol position of all said m records and each code having a length x, wherein x is the smallest integer that satisfies the relationship, r.sup.x ≧k, where r is the number of states in each said memory cell and k is the number of unique symbols in said m records associated with a given symbol position.
Claim 17
Dependent Claim
14 words
A method in accordance with claim 10 and wherein r is equal to two.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1985-03-08 | 1985-09-07 | 1986-03-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1989-03-08 | 1989-09-07 | 1990-03-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1993-03-08 | 1993-09-07 | 1994-03-09 | $7700.00 | Window Closed / Lapsed |