Rate-Matched Data Compression for Lower Interface Bandwidth
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In next-generation cellular communication systems, the high data transfer rates and complexity of channel decoding and reverse rate matching between devices lead to significant bandwidth requirements, particularly when using punctured codewords and erasure symbols, necessitating a compression scheme to reduce data transfer between devices.
Innovation Solution
A simple prefix-free coding scheme is employed, where a single bit represents erasure symbols, and normal data is marked with a different bit, allowing for efficient compression and decompression of data streams, thereby reducing the bandwidth required for transferring rate-matched data between devices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If punctured codewords and erasure symbols are used for channel decoding and reverse rate matching, then error correction capability is improved, but interface bandwidth requirements increase significantly
Solution Approach 1:
The patent extracts only the essential information from rate-matched data by identifying and removing redundant erasure symbols and known parity bits. Instead of transferring complete codewords with all N symbols, the system extracts only the unknown information bits that require actual transmission, thereby reducing interface bandwidth while preserving error correction capability.
Solution Approach 2:
The patent segments the rate-matched codeword into distinct components: known erasure symbols, known parity bits, and unknown information bits. This segmentation allows the system to process and transmit only the necessary unknown portions separately from the known portions, reducing overall data transfer requirements while maintaining the ability to perform complete channel decoding at the receiver.
2Measurement precision
If complete rate-matched data is transferred between devices, then decoding accuracy is maintained, but data transfer complexity and bandwidth increase
Solution Approach 1:
The patent performs preliminary identification of erasure symbols and parity bit positions at the transmitter before data transfer. By pre-processing the rate-matched data to mark known positions, the system eliminates the need for the receiver to perform complex rate matching operations, thereby reducing receiver complexity while preserving decoding accuracy through maintained codeword structure.
3Reliability
If all parity bits and erasure symbols are transmitted, then forward error correction is robust, but interface bandwidth consumption increases
Solution Approach 1:
The patent applies different treatment to different portions of the codeword based on their local characteristics. Erasure symbols and systematic parity bits at known positions are handled differently from unknown information bits. This local quality approach allows the system to maintain FEC robustness by preserving the codeword structure while reducing bandwidth by not redundantly transmitting known portions.
Data Source
AI summary
A block of N-bit symbols is compressed to reduce transfer bandwidth between two devices. A plurality of locations within the block of N-bit symbols is identified in which a same known N-bit symbol is to be located. The known symbol in each of the plurality of locations is replaced with a substitute 1-bit symbol having a first value. Each remaining symbol in the block of N-bit symbols is marked with a marker bit having a second value. The compressed block of marked N-bit symbols and substitute symbols is transmitted from one device to another device and then decompressed by replacing the substitute symbols with known symbols and removing the markers to restore the original block.