Lower bounds on the error probability of turbo codes

Date

2014-06-07

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
3
views
41
downloads

Citation Stats

Series

Abstract

We present lower bounds on the error probability of turbo codes under maximum likelihood (ML) decoding. We focus on additive white Gaussian noise (AWGN) channels, and consider both ensembles of codes with uniform interleaving and specific turbo codes with fixed interleavers. To calculate the lower bounds, instead of using the traditional approach that only makes use of the distance spectrum, we propose to utilize the exact second order distance spectrum. This approach together with a proper restriction of the error events results in promising lower bounds. © 2014 IEEE.

Source Title

IEEE International Symposium on Information Theory - Proceedings

Publisher

IEEE

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English