Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Humble suggestion. #333

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Humble suggestion. #333

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
0e347d7
Humble suggestion.
cabelo Sep 15, 2022
2fd82d1
suggestion
cabelo Oct 2, 2022
ca995e1
Another humble suggestion
cabelo Oct 13, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion 10.additional.tables.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5565,7 +5565,7 @@ Default_Coeff_Br_Cdf[ COEFF_CDF_Q_CTXS ][ TX_SIZES ][ PLANE_TYPES ][ LEVEL_CONTE

#### General

There are three fundamental quantizer matrix sizes: 32x32, 32x16 and 16x32. One set of these three sizes of
There are three fundamental quantizer matrix sizes: 32x32, 32x16 and 16x32. One set of these three sizes of the
matrix is defined for each quantizer level (except level 15)
and for each plane type (luma or chroma). All other quantizer matrix sizes
are subsampled from these. All matrix sizes, including derived ones, are
Expand Down
2 changes: 1 addition & 1 deletion annex.a.levels.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -159,7 +159,7 @@ variables derived as follows:
that belong to the indicated scalability layer and to the layers below.

* TotalDecodedLumaSampleRate is defined as the sum of the UpscaledWidth *
FrameHeight of all frames with show_existing_frame equal to 0 that belong
FrameHeight of all frames with show_existing_frame equal to 0 that belongs
to the temporal unit that belongs to the operating point, divided by the
time difference between the decoding time of the first frame of the current
temporal unit and the decoding time of the first frame of the next temporal
Expand Down
4 changes: 2 additions & 2 deletions annex.c.experiments.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,7 +29,7 @@ In particular, a frame that is processable will have correct values for:

* All syntax elements

* The size, bitdepth, subsampling structure of any output frames
* The size, bitdepth and subsampling structure of any output frames

* All values written in the reference frame update process specified in [section 7.20][], except for the contents of FrameStore
(which may or may not be correct).
Expand All @@ -50,7 +50,7 @@ A frame with show_existing_frame equal to 0 is defined to be processable if the
has been scaled - but this is not known unless the frame has been processed)

* The decoding process for the frame does not use values in RefOrderHint before they have been written
(written either by the decoding process for the current frame, or written when a previous frame was processed)
(written either by the decoding process for the current frame or written when a previous frame was processed)

* If the syntax element found_ref is equal to 1, ref_frame_idx[ i ] indicates a frame that has been processed
(this is necessary because the frame dimensions are only correct for processed frames)
Expand Down
8 changes: 4 additions & 4 deletions annex.e.decoder.model.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -138,7 +138,7 @@ rate.
#### Resource availability mode
{:.no_count}

In this mode the model simulates the operation of the decoder under the
In this mode, the model simulates the operation of the decoder under the
assumption that the complete coded frame is available in the smoothing buffer
when decoding of that frame begins. In addition, it is assumed that the decoder
will begin to decode a frame immediately after it finishes decoding the previous
Expand All @@ -150,7 +150,7 @@ of a bitstream.

To verify that a bitstream can be decoded by a decoder under the constraints of
a particular level it is assumed that the decoder performs the decoding
operations at maximum speed (the minimum time interval) specified for that level
operations at the maximum speed (the minimum time interval) specified for that level
in [section A.3][].

To use Resource Availability mode, the following parameters should be set in the
Expand Down Expand Up @@ -310,7 +310,7 @@ the index associated with the most recent random access point.

DFG i is removed from the smoothing buffer at time Removal[ i ].

There are two modes of operation of a decoder which determine whether the
There are two modes of operation of a decoder that determine whether the
actual DFG removal time Removal[ i ] may be different from the scheduled DFG
removal timing ScheduledRemovalTiming [ i ]. As was mentioned earlier, the
decoder starts decoding a frame instantaneously when the data that belongs to
Expand Down Expand Up @@ -349,7 +349,7 @@ Removal[ i ] = ScheduledRemovalTiming[ i ]
#### Removal times in resource availability mode
{:.no_count}

In the resource availability mode, buffer_removal_time[ i ] are not signaled for
In the resource availability mode, buffer_removal_time[ i ] is not signaled for
the chosen operating point. In this mode, timing of the decoder model is driven
by the availability of the resources in the decoder, in particular, by times
when the decoding of the previous frame with show_existing_frame flag equal to 0
Expand Down