Translation of "Convolution code" in German

For the modulation PBCC uses a convolution code (mathematical method) based on 8-phase-shift-keying.

In order to explain the operation of a circuit configuration according to the invention, the following discussion will assume a convolution code often used in mobile radio, for example.

The source-encoded sequence {u l} is then encoded against channel disturbances in a channel encoder 12, use being made, for example, of a convolution code.

The present invention relates to a method of decoding binary signals processed according to an error correcting convolution code, wherein binary operations form branch metrics and they again form path metrics according to the Viterbi decoding proces for the reception probability of the source data binary signals formed in the encoder.

If a convolution code has been employed in the redundancy adding channel encoder 17 a (FIG. 3, FIG. 4), it is very likely that here too a shift register, though forward coupled, will have been used for the purpose, in order e.g. as is shown in FIG. 9 to generate two output bits C 1 (D) and C 2 (D) from an input bit A(D) if a code rate of ½ has been used.

Concatenated coding with inner and outer convolutional codes also is very promising.

A possible use of this combination of convolutional codes is in the channel coding in the GSM system.

View convoluted code in a new light.

Turbo codes are binary recursive convolution codes that are concatenated in parallel.

Turbo codes are binary recursive convolution codes concatenated in parallel.

The proposed method can be used for block codes and also for convolutional codes.

A node represents a state of the memory of the convolutional code.

This is similar to the termination of a convolutional code.

Convolutional codes, by contrast, continuously add redundant bits and have an arbitrary length.

In the present case, however, the employment of a convolutional self-orthogonal code is of special interest.

In connection with convolutional codes, too, there is a possibility of soft code decoding in an optimal and elegant way.

In punctured coding, single bits are deleted at intervals in a low-rate convolutional code.

With an additional outer coding system convolutional codes with Viterbi coding can be used in order to perform FEC (forward error correction) decoding.

This is a convolutional code with memory v, terminated by uknown symbols.

In this context, the error-correcting code may be a block code or a convolutional code.

This is a consequence of the known starting states and final states (if terminated) of the convolutional code.

Such error detecting and correcting measures include error detecting and correcting codes such as block codes or convolution codes.

A convolutional self-orthogonal code (CSOC), a Reed-Solomon Code or, respectively, a block code having Lee metrics are used for error correction in these examples.

Arbitrary block or convolution codes can fundamentally come into consideration for the underlaid code, on the basis of which the coder (see FIG. 1) generates the redundancy bits and the decoder (see FIG. 2) decodes the transmission errors.

This holds true for the concatenation of two codes in comparison with a single convolutional code with a rate of 1/3 and the same receiver complexity.

In contrast to this, convolutional codes result in bandwidth extension which is proportional to the code rate if the number of elements of the symbol space remains unchanged.

This could be a Viterbi equalizer, a Viterbi demodulator (for example for modulation processes of constant envelopes (CPM) or for trellis-coded modulation (TCM)), or a Viterbi decoder for an inner convolutional code.