# US 2017/0257634 A1 · System and method for compression and decompression of text data

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

- Number: US 2017/0257634 A1
- Document ID: US20170257634A1
- Status: Published application
- Kind: A1
- Application number: 15/438,745
- Filed: 2017-02-21
- Published: 2017-09-07
- Earliest claimed: 2016-03-02
- Assignees: Centre for Development of Advanced Computing (C-DAC)
- Applicants: Centre for Development of Advanced Computing (C-DAC)
- Inventors: Mahesh Dattatray KULKARNI; Ajay Sharadchandra LOHOKARE; Umesh Hareshwar VITHALKAR; Swapnil Dnyaneshwar BELHE; Vinodkumar Tejlal PACHE
- Web page: https://patentgrep.com/patent/US20170257634A1

## CPC

- H03M 7/705: {Unicode}
- G06F 18/23: Clustering techniques
- G06V 30/2445: {Alphabet recognition, e.g. Latin, Kanji or Katakana}
- H03M 7/42: using table look-up for the coding or decoding process, e.g. using read-only memory {(H03M7/4006 takes precedence)}
- H04N 19/184: the unit being bits, e.g. of the compressed video stream
- H04N 19/44: Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
- G06V 30/293: {of characters other than Kanji, Hiragana or Katakana}
- 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)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

The present disclosure relates to system(s) and method(s) for compression and decompression of Unicode characters. The system is configured to maintain a set of character tables and a cluster table in a memory. Each character table is configured to store a set of Unicode characters corresponding to a character class of a set of characters classes, wherein each Unicode character from the character table is assigned with a shortened bit representation. Furthermore, the cluster table may be configured to maintain a set of cluster types and a cluster identifier corresponding to each of the cluster type. The system is configured to compress text data in Unicode format using the set of character tables and the cluster table by identifying the different clusters in each word and replacing the clusters with cluster identifier followed by the shorten bit representation of characters in each cluster.

## Claims

### Claim 1

A compression system for compression of text data, the compression system comprising:
a memory; and
a processor coupled to the memory, wherein the processor is configured to execute programmed instructions stored in the memory to:
maintain a set of character tables and a cluster table in the memory, wherein each character table stores a set of Unicode characters corresponding to a character class of a set of characters classes, wherein each Unicode character from the character table is assigned with a shortened bit representation, and wherein the cluster table is configured to maintain a set of cluster types and a cluster identifier corresponding to each of the cluster type, wherein each cluster type corresponds to a character class or a valid combination of two or more character classes represented by the set of character tables;
accept an input text string comprising a combination of Unicode characters;
classify the input text string into a set of clusters based on the set of cluster types in the cluster table, wherein each cluster corresponds to an Unicode character or a valid combination of two or more Unicode characters in the input text string;
identify a cluster identifier, from the cluster table, corresponding to each cluster from the set of clusters;
identify a shortened bit representation corresponding to each character, in each cluster, from the set of character tables; and
generate a compressed text string, corresponding to the input text string, by representing each cluster with a corresponding cluster identifier followed by the shortened bit representation corresponding to each character in the cluster.

### Claim 2 (depends on 1)

The compression system of claim 1, wherein the shortened bit representation is based on the number of characters in each of the character table.

### Claim 3 (depends on 1)

The compression system of claim 1, wherein the shortened bit representation is unique for each character in the character table.

### Claim 4 (depends on 1)

The compression system of claim 1, wherein the cluster identifier is of a variable bit length, wherein the variable bit length is assigned based on the frequency of occurrence of the cluster.

### Claim 5 (depends on 1)

The compression system of claim 1, wherein the valid combination is determined based on a cluster types associated with at least one language of a set of languages.

### Claim 6

A decompression system for decompression of compressed text data, the decompression system comprising:
a memory; and
a processor coupled to the memory, wherein the processor is configured to execute programmed instructions stored in the memory to:
maintain a set of character tables and a cluster table in the memory, wherein each character table stores a set of Unicode characters corresponding to a character class of a set of characters classes, wherein each Unicode character from the character table is assigned with a shortened bit representation, and wherein the cluster table is configured to maintain a set of cluster types and a cluster identifier corresponding to each of the cluster type, wherein each cluster type corresponds to a character class or a valid combination of two or more character classes represented by the set of character tables;
accept a compressed text string, wherein the compressed text string is a set of clusters, wherein each cluster is represented with a cluster identifier followed by shortened bit representation corresponding to each Unicode character in each cluster;
classify the compressed text string into a set of clusters, wherein each cluster is identified based on a corresponding cluster identifier and the set of cluster types in the cluster table;
identify a shortened bit representation and corresponding character table for each character in the cluster based on the cluster type applicable to the cluster; and
generate a Unicode text string by representing each shortened bit representation in the cluster with a corresponding Unicode character, wherein the Unicode character is identified from the corresponding character table.

### Claim 7 (depends on 6)

The decompression system of claim 6, wherein the shortened bit representation is based on the number of characters in each of the character table.

### Claim 8 (depends on 6)

