Encoding of plain ASCII data streams

Patent metadata

Field	Value
Publication number	US-9300322-B2
Application number	US-201414309901-A
Country	US
Kind code	B2
Filing date	Jun 20, 2014
Priority date	Jun 20, 2014
Publication date	Mar 29, 2016
Grant date	Mar 29, 2016

Abstract

A pair of adjacent characters in a plain ASCII data stream is examined for a condition that the pair contains a consonant followed by one of a set of characters, or a vowel followed by one of the set of characters. The set of characters is selected only from vowels and the space character. If the condition is satisfied, the pair is encoded as a corresponding extended ASCII code. If the condition is not satisfied, the first character of the pair is emitted as a corresponding plain ASCII code, and a next pair is formed with the second character of the (previous) pair as the first character and a next character of the plain ASCII stream as the second character. The next pair as well as further pairs are examined for the condition and correspondingly processed. Compression of the plain ASCII data stream is thereby achieved.

First claim

What is claimed is:

1. A method of encoding plain ASCII data streams, said method being performed in a digital processing system, said method comprising:
receiving a stream of characters sought to be encoded as an encoded content, with each character being represented as a corresponding plain ASCII code;
selecting a pair of adjacent characters in said stream;
examining said pair for a condition of said pair containing a consonant followed by one of a set of characters, or a vowel followed by one of said set of characters, wherein said set of characters is selected only from vowels and the space character;
if said condition is satisfied, emitting a corresponding extended ASCII code for said pair into said encoded content, and forming said pair for a next iteration as the next two characters of said stream;
if said condition is not satisfied, emitting the first character of said pair in the form of a corresponding plain ASCII code into said encoded content, and forming said pair for said next iteration with the second character of the pair as the first character and a next character of said stream of characters as the second character; and
performing said next iteration of said examining and said emitting using the formed pair until all of said stream of characters are encoded in said encoded content.

2. The method of claim 1 , wherein said set of characters comprises only five characters.

3. The method of claim 2 , wherein said set of characters comprises only vowels in one of upper and lower cases.

4. The method of claim 2 , wherein said set of characters comprises four vowels and said space character.

5. The method of claim 4 , wherein said four vowels comprise a, e, i, and o.

6. The method of claim 1 , further comprising processing said emitted codes by a compression approach to generate a further compressed representation of said stream of characters.

7. A digital processing system comprising:
a processor;
a random access memory (RAM);
a machine readable medium to store one or more instructions, which when retrieved into said RAM and executed by said processor causes said digital processing system to process a stream of characters sought to be encoded as an encoded content, said digital processing system performing the actions of:
receiving said stream of characters, with each character being represented as a corresponding plain ASCII code;
selecting a pair of adjacent characters in said stream;
examining said pair for a condition of said pair containing a consonant followed by one of a set of characters, or a vowel followed by one of said set of characters, wherein said set of characters is selected only from vowels and the space character;
if said condition is satisfied, emitting a corresponding extended ASCII code for said pair into said encoded content, and forming said pair for a next iteration as the next two characters of said stream;
if said condition is not satisfied, emitting the first character of said pair in the form of a corresponding plain ASCII code into said encoded content, and forming said pair for said next iteration with the second character of the pair as the first character and a next character of said stream of characters as the second character; and
performing said next iteration of said examining and said emitting using the formed pair until all of said stream of characters are encoded in said encoded content.

8. The digital processing system of claim 7 , wherein said set of characters comprises only five characters.

9. The digital processing system of claim 8 , wherein said set of characters comprises only vowels in one of upper and lower cases.

10. The digital processing system of claim 8 , wherein said set of characters comprises four vowels and said space character.

11. The digital processing system of claim 10 , wherein said four vowels comprise a, e, i, and o.

12. The digital processing system of claim 7 , further comprising processing said emitted codes by a compression approach to generate a further compressed representation of said stream of characters.

13. A non-transitory machine readable medium storing one or more sequences of instructions for enabling a digital processing system to process a stream of characters, wherein execution of said one or more instructions by one or more processors contained in said digital processing system enables said digital processing system to perform the actions of:
receiving said stream of characters, with each character being represented as a corresponding plain ASCII code;
selecting a pair of adjacent characters in said stream;
examining said pair for a condition of said pair containing a consonant followed by one of a set of characters, or a vowel followed by one of said set of characters, wherein said set of characters is selected only from vowels and the space character;
if said condition is satisfied, emitting a corresponding extended ASCII code in place of said pair, and forming said pair for a next iteration as the next two characters of said stream;
if said condition is not satisfied, emitting the first character of said pair in the form of a corresponding plain ASCII code, and forming said pair for said next iteration with the second character of the pair as the first character and a next character of said stream as the second character; and
performing said next iteration of said examining and said emitting using the formed pair.

14. The non-transitory machine readable medium of claim 13 , wherein said set of characters comprises only five characters.

15. The non-transitory machine readable medium of claim 14 , wherein said set of characters comprises only vowels in one of upper and lower cases.

16. The non-transitory machine readable medium of claim 14 , wherein said set of characters comprises four vowels and said space character.

17. The non-transitory machine readable medium of claim 16 , wherein said four vowels comprise a, e, i, and o.

18. The non-transitory machine readable medium of claim 13 , further comprising instructions for processing said emitted codes by a compression approach to generate a further compressed representation of said stream of characters.

19. A non-transitory machine readable medium storing one or more sequences of instructions for enabling a digital processing system to process streams of characters, wherein execution of said one or more instructions by one or more processors contained in said digital processing system enables said digital processing system to perform the actions of:
receiving a stream of characters sought to be encoded as an encoded content, with each character being represented as a corresponding plain ASCII code;
selecting a pair of adjacent characters in said stream;
examining said pair for a condition of said pair containing a consonant followed by one of a set of characters, or a vowel followed by one of said set of characters, wherein said set of characters is selected only from vowels and the space character;
if said condition is satisfied, emitting a corresponding extended ASCII code for said pair into said encoded content, and forming said pair for a next iteration as the next two characters of said stream;
if said condition is not satisfied, emitting the first character of said pair in the form of a corresponding plain ASCII code into said encoded content, and forming said pair for said next iteration with the second character of the pair as the first character and a next character of said stream of characters as the second character; and
performing said next iteration o

Assignees

• Oracle Int Corp

Inventors

• Shirguppi Sagar Shamrao

Classifications

• H03M7/705 Primary

  Unicode · CPC title

• H03M7/42

  using table look-up for the coding or decoding process, e.g. using read-only memory {(H03M7/4006 takes precedence)} · CPC title

• H03M7/4093 Primary

  Variable length to variable length coding · CPC title