Low Complexity Nonbinary Decoder: Correct Only Data part with Implementation

For systematic nonbinary codes, there is no need to correct erroneous parity check symbols since users need only the decoded data symbols. This idea can be generally applied for systematic nonbinary codes. In particular, the complexity of Vector Symbol Decoding (VSD) is greatly reduced because its step for calculating error values need a matrix inversion whose size depends on the number of error symbols. Results show that for a (40,20) code with 32 bits/symbol, the decoding time for VSD decreases from
$6.32\times 10^{-5}\mathrm{s}$
to
$3.02\times 10^{-5}\mathrm{s}$
with the proposed method at probability of symbol error = 0.05. Experiments on Raspberry-pi boards are also shown.