Method for encoding data

• US 7,453,378 B2
• Filed: 10/02/2007
• Issued: 11/18/2008
• Est. Priority Date: 06/03/2005
• Status: Expired due to Fees

• Current Assignee: Sarukkai R. Narayanan
• Original Assignee: Sarukkai R. Narayanan
• Inventors: Narayanan, Sarukkai R.
• Primary Examiner(s): YOUNG, BRIAN K
• Application Number:
  US11/866,137
• Publication Number:
  US 20080018504A1
• Time in Patent Office: 413 Days
• Field of Search: 341/51, 341/106, 341/107, 341/56
• US Class Current: 341/51
• CPC Class Codes: 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

Abstract

A method of compressing ordered binary data, comprising the step of: (a) encoding and summarizing a frame of data to produce an initial super cooled set. The frame of data includes bits of data in a number that is an odd multiple of four. In one embodiment, the method further comprises the step of: (b) compressing the initial super cooled set. Compressing comprises the steps of: embedding the initial super cooled set in a known position within a subsequent frame of data containing uncompressed data; and encoding and summarizing the subsequent frame of data containing the initial super cooled set to produce a subsequent super cooled set. In another embodiment, the method further comprises the steps of: (c) defining the subsequent super cooled set as the initial super cooled set; and (d) repeating steps b and c to produce a super frozen set.

Claims

1. A method of compressing ordered input binary data comprising the steps of:

accessing the input binary data;

determining whether a frame of data within the the input binary data includes bits of data in a number that is an odd multiple of four;

adding a number of padding bits to the input binary data to produce a frame of data responsive to a determination that the input binary data includes bits of data in a number that is not a multiple of four, the number of padding bits such that when added to the bits of the input binary data, the resulting frame of data includes bits of data in a number that is an odd multiple of four; and

,

encoding and summarizing a frame of data to produce an initial compressed set, the frame of data including bits of data in a number that is a multiple of four.

2. The method of claim 1, further comprising the step of

compressing the initial compressed set, wherein compressing comprises the steps of:

embedding the initial compressed set in a known position within a subsequent frame of data containing uncompressed data;

encoding and summarizing the subsequent frame of data containing the initial compressed set to produce a subsequent compressed set.

3. The method of claim 1, further comprising the steps of:

defining the subsequent compressed set as the initial compressed set;

repeating the steps of;

embedding the initial compressed set in a known position within a subsequent frame of data containing uncompressed data,

encoding and summarizing the subsequent frame of data containing the initial compressed set to produce a subsequent compressed set b and c to produce a super compressed set, and

defining the subsequent compressed set as the initial compressed set,

to produce a super compressed set.

4. The method of claim 1, wherein encoding and summarizing comprises the steps of:

adding bits to the end of the input stream of data to enable proper encoding;

introducing a predetermined series of bits into the input stream of data to produce a frame of modified stream of data;

rotating the modified stream of data to the right by a predetermined number of bits to produce a source stream of data;

rotating a copy of the modified stream of data to the left by a predetermined number of bits and reversing the order of the rotated copy to produce a reverse stream of data.

5. The method of claim 4, wherein the step of converting the source stream and the reverse stream into interim streams comprises dividing the binary data of the source stream and of the reverse stream into even and odd bits in relation to the position of each bit in its respective stream and applying a predetermined code to consecutive even and odd bits of each of the source stream and the reverse stream to produce a series of two-bit entities representative of each of the source stream and the reverse stream in two-tier interim streams.

6. The method of claim 4 wherein the step of converting the source stream and the reverse stream into interim streams comprises taking two consecutive bits of the source stream and reverse stream and applying a pre-determined code to produce a series of two bit entities representative of each of the source stream and the reverse stream in single-tier interim streams.

7. The method of claim 6, wherein the step of converting the source stream and the reverse stream into interim streams comprises applying a predetermined code to the binary data of the source stream and the reverse stream to produce a series of ordered four bit entities comprising two, two-bit entities representative of each of the source stream and the reverse stream in single tier interim quad streams.

8. The method of claim 7, wherein encoding and summarizing further comprises the step of:

converting the source stream into a series of sequential four bit entities and the reverse stream into a series of sequential reverse four bit entities, each puck containing two left bits a and two rights bits, the four bit entities defined such that the two left bits of each internal four bit entities is the same as the two rights bits of the immediately adjacent entities on the left and such that the two rights bits of each internal entities is the same as the two left bits of the immediately adjacent entities on the right, wherein the series of source entities representing the source stream and the series of reverse entities representing the reverse stream can be taken together to form the basis for compression of the data.

9. The method of claim 8, wherein encoding and summarizing further comprises the step of:

reversing the order of the series of reverse four bit entities representing the reverse stream and pairing the series of reverse four bit entities with the series of source four bit entities;

defining a first group of paired reverse four bit entities and source four bit entities to form a series of two four bit entities that have a precedence relationship to each other in which the reverse four bit entities of the first group have a precedence relationship with the correspondingly-paired source four bit entities of the first group, wherein the first group extends from a first end of the series of reverse pucks to a point in the series of reverse pucks such that the first group extends to a point where the precedence relationship switches to at least one inversion puck; and

,

