Lines Matching refs:is
31 vector is the same in all three variants.
34 coding structure, ignoring for the moment exactly how a partition is
35 encoded and simply trusting that it is, is as follows:
38 \item Each vector is partitioned into multiple equal sized chunks
42 coded is \emph{n}/\emph{residue_partition_size}*\emph{ch}. It is
52 is also partitioned into chunks. The integer elements of each scalar
60 codebook design dictates that each vector is encoded as the additive
64 a partition is the same in each pass, thus the classification codeword
65 is coded only in the first pass.
106 It is worth mentioning at this point that no configurable value in the
107 residue coding setup is restricted to a power of two.
143 \emph{ch}*\emph{n}. Encoding then proceeds as in type 1. Decoding is
157 Header decode for all three residue types is identical.
168 each vector that is actually coded; it implements akin to a bandpass
175 \varname{[residue_partition_size]} is as explained above,
176 \varname{[residue_classifications]} is the number of possible
178 \varname{[residue_classbook]} is the codebook number used to
199 5) if ( [bitflag] is set ) then [high_bits] = read five bits as unsigned integer
216 3) if ( vector [residue_cascade] element [i] bit [j] is set ) {
243 Format 0 and 1 packet decode is identical except for specific
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
256 \varname{[residue_end]}, it is obvious that the encoded
259 zero padding at either uncoded end. However, it is also possible to
266 \varname{[ch]} is provided by the higher level decoding
271 2) if residue encoding is format 2
289 2) if ([n_to_read] is zero), stop; there is no residue to decode.
294 5) while [partition_count] is less than [partitions_to_read]
296 6) if ([pass] is zero) {
300 8) if vector [j] is not marked 'do not decode' {
318 is also less than [partitions_to_read] {
322 15) if vector [j] is not marked 'do not decode' {
326 18) if ([vqbook] is not 'unused') {
344 An end-of-packet condition during packet decode is to be considered a
357 \item \varname{[n]} is the value in \varname{[residue_partition_size]}
358 \item \varname{[v]} is the residue vector
359 \item \varname{[offset]} is the beginning read offset in [v]
391 \item \varname{[n]} is the value in
393 \item \varname{[v]} is the residue vector
394 \item \varname{[offset]} is the beginning read offset in [v]
410 6) if ( [i] is less than [n] ) continue at step 2
418 Format 2 is reducible to format 1. It may be implemented as an additional step prior to and an additional post-decode step after a normal format 1 decode.
423 However, if at least one vector is to be decoded, all the vectors are
426 channel. After decode, deinterleave the vector into independent vectors, one for each output channel. That is: