Bit Sequence Encoding Using Unary Run-Length Bit Planes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for encoding bit sequences, such as entropy coding, do not effectively address the redundancy in bit sequences with significantly differing frequencies of Zeroes and Ones, limiting efficient storage and transmission.
Innovation Solution
A method that generates unary representations of run lengths for both Zeroes and Ones, followed by bit plane encoding, which reduces overall entropy and allows for more compact encoding by alternating and separating bit planes for further compression.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional entropy coding methods are used on bit sequences with significantly differing frequencies of Zeroes and Ones, then the encoding process is simple, but the compression efficiency is limited due to未能 effectively address the redundancy
Solution Approach 1:
The patent segments the bit sequence into separate runs of Zeroes and runs of Ones, processing each run independently. This segmentation allows the encoder to exploit the redundancy in each homogeneous run separately, significantly improving compression efficiency while maintaining a manageable encoding process through systematic organization
Solution Approach 2:
The patent transforms the one-dimensional bit sequence into a two-dimensional representation by creating bit planes for runs of Zeroes and runs of Ones separately. This dimensional transformation enables more effective entropy coding by organizing data in a structure that better reveals statistical patterns and redundancy
2Quantity of substance
If bit sequences are encoded without addressing the frequency difference between Zeroes and Ones, then the encoding process is straightforward, but the storage and transmission efficiency is suboptimal
Solution Approach 1:
The patent changes the representation parameters by converting bit sequences into run-length representations and organizing them into separate bit planes. This parameter transformation enables more efficient storage and transmission by matching the encoding scheme to the statistical properties of the data, reducing the number of bits required to represent the same information
3Loss of information
If unary representations of run lengths are generated and bit plane encoding is applied, then entropy reduction is achieved, but the encoding process becomes more complex
Solution Approach 1:
The patent performs preliminary actions by first converting the bit sequence into unary representations of run lengths and organizing them into bit planes before applying entropy coding. This preliminary organization prepares the data in an optimal format that maximizes entropy reduction while making the subsequent encoding process more systematic and manageable
Data Source
AI summary
The invention is related to a method and a device for encoding of a bit sequence. Said method comprises generating, for each run of Ones comprised in the bit sequence, a unary representation of length of the respective run of Ones, generating a first sequence by concatenating the generated unary representations of lengths of runs of Ones, generating, for each run of Zeroes comprised in the bit sequence, a unary representation of the length of the respective run of Zeroes, generating a second sequence by concatenating the generated unary representations of lengths of runs of Zeroes, and bit plane encoding the generated first and second sequence of unary representations. In most cases, overall entropy of bit planes of unary representations of run lengths is smaller than entropy of the bit sequence. Thus, more compact encoding can be achieved.