IP Library Granted Patent US 7,286,670
Granted Patent B2
US 7,286,670 · App. 10/106,696 · Granted Oct 23, 2007

Method and apparatus for chaotic opportunistic lossless compression of data

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,286,670
App. No.
10/106,696
Granted
Oct 23, 2007
Kind
B2
Abstract

The present invention is a compression method for compressing digital data. The data is strings of digital values, which can be broken down to a series of 1 's and 0 's. The present inventive method uses a chaotic system to compress the data. The first step in the inventive method is generating a plurality of periodic orbits that correspond to a plurality of control bit strings. Each of the periodic orbits is formed with a series of numeric values. The next step is to convert the numeric values of the periodic orbits to digital data values, similar in form to the data to be compressed. The digital data values of the periodic orbits are then organized to identically match the original digital data values. Then the control bit strings corresponding to the organized digital data values of the periodic orbits are identified and saved in order, such that applying the control bit strings to the chaotic system will regenerate the original data.

Claims (53)

1. A compression method for compressing data having original digital data values, said method using a chaotic system, said method comprising the steps of:

generating a plurality of periodic orbits corresponding to a plurality of control bit strings, said periodic orbits having numeric values;

converting the numeric values of the plurality of periodic orbits to generated digital data values;

matching generated digital data values to original digital data values;

identifying the control bit strings that correspond to the matching generated digital data values; and

reducing at least one control bit string in the plurality of control bit strings to a smaller substring whereby the smaller substring is substituted in place of the control bit string.

2. The compression method of claim 1 further comprising decompressing, which comprises the steps of:

receiving the identified control bit strings;

regenerating the plurality of periodic orbits corresponding to the identified control bit strings;

and converting the numeric values of the plurality of periodic orbits to original digital data values.

3. The method of claim 2 wherein the step of decompressing is accomplished without access to a compression dictionary.

4. The method of claim 3 wherein the step of converting further comprises adding numeric values of the at least two separate generated digital data values to construct a matching generated digital data value for the outlying digital data value.

5. The method of claim 3 wherein the step of converting further comprises using the at least two separate generated digital data values to each represent a portion of a matching generated digital data value for the outlying digital data value.

6. The method of claim 1 wherein the step of matching further comprises:

finding an outlying digital data value in the original digital data values whereby a single matching generated digital data value does not exist; and

combining at least two separate generated digital data values to construct a matching generated digital data value for the outlying digital data value.

7. The method of claim 3 wherein the step of converting the numeric values of the plurality of periodic orbits to generated digital data values further comprises:

setting a threshold value;

making any orbit value in a periodic orbit greater than the threshold value a one; and

making any remaining orbit value a zero.

8. The method of claim 1 wherein the step of converting the numeric values of the plurality of periodic orbits to generated digital data values further comprises:

setting a threshold value;

making any orbit section value in a periodic orbit greater than the threshold value a one; and

making any remaining orbit section value a zero.

9. The method of claim 1 wherein the step of converting the numeric values of the plurality of periodic orbits to generated digital data values further comprises:

labeling different sections of the chaotic system with digital labels; and

concatenating digital labels of sections of the chaotic system visited during the periodic orbit by the digital labels thereby generating the generated digital data values.

10. The method of claim 1 further comprising saving the identified control bit strings that correspond to the matching generated digital data values.

11. The method of claim 1 further comprising transmitting the identified and reduced control bit strings to a receiver.

12. A system for compressing data having original digital data values, said system using a chaotic system, said system comprising:

a plurality of periodic orbits corresponding to a plurality of control bit strings, said plurality of periodic orbits having numeric values;

a converting means for using the numeric values of the plurality of periodic orbits to generate a set of generated digital data values;

a matching arrangement of generated digital data values matching the set of generated digital data values to original digital data values;

an ordered arrangement of the control bit strings correspond to the matching arrangement of generated digital data values; and

a reduction means for reducing each control bit string in the plurality of control bit strings to a smaller substring whereby the smaller substring is then used in place of the control bit string.

13. The system of claim 12 wherein:

the original digital data values further comprises an outlying digital data value in the original digital data values whereby no individual member of the set of generated digital data values matches the outlying digital data value; and

the matching arrangement of generated digital data values further comprises a generated digital data value combination consisting of a plurality of individual members of the set of generated digital data values.

