FIFO Radix Coding for Non-Power-of-2 Symbol Compression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data compression methods face challenges in efficiently coding data when the number of possible symbols is not a power of 2, leading to suboptimal bit usage and compression efficiency.
Innovation Solution
The use of a radix coder that employs a First In First Out (FIFO) method with mixed radix or base, interleaving data with binary bits, and coding residual parts of Golomb codes, allowing for efficient compression of symbols with non-power of 2 ranges.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If traditional binary coding methods are used for data compression, then the coding process is simple, but compression efficiency deteriorates when the number of symbols is not a power of 2
Solution Approach 1:
The patent changes the radix parameter from fixed binary (base 2) to variable radix (base g where g is not necessarily a power of 2). This allows the coding system to adapt to the actual number of symbols being encoded, improving compression efficiency while maintaining computational simplicity through the use of mixed-radix representation and FIFO buffering.
2Productivity
If variable length coding is used to improve compression efficiency, then bit usage improves, but decoding complexity increases
Solution Approach 1:
The patent segments the coding process into distinct stages: encoding with variable length codes, buffering in FIFO queues organized by radix groups, and sequential decoding. This segmentation allows variable length coding to improve compression while the structured FIFO buffer system manages decoding complexity by organizing codes into manageable radix-based groups.
Solution Approach 2:
The FIFO buffer acts as an intermediary between the variable length encoder and the decoder. It stores encoded symbols and manages the transition from compressed representation back to original data, absorbing the complexity of variable length decoding while presenting a simplified interface to both encoding and decoding operations.
3Productivity
If data is coded in blocks to improve compression, then compression efficiency improves, but loss of time increases due to buffering requirements
Solution Approach 1:
The patent implements dynamic buffering where the FIFO queue depth and radix groupings are adjusted based on the actual data characteristics and compression requirements. This dynamic approach allows the system to optimize between compression efficiency and latency, reducing buffering delay when possible while maintaining high compression ratios when beneficial.
Data Source
AI summary
Embodiments described herein may include example embodiments of a method, article and/or apparatus for coding data which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communication between computing platforms via a network or other interconnection medium.