Microsoft patents data compression method using multiple lookup tables
This filing describes a way to compress large grids of numbers, called matrices, by breaking them into smaller sections. Instead of storing every number, the system saves a list of pointers that point to specific pre-calculated values in shared lookup tables. When the data is needed, the computer uses these pointers to quickly rebuild the original grid.
In the filing’s own words
A computing system including memory storing encoded sub-blocks of an encoded matrix block. Each of the encoded sub-blocks includes element indices. The memory further stores lookup tables that each include centroid values. The memory further stores a table index array including table indices that specify lookup tables associated with the encoded sub-blocks. The computing system further includes one or more processing devices configured to, for each of the encoded sub-blocks, retrieve the table index, retrieve the lookup table specified by the table index, and retrieve the element indices included in the encoded sub-block. The one or more processing devices perform table lookup operations using the table index, lookup table, and element indices to compute a decoded sub-block that includes, for each of the element indices, the corresponding centroid value specified by that element index. The one or more processing devices output a decoded matrix block including the decoded sub-blocks.
What exactly they claim (claim 1)
1. A computing system comprising: memory storing: a plurality of encoded sub-blocks of an encoded matrix block, wherein each of the encoded sub-blocks includes a plurality of element indices; a plurality of lookup tables that each include a respective plurality of centroid values; and a table index array including a plurality of table indices that specify respective lookup tables associated with the encoded sub-blocks; and one or more processing devices configured to, during a decoding stage: for each of the encoded sub-blocks: retrieve the table index of the encoded sub-block; retrieve the lookup table specified by the table index of the encoded sub-block; retrieve the element indices included in the encoded sub-block; and perform a plurality of table lookup operations using the table index, the lookup table, and the element indices to compute a decoded sub-block that includes, for each of the element indices included in the encoded sub-block, the corresponding centroid value specified by that element index; and output a decoded matrix block including the decoded sub-blocks computed from each of the encoded sub-blocks.
Facts
- Company
- Microsoft (Microsoft Technology Licensing, LLC)
- Official title
- MULTI-TABLE DISTRIBUTION ENCODING
- Publication number
- US20260300167A1
- Application number
- 19094382
- Filed
- Mar 28, 2025
- Published
- Oct 1, 2026
- Inventors
- 2
- Claims
- 20
Classified under
G06F 12/0292 Physics & computingG06F 2212/651 Physics & computingMore from Microsoft in Chips & hardware
- Microsoft patents chips with liquid cooling built inside Oct 1, 2026
- Microsoft patents chip design that guesses code steps ahead Sep 8, 2026
- Microsoft patents 3D glass storage using laser light patterns Sep 8, 2026
- Microsoft patents hand-held radar reflectors for tracking movement Sep 8, 2026
- Microsoft patents video boost that reuses old frames to save power Sep 15, 2026
Summaries are simplified from the filing’s own abstract and first claim. A patent filing is not a product announcement.
Patent data and drawings: U.S. Patent and Trademark Office (USPTO). Nebula is not affiliated with or endorsed by the USPTO.