The decompression system of claim 6, wherein the shortened bit representation is unique for each character in the character table.

### Claim 9 (depends on 6)

The decompression system of claim 6, wherein the cluster identifier is of a variable bit length, wherein the variable bit length is assigned based on the frequency of occurrence of the cluster.

### Claim 10 (depends on 6)

The decompression system of claim 6, wherein the valid combination is determined based on a cluster types associated with at least one language of a set of languages.

### Claim 11

A method for compression of text data, the method comprising steps of:
maintaining, by a processor, a set of character tables and a cluster table in the memory, wherein each character table stores a set of Unicode characters corresponding to a character class of a set of characters classes, wherein each Unicode character from the character table is assigned with a shortened bit representation, and wherein the cluster table is configured to maintain a set of cluster types and a cluster identifier corresponding to each of the cluster type, wherein each cluster type corresponds to a character class or a valid combination of two or more character classes represented by the set of character tables;
accepting, by the processor, an input text string comprising a combination of Unicode characters;
classifying, by the processor, the input text string into a set of clusters based on the set of cluster types in the cluster table, wherein each cluster corresponds to an Unicode character or a valid combination of two or more Unicode characters in the input text string;
identifying, by the processor, a cluster identifier, from the cluster table, corresponding to each cluster from the set of clusters;
identifying, by the processor, a shortened bit representation corresponding to each character, in each cluster, from the set of character tables; and
generating, by the processor, a compressed text string, corresponding to the input text string, by representing each cluster with a corresponding cluster identifier followed by the shortened bit representation corresponding to each character in the cluster.

### Claim 12

A method for decompression of compressed text data, the method comprising steps of:
maintaining, by a processor, a set of character tables and a cluster table in the memory, wherein each character table stores a set of Unicode characters corresponding to a character class of a set of characters classes, wherein each Unicode character from the character table is assigned with a shortened bit representation, and wherein the cluster table is configured to maintain a set of cluster types and a cluster identifier corresponding to each of the cluster type, wherein each cluster type corresponds to a character class or a valid combination of two or more character classes represented by the set of character tables;
accepting, by the processor, a compressed text string, wherein the compressed text string is a set of clusters, wherein each cluster is represented with a cluster identifier followed by shortened bit representation corresponding to each Unicode character in each cluster;
classifying, by the processor, the compressed text string into a set of clusters, wherein each cluster is identified based on a corresponding cluster identifier and the set of cluster types in the cluster table;
identifying, by the processor, a shortened bit representation and corresponding character table for each character in the cluster based on the cluster type applicable to the cluster; and
generating, by the processor, a Unicode text string by representing each shortened bit representation in the cluster with a corresponding Unicode character, wherein the Unicode character is identified from the corresponding character table.

### Claim 13

A non-transitory computer readable medium embodying a program executable in a computing device for compression of text data, the computer program product comprising:
a program code for maintaining a set of character tables and a cluster table in the memory, wherein each character table stores a set of Unicode characters corresponding to a character class of a set of characters classes, wherein each Unicode character from the character table is assigned with a shortened bit representation, and wherein the cluster table is configured to maintain a set of cluster types and a cluster identifier corresponding to each of the cluster type, wherein each cluster type corresponds to a character class or a valid combination of two or more character classes represented by the set of character tables;
a program code for accepting an input text string comprising a combination of Unicode characters;
a program code for classifying the input text string into a set of clusters based on the set of cluster types in the cluster table, wherein each cluster corresponds to an Unicode character or a valid combination of two or more Unicode characters in the input text string;
a program code for identifying a cluster identifier, from the cluster table, corresponding to each cluster from the set of clusters;
a program code for identifying a shortened bit representation corresponding to each character, in each cluster, from the set of character tables; and
a program code for generating a compressed text string, corresponding to the input text string, by representing each cluster with a corresponding cluster identifier followed by the shortened bit representation corresponding to each character in the cluster.

### Claim 14

A non-transitory computer readable medium embodying a program executable in a computing device for decompression of compressed text data, the computer program product comprising:
a program code for maintaining a set of character tables and a cluster table in the memory, wherein each character table stores a set of Unicode characters corresponding to a character class of a set of characters classes, wherein each Unicode character from the character table is assigned with a shortened bit representation, and wherein the cluster table is configured to maintain a set of cluster types and a cluster identifier corresponding to each of the cluster type, wherein each cluster type corresponds to a character class or a valid combination of two or more character classes represented by the set of character tables;
a program code for accepting a compressed text string, wherein the compressed text string is a set of clusters, wherein each cluster is represented with a cluster identifier followed by shortened bit representation corresponding to each Unicode character in each cluster;
a program code for classifying the compressed text string into a set of clusters, wherein each cluster is identified based on a corresponding cluster identifier and the set of cluster types in the cluster table;
a program code for identifying a shortened bit representation and corresponding character table for each character in the cluster based on the cluster type applicable to the cluster; and
a program code for generating a Unicode text string by representing each shortened bit representation in the cluster with a corresponding Unicode character, wherein the Unicode character is identified from the corresponding character table.
