Method for data compression by associating complex numbers with files of data values
Abstract
A method for compressing data for storage or transmission. Given a complex polynomial and a value assigned to each root, a root generated data file (RGDF) is created, one entry at a time. Each entry is mapped to a point in a complex plane. An iterative root finding technique is used to map the coordinates of the point to the coordinates of one of the roots of the polynomial. The value associated with that root is assigned to the entry. An equational data compression (EDC) method reverses this procedure. Given a target data file, the EDC method uses a search algorithm to calculate a set of m complex numbers and a value map that will generate the target data file. The error between a simple target data file and generated data file is typically less than 10%. Data files can be transmitted or stored without loss by transmitting the m complex numbers, their associated values, and an error file whose size is at most one-tenth of the size of the input data file.
- Inventors:
-
- Dublin, CA
- San Ramon, CA
- Leeburg, VA
- Issue Date:
- Research Org.:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- OSTI Identifier:
- 871370
- Patent Number(s):
- 5717787
- Application Number:
- 08/633386
- Assignee:
- Regents of University of California (Oakland, CA)
- Patent Classifications (CPCs):
-
G - PHYSICS G06 - COMPUTING G06T - IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- DOE Contract Number:
- W-7405-ENG-48
- Resource Type:
- Patent
- Country of Publication:
- United States
- Language:
- English
- Subject:
- method; data; compression; associating; complex; files; values; compressing; storage; transmission; polynomial; value; assigned; root; generated; file; rgdf; created; entry; time; mapped; plane; iterative; finding; technique; map; coordinates; roots; associated; equational; edc; reverses; procedure; target; algorithm; calculate; set; generate; error; simple; typically; 10; transmitted; stored; loss; transmitting; size; one-tenth; input; data compression; input data; data values; compressing data; data value; /382/706/
Citation Formats
Feo, John Thomas, Hanks, David Carlton, and Kraay, Thomas Arthur. Method for data compression by associating complex numbers with files of data values. United States: N. p., 1998.
Web.
Feo, John Thomas, Hanks, David Carlton, & Kraay, Thomas Arthur. Method for data compression by associating complex numbers with files of data values. United States.
Feo, John Thomas, Hanks, David Carlton, and Kraay, Thomas Arthur. Tue .
"Method for data compression by associating complex numbers with files of data values". United States. https://www.osti.gov/servlets/purl/871370.
@article{osti_871370,
title = {Method for data compression by associating complex numbers with files of data values},
author = {Feo, John Thomas and Hanks, David Carlton and Kraay, Thomas Arthur},
abstractNote = {A method for compressing data for storage or transmission. Given a complex polynomial and a value assigned to each root, a root generated data file (RGDF) is created, one entry at a time. Each entry is mapped to a point in a complex plane. An iterative root finding technique is used to map the coordinates of the point to the coordinates of one of the roots of the polynomial. The value associated with that root is assigned to the entry. An equational data compression (EDC) method reverses this procedure. Given a target data file, the EDC method uses a search algorithm to calculate a set of m complex numbers and a value map that will generate the target data file. The error between a simple target data file and generated data file is typically less than 10%. Data files can be transmitted or stored without loss by transmitting the m complex numbers, their associated values, and an error file whose size is at most one-tenth of the size of the input data file.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {1998},
month = {2}
}