Serially concatenated turbo codes

Sina Vafi, Tadeusz A Wysocki, Mehran Abolhasan

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

3 Citations (Scopus)

Abstract

The paper presents a new scheme of concatenated codes, referred to as Serially Concatenated Turbo (SCT) codes. The code is constructed as the serial combinations of two turbo codes, i.e. turbo Recursive Systematic Convolutional (RSC) codes and turbo Bose Ray Chaudhuri Hocquenghem (BCH) codes, linked by a pseudo-random interleaver. In comparison with the conventional turbo RSC codes, SCT codes have higher minimum distance values. Based on conducted simulations, it is found that SCT codes outperform turbo RSC codes at the waterfall and error floor regions, while they require reasonable number of iterations at their iterative decoding structure to achieve good performance.

Original languageEnglish (US)
Title of host publicationProceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009
DOIs
StatePublished - Dec 1 2009
Event5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009 - Beijing, China
Duration: Sep 24 2009Sep 26 2009

Publication series

NameProceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009

Other

Other5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009
CountryChina
CityBeijing
Period9/24/099/26/09

Fingerprint

Turbo codes
Convolutional codes
Concatenated codes
Iterative decoding
simulation
performance
Values

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing
  • Software
  • Communication

Cite this

Vafi, S., Wysocki, T. A., & Abolhasan, M. (2009). Serially concatenated turbo codes. In Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009 [5303570] (Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009). https://doi.org/10.1109/WICOM.2009.5303570

Serially concatenated turbo codes. / Vafi, Sina; Wysocki, Tadeusz A; Abolhasan, Mehran.

Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009. 2009. 5303570 (Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009).

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

Vafi, S, Wysocki, TA & Abolhasan, M 2009, Serially concatenated turbo codes. in Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009., 5303570, Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009, 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009, Beijing, China, 9/24/09. https://doi.org/10.1109/WICOM.2009.5303570
Vafi S, Wysocki TA, Abolhasan M. Serially concatenated turbo codes. In Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009. 2009. 5303570. (Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009). https://doi.org/10.1109/WICOM.2009.5303570
Vafi, Sina ; Wysocki, Tadeusz A ; Abolhasan, Mehran. / Serially concatenated turbo codes. Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009. 2009. (Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009).
@inproceedings{3bf0c658907a4980b61464b75c4a08c2,
title = "Serially concatenated turbo codes",
abstract = "The paper presents a new scheme of concatenated codes, referred to as Serially Concatenated Turbo (SCT) codes. The code is constructed as the serial combinations of two turbo codes, i.e. turbo Recursive Systematic Convolutional (RSC) codes and turbo Bose Ray Chaudhuri Hocquenghem (BCH) codes, linked by a pseudo-random interleaver. In comparison with the conventional turbo RSC codes, SCT codes have higher minimum distance values. Based on conducted simulations, it is found that SCT codes outperform turbo RSC codes at the waterfall and error floor regions, while they require reasonable number of iterations at their iterative decoding structure to achieve good performance.",
author = "Sina Vafi and Wysocki, {Tadeusz A} and Mehran Abolhasan",
year = "2009",
month = "12",
day = "1",
doi = "10.1109/WICOM.2009.5303570",
language = "English (US)",
isbn = "9781424436934",
series = "Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009",
booktitle = "Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009",

}

TY - GEN

T1 - Serially concatenated turbo codes

AU - Vafi, Sina

AU - Wysocki, Tadeusz A

AU - Abolhasan, Mehran

PY - 2009/12/1

Y1 - 2009/12/1

N2 - The paper presents a new scheme of concatenated codes, referred to as Serially Concatenated Turbo (SCT) codes. The code is constructed as the serial combinations of two turbo codes, i.e. turbo Recursive Systematic Convolutional (RSC) codes and turbo Bose Ray Chaudhuri Hocquenghem (BCH) codes, linked by a pseudo-random interleaver. In comparison with the conventional turbo RSC codes, SCT codes have higher minimum distance values. Based on conducted simulations, it is found that SCT codes outperform turbo RSC codes at the waterfall and error floor regions, while they require reasonable number of iterations at their iterative decoding structure to achieve good performance.

AB - The paper presents a new scheme of concatenated codes, referred to as Serially Concatenated Turbo (SCT) codes. The code is constructed as the serial combinations of two turbo codes, i.e. turbo Recursive Systematic Convolutional (RSC) codes and turbo Bose Ray Chaudhuri Hocquenghem (BCH) codes, linked by a pseudo-random interleaver. In comparison with the conventional turbo RSC codes, SCT codes have higher minimum distance values. Based on conducted simulations, it is found that SCT codes outperform turbo RSC codes at the waterfall and error floor regions, while they require reasonable number of iterations at their iterative decoding structure to achieve good performance.

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

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

U2 - 10.1109/WICOM.2009.5303570

DO - 10.1109/WICOM.2009.5303570

M3 - Conference contribution

SN - 9781424436934

T3 - Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009

BT - Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009

ER -