Bit-Depth Remapping for Threshold-Based GPU Data Compression

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current data compression methods for image data in graphics processing units (GPUs) face challenges in reducing memory bandwidth and storage space efficiently, particularly in mobile devices, due to varying compression ratios and the need for random access, which can lead to increased power consumption and memory inefficiencies.

Innovation Solution

A method of data compression that determines the bit depth of input data by comparing its total size to pre-defined threshold values, using a mapping parameter to reduce bit depth and encode it within the compressed data, ensuring a guaranteed compression ratio and efficient memory usage, while allowing for lossy compression techniques to achieve higher compression ratios.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If data compression is applied to reduce memory bandwidth and storage space, then memory efficiency is improved, but compression ratio variability and random access requirements can increase power consumption

Engineering Contradiction:
Improvememory bandwidthVSAvoidpower consumption
Core Design Contradiction:
Quantity of substanceVSUse of energy by moving object

Solution Approach 1:

The patent applies preliminary action by determining the bit depth of input data before compression using at least partial data compression techniques, comparing the calculated total size to pre-defined thresholds, and generating a mapping parameter in advance. This pre-processing step ensures that the appropriate bit depth reduction is applied before full compression, optimizing the compression ratio while meeting minimum size requirements, thereby reducing memory bandwidth usage without excessive power consumption.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent employs parameter changes by dynamically adjusting the bit depth of input data based on the calculated total size and pre-defined thresholds. The mapping parameter generated from comparing total size to thresholds controls the remapping element to convert input data to reduced bit depth. This dynamic parameter adjustment optimizes compression ratios while ensuring compressed data meets minimum size requirements, efficiently balancing memory bandwidth reduction with power consumption.

Inventive Principle:
Principle #35Parameter changes

2Measurement precision

If higher quality rendering algorithms are used on faster GPUs, then rendering quality is improved, but memory bandwidth requirements increase

Engineering Contradiction:
Improverendering qualityVSAvoidmemory bandwidth
Core Design Contradiction:
Measurement precisionVSQuantity of substance

Solution Approach 1:

The patent applies parameter changes by dynamically adjusting the bit depth of pixel data, depth data, and texture data based on calculated total sizes and pre-defined thresholds. The mapping parameter generated from size comparisons controls remapping elements to convert data to reduced bit depth, optimizing compression ratios while maintaining quality requirements. This enables high-quality rendering on faster GPUs while reducing memory bandwidth requirements through efficient compression.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent uses preliminary action by determining the bit depth of rendering data before compression, comparing calculated total sizes to thresholds, and generating mapping parameters in advance. This pre-processing ensures appropriate bit depth reduction is applied to pixel, depth, and texture data before full compression, optimizing memory bandwidth usage while maintaining rendering quality for high-quality rendering algorithms.

Inventive Principle:
Principle #10Preliminary action

3Productivity

If bit depth is reduced before compression, then compression ratio is improved, but data quality may deteriorate

Engineering Contradiction:
Improvecompression ratioVSAvoiddata quality
Core Design Contradiction:
ProductivityVSMeasurement precision

Solution Approach 1:

The patent applies parameter changes by dynamically adjusting bit depth reduction based on calculated total sizes and pre-defined thresholds. The mapping parameter controls the remapping element to convert input data to reduced bit depth only when necessary to meet compression targets, optimizing compression ratios while maintaining data quality through selective and controlled bit depth reduction rather than uniform compression.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent uses preliminary action by determining the appropriate bit depth reduction level before applying compression, comparing calculated total sizes to thresholds, and generating mapping parameters in advance. This pre-determination ensures that bit depth is reduced only to the extent necessary to meet compression targets, preventing excessive quality loss while achieving improved compression ratios through optimized pre-processing.

Inventive Principle:
Principle #10Preliminary action

4Quantity of substance

If compression thresholds are enforced to guarantee minimum data size, then memory efficiency is improved, but compression flexibility is reduced

Engineering Contradiction:
Improvememory efficiencyVSAvoidcompression flexibility
Core Design Contradiction:
Quantity of substanceVSAdaptability or versatility

Solution Approach 1:

The patent applies preliminary action by calculating total data size and comparing it to pre-defined thresholds before applying full compression, generating a mapping parameter that determines the appropriate bit depth reduction. This pre-assessment ensures compression thresholds are enforced only when necessary to meet memory efficiency targets, maintaining flexibility by allowing uncompressed or minimally compressed data when size requirements are already satisfied.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent employs parameter changes by dynamically adjusting the compression approach based on the relationship between calculated total size and pre-defined thresholds. The mapping parameter enables flexible bit depth reduction only when needed to meet compression targets, optimizing memory efficiency while preserving compression flexibility by adapting the compression level to the specific characteristics of each data block rather than applying uniform compression.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS10812101B2Guaranteed data compression
Publication Date: 2020.10.20 IMAGINATION TECH LTD
  • US10812101B2 patent drawing
  • US10812101B2 patent drawing
  • US10812101B2 patent drawing

AI summary

A method of data compression in which the total size of the compressed data is determined and based on that determination, the bit depth of the input data may be reduced before the data is compressed. The bit depth that is used may be determined by comparing the calculated total size to one or more pre-defined threshold values to generate a mapping parameter. The mapping parameter is then input to a remapping element that is arranged to perform the conversion of the input data and then output the converted data to a data compression element. The value of the mapping parameter may be encoded into the compressed data so that it can be extracted and used when subsequently decompressing the data.