# US 10,873,836 B2 · Efficient short message compression

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 10,873,836 B2
- Document ID: US10873836B2
- Status: Granted
- Kind: B2
- Application number: 16/685,860
- Filed: 2019-11-15
- Published: 2020-03-12
- Granted: 2020-12-22
- Earliest claimed: 2018-06-27
- Assignees: Harris Global Communications, Inc.
- Applicants: Harris Global Communications, Inc.
- Inventors: William N. Furman; John W. Nieto; Michael A. Wadsworth
- Web page: https://patentgrep.com/patent/US10873836B2

## CPC

- H04W 4/14: Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]
- H03M 7/30: Compression (speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N); Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0061: {Error detection codes}
- H04L 69/04: Protocols for data compression, e.g. ROHC
- H04W 28/04: Error control
- H04L 1/0045: {Arrangements at the receiver end}
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

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.

## Claims

### Claim 1

A method for reconstructing a compressed short message, comprising, by a processor:
receiving a compressed short message, the message comprising a plurality of fields;
dividing the compressed short message into one or more sub-blocks;
for each of the one or more sub-blocks:
a) identifying positions of a number of text strings field, a cyclic redundancy check (CRC) code length field, and a CRC code field in that sub-block,
b) extracting, from that sub-block, the CRC code length and the number of words (m) based on the identified positions,
c) extracting, from that sub-block, the CRC code,
d) extracting, from that sub-block, a first code representing a text string type of a text string following the first code,
e) analyzing the first code to determine whether the text string was compressed using a library,
f) upon determining that the text string was compressed using a library, extracting, from that sub-block, a predetermined number of least significant bits representative of an index corresponding to the text string in the library,
g) using the CRC code to determine the index, and
h) using the index to replace the predetermined number of least significant bits representative of the index in that sub-block with the text string.

### Claim 2 (depends on 1)

The method according to claim 1, further comprising upon determining that the text string was not compressed using a library, identifying a number of characters in the text string and decoding the text string.

### Claim 3 (depends on 2)

The method according to claim 2, further comprising repeating the steps (d)-(h) “m” number of times to create a reconstructed message.

### Claim 4

A system for reconstructing a compressed short message, the system comprising: a processor, and a non-transitory computer-readable storage medium comprising one or more programming instructions that, when executed, will cause the processor to:
receive a compressed short message, the message comprising a plurality of fields;
divide the compressed short message into one or more sub-blocks;
for each of the one or more sub-blocks:
a) identify positions of a number of text strings field, a cyclic redundancy check (CRC) code length field, and a CRC code field in that sub-block,
b) extract, from that sub-block, the CRC code length and the number of words (m) based on the identified positions,
c) extract, from that sub-block, the CRC code,
d) extract, from that sub-block, a first code representing a text string type of a text string following the first code,
e) analyze the first code to determine whether the text string was compressed using a library,
f) upon determining that the text string was compressed using a library, extracting, from that sub-block, a predetermined number of least significant bits representative of an index corresponding to the text string in the library,
g) use the CRC code to determine the index, and
h) use the index to replace the predetermined number of least significant bits representative of the index in that sub-block with the text string.

### Claim 5 (depends on 4)

The system according to claim 4, further comprising programming instructions that, when executed, will cause the processor to, for each of the one or more sub-blocks, upon determining that the text string was not compressed using a library, identify a number of characters in the text string and decoding the text string.

### Claim 6 (depends on 5)

The system according to claim 5, further comprising programming instructions that, when executed, will cause the processor to repeat the steps (d)-(h) “m” number of times to create a reconstructed message.