Analysis and Design of Tuned Turbo Codes

Turbo codes and Multiple Parallel Concatenated Codes (MPCCs) perform very close to the Shannon limit with suboptimum iterative decoding, but the corresponding code ensembles are asymptotically bad in the sense that their minimum (Hamming) distance does not grow linearly with block length. It has been widely observed that there exists a fundamental trade-off between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo-like codes. While capacity achieving code ensembles typically are asymptotically bad in the sense that their minimum distance does not grow linearly with block length, and they therefore exhibit an error floor at moderate-to-high signal to noise ratios, asymptotically good codes usually converge further away from channel capacity.

Provided by: Institute of Electrical and Electronics Engineers Topic: Networking Date Added: Apr 2012 Format: PDF

Find By Topic