Data processing: database and file management or data structures – Database design – Data structure types
Patent
1998-10-29
1999-12-28
Black, Thomas G.
Data processing: database and file management or data structures
Database design
Data structure types
707101, 707102, 707103, 707104, G06F 1730
Patent
active
060094346
ABSTRACT:
A data encoder and method utilizes a node list for storing a list of nodes in the data array to be processed, a branch list for storing a list of tree branches in the data array to be processed and a set list for storing a list of data sets. The method begins by initially storing in the node list node identifiers representing a predefined set of nodes in the data array, corresponding to coefficients generated by a last iteration of a data decomposition procedure. Also, it initially stores in the branch list branch identifiers representing tree branches corresponding to a predefined subset of the nodes initially listed in the node list. Each such tree branch has an associated root node and a branch depth value indicating how many node layers intervene between the root node and the nodes of the tree branch closest to the root node. The set list is initially empty, and a parameter called the LayerLimit value is also initialized. For successively smaller values of m, where m is a positive integer, a set of data encoding steps are repeatedly performed so as to process all nodes, branches and sets in the lists. A magnitude flag is output for each node, branch and set to indicate whether or not it is or contains a node whose absolute value is equal to or larger than 2.sup.m-1, and for each node, branch and set that is equal to or larger than 2.sup.m-1 further processing is performed.
REFERENCES:
patent: 3584183 (1971-06-01), Chiaretta et al.
patent: 3685016 (1972-08-01), Eachus
patent: 3691557 (1972-09-01), Constant
patent: 4599567 (1986-07-01), Goupillaud et al.
patent: 4974187 (1990-11-01), Lawton
patent: 5014134 (1991-05-01), Lawton et al.
patent: 5254919 (1993-10-01), Bridges et al.
patent: 5262958 (1993-11-01), Chui et al.
patent: 5271012 (1993-12-01), BLaum et al.
patent: 5283878 (1994-02-01), Murray
patent: 5321776 (1994-06-01), Shapiro
patent: 5347479 (1994-09-01), Miyazaki
patent: 5384725 (1995-01-01), Coifman et al.
patent: 5388182 (1995-02-01), Benedetto et al.
patent: 5392255 (1995-02-01), LeBrass et al.
patent: 5414741 (1995-05-01), Shapiro
patent: 5420891 (1995-05-01), Akansu
patent: 5579475 (1996-11-01), Blaum et al.
patent: 5893100 (1999-04-01), Chui et al.
Potter et al, Array Processor, Supercomputers, IEEE, pp. 1896-1914, Dec. 1989.
Maier et al, Object Databases for Scientific Computing, IEEE, pp. 176-184, Sep. 1994.
Lu et al, An Encoding Procedure and a Decoding Procedure for a New Modified Huffman Code, IEEE, pp. 128-136, Jan. 1990.
Chui Charles K.
Yi Rongxiang
Black Thomas G.
Coby Frantz
TeraLogic, Inc.
LandOfFree
System and method for tree ordered coding of sparse data sets does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for tree ordered coding of sparse data sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for tree ordered coding of sparse data sets will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2389732