Principles
The Bitshuffle algorithm divides the input data into multiple small blocks, rearrange each small data block by bit, and make adjacent bits more similar. This increases the data local repetition, facilitating the compression algorithms to easily identify and utilize the repetition, thereby improving the data compression efficiency.
Parent topic: Instruction Optimization Feature Guide (openEuler)