On parallel and serial concatenated convolutional codes over GF(4)

Ali Ghrayeb, T. Abualrub

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We compare the asymptotic performance of parallel concatenated codes (PCCs) and serial concatenated codes (SCCs) over GF(4). We construct such codes using optimal nonbinary 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. For all of these code rates, we find the minimum distance and its 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 outperform their counterpart PCC codes with much lower complexity.

Original languageEnglish
Title of host publication8th International Conference on Communication Systems, ICCS 2002 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages327-331
Number of pages5
ISBN (Electronic)0780375106, 9780780375109
DOIs
Publication statusPublished - 2002
Externally publishedYes
Event8th International Conference on Communication Systems, ICCS 2002 - Singapore, Singapore
Duration: 25 Nov 200228 Nov 2002

Other

Other8th International Conference on Communication Systems, ICCS 2002
CountrySingapore
CitySingapore
Period25/11/0228/11/02

Fingerprint

Concatenated codes
Convolutional codes
Monitoring

Keywords

  • convolutional codes
  • Nonbinary turbo codes
  • parallel concatenated codes
  • serial concatenated codes

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Ghrayeb, A., & Abualrub, T. (2002). On parallel and serial concatenated convolutional codes over GF(4). In 8th International Conference on Communication Systems, ICCS 2002 - Proceedings (pp. 327-331). [1182491] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCS.2002.1182491

On parallel and serial concatenated convolutional codes over GF(4). / Ghrayeb, Ali; Abualrub, T.

8th International Conference on Communication Systems, ICCS 2002 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2002. p. 327-331 1182491.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ghrayeb, A & Abualrub, T 2002, On parallel and serial concatenated convolutional codes over GF(4). in 8th International Conference on Communication Systems, ICCS 2002 - Proceedings., 1182491, Institute of Electrical and Electronics Engineers Inc., pp. 327-331, 8th International Conference on Communication Systems, ICCS 2002, Singapore, Singapore, 25/11/02. https://doi.org/10.1109/ICCS.2002.1182491
Ghrayeb A, Abualrub T. On parallel and serial concatenated convolutional codes over GF(4). In 8th International Conference on Communication Systems, ICCS 2002 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2002. p. 327-331. 1182491 https://doi.org/10.1109/ICCS.2002.1182491
Ghrayeb, Ali ; Abualrub, T. / On parallel and serial concatenated convolutional codes over GF(4). 8th International Conference on Communication Systems, ICCS 2002 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2002. pp. 327-331
@inproceedings{72c7aaf3b61b429fb53f66c62543b74a,
title = "On parallel and serial concatenated convolutional codes over GF(4)",
abstract = "We compare the asymptotic performance of parallel concatenated codes (PCCs) and serial concatenated codes (SCCs) over GF(4). We construct such codes using optimal nonbinary 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. For all of these code rates, we find the minimum distance and its 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 outperform their counterpart PCC codes with much lower complexity.",
keywords = "convolutional codes, Nonbinary turbo codes, parallel concatenated codes, serial concatenated codes",
author = "Ali Ghrayeb and T. Abualrub",
year = "2002",
doi = "10.1109/ICCS.2002.1182491",
language = "English",
pages = "327--331",
booktitle = "8th International Conference on Communication Systems, ICCS 2002 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - On parallel and serial concatenated convolutional codes over GF(4)

AU - Ghrayeb, Ali

AU - Abualrub, T.

PY - 2002

Y1 - 2002

N2 - We compare the asymptotic performance of parallel concatenated codes (PCCs) and serial concatenated codes (SCCs) over GF(4). We construct such codes using optimal nonbinary 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. For all of these code rates, we find the minimum distance and its 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 outperform their counterpart PCC codes with much lower complexity.

AB - We compare the asymptotic performance of parallel concatenated codes (PCCs) and serial concatenated codes (SCCs) over GF(4). We construct such codes using optimal nonbinary 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. For all of these code rates, we find the minimum distance and its 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 outperform their counterpart PCC codes with much lower complexity.

KW - convolutional codes

KW - Nonbinary turbo codes

KW - parallel concatenated codes

KW - serial concatenated codes

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

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

U2 - 10.1109/ICCS.2002.1182491

DO - 10.1109/ICCS.2002.1182491

M3 - Conference contribution

SP - 327

EP - 331

BT - 8th International Conference on Communication Systems, ICCS 2002 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -