Block Data Compression Using Adaptive Bit Shifting

The patent changes the compression approach by dynamically adjusting the shift bit width based on the significant digit values of the data block. Instead of using fixed DCT transformation, it applies variable bit-shifting operations where the shift amount is determined by calculating the average significant digit value and comparing it with the target storage bit width. This parameter-based adaptation allows optimal compression for each data block while meeting the storage space requirement.

The patent applies local quality by processing each data block independently with its own calculated shift bit width based on its specific significant digit values. Each block is compressed according to its local characteristics rather than applying a global compression scheme. This allows adaptive compression for different data types while minimizing overhead since only the shift bit width parameter needs to be stored for each block.

The patent segments the data into fixed-size blocks and processes each block independently through the compression algorithm. The compression function takes a data block as input and produces a compressed result, allowing multiple blocks to be processed simultaneously in parallel. This segmentation approach enables efficient parallel processing while maintaining relatively simple processing logic for each individual block.