Support Vector Machine based Decoding Algorithm for BCH Codes

Authors

  • V. Sudharsan
  • B. Yamuna

DOI:

https://doi.org/10.26636/jtit.2016.2.728

Keywords:

BCH codes, Chase-2 algorithm, coding gain, kernel, multi-class classification, Soft Decision Decoding, Support Vector Machine

Abstract

Modern communication systems require robust, adaptable and high performance decoders for efficient data transmission. Support Vector Machine (SVM) is a margin based classification and regression technique. In this paper, decoding of Bose Chaudhuri Hocquenghem codes has been approached as a multi-class classification problem using SVM. In conventional decoding algorithms, the procedure for decoding is usually fixed irrespective of the SNR environment in which the transmission takes place, but SVM being a machinelearning algorithm is adaptable to the communication environment. Since the construction of SVM decoder model uses the training data set, application specific decoders can be designed by choosing the training size efficiently. With the soft margin width in SVM being controlled by an equation, which has been formulated as a quadratic programming problem, there are no local minima issues in SVM and is robust to outliers.

Downloads

Download data is not yet available.

Downloads

Published

2016-06-30

Issue

Section

ARTICLES FROM THIS ISSUE

How to Cite

[1]
V. Sudharsan and B. Yamuna, “Support Vector Machine based Decoding Algorithm for BCH Codes”, JTIT, vol. 64, no. 2, pp. 108–112, Jun. 2016, doi: 10.26636/jtit.2016.2.728.