Bit Error Rate Estimate of Finite Length Turbo Codes
نویسندگان
چکیده
A novel method of estimating the BER performance of finite length turbo codes in a binary AWGN channel is proposed. We consider the asymptotes of BER performance at low and high Eb N0 resulted from the small and large extrinsic values, respectively. The BER performance curve transitions between two asymptotes in the waterfall region, where the transition probability is approximately obtained by using the SNR transfer characteristic band of extrinsic values in the turbo decoding algorithm. Then, the BER estimate of finite length turbo codes is obtained by using two asymptotes at low and high Eb N0 and the transition probability between them.
منابع مشابه
Combined MMSE interference suppression and turbo coding for a coherent DS-CDMA system
The performance of a turbo-coded code division multiaccess system with a minimum mean-square error (MMSE) receiver for interference suppression is analyzed on a Rayleigh fading channel. In order to accurately estimate the performance of the turbo coding, two improvements are proposed on the conventional union bounds: the information of the minimum distance of a particular turbo interleaver is u...
متن کاملGeneralized EXIT chart and BER analysis of finite-length turbo codes
We propose an analysis tool of the finite-length iterative turbo decoding algorithm. The proposed tool is a generalized EXIT chart based on the mutual information transfer characteristics of the extrinsic information in the iterative turbo decoding algorithm. The proposed tool can describe the probabilistic convergence behavior of the iterative decoding algorithm. By using this tool, we obtain ...
متن کاملPerformance Analysis and Design of Punctured Turbo Codes
Turbo codes, formed by the parallel concatenation of two recursive systematic convolutional component codes separated by an interleaver, have been proposed for use in a variety of wireless applications, including mobile, satellite and fixed wireless systems. Analysis of their performance requires knowledge of their transfer function, which conveys their distance properties. Using the transfer f...
متن کاملTransfer Function Bounds on the Performance of Turbo Codes
In this article, we apply transfer function bounding techniques to obtain upper bounds on the bit-error rate for maximum-likelihood decoding of turbo codes constructed with random permutations. These techniques are applied to two turbo codes with constraint length 3 and later extended to other codes. The performance predicted by these bounds is compared with simulation results. The bounds are u...
متن کاملOn the Frame Error Rate of Turbo - Codes 1 Oscar
| In spite of the excellent bit error rate performance of the original turbo-code, simulations indicate that this code yields relatively poor frame error rate performance. In this paper we show that \primitive" turbo-codes and \asymmetric" turbocodes provides both good bit error rate and frame error rate performance.
متن کامل