Enhancement of turbo codes using cyclic redundancy check with interleaver optimisation

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A method is presented where a parallel concatenated convolutional code is preceded with a short cyclic redundancy check (CRC) without code rate loss. Parity bits are punctured and their place taken, by the CRC. Results are given for the weight spectrum of an optimised code, rate 2/3, codeword length, n=1014 in comparison with an optimised, non-CRC code using the same rate and codeword length. Frame error rate performance achieved is within 0.36dB of the Sphere Packing Bound constrained for binary transmission.

Cite

CITATION STYLE

APA

Rogers, A. J., Tomlinson, M., Ambroze, M. A., & Ahmed, M. Z. (2004). Enhancement of turbo codes using cyclic redundancy check with interleaver optimisation. In IEEE International Symposium on Information Theory - Proceedings (p. 508). https://doi.org/10.1109/isit.2004.1365544

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free