14. The system of claim 13 wherein the generated digital data value combination further consists of a sum of the plurality of individual members of the set of generated digital data values to construct part of the matching arrangement of generated digital data values for the outlying digital data value.

15. The system of claim 13 wherein the generated digital data value combination further consists of a concatenation of the plurality of individual members of the set of generated digital data values.

16. The system of claim 12 wherein the converting means further comprises:

a threshold value;

a one bit value for any orbit value in a periodic orbit greater than the threshold value; and

a zero bit value for any remaining orbit value a zero.

17. The system of claim 12 wherein the converting means further comprises:

a threshold value;

a one bit value for any orbit section value in a periodic orbit greater than the threshold value; and

a zero bit value for any remaining orbit section value.

18. The system of claim 12 wherein the converting means further comprises:

a plurality of digital labels for sections of the chaotic system; and

a digital label concatenation of the chaotic system sections visited during periodic orbit.

19. The system of claim 12 further comprising a storage location in which the ordered arrangement of the substrings are stored.

20. The system of claim 12 further comprising a transmitter for transmitting the ordered arrangement of the substrings to a receiver whereby the receiver only requires a mathematically identical chaotic system to decompress the ordered arrangement of the substrings.

Assignments (11)
RELEASE OF SECURITY INTEREST Recorded Jan 7, 2014
From: LLOYD I. MILLER TRUST A-4; MILFAM II, L.P.; SINGER CHILDREN'S MANAGEMENT TRUST; MARRA, JANICE; OROS, DAVE; OROS, MARIA
To: LIVEWIRE MOBILE, INC.; GROOVE MOBILE, INC.
Reel/Frame 031906/0406 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 14, 2013
From: LIVEWIRE MOBILE, INC.; GROOVE MOBILE, INC.
To: ONMOBILE LIVE, INC.
Reel/Frame 031009/0320 →
CHANGE OF NAME Recorded Aug 14, 2013
From: CHAOTICOM, INC.
To: GROOVE MOBILE, INC.
Reel/Frame 031014/0054 →
SECURITY AGREEMENT Recorded Dec 19, 2011
From: GROOVE MOBILE, INC.
To: SINGER CHILDREN'S MANAGEMENT TRUST; MILFAM II, L.P.; LLOYD I. MILLER TRUST A-4; OROS, DAVID; OROS, MARLA; MARRA, JANICE
Reel/Frame 027412/0188 →
RELEASE Recorded Jul 19, 2011
From: SILICON VALLEY BANK
To: GROOVE MOBILE, INC.
Reel/Frame 026617/0577 →
SECURITY AGREEMENT Recorded Jun 27, 2011
From: GROOVE MOBILE INC.
To: SINGER CHILDREN'S MANAGEMENT TRUST; MILFAM II, L.P.; LLOYD I. MILLER TRUST A-4; OROS, DAVID; ORLOS, MARLA
Reel/Frame 026509/0596 →
SECURITY AGREEMENT Recorded Nov 18, 2008
From: GROOVE MOBILE, INC.
To: SILICON VALLEY BANK
Reel/Frame 021849/0696 →
SECURITY AGREEMENT Recorded Dec 11, 2007
From: GROOVE MOBILE, INC.
To: ORIX VENTURE FINANCE LLC
Reel/Frame 020227/0011 →
INTELLECTUAL PROPERTY SECURITY AGREEMENT Recorded Aug 15, 2007
From: GROOVE MOBILE, INC.
To: ORIX VENTURE FINANCE LLC
Reel/Frame 019690/0548 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 12, 2003
From: SHORT, KEVIN M.
To: CHAOTICOM, INC.
Reel/Frame 013646/0324 →
AMENDED AND RESTATED SECURITY AGREEMENT Recorded May 5, 2003
From: CHAOTICOM, INC.
To: CHARLES RIVER PARTNERSHIP XI, LP; CHARLES RIVER FRIENDS XI-A, LP; CHARLES RIVER FRIENDS XI-B, LP; KODIAK VENTURE PARTNERS, L.P.; KODIAK VENTURE PARTNERS II-A, L.P.; KODIAK VENTURE PARTNERS II-B, L.P.
Reel/Frame 014026/0443 →