defining a second group of paired source four bit entities and reverse four bit entities to form a series of duets in which the source four bit entities of the second group have a precedence relationship with the correspondingly-paired reverse four bit entities of the second group, wherein the second group extends from a first end of the series of source four bit entities to a point in the series of source four bit entities such that the second group includes at least one inversion entity.

10. The method of claim 9, wherein the source four bit entities and the correspondingly-paired reverse four bit entities in the series of two four bit entities that have a precedence relationship to each other in each of the first group and the second group form two helixes which resemble the double helix structure of DNA from which a binary equivalent of the double helix can be deduced.

11. The method of claim 9, wherein encoding and summarizing further comprises the steps of:

rendering the reverse four bit entities of the first group and the correspondingly-paired source four bit entities of the first group to produce a first group bubble comprising a plurality of two four bit entities that have a precedence relationship to each other and one unpaired reverse four bit entities from a first end of the reverse stream, wherein each of the two four bit entities that have a precedence relationship to each other includes one source four bit entities of the first group and one correspondingly-paired reverse four bit entities of the first group such that each two four bit entities that have a precedence relationship to each other represents eight bits of binary data; and

rendering the source four bit entities of the second group and the correspondingly-paired reverse four bit entities of the second group to produce a first group bubble comprising a plurality of two four bit entities that have a precedence relationship to each other and one unpaired source four bit entities from the first end of the source stream, wherein each of the plurality of two four bit entities that have a precedence relationship to each other is defined by one source four bit entities of the second group and one correspondingly-paired reverse four bit entities of the second group such that each two four bit entities that have a precedence relationship to each other duet represents eight bits of binary data.

12. The method of claim 11, wherein encoding and summarizing further comprises the steps of:

rearranging the reverse four bit entities and source four bit entities of the first group to produce a plurality of eight bit entities including all of the source four bit entities and reverse four bit entities except the reverse four bit entities of the first two four bit entities that have a precedence relationship to each other and the source four bit entities of the last two four bit entities that have a precedence relationship to each other, wherein each eiciht bit entity includes the source four bit entities of one pair of four bit entities that have a precedence relationship to each other and the reverse four bit entities of an immediately-subsequent two four bit entities that have a precedence relationship to each other such that each eiciht bit entity represents eight bits of binary data;

rearranging the source four bit entities and reverse four bit entities of the second group to produce a plurality of eight bit entities including all of the source four bit entities and reverse four bit entities except the source four bit entities of the first two four bit entities that have a precedence relationship to each other and the reverse four bit entities of the last two four bit entities that have a precedence relationship to each other, wherein each eight bit entity includes the reverse four bit entities of one two four bit entities that have a precedence relationship to each other and the source four bit entities of an immediately-subsequent two four bit entities that have a precedence relationship to each other such that each eight bit entity represents eight bits of binary data;

evaluating the type of each eight bit entity; and

counting the number of eight bit entities of each type.

13. The method of claim 12, wherein encoding and summarizing further comprises the steps of:

pairing each eight bit entity of the first group with the immediately subsequent eight bit entity of the first group to produce a plurality of adjacent eight bit entities including all of the eight bit entities of the first group, wherein each adjacent eight bit entity comprises one eight bit entity of the first group and the immediately subsequent eight bit entity of the first group such that each adjacent eight bit entity represents sixteen bits of binary data;

pairing each eight bit entity of the second group with the immediately subsequent eight bit entity of the second group to produce a plurality of adjacent eight bit entities including all of the eight bit entities of the second group, wherein each adjacent eight bit entity comprises one eight bit entity of the second group and the immediately subsequent eight bit entity of the second group such that each adjacent eight bit entity represents sixteen bits of binary data;

evaluating the type of each adjacent eight bit entity; and

counting the number of adjacent eight bit entity of each type.

14. The method of claim 13, wherein encoding and summarizing further comprises the steps of:

generating a compressed set for the first group representing the binary data contained in the first group in a different form containing precedential information; and

generating a compressed set for the second group representing the binary data contained in the second group in a different form containing precedential information;

wherein the compressed set for the first group and the compressed set for the second group together represent all of the binary data contained in the frame of data.

15. The method of claim 14, wherein the compressed set for the first group comprises information indicative of the number of bits of binary data in the frame of data, the number of source four bit entities in the first group, the number of reverse four bit entities in the first group, the unpaired reverse four bit entities in the first group, the starting eight bit entity and starting adjacent eight bit entity in the first group, odd and even eight bit entity types and counts in the first group, adjacent eight bit entity types and counts in the first group, and inversion entities in the first group;

and wherein the compressed set for the second group comprises information indicative of the number of bits of binary data in the frame of data, the number of source four bit entities in the second group, the number of reverse four bit entities in the second group, the unpaired source four bit entities in the second group, the starting eight bit entity and starting adjacent eight bit entity in the second group, odd and even eight bit entity types and counts in the second group, adjacent eight bit entity types and counts in the second group, and inversion entities in the second group.

16. The method of claim 15, further comprising the steps of:

dividing the information of at least one of the compressed

sets into at least a lock group and a key group, each of the lock group and the key group containing count information;

modifying the count information of each of the lock group and the key group by a factor to produce modified count information to place the at least one compressed set in a lock box mode;

wherein the factor may be negatively applied to the modified count information to return the count information to an unmodified state to unlock the at least one compressed set and return the at least one compressed set from the lock box mode to an open box mode.