A method for processing a data block by a user equipment in a wireless communication system comprises generating tail bits of 18 bits by performing trellis termination in a turbo encoder of code rate 1/5 containing a plurality of constituent encoders; and deploying the tail bits of 18 bits to 5 encoded bit sequences of the turbo encoder according to a prescribed rule, wherein 4 tail bits are deployed to a systematic bit sequence among the 5 encoded bit sequences according to the prescribed rule, and 4 tail bits are deployed to each of specific 2 parity bit sequences among 4 parity bit sequences according to the prescribed rule.

A soft input decoding method and a decoder for generalized concatenated (GC) codes. The GC codes are constructed from inner nested block codes, such as binary Bose-Chaudhuri-Hocquenghem, BCH, codes and outer codes, such as Reed-Solomon, RS, codes. In order to enable soft input decoding for the inner block codes, a sequential stack decoding algorithm is used. Ordinary stack decoding of binary block codes requires the complete trellis of the code. In one aspect, the present invention applies instead a representation of the block codes based on the trellises of supercodes in order to reduce the memory requirements for the representation of the inner codes. This enables an efficient hardware implementation. In another aspect, there is provided a soft input decoding method and device employing a sequential stack decoding algorithm in combination with list-of-two decoding which is particularly well suited for applications that require very low residual error rates.

The invention relates to a soft input decoding method and a decoder for generalized concatenated (GC) codes. The GC codes are constructed from inner nested block codes, such as binary Bose-Chaudhuri-Hocquenghem, BCH, codes and outer codes, such as Reed-Solomon, RS, codes. In order to enable soft input decoding for the inner block codes, a sequential stack decoding algorithm is used. Ordinary stack decoding of binary block codes requires the complete trellis of the code. In one aspect, the present invention applies instead a representation of the block codes based on the trellises of supercodes in order to reduce the memory requirements for the representation of the inner codes. This enables an efficient hardware implementation. In another aspect, the present invention provides a soft input decoding method and device employing a sequential stack decoding algorithm in combination with list-of-two decoding which is particularly well suited for applications that require very low residual error rates.

A decoder having an input configured to receive a sequence of softbits presumed to correspond to a convolutionally-encoded codeword; and a decoding circuit configured to: determine, as part of a decoding process, a Maximum Likelihood (ML) survivor path in a trellis representation of the codeword; determine whether the presumed convolutionally-encoded codeword meets an early-termination criteria; and abort the decoding process if the presumed convolutionally-encoded codeword meets the early-termination criteria, continue the decoding process if the presumed convolutionally-encoded codeword fails to meet the early-termination criteria.

A method for processing a data block by a user equipment in a wireless communication system comprises generating tail bits of 18 bits by performing trellis termination in a turbo encoder of code rate 1/5 containing a plurality of constituent encoders; and deploying the tail bits of 18 bits to 5 encoded bit sequences of the turbo encoder according to a prescribed rule, wherein 4 tail bits are deployed to a systematic bit sequence among the 5 encoded bit sequences according to the prescribed rule, and 4 tail bits are deployed to each of specific 2 parity bit sequences among 4 parity bit sequences according to the prescribed rule.

The invention relates to a soft input decoding method and a decoder for generalized concatenated (GC) codes. The GC codes are constructed from inner nested block codes, such as binary Bose-Chaudhuri-Hocquenghem, BCH, codes and outer codes, such as Reed-Solomon, RS, codes. In order to enable soft input decoding for the inner block codes, a sequential stack decoding algorithm is used. Ordinary stack decoding of binary block codes requires the complete trellis of the code. In one aspect, the present invention applies instead a representation of the block codes based on the trellises of supercodes in order to reduce the memory requirements for the representation of the inner codes. This enables an efficient hardware implementation. In another aspect, the present invention provides a soft input decoding method and device employing a sequential stack decoding algorithm in combination with list-of-two decoding which is particularly well suited for applications that require very low residual error rates.

Disclosed herein is a concatenated code encoding method for improving a turbo code. The concatenated code encoding method of the present disclosure includes encoding an input signal based on a repetition-accumulation (RA) code as an outer code, adding a tail bit to the encoded input signal, and encoding the encoded input signal based on the a turbo code. The concatenated code encoding method may further include interleaving the encoded input signal after application of the outer code.

A soft input decoding method and a decoder for generalized concatenated (GC) codes. The GC codes are constructed from inner nested block codes, such as binary Bose-Chaudhuri-Hocquenghem, BCH, codes and outer codes, such as Reed-Solomon, RS, codes. In order to enable soft input decoding for the inner block codes, a sequential stack decoding algorithm is used. Ordinary stack decoding of binary block codes requires the complete trellis of the code. In one aspect, the present invention applies instead a representation of the block codes based on the trellizes of supercodes in order to reduce the memory requirements for the representation of the inner codes. This enables an efficient hardware implementation. In another aspect, there is provided a soft input decoding method and device employing a sequential stack decoding algorithm in combination with list-of-two decoding which is particularly well suited for applications that require very low residual error rates.

A decoder having an input configured to receive a sequence of softbits presumed to correspond to a convolutionally-encoded codeword; and a decoding circuit configured to: determine, as part of a decoding process, a Maximum Likelihood (ML) survivor path in a trellis representation of the codeword; determine whether the presumed convolutionally-encoded codeword meets an early-termination criteria; and abort the decoding process if the presumed convolutionally-encoded codeword meets the early-termination criteria, continue the decoding process if the presumed convolutionally-encoded codeword fails to meet the early-termination criteria.

Disclosed herein is a concatenated code encoding method for improving a turbo code. The concatenated code encoding method of the present disclosure includes encoding an input signal based on a repetition-accumulation (RA) code as an outer code, adding a tail bit to the encoded input signal, and encoding the encoded input signal based on the a turbo code. The concatenated code encoding method may further include interleaving the encoded input signal after application of the outer code.