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
N1 - Publisher Copyright:
© 2016 ACM.
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
U2 - 10.1145/3023924.3023940
DO - 10.1145/3023924.3023940
M3 - Conference contribution
AN - SCOPUS:85014914911
T3 - ACM International Conference Proceeding Series
SP - 118
EP - 122
BT - Proceedings of 2016 International Conference on Communication and Information Systems, ICCIS 2016
PB - Association for Computing Machinery
T2 - 2016 International Conference on Communication and Information Systems, ICCIS 2016
Y2 - 16 December 2016 through 18 December 2016
ER -