System and method for dictionary-based cache-line level code compression for on-chip memories using gradual bit removal
US-2015381201-A1 · Dec 31, 2015 · US
US10691529B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10691529-B2 |
| Application number | US-201816013710-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 20, 2018 |
| Priority date | Jun 20, 2018 |
| Publication date | Jun 23, 2020 |
| Grant date | Jun 23, 2020 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A processing device comprising compression circuitry to: determine a compression configuration to compress source data; generate a checksum of the source data in an uncompressed state; compress the source data into at least one block based on the compression configuration, wherein the at least one block comprises: a plurality of sub-blocks, wherein the plurality of sub-block includes a predetermined size; a block header corresponding to the plurality of sub-blocks; and decompression circuitry coupled to the compression circuitry, wherein the decompression circuitry to: while not outputting a decompressed data stream of the source data: generate index information corresponding to the plurality of sub-blocks; in response to generating the index information, generate a checksum of the compressed source data associated with the plurality of sub-blocks; and determine whether the checksum of the source data in the uncompressed format matches the checksum of the compressed source data.
Opening claim text (preview).
What is claimed is: 1. A processing device comprising: compression circuitry to: determine a compression configuration to compress source data; generate a checksum of the source data in an uncompressed state; and compress the source data into at least one block based on the compression configuration to generate compressed source data, wherein the at least one block comprises: a plurality of sub-blocks, wherein each sub-block of the plurality of sub-blocks is to include a corresponding predetermined amount of data; and a block header corresponding to the plurality of sub-blocks; and decompression circuitry coupled to the compression circuitry, wherein the decompression circuitry is to: while not outputting a decompressed data stream of the source data: generate index information corresponding to the plurality of sub-blocks; in response to generating the index information, generate a checksum of the compressed source data associated with the plurality of sub-blocks; and determine whether the checksum of the source data in the uncompressed state matches the checksum of the compressed source data. 2. The processing device of claim 1 , wherein the decompression circuitry is further to: in response to determining that the checksum of the source data in the uncompressed state matches the checksum of the compressed source data, verify that the source data was properly compressed. 3. The processing device of claim 1 , wherein the decompression circuitry is further to: in response to determining that the checksum of the source data in the uncompressed state does not match the checksum of the compressed source data, verify that the source data was not properly compressed. 4. The processing device of claim 1 , wherein the decompression circuitry is further to: determine whether the source data was compressed into the at least one block based on the compression configuration. 5. The processing device of claim 1 , wherein the at least one block is a Deflate block. 6. The processing device of claim 1 , wherein the index information comprises bit offset of each of the plurality of sub-blocks. 7. The processing device of claim 1 , wherein the decompression circuitry is further to: generate a cumulative checksum of the compressed source data at a bit offset of each of the plurality of sub-blocks. 8. The processing device of claim 1 , wherein a sub-block of the plurality of sub-blocks comprises history information for decompressing all data in the sub-block, the history information not including information for other sub-blocks of the plurality of sub-blocks. 9. The processing device of claim 1 , wherein the decompression circuitry is further to: provide for random access of a single sub-block of the plurality of sub-blocks by receiving a request for the single sub-block and decompressing the requested single sub-block while not decompressing other sub-blocks of the plurality of sub-blocks. 10. A processing system comprising: a core; memory coupled to the core; compression circuitry coupled to the core and the memory, the compression circuitry to: determine a compression configuration to compress source data; generate a checksum of the source data in an uncompressed state; and compress the source data into at least one block based on the compression configuration to generate compressed source data, wherein the at least one block comprises: a plurality of sub-blocks, wherein each sub-block of the plurality of sub-blocks is to include a corresponding predetermined amount of data; and a block header corresponding to the plurality of sub-blocks; and decompression circuitry coupled to the compression circuitry, the core and the memory, wherein the decompression circuitry is to: while not outputting a decompressed data stream of the source data: generate index information corresponding to the plurality of sub-blocks; in response to generating the index information, generate a checksum of the compressed source data associated with the plurality of sub-blocks; and determine whether the checksum of the source data in the uncompressed state matches the checksum of the compressed source data. 11. The processing system of claim 10 , wherein the decompression circuitry is further to: in response to determining that the checksum of the source data in the uncompressed state matches the checksum of the compressed source data, verify that the source data was properly compressed. 12. The processing system of claim 10 , wherein the decompression circuitry is further to: in response to determining that the checksum of the source data in the uncompressed state does not match the checksum of the compressed source data, verify that the source data was not properly compressed. 13. The processing system of claim 10 , wherein the decompression circuitry is further to: determine whether the source data was compressed into the at least one block based on the compression configuration. 14. The processing system of claim 10 , wherein the at least one block is a Deflate block. 15. The processing system of claim 10 , wherein the index information comprises bit offset of each of the plurality of sub-blocks. 16. The processing system of claim 10 , wherein the decompression circuitry is further to: generate a cumulative checksum of the compressed source data at a bit offset of each of the plurality of sub-blocks. 17. The processing system of claim 10 , wherein a sub-block of the plurality of sub-blocks comprises history information for decompressing all data in the sub-block, the history information not including information for other sub-blocks of the plurality of sub-blocks. 18. The processing system of claim 10 , wherein the decompression circuitry is further to: provide for random access of a single sub-block of the plurality of sub-blocks by receiving a request for the single sub-block and decompressing the requested single sub-block while not decompressing other sub-blocks of the plurality of sub-blocks. 19. A method comprising: determining a compression configuration to compress source data; generating a checksum of the source data in an uncompressed state; compressing the source data into at least one block based on the compression configuration to generate compressed source data, wherein the at least one block comprises: a plurality of sub-blocks, wherein each sub-block of the plurality of sub-blocks is to include a corresponding predetermined amount of data; and a block header corresponding to the plurality of sub-blocks; and while not outputting a decompressed data stream of the source data: generating index information corresponding to the plurality of sub-blocks; in response to generating the index information, generating a checksum of the compressed source data associated with the plurality of sub-blocks; and determining whether the checksum of the source data in the uncompressed state matches the checksum of the compressed source data. 20. The method of claim 19 , further comprising: in response to determining that the checksum of the source data in the uncompressed state matches the checksum of the compressed source data, verifying that the source data was properly compressed. 21. The method of claim 19 , further comprising: determining whether the source data was compressed into the at least one block based on the compression configuration. 22. The method of claim 19 , further comprising: generating a cumulative checksum of th
using table look-up for the coding or decoding process, e.g. using read-only memory {(H03M7/4006 takes precedence)} · CPC title
employing a sliding window, e.g. LZ77 · CPC title
to protect a block of data words, e.g. CRC or checksum (G06F11/1076 takes precedence; security arrangements for protecting computers or computer systems against unauthorized activity G06F21/00) · CPC title
using compression, e.g. sparse files · CPC title
Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.