Patent ID: 7840884

Claim:
A method for decoding a convolutionally coded input data signal y comprising: multiplying the input data signal with a scaling factor L c ; demultiplexing the multiplied input data signal L c y into three signals which are related to systematic bits and parity bits, a demultiplexed input data signal L c S being associated with the systematic bits; turbo decoding the demultiplexed input data signal L c S in order to obtain turbo decoded output data Λ, characterized in that, the scaling factor L c ; is updated for a next iteration in dependence on a combination of a posteriori likelihood data based on turbo decoded output data Λ and a priori likelihood data based on the demultiplexed signal L c S, using an estimate of the mean value of the signal amplitude ĉ and an estimate of the noise variation {circumflex over (σ)} n′ 2 in which the estimate of the mean value of the signal amplitude is equal to c ^ = 1 N ⁢ ∑ i = 0 N - 1 ⁢ sgn ⁡ ( Λ i ) · L c · s i where N is the number of bits in a coding block of the input data signal s i is the i th systematic bit ĉ is the estimation of the mean value of the amplitude of the scaled systematic bits L c ·s i and Λ is the log-likelihood ratio resulting from the most recent turbo decoder iteration, and in which the noise variance estimation {circumflex over (σ)} n′ 2 equals σ ^ n ′ 2 = 1 N - 1 ⁢ ∑ i = 0 N - 1 ⁢ ( s i ′ - 1 ) 2 · P i ⁡ ( 1 ) + ( s i ′ + 1 ) 2 · P i ⁡ ( 0 ) - K ⁢ : the probability of the i th bit being zero is estimated like Pr ⁢ { x i = 0 } = P i ⁡ ( 0 ) = 1 1 + ⅇ - Λ i and the probability of that bit being one like Pr ⁢ { x i = 1 } = P i ⁡ ( 1 ) = 1 1 + ⅇ Λ i = 1 - P i ⁡ ( 0 ) : the normalized systematic bits s′ i are calculated as s i ′ = L c · s i c ^ : and where K is a bias correction computed as K = 1 N ⁢ ∑ i = 0 N - 1 ⁢ 2 · ( P i ⁡ ( 0 ) - P i ⁡ ( 1 ) ) · s i ′ - 2.