Patent ID: 6388585
Filing Date: 2002-05-14
Classification: H03M

Abstract:
A decompression language for compressing original data by replacing said original data with decompression instructions, and said decompression instructions may be executed to retrieve said original data without any data loss; the decompression instructions are characterized by: counting an occurrence of the number of times each character appears in a string of characters; filling a string of data with background character which is the character that has the highest number of occurrences; overwriting one or more said background character at required positions within the string of data of said background character with subsequent current character, whose number of occurrences in the string of characters is greater than zero, and is positioned based on its positions within said string of characters and the decompression instructions; wherein a new data string at compression level zero is first developed and is comprised of a compressed segment instruction at compression level zero and an original data instruction and said original data, then compressed segment instruction at compression level 1 is produced to start a new data string at compression level 1, and said new data string at compression level zero is analyzed to count the occurrence of each possible character within said new data string at compression level zero, and the character with the greatest count is chosen and defined as the said background character, and an instruction is produced that will produce a string whose length is equal to the length of said new data string at compression level zero, and fill it with said background character, then said background character's count is set equal to zero, and each said character with a count greater than zero will in turn become the said current character, and instructions will be produced for each said current character, and said current character will be positioned at required locations to overwrite one or more said background character of said string, developing another set of decompression instructions in a said new data string at compression level 1, and at higher compression levels if each subsequent new data string is repeatedly compressed, said decompression language comprising:a) a non executing decompression instruction; b) a decompression instruction for defining a compressed segment, its compression level, and length; c) a decompression instruction for defining said original data, its length and units; d) a decompression instruction for producing a string of a specified length, whose length is equal to the length of said new data string, and filled with a specified said background character; e) a decompression instruction for changing to a new said current character, and resetting the current position in a string to zero; f) decompression instructions for positioning a single said current character at a distance from the current position, defining a new said current position and positioning from said new current position at a specified interval, a specified number of additional said current characters, each successive said current character at said specified interval between each said current character; g) and decompression instructions for positioning a single said current character at an absolute position, defining a new said current position and positioning from said new current position at a specified interval, a specified number of additional said current characters, each successive said current character at said specified interval between each said current character.