US 6,889,353 B2Granted

Method and arrangement for decoding convolutionally encoded code word

AssigneeNokia Corporation

InventorEsko Nieminen

Life of this patent

Estimating the term…

Loading patent…

Abstract

The invention relates to a method and arrangement for decoding a turbo coded code word comprising termination bits. The received code word samples are applied to a decoder in a sequence required by the code structure. Termination samples are grouped according to different components of the code word, code interleavers are extended such that the extension part comprises addresses of the systematic termination samples. The address of the ascending order is formed after the actual code word samples such that the addresses of the extension part are addresses of the systematic termination samples corresponding to the termination samples of one or more parities of ascending order and those of the extrinsic weight coefficients related to said systematic termination samples. Decoding is executed by using the extended, ascending address formation and one or more extended interleavers.

Claims16

Dependent claims

A method for decoding a turbo-coded code word comprising termination bits, the method comprising

storing received code word samples in a memory for decoding, the code word sample comprising samples of the actual code word and termination samples corresponding to the termination bits of the code word,
applying the samples to a decoder in a sequence required by a code structure,
grouping the termination samples according to different code word components,
extending one or more interleavers of the code word such that the extension part comprises addresses of systematic termination samples corresponding to termination samples of one or more parity components associated with each interleaver and addresses of extrinsic weight coefficients related to said systematic termination samples,
forming an address of ascending order after the samples of the actual code word such that the addresses of the extension part are ascending-order addresses of the extrinsic weight coefficients or of the systematic termination samples corresponding to the termination samples of one or more parities, and
executing decoding by using extended ascending address formation or one or more extended interleavers.

3 more elements

An arrangement for decoding a turbo coded code word comprising non-interleaved termination bits, the arrangement comprising

a memory for storing received code word samples,
means for reading the samples into a decoder in a sequence required by the code structure,
means for grouping the termination samples according to different components of the code word,
means for extending one or more interleavers of the code such that the extension part comprises addresses of systematic termination samples corresponding to termination samples of one or more parity components associated with each interleaver and addresses of extrinsic weight coefficients related to said systematic termination samples,
means for forming an address of ascending order after the samples of the actual code word such that the addresses of the extension part are ascending-order addresses of the extrinsic weight coefficients or of systematic termination samples corresponding to termination samples of one or more parities, and
means for executing the decoding by using the extended ascending address formation and one or more extended interleavers.

3 more elements

Dependencies are inferred from the claim text.