Binary Data Compression via Highest-Weighted Bit Position Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Solid-state imaging devices in battery-powered applications face challenges with high power consumption and high data transmission bandwidth, particularly in systems like electric vehicles, where low power consumption and low bandwidth are crucial.
Innovation Solution
A data compression method that encodes binary data by identifying the position of the highest-weighted bit in a binary number and generates binary position information, reducing the number of bits required for encoding, thereby decreasing power consumption and bandwidth needs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If binary data is transmitted using full binary encoding, then data transmission bandwidth is high, but power consumption increases and transmission efficiency decreases
Solution Approach 1:
The patent extracts only the essential information from binary data for transmission. Instead of transmitting the complete binary value, only the position of the highest-weighted bit and the significant lower bits are extracted and transmitted. This reduces the number of bits required for transmission while preserving the ability to reconstruct the original value at the receiver end.
Solution Approach 2:
The patent changes the representation parameters of binary data by using a variable-length encoding scheme based on the position of the highest-weighted bit. The number of bits transmitted varies depending on the magnitude of the binary value, with smaller values requiring fewer bits. This parameter change optimizes the trade-off between transmission bandwidth and power consumption.
2Loss of energy
If binary data is compressed to reduce bits, then power consumption and bandwidth decrease, but data transmission accuracy may be compromised
Solution Approach 1:
The patent performs preliminary encoding at the transmitter end by identifying the position of the highest-weighted bit and calculating the required number of bits for accurate representation. This preliminary action ensures that the minimum necessary information is transmitted to maintain data accuracy, preventing loss of precision while minimizing bit transmission.
Solution Approach 2:
The encoding scheme inherently provides feedback mechanisms where the position of the highest-weighted bit determines the structure of the transmitted data. The receiver uses this positional information to correctly interpret and reconstruct the original binary value, ensuring accuracy is maintained throughout the compression and transmission process.
3Productivity
If variable-length encoding is used, then data compression efficiency improves, but device complexity increases
Solution Approach 1:
The patent segments binary data transmission into two parts: the position information of the highest-weighted bit and the significant lower bits. This segmentation allows each part to be processed independently using relatively simple logic circuits, reducing overall device complexity while maintaining high compression efficiency.
Solution Approach 2:
The patent implements a dynamic encoding scheme where the number of bits transmitted adapts based on the input value's magnitude. The encoding circuit dynamically adjusts the output length based on the position of the highest-weighted bit, achieving high compression efficiency without requiring overly complex fixed-structure circuits.
Data Source
AI summary
A raw binary number (401) includes a first predefined number n1 of bits, wherein each bit represents either zero or 2(n−1) with n representing a position of the bit in the binary number and 1≤n≤n1. In the raw binary number a position of a highest-weighted bit unequal zero is identified. By using a first electronic circuit (491), binary position information is generated by encoding the identified position. An encoded binary number is compiled, wherein the encoded binary number is based on the binary position information and on a partial binary number. The partial binary number is a portion of the raw binary number directly following the highest-weighted bit unequal zero. The encoded binary number includes a second predefined number m1 of bits. The second predefined number m1 of bits is smaller than the first predefined number n1 of bits.