Sentence examples for a decoder that from inspiring English sources

Transcoding: It is the process of decoding the audio signal with a decoder that is different than the one used in the encoding operation.

Let us now try to investigate how to build a decoder that works against arbitrary attacks in fingerprinting.

Let us define a decoder that relates each search point (x in mathcal {X}^{text {aux}}) to a feasible schedule f(x) in the following manner.

In this case, the lower layers are regarded as an encoder to obtain an efficient code and the upper layers are regarded as a decoder that "reverses" the encoder.

To build such a decoder, Meerwald and Furon [12] previously noted that Abbe and Zheng [11] proved in a more general context that under certain conditions on the set of allowed pirate strategies (vec {Theta }), a decoder that works against the worst-case attack (vec {theta }^ in vec {Theta }) also works against arbitrary other attacks (vec {theta } in vec {Theta }).

The chaotic communication system proposed in [24] is composed of a symbolic dynamics chaotic modulator based on the backward iteration of the modified Bernoulli map, a communication channel, and a decoder that implements the Viterbi algorithm over a two-state trellis to estimate the transmitted sequence.

Note that since g only depends on (mathcal {X}) through (vec {X}_{j}), any decoder that follows this framework is a simple decoder.

The proposed shift register memory consists of an array of shift registers and a packet decoder that switches a high-speed serial data stream into the destined shift register.

Nevertheless, we achieve the required differentiability (Theorem 3) by considering a hard decoder that is a slightly perturbed version of the original hard decoder.

The quantizer includes a quantizer encoder that is a mapping from source X to a certain index i Q e : { X | X ∈ 0, 1 } → { i | i = 0, 1, …, 2 n − 1 }, and a quantizer decoder that is a mapping from the index i to codepoint y n (i), Q d : { i | i = 0, 1, …, 2 n − 1 } → { y n i | i = 0, 1, …, 2 n − 1 }. Figure 1 The structure of a rate 2 quantizer.

We will use the 'standard' back end for this task, i.e. a Viterbi decoder that finds the best path in a lattice spanned by the 179 states that result from representing 11 digit words by 16 states each, plus 3 states for representing non-speech.