System and method for coding data
First Claim
Patent Images
1. A method for coding data, said method comprising:
- receiving data;
initializing a top tree bin structure based on a bit depth of said data, said top tree bin structure comprising a plurality of top tree bins, each of said top tree bins comprising a plurality of top tree symbols;
splitting any one of said top tree bins into two split top tree bins based on a splitting condition;
wherein said splitting condition is determined based on pseudo-splitting each of said plurality of top tree bins into a plurality of child top tree bins, said splitting step comprising;
adding bin information or loss of each one of said plurality of child top tree bins,splitting one of said top tree bins comprising said plurality of child top tree bins that correspond to a minimum increase in bin information or a maximum reduction in loss;
repeating said splitting step until a terminating condition is reached; and
generating said desired bin structure using said plurality of top tree bins and said plurality of said split top tree bins;
coding the date using the desired bin structure.
2 Assignments
0 Petitions
Accused Products
Abstract
A universal position coding method and system are provided for coding uncompressed data. Data symbols are assigned to a bin portion and a raw portion, and a data tree structure is utilized. A top down approach involves initializing a data tree based on the bit depth of the data; splitting a bin to form two separate bins based on a predetermined splitting condition; and repeating the splitting step until a terminating condition is achieved. A bottom up approach involves forming a data tree; merging two existing bins to form a new bin based on a merging condition; and repeating the merging step until a terminating condition is achieved.
-
Citations
52 Claims
-
1. A method for coding data, said method comprising:
-
receiving data; initializing a top tree bin structure based on a bit depth of said data, said top tree bin structure comprising a plurality of top tree bins, each of said top tree bins comprising a plurality of top tree symbols; splitting any one of said top tree bins into two split top tree bins based on a splitting condition;
wherein said splitting condition is determined based on pseudo-splitting each of said plurality of top tree bins into a plurality of child top tree bins, said splitting step comprising;adding bin information or loss of each one of said plurality of child top tree bins, splitting one of said top tree bins comprising said plurality of child top tree bins that correspond to a minimum increase in bin information or a maximum reduction in loss; repeating said splitting step until a terminating condition is reached; and generating said desired bin structure using said plurality of top tree bins and said plurality of said split top tree bins; coding the date using the desired bin structure. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A method for coding uncompressed data, said data having a predetermined bit depth, the steps of said method, comprising:
-
receiving said uncompressed data; initializing a bottom tree bin structure, said bottom tree bin structure comprising a plurality of bottom tree bins, each of said bottom tree bins comprising a plurality of bottom tree symbols;
merging at least two of said plurality of bottom tree bins based on a merging condition to generate a plurality of merged bottom tree bins;repeating said merging step until a terminating condition is reached; and generating said desired bin structure using said plurality of bottom tree bins and said plurality of said merged bottom tree bins; and coding the data using the desired bin structure. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. A data coding system for coding uncompressed data using a desired bin structure, the data coding system comprising:
a universal position coding system for generating a desired bin structure, said a universal position coding block comprising; an initializing block, said initializing block configured for initializing a top tree bin structure; and a processing block coupled to said initializing block and configured to split any one of said plurality of top tree bins based on a splitting condition to generate a plurality of split top tree bins; and
said processing block is further configured to split said plurality of top tree bins till a terminating condition is reached to generate said desired bin structure using said plurality of top tree bins and said plurality of said split top tree bins;
wherein said splitting condition is determined based on;pseudo-splitting each of said plurality of top tree bins into a plurality of child top tree bins, adding the bin-information or loss of each one of said plurality of child top tree bins, splitting one of said top tree bins comprising said plurality of child top tree bins that correspond to a minimum increase in bin-information or a maximum reduction in loss. - View Dependent Claims (16, 17, 18, 19)
-
20. A data coding system comprising for coding uncompressed data using a desired bin structure, the data coding system comprising:
-
a universal position coding system for generating a desired bin structure, said a universal position coding block comprising; an initializing block, initializes a bottom tree bin structure, said bottom tree bin structure comprising a plurality of bottom tree bins;
wherein each of said bottom tree bins comprises a plurality of bottom tree symbols;a processing block coupled to said initializing block;
said processing block merges at least two of said plurality of bottom tree bins based on a merging condition to generate a plurality of merged bottom tree bins; andsaid processing block further merges said plurality of bottom tree bins till a terminating condition is reached; and
said processing block generates said desired bin structure using said plurality of bottom tree bins and said plurality of said merged bottom tree bins. - View Dependent Claims (21, 22, 23, 24)
-
-
25. A computer-readable medium storing computer instructions for instructing a computer system to code uncompressed data, the computer instructions including:
-
initializing a top tree bin structure, said top tree bin structure comprising a plurality of top tree bins;
wherein each of said top tree bins comprises a plurality of top tree symbols;splitting said any one of said plurality of top tree bins based on a splitting condition to generate a plurality of split top tree bins; further splitting said plurality of top tree bins till a terminating condition is reached; and initializing a bottom tree bin structure, said bottom tree bin structure comprising a plurality of bottom tree bins;
wherein each of said bottom tree bins comprises a plurality of bottom tree symbols;merging at least two of said plurality of bottom tree bins based on a merging condition to generate a plurality of merged bottom tree bins; further merging said plurality of bottom tree bins till a terminating condition is reached; and generating a desired bin structure using said plurality of top tree bins, said plurality of split top tree bins, said plurality of bottom tree bins and said plurality of merged bottom tree bins. - View Dependent Claims (26, 27, 28, 29, 30)
-
-
31. A method for generating a desired bin structure to code an uncompressed date, said method comprising:
-
initializing a top tree bin structure, said top tree bin structure comprising a plurality of top tree bins;
wherein each of said top tree bins comprises a plurality of top tree symbols;splitting said any one of said plurality of top tree bins based on a splitting condition to generate a plurality of split top tree bins; further splitting said plurality of top tree bins till a terminating condition is reached; and initializing a bottom tree bin structure, said bottom tree bin structure comprising a plurality of bottom tree bins;
wherein each of said bottom tree bins comprises a plurality of bottom tree symbols;merging at least two of said plurality of bottom tree bins based on a merging condition to generate a plurality of merged bottom tree bins; further merging said plurality of bottom tree bins till a terminating condition is reached; generating a desired bin structure using said plurality of top tree bins, said plurality of split top tree bins, said plurality of bottom tree bins and said plurality of merged bottom tree bins; and coding the uncompressed data using the desired bin structure. - View Dependent Claims (32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46)
-
-
47. A system for coding uncompressed data, said system comprising:
-
means for initializing a top tree bin structure, said top tree bin structure comprising a plurality of top tree bins;
wherein each of said top tree bins comprises a plurality at top tree symbols; andmeans for splitting said any one of said plurality of top tree bins based on a splitting condition to generate a plurality of split top tree bins; means for further splitting said plurality of top tree bins till a terminating condition is reached; and means for initializing a bottom tree bin structure, said bottom tree bin structure comprising a plurality of bottom tree bins;
wherein each of said bottom tree bins comprises a plurality of bottom tree symbols;means for merging at least two of said plurality of bottom tree bins based on a merging condition to generate a plurality of merged bottom tree bins; means for further merging said plurality of bottom tree bins till a terminating condition is reached; and means for generating a desired bin structure using said plurality of top tree bins, said plurality of split top tree bins, said plurality of bottom tree bins and said plurality of merged bottom tree bins. - View Dependent Claims (48, 49, 50, 51, 52)
-
Specification