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
Data compression engine for dictionary based lossless data compression
US2019123763A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2019123763-A1 |
| Application number | US-201816228300-A |
| Country | US |
| Kind code | A1 |
| Filing date | Dec 20, 2018 |
| Priority date | Dec 20, 2018 |
| Publication date | Apr 25, 2019 |
| Grant date | — |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
A compression engine includes sets of independent search engines. The sets of independent search engines concurrently perform searches for a longest match in a stream of uncompressed data. The searches are distributed amongst the sets of independent search engines on byte boundaries to load balance the use of the search engines.
First claim
Opening claim text (preview).
What is claimed is: 1 . An apparatus comprising: memory to store a data stream to be compressed; and a plurality of sets of independent search engines, the plurality of sets of independent search engines to concurrently perform searches for a longest match in the data stream, each set of independent search engines to start a search in the data stream at an assigned location in the data stream. 2 . The apparatus of claim 1 , wherein the assigned location is a byte boundary within the data stream. 3 . The apparatus of claim 1 , wherein the searches are distributed amongst the sets of independent search engines to load balance use of the sets of independent search engines. 4 . The apparatus of claim 1 , wherein a number of search engines in one of the sets of independent search engines is 16. 5 . The apparatus of claim 1 , wherein a number of sets of search engines is 16. 6 . The apparatus of claim 1 , wherein the data stream to be compressed using a lossless data compression algorithm. 7 . The apparatus of claim 6 , wherein the lossless data compression algorithm is algorithm is one of Lempel-Ziv (LZ)77, LZ4 or LZ4 Streaming (LZ4S). 8 . A method comprising: storing, a data stream to be compressed in a memory; and concurrently performing, by a plurality of sets of independent search engines, searches for a longest match in the data stream, each set of independent search engines to start a search in the data stream at an assigned location in the data stream. 9 . The method of claim 8 , wherein the assigned location is a byte boundary within the data stream. 10 . The method of claim 8 , wherein the searches are distributed amongst the sets of independent search engines to load balance use of the sets of independent search engines. 11 . The method of claim 8 , wherein a number of search engines in one of the sets of independent search engines is 16. 12 . The method of claim 8 , wherein a number of sets of search engines is 16. 13 . The method of claim 8 , wherein the data stream to be compressed using a lossless data compression algorithm. 14 . The method of claim 13 , wherein the lossless data compression algorithm is one of Lempel-Ziv (LZ)77, LZ4 or LZ4 Streaming (LZ4S). 15 . A system comprising: a memory module, the memory module comprising at least one volatile memory integrated circuit, the volatile memory integrated circuit to store a data stream to be compressed; and a plurality of sets of independent search engines, the plurality of sets of independent search engines to concurrently perform searches for a longest match in the data stream, each set of independent search engines to start a search in the data stream at an assigned location in the data stream. 16 . The system of claim 15 , wherein the assigned location is a byte boundary within the data stream. 17 . The system of claim 15 , wherein the searches are distributed amongst the sets of independent search engines to load balance use of the sets of independent search engines. 18 . The system of claim 15 , wherein a number of search engines in one of the sets of independent search engines is 16. 19 . The system of claim 15 , wherein a number of sets of search engines is 16. 20 . The system of claim 15 , wherein the data stream to be compressed using a lossless data compression algorithm.
Assignees
Inventors
Classifications
Data stream processing; Continuous queries · CPC title
Querying, e.g. by the use of web search engines · CPC title
- H03M7/3086Primary
employing a sliding window, e.g. LZ77 · CPC title
- H03M7/6023Primary
Parallelization · CPC title
using adaptive string matching, e.g. the Lempel-Ziv method · CPC title
Patent family
Related publications grouped by family.
External sources
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US2019123763A1 cover?
- A compression engine includes sets of independent search engines. The sets of independent search engines concurrently perform searches for a longest match in a stream of uncompressed data. The searches are distributed amongst the sets of independent search engines on byte boundaries to load balance the use of the search engines.
- Who is the assignee on this patent?
- Intel Corp
- What technology area does this patent fall under?
- Primary CPC classification H03M7/3086. Mapped technology areas include Electricity.
- When was this patent published?
- Publication date Thu Apr 25 2019 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).