Data compression and decompression

Patent metadata

Field	Value
Publication number	US-12333768-B2
Application number	US-202318123900-A
Country	US
Kind code	B2
Filing date	Mar 20, 2023
Priority date	Mar 29, 2022
Publication date	Jun 17, 2025
Grant date	Jun 17, 2025

Abstract

A computer-implemented method for compressing, an input group of m data values compresses the two least significant bits of each of the data values by mapping the two least significant bits of each of the data values in the input group of m data values collectively onto an m-bit encoding and storing the m-bit encoding, the m-bit encoding being selected from 2 m m-bit encodings, the 2 m m-bit encodings comprising a first group of encodings comprising (2 m −4) m-bit encodings and a second group of encodings comprising four m-bit encodings, wherein if the selected encoding is an encoding from the first group of encodings then the selected encoding represents the two least significant bits for a representative group of m data values in which the second least significant bit of each of the data values is the same as a respective bit of the m-bit encoding, and wherein if the selected encoding is an encoding from the second group of encodings then the selected encoding represents the two least significant bits for a representative group of m data values in which the two least significant bits for each of the data values in the representative group are equal to the two least significant bits of the other data values in the representative group.

First claim

What is claimed is:

1. A computer-implemented method for compressing an input group of m data values comprising compressing the two least significant bits of each of the data values by:
mapping the two least significant bits of each of the data values in the input group of m data values collectively onto an m-bit encoding and storing the m-bit encoding, the m-bit encoding being selected from 2 m m-bit encodings, the 2 m m-bit encodings comprising a first group of encodings comprising (2 m −4) m-bit encodings and a second group of encodings comprising four m-bit encodings,
wherein if the selected encoding is an encoding from the first group of encodings then the selected encoding represents the two least significant bits for a representative group of m data values in which the second least significant bit of each of the data values is the same as a respective bit of the m-bit encoding, and
wherein if the selected encoding is an encoding from the second group of encodings then the selected encoding represents the two least significant bits for a representative group of m data values in which the two least significant bits for each of the data values in the representative group are equal to the two least significant bits of the other data values in the representative group.

2. The method according to claim 1 , wherein if the second least significant bit of each data value in the input group of m data values is the same as the second least significant bit of the other data values in the input group of m data values, then the two least significant bits of each data value in the input group of m data values are collectively mapped onto an encoding from the second group of encodings.

3. The method according to claim 1 , wherein if it is not the case that the second least significant bit of each data value in the input group of m data values is the same as the second least significant bit of the other data values in the input group of m data values, then the two least significant bits of each data value in the input group of m data values are collectively mapped onto an encoding from the first group of encodings.

4. The method according to claim 1 , wherein m=4.

5. The method according to claim 1 , wherein decompression of the selected encoding results in the representative group of m data values and the selected encoding is chosen so as to minimise error between the two least significant bits of the m data values in the input group and the two least significant bits of the m data values in the representative group.

6. The method according to claim 1 , wherein the data values represent image data.

7. A compression unit configured to compress the two least significant bits of each of the data values of an input group of m data values, the compression unit comprising:
mapping logic configured to map the two least significant bits of each of the data values in the input group of m data values collectively onto an m-bit encoding for storage, the m-bit encoding being selected from 2 m m-bit encodings, the 2 m m-bit encodings comprising a first group of encodings comprising (2 m −4) m-bit encodings and a second group of encodings comprising four m-bit encodings,
wherein when the selected encoding is an encoding from the first group of encodings the selected encoding represents the two least significant bits for a representative group of m data values in which the second least significant bit of each of the data values is the same as a respective bit of the m-bit encoding, and
wherein when the selected encoding is an encoding from the second group of encodings the selected encoding represents the two least significant bits for a representative group of m data values in which the two least significant bits for each of the data values in the representative group are equal to the two least significant bits of the other data values in the representative group.

8. The compression unit according to claim 7 , wherein the compression unit is configured to collectively map the two least significant bits of each data value in the input group of m data values onto an encoding from the second group of encodings if the second least significant bit of each data value in the input group of m data values is the same as the second least significant bit of the other data values in the input group of m data values.

9. The compression unit according to claim 7 , wherein the compression unit is configured to collectively map the two least significant bits of each data value in the input group of m data values onto an encoding from the first group of encodings if it is not the case that the second least significant bit of each data value in the input group of m data values is the same as the second least significant bit of the other data values in the input group of m data values.

10. The compression unit according to claim 7 , wherein the compression unit is embodied in hardware on an integrated circuit.

11. A computer-implemented method for decompressing, compressed data, the compressed data comprising an m-bit encoding representing the two least significant bits of each decompressed data value of a group of m decompressed data values, wherein the m-bit encoding is from either: (i) a first group of encodings comprising (2 m −4) m-bit encodings, or (ii) a second group of encodings comprising four m-bit encodings, the method comprising:
mapping the m-bit encoding onto 2m output bits representing the two least significant bits of each of the m decompressed data values,
wherein if the m-bit encoding is from the first group of encodings, the 2m output bits representing the two least significant bits of each of the m decompressed data values comprise: (i) a second least significant bit of each of the m decompressed data values which is equal to a respective bit of the m-bit encoding, and (ii) a least significant bit for each of the m decompressed data values, and
wherein if the m-bit encoding is from the second group of encodings, the two least significant bits of each of the m decompressed data values represented by the 2m output bits are equal to the two least significant bits of the other ones of the m decompressed data values represented by the 2m output bits.

12. The method according to claim 11 , wherein if the compressed data comprises an encoding from the first group of encodings, mapping the encoding onto 2m output bits comprises: (i) retrieving, from the m-bit encoding, the second least significant bit of each of the m decompressed data values, and (ii) appending the most significant bit of each the m decompressed data values onto the second least significant bit of the respective decompressed data value.

13. The method according to claim 11 , wherein m=4.

14. The method according to claim 11 , wherein the decompressed data values represent image data.

15. A decompression unit configured to decompress compressed data, the compressed data comprising an m-bit encoding representing the two least significant bits of each decompressed data value of a group of m decompressed data values, wherein the m-bit encoding is from either: (i) a first group of encodings comprising (2 m −4) m-bit encodings, or (ii) a second group of encodings comprising four m-bit encodings, the decompression unit comprising:
mapping logic configured to map the m-bit encoding onto 2m output bits representing the two least significant bits of each of the m decompressed data values, wherein the mapping logic is configured such that:
when the m-bit encoding is from the first group of encodings, the 2m output bits representing the two least significant bits of each of the m decompressed

Assignees

• Imagination Tech Ltd

Inventors

• Smith-Lacey Peter

Classifications

• H03M7/20

  Conversion to or from n-out-of-m codes · CPC title

• H03M7/6064 Primary

  Selection of Compressor · CPC title

• H03M7/3064

  Segmenting · CPC title

• H03M7/6005

  Decoder aspects · CPC title

• G06F16/215

  Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors · CPC title