From c641897818a118f1fb270885011c5693443073fd Mon Sep 17 00:00:00 2001 From: Ralph Giles Date: Mon, 28 Nov 2005 00:34:44 +0000 Subject: [PATCH] Wrap itemizedlist tags in a para container. Docbook doesn't require this, but google alleges it may help with some stylesheet problems we're having. Doesn't seem to, but doesn't really do any harm either: we weren't being consistent. svn path=/trunk/vorbis/; revision=10466 --- doc/xml/04-codec.xml | 2 ++ doc/xml/07-floor1.xml | 2 ++ doc/xml/08-residue.xml | 6 ++++++ 3 files changed, 10 insertions(+) diff --git a/doc/xml/04-codec.xml b/doc/xml/04-codec.xml index e9ebbdd..9c36cd1 100644 --- a/doc/xml/04-codec.xml +++ b/doc/xml/04-codec.xml @@ -90,12 +90,14 @@ The bitrate fields above are used only as hints. The nominal bitrate field especially may be considerably off in purely VBR streams. The fields are meaningful only when greater than zero. + All three fields set to the same value implies a fixed rate, or tightly bounded, nearly fixed-rate bitstream Only nominal set implies a VBR or ABR stream that averages the nominal bitrate Maximum and or minimum set implies a VBR bitstream that obeys the bitrate limits None set indicates the encoder does not care to speculate. + diff --git a/doc/xml/07-floor1.xml b/doc/xml/07-floor1.xml index c134602..5a4a78b 100644 --- a/doc/xml/07-floor1.xml +++ b/doc/xml/07-floor1.xml @@ -35,6 +35,7 @@ line segments. Synthesis constructs a floor curve using iterative prediction in a process roughly equivalent to the following simplified description: + the first line segment (base case) is a logical line spanning from x_0,y_0 to x_1,y_1 where in the base case x_0=0 and x_1=[n], the @@ -56,6 +57,7 @@ the codec setup header at floor 1 initialization time. Computation is completed at the end of the x value list. + Consider the following example, with values chosen for ease of diff --git a/doc/xml/08-residue.xml b/doc/xml/08-residue.xml index 8cd47e2..050badd 100644 --- a/doc/xml/08-residue.xml +++ b/doc/xml/08-residue.xml @@ -50,6 +50,7 @@ A set of coded residue vectors are all of the same length. High level coding structure, ignoring for the moment exactly how a partition is encoded and simply trusting that it is, is as follows: + Each vector is partitioned into multiple equal sized chunks according to configuration specified. If we have a vector size of @@ -81,6 +82,7 @@ a partition is the same in each pass, thus the classification codeword is coded only in the first pass. + @@ -362,11 +364,13 @@ Format zero decodes partitions exactly as described earlier in the 'Residue Format: residue 0' section. The following pseudocode presents the same algorithm. Assume: + [n] is the value in [residue_partition_size] [v] is the residue vector [offset] is the beginning read offset in [v] + 1) [step] = [n] / [codebook_dimensions] @@ -396,12 +400,14 @@ Format 1 decodes partitions exactly as described earlier in the 'Residue Format: residue 1' section. The following pseudocode presents the same algorithm. Assume: + [n] is the value in [residue_partition_size] [v] is the residue vector [offset] is the beginning read offset in [v] + 1) [i] = 0 -- 2.7.4