An efficient decoding scheme for improved throughput in three dimensional turbo product codes based on single parity code

Byungkyu Ahn, Sangchul Ha, Sungsik Yoon, Jun Heo

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

Abstract

This study proposes an effective decoding method that can be used when the existing two dimensional Turbo Product code (TPC) with extended Hamming code is expanded to three dimensional TPC by applying Single Parity code (SPC). In the multidimensional TPC, the SPC is mainly used for increasing the code rate of the axis with short code length. However, the SPC is unable to correct errors, and therefore, its application only is unlikely to improve the performance of the three dimensional TPC. Moreover, its expanded dimensions decrease the throughput. To solve this problem, three types of decoding schemes are suggested. The first scheme is applied to form of mixed iterative decoding scheme that serial and parallel decoding method are used together. Secondly, Normalized Min-Sum (NMS) algorithm is used in axis with shortest code length. Finally, Partial sorting networks reduces clock consumption of least reliable values selection in Chase-Pyndiah algorithm.

Original languageEnglish
Title of host publicationProceedings of 2016 International Conference on Communication and Information Systems, ICCIS 2016
PublisherAssociation for Computing Machinery
Pages118-122
Number of pages5
VolumePart F125975
ISBN (Electronic)9781450347914
DOIs
Publication statusPublished - 2016 Dec 16
Event2016 International Conference on Communication and Information Systems, ICCIS 2016 - Bangkok, Thailand
Duration: 2016 Dec 162016 Dec 18

Other

Other2016 International Conference on Communication and Information Systems, ICCIS 2016
CountryThailand
CityBangkok
Period16/12/1616/12/18

Fingerprint

Decoding
Throughput
Iterative decoding
Sorting
Clocks

Keywords

  • Chase-Pyndiah algorithm
  • Extended Hamming code
  • Iterative decoding
  • Normalized minsum algorithm
  • Turbo product code

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Ahn, B., Ha, S., Yoon, S., & Heo, J. (2016). An efficient decoding scheme for improved throughput in three dimensional turbo product codes based on single parity code. In Proceedings of 2016 International Conference on Communication and Information Systems, ICCIS 2016 (Vol. Part F125975, pp. 118-122). Association for Computing Machinery. https://doi.org/10.1145/3023924.3023940

An efficient decoding scheme for improved throughput in three dimensional turbo product codes based on single parity code. / Ahn, Byungkyu; Ha, Sangchul; Yoon, Sungsik; Heo, Jun.

Proceedings of 2016 International Conference on Communication and Information Systems, ICCIS 2016. Vol. Part F125975 Association for Computing Machinery, 2016. p. 118-122.

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

