Asymptotic performance comparison of concatenated (turbo) codes over GF(4)

Ali Ghrayeb, Taher Abualrub

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, we investigate and compare the asymptotic performance of concatenated convolutional coding schemes over GF(4) over additive white Gaussian noise (AWON) channels. Both parallel concatenated codes (PCC) and serial concatenated codes (SCC) are considered. We construct such codes using optimal non-binary convolutional codes where optimality is in the sense of achieving the largest minimum distance for a fixed number of encoder states. Code rates of the form k0/(k0 + 1) for k0 = 1, 8, and 64 are considered, which suite a wide spectrum of communications applications. For all of these code rates, we find the minimum distance and the corresponding multiplicity for both concatenated code systems. This is accomplished by feeding the encoder with all possible weight-two and weight-three input information patterns and monitoring, at the output of the encoder, the weight of the corresponding codewords and their multiplicity. Our analytical results indicate that the SCC codes considerably outperform their counterpart PCC codes at a much lower complexity. Inspired by the superiority of SCC codes, we also discuss a mathematical approach for analysing such codes, leading to a more comprehensive analysis and allowing for further improvement in performance by giving insights on designing a proper interleaver that is capable of eliminating the dominant error patterns.

Original languageEnglish
Pages (from-to)479-490
Number of pages12
JournalInternational Journal of Communication Systems
Volume17
Issue number5
DOIs
Publication statusPublished - Jun 2004
Externally publishedYes

Fingerprint

Concatenated codes
Turbo codes
Convolutional codes
Monitoring
Communication

Keywords

  • Asymptotic performance
  • Convolutional codes
  • Non-binary turbo codes
  • Parallel concatenated codes
  • Serial concatenated codes

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Asymptotic performance comparison of concatenated (turbo) codes over GF(4). / Ghrayeb, Ali; Abualrub, Taher.

In: International Journal of Communication Systems, Vol. 17, No. 5, 06.2004, p. 479-490.

Research output: Contribution to journalArticle

@article{a67a3bb50f8a490082ba0f2aa5e75c1b,
title = "Asymptotic performance comparison of concatenated (turbo) codes over GF(4)",
abstract = "In this paper, we investigate and compare the asymptotic performance of concatenated convolutional coding schemes over GF(4) over additive white Gaussian noise (AWON) channels. Both parallel concatenated codes (PCC) and serial concatenated codes (SCC) are considered. We construct such codes using optimal non-binary convolutional codes where optimality is in the sense of achieving the largest minimum distance for a fixed number of encoder states. Code rates of the form k0/(k0 + 1) for k0 = 1, 8, and 64 are considered, which suite a wide spectrum of communications applications. For all of these code rates, we find the minimum distance and the corresponding multiplicity for both concatenated code systems. This is accomplished by feeding the encoder with all possible weight-two and weight-three input information patterns and monitoring, at the output of the encoder, the weight of the corresponding codewords and their multiplicity. Our analytical results indicate that the SCC codes considerably outperform their counterpart PCC codes at a much lower complexity. Inspired by the superiority of SCC codes, we also discuss a mathematical approach for analysing such codes, leading to a more comprehensive analysis and allowing for further improvement in performance by giving insights on designing a proper interleaver that is capable of eliminating the dominant error patterns.",
keywords = "Asymptotic performance, Convolutional codes, Non-binary turbo codes, Parallel concatenated codes, Serial concatenated codes",
author = "Ali Ghrayeb and Taher Abualrub",
year = "2004",
month = "6",
doi = "10.1002/dac.660",
language = "English",
volume = "17",
pages = "479--490",
journal = "International Journal of Communication Systems",
issn = "1074-5351",
publisher = "John Wiley and Sons Ltd",
number = "5",

}

TY - JOUR

T1 - Asymptotic performance comparison of concatenated (turbo) codes over GF(4)

AU - Ghrayeb, Ali

AU - Abualrub, Taher

PY - 2004/6

Y1 - 2004/6

N2 - In this paper, we investigate and compare the asymptotic performance of concatenated convolutional coding schemes over GF(4) over additive white Gaussian noise (AWON) channels. Both parallel concatenated codes (PCC) and serial concatenated codes (SCC) are considered. We construct such codes using optimal non-binary convolutional codes where optimality is in the sense of achieving the largest minimum distance for a fixed number of encoder states. Code rates of the form k0/(k0 + 1) for k0 = 1, 8, and 64 are considered, which suite a wide spectrum of communications applications. For all of these code rates, we find the minimum distance and the corresponding multiplicity for both concatenated code systems. This is accomplished by feeding the encoder with all possible weight-two and weight-three input information patterns and monitoring, at the output of the encoder, the weight of the corresponding codewords and their multiplicity. Our analytical results indicate that the SCC codes considerably outperform their counterpart PCC codes at a much lower complexity. Inspired by the superiority of SCC codes, we also discuss a mathematical approach for analysing such codes, leading to a more comprehensive analysis and allowing for further improvement in performance by giving insights on designing a proper interleaver that is capable of eliminating the dominant error patterns.

AB - In this paper, we investigate and compare the asymptotic performance of concatenated convolutional coding schemes over GF(4) over additive white Gaussian noise (AWON) channels. Both parallel concatenated codes (PCC) and serial concatenated codes (SCC) are considered. We construct such codes using optimal non-binary convolutional codes where optimality is in the sense of achieving the largest minimum distance for a fixed number of encoder states. Code rates of the form k0/(k0 + 1) for k0 = 1, 8, and 64 are considered, which suite a wide spectrum of communications applications. For all of these code rates, we find the minimum distance and the corresponding multiplicity for both concatenated code systems. This is accomplished by feeding the encoder with all possible weight-two and weight-three input information patterns and monitoring, at the output of the encoder, the weight of the corresponding codewords and their multiplicity. Our analytical results indicate that the SCC codes considerably outperform their counterpart PCC codes at a much lower complexity. Inspired by the superiority of SCC codes, we also discuss a mathematical approach for analysing such codes, leading to a more comprehensive analysis and allowing for further improvement in performance by giving insights on designing a proper interleaver that is capable of eliminating the dominant error patterns.

KW - Asymptotic performance

KW - Convolutional codes

KW - Non-binary turbo codes

KW - Parallel concatenated codes

KW - Serial concatenated codes

UR - http://www.scopus.com/inward/record.url?scp=3042672716&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3042672716&partnerID=8YFLogxK

U2 - 10.1002/dac.660

DO - 10.1002/dac.660

M3 - Article

VL - 17

SP - 479

EP - 490

JO - International Journal of Communication Systems

JF - International Journal of Communication Systems

SN - 1074-5351

IS - 5

ER -