Short Message Compression with Sub-Block CRC Reconstruction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data compression algorithms for short messages in bandwidth-constrained tactical data networks, such as tactical communications networks, are inefficient as they often result in expansion or poor compression due to short code sequences, leading to increased bandwidth usage and latency issues.
Innovation Solution
A system and method that divides short messages into sub-blocks, identifies the type of each text string, and uses a library to replace strings with codes and indices, accompanied by cyclic redundancy check (CRC) codes for error detection and reconstruction, optimizing compression and decompression processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If typical lossless data compression algorithms (PKZIP, Huffman coding) are used on short messages, then compression is attempted, but the encoded output contains more bits than the original sequence resulting in expansion not compression
Solution Approach 1:
The patent segments the short message into multiple sub-blocks, each containing a limited number of characters (e.g., 5-10 characters per sub-block). This segmentation allows the application of custom compression schemes optimized for each small sub-block, avoiding the inefficiency of general-purpose compressors on short sequences. The segmented approach enables targeted encoding strategies that reduce overall message length while maintaining decompression accuracy.
2Ease of operation
If short messages are transmitted in uncompressed form, then transmission is simple, but bandwidth usage increases and latency increases in bandwidth-constrained networks
Solution Approach 1:
The patent applies compression encoding to short messages before transmission, performing the compression action in advance. This preliminary compression reduces the message length and bandwidth requirements before the data enters the network, addressing the bandwidth constraint issue. The receiving end performs corresponding decompression, maintaining end-to-end compatibility while optimizing network resource utilization.
3Quantity of substance
If dictionary-based compression is used with short code sequences, then pattern matching is attempted, but the overhead of dynamic dictionary creation exceeds the benefits for short messages
Solution Approach 1:
The patent employs lightweight, simple encoding schemes for each sub-block rather than complex dynamic dictionary structures. The compression approach uses basic character frequency analysis and simple substitution tables that are computationally inexpensive to create and use. This disposable, simple encoding strategy avoids the overhead of maintaining complex dictionaries while achieving effective compression for short message sub-blocks.
Data Source
AI summary
A method for compressing a short message includes receiving a short message that includes a plurality of text strings for compression, dividing the short message into one or more sub-blocks, where a number of text strings in each of the one or more sub-blocks is less than or equal to a predetermined number. The method also includes compressing each of the one or more sub-blocks by identifying a type of a first text string, identifying a code representing the type, determining whether the first text string exists in a library, upon determining that the first text string exists in the library, determining an index corresponding to the first text string, extracting a predetermined number of least significant digits of the index, and replacing the first text string in that sub-block with the code and the extracted predetermined number of least significant digits of the index.