Lines Matching full:vector
8 A residue vector represents the fine detail of the audio spectrum of
10 curve and performs any channel coupling. A residue vector may
13 the vector does not matter to the residue abstraction.
18 variants (numbered 0, 1 and 2) of the same basic vector encoding
25 Residue format partitions each vector in the vector bundle into chunks,
31 vector is the same in all three variants.
38 \item Each vector is partitioned into multiple equal sized chunks
39 according to configuration specified. If we have a vector size of
46 \item Each partition in each vector has a classification number that
49 can be thought of as forming a vector in their own right, as in the
51 partitions to increase encoding efficiency, the classification vector
58 \item The values in a residue vector may be encoded monolithically in a
59 single pass through the residue vector, but more often efficient
60 codebook design dictates that each vector is encoded as the additive
61 sum of several passes through the residue vector using more than one
72 \captionof{figure}{illustration of residue vector format}
89 As an example, assume a partition vector of size eight, to be encoded
94 original residue vector: [ 0 1 2 3 4 5 6 7 ]
114 vector scalars in order. As with residue 0, however, partition length
118 As an example, assume a partition vector of size eight, to be encoded
123 original residue vector: [ 0 1 2 3 4 5 6 7 ]
142 interleaved and flattened into a single vector of length
145 vector to begin with, residue type 1 and type 2 are equivalent.
168 each vector that is actually coded; it implements akin to a bandpass
169 where, for coding purposes, the vector effectively begins at element
174 the interleaved vector, not the individual vectors before interleave.
200 6) vector [residue_cascade] element [i] = [high_bits] * 8 + [low_bits]
216 3) if ( vector [residue_cascade] element [i] bit [j] is set ) {
249 is passed the number of vectors in the submap bundle and a vector of
251 passed in number of vectors is 3 and vector number 1 is marked 'do not
252 decode', decode skips vector 1 during the decode loop. However, even
257 portion of a residue vector may be the entire possible residue vector
258 or some other strict subset of the actual residue vector size with
262 wholly beyond the maximum vector size. Before beginning residue
264 \varname{[residue_end]} to the maximum possible vector size
300 8) if vector [j] is not marked 'do not decode' {
322 15) if vector [j] is not marked 'do not decode' {
328 19) decode partition into output vector number [j], starting at scalar
345 nominal occurrence. Decode returns the result of vector decode up to
358 \item \varname{[v]} is the residue vector
367 3) vector [entry_temp] = read vector from packet using current codebook in VQ context
370 5) vector [v] element ([offset]+[i]+[j]*[step]) =
371 vector [v] element ([offset]+[i]+[j]*[step]) +
372 vector [entry_temp] element [j]
393 \item \varname{[v]} is the residue vector
400 2) vector [entry_temp] = read vector from packet using current codebook in VQ context
403 4) vector [v] element ([offset]+[i]) =
404 vector [v] element ([offset]+[i]) +
405 vector [entry_temp] element [j]
423 However, if at least one vector is to be decoded, all the vectors are
424 decoded. We then request normal format 1 to decode a single vector
425 representing all output channels, rather than a vector for each
426 channel. After decode, deinterleave the vector into independent vectors, one for each output channel. That is:
429 \item If all vectors 0 through \emph{ch}-1 are marked 'do not decode', allocate and clear a single vector
430 \item Rather than performing format 1 decode to produce \emph{ch} vectors of length \emph{n} each, call format 1 decode to produce a single vector \varname{[v]} of length \emph{ch*n}.
431 \item Post decode: Deinterleave the single vector \varname{[v]} returned by format 1 decode as described above into \emph{ch} independent vectors, one for each outputchannel, according to:
437 3) output vector number [j] element [i] = vector [v] element ([i] * [ch] + [j])