Ahn, B, Ha, S, Yoon, S & Heo, J 2016, An efficient decoding scheme for improved throughput in three dimensional turbo product codes based on single parity code. in Proceedings of 2016 International Conference on Communication and Information Systems, ICCIS 2016. vol. Part F125975, Association for Computing Machinery, pp. 118-122, 2016 International Conference on Communication and Information Systems, ICCIS 2016, Bangkok, Thailand, 16/12/16. https://doi.org/10.1145/3023924.3023940
Ahn B, Ha S, Yoon S, Heo J. An efficient decoding scheme for improved throughput in three dimensional turbo product codes based on single parity code. In Proceedings of 2016 International Conference on Communication and Information Systems, ICCIS 2016. Vol. Part F125975. Association for Computing Machinery. 2016. p. 118-122 https://doi.org/10.1145/3023924.3023940
Ahn, Byungkyu ; Ha, Sangchul ; Yoon, Sungsik ; Heo, Jun. / An efficient decoding scheme for improved throughput in three dimensional turbo product codes based on single parity code. Proceedings of 2016 International Conference on Communication and Information Systems, ICCIS 2016. Vol. Part F125975 Association for Computing Machinery, 2016. pp. 118-122
@inproceedings{6391ef76543448228e23830e3d9cda81,
title = "An efficient decoding scheme for improved throughput in three dimensional turbo product codes based on single parity code",
abstract = "This study proposes an effective decoding method that can be used when the existing two dimensional Turbo Product code (TPC) with extended Hamming code is expanded to three dimensional TPC by applying Single Parity code (SPC). In the multidimensional TPC, the SPC is mainly used for increasing the code rate of the axis with short code length. However, the SPC is unable to correct errors, and therefore, its application only is unlikely to improve the performance of the three dimensional TPC. Moreover, its expanded dimensions decrease the throughput. To solve this problem, three types of decoding schemes are suggested. The first scheme is applied to form of mixed iterative decoding scheme that serial and parallel decoding method are used together. Secondly, Normalized Min-Sum (NMS) algorithm is used in axis with shortest code length. Finally, Partial sorting networks reduces clock consumption of least reliable values selection in Chase-Pyndiah algorithm.",
keywords = "Chase-Pyndiah algorithm, Extended Hamming code, Iterative decoding, Normalized minsum algorithm, Turbo product code",
author = "Byungkyu Ahn and Sangchul Ha and Sungsik Yoon and Jun Heo",
year = "2016",
month = "12",
day = "16",
doi = "10.1145/3023924.3023940",
language = "English",
volume = "Part F125975",
pages = "118--122",
booktitle = "Proceedings of 2016 International Conference on Communication and Information Systems, ICCIS 2016",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - An efficient decoding scheme for improved throughput in three dimensional turbo product codes based on single parity code

AU - Ahn, Byungkyu

AU - Ha, Sangchul

AU - Yoon, Sungsik

AU - Heo, Jun

PY - 2016/12/16

Y1 - 2016/12/16

N2 - This study proposes an effective decoding method that can be used when the existing two dimensional Turbo Product code (TPC) with extended Hamming code is expanded to three dimensional TPC by applying Single Parity code (SPC). In the multidimensional TPC, the SPC is mainly used for increasing the code rate of the axis with short code length. However, the SPC is unable to correct errors, and therefore, its application only is unlikely to improve the performance of the three dimensional TPC. Moreover, its expanded dimensions decrease the throughput. To solve this problem, three types of decoding schemes are suggested. The first scheme is applied to form of mixed iterative decoding scheme that serial and parallel decoding method are used together. Secondly, Normalized Min-Sum (NMS) algorithm is used in axis with shortest code length. Finally, Partial sorting networks reduces clock consumption of least reliable values selection in Chase-Pyndiah algorithm.

AB - This study proposes an effective decoding method that can be used when the existing two dimensional Turbo Product code (TPC) with extended Hamming code is expanded to three dimensional TPC by applying Single Parity code (SPC). In the multidimensional TPC, the SPC is mainly used for increasing the code rate of the axis with short code length. However, the SPC is unable to correct errors, and therefore, its application only is unlikely to improve the performance of the three dimensional TPC. Moreover, its expanded dimensions decrease the throughput. To solve this problem, three types of decoding schemes are suggested. The first scheme is applied to form of mixed iterative decoding scheme that serial and parallel decoding method are used together. Secondly, Normalized Min-Sum (NMS) algorithm is used in axis with shortest code length. Finally, Partial sorting networks reduces clock consumption of least reliable values selection in Chase-Pyndiah algorithm.

KW - Chase-Pyndiah algorithm

KW - Extended Hamming code

KW - Iterative decoding

KW - Normalized minsum algorithm

KW - Turbo product code

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

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

U2 - 10.1145/3023924.3023940

DO - 10.1145/3023924.3023940

M3 - Conference contribution

AN - SCOPUS:85014914911

VL - Part F125975

SP - 118

EP - 122

BT - Proceedings of 2016 International Conference on Communication and Information Systems, ICCIS 2016

PB - Association for Computing Machinery

ER -