Simplified logic of parsing sizes of rice-partitions

> if the partition order is zero, n = frame's blocksize - predictor order
> else if this is not the first partition of the subframe,
>   n = (frame's blocksize / (2^partition order))
> else n = (frame's blocksize / (2^partition order)) - predictor order

if the partition order is zero, then partition_number can only be zero
if the partition order is zero, then
  (frame's blocksize / (2^partition order))
  is (frame's blocksize / 1) == frame's blocksize
This commit is contained in:
Ulrik Mikaelsson
2020-02-02 21:03:37 +01:00
committed by Erik de Castro Lopo
parent 4fbb6d4f2e
commit 37e675b777
2 changed files with 9 additions and 9 deletions

View File

@@ -1737,13 +1737,13 @@
Encoded residual. The number of samples (n) in the partition is determined as follows:<br />
<ul>
<li>
if the partition order is zero, n = frame's blocksize - predictor order
partition size = (frame's blocksize / (2^partition order))
</li>
<li>
else if this is not the first partition of the subframe, n = (frame's blocksize / (2^partition order))
for first partition of the subframe, n = partition size - predictor
</li>
<li>
else n = (frame's blocksize / (2^partition order)) - predictor order
for remaining partitions, n = partition size
</li>
</ul>
</td>
@@ -1816,13 +1816,13 @@
Encoded residual. The number of samples (n) in the partition is determined as follows:<br />
<ul>
<li>
if the partition order is zero, n = frame's blocksize - predictor order
partition size = (frame's blocksize / (2^partition order))
</li>
<li>
else if this is not the first partition of the subframe, n = (frame's blocksize / (2^partition order))
for first partition of the subframe, n = partition size - predictor
</li>
<li>
else n = (frame's blocksize / (2^partition order)) - predictor order
for remaining partitions, n = partition size
</li>
</ul>
</td>