Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
186 words
A method for coding information from a binary Markov information source by binary coding an output symbol sequence from said information source comprising less probable symbols (LPS) and more probable symbols (MPS), each having an occurrence probability, on a normalization number line, said method comprising the steps of; a) storing in a memory storage device a normalization number line having a range from 0 to 1 which corresponds to said output symbol sequence, b) keeping a desired calculation accuracy by expanding a range of the normalization number line which includes a mapping range by means of a multiple of a power of 2 when the mapping range becomes less than 0.5, c) allocating a portion of said normalization number line as a predetermined mapping interval for said LPSs, said portion being proportional to the occurrence probability of said LPSs, d) allocating the remaining portion of said number line as a mapping interval for said MPSs, e) reassigning half of the LPS mapping interval above 0.5 to said MPS mapping interval when the LPS mapping range exceeds 0.5, and f) repeating steps b, c, d and e.
Claim 2
Independent Claim
186 words
A method for coding information from a binary Markov information source by binary coding an output symbol sequence from said information source comprising less probable symbols (LPS) and more probable symbols (MPS), each having an occurrence probability, on a normalization number line, said method comprising the steps of; a) storing in a memory storage device a normalization number line having a range from 0 to 1 which corresponds to said output symbol sequence, b) keeping a desired calculation accuracy by expanding a range of the normalization number line which includes a mapping range by means of a multiple of a power of 2 when the mapping range becomes less than 0.5, c) allocating a portion of said normalization number line as a predetermined mapping interval for said LPSs, said portion being proportional to the occurrence probability of said LPSs, d) allocating the remaining portion of said number line as a mapping interval for said MPSs, e) reassigning half of the LPS mapping interval above 0.5 to said MPS mapping interval when the LPS mapping range exceeds 0.5, and f) repeating steps b, c, d and e.
Claim 3
Dependent Claim
26 words
A coding method as set forth in claim 1 whereas said LPS mapping interval is a power of 1/2 of the range of said number line.
Claim 4
Dependent Claim
63 words
A coding method as set forth in claim 1 further including the steps of assigning as an offset value the difference between 1 and the LPS mapping interval after step e), and coding a base value for subsequent use for calculating the offset value after step e) by subtracting said offset value from the lower limit of said MPS mapping range before normalization.
Claim 5
Independent Claim
176 words
An apparatus for coding information from a binary Markov information source by binary coding an output symbol sequence comprising less probable symbols (LPSs) and more probable symbols (MPS) from said information source on a normalization number line, said LPSs and MPSs each having an occurrence probability, said apparatus comprising: memory storage means for storing a normalization number line having a range from 0 to 1 which corresponds to said output symbol sequence, means for keeping desired calculation accuracy by expanding a range on said normalization number line, which includes a mapping range, by a multiple power of 2 when the mapping range becomes less than 0.5, means for allocating a portion of said normalization number line as a predetermined mapping interval for said LPSs, said portion being proportional to the occurrence probability of said LPSs, means for allocating the remaining portion of said normalization number line as a mapping interval for said MPSs, means for reassigning half of the LPS mapping interval above 0.5 to said MPS mapping interval when said LPS mapping interval exceeds 0.5.
Claim 6
Independent Claim
176 words
An apparatus for coding information from a binary Markov information source by binary coding an output symbol sequence comprising less probable symbols (LPSs) and more probable symbols (MPS) from said information source on a normalization number line, said LPSs and MPSs each having an occurrence probability, said apparatus comprising: memory storage means for storing a normalization number line having a range from 0 to 1 which corresponds to said output symbol sequence, means for keeping desired calculation accuracy by expanding a range on said normalization number line, which includes a mapping range, by a multiple power of 2 when the mapping range becomes less than 0.5, means for allocating a portion of said normalization number line as a predetermined mapping interval for said LPSs, said portion being proportional to the occurrence probability of said LPSs, means for allocating the remaining portion of said normalization number line as a mapping interval for said MPSs, means for reassigning half of the LPS mapping interval above 0.5 to said MPS mapping interval when said LPS mapping interval exceeds 0.5.
Claim 7
Dependent Claim
25 words
An apparatus as set forth in claim 4 wherein said LPS mapping interval is a power of 1/2 of the range of said number line.
Claim 8
Dependent Claim
73 words
An apparatus as set forth in claim 4 further comprising means for assigning an offset value, said offset value being the difference between 1 and the LPS interval before reassignment of the LPS mapping interval, and means for coding a base value for subsequent use for calculating the offset value after reassignment of the LPS mapping interval by subtracting said offset value from the lower limit of said MPS mapping range before normalization.