Performance of the Bounded Distance Decoder on the AWGN Channel

TL;DR

This paper analyzes the performance of the bounded distance decoder on the AWGN channel, deriving bounds for error rates and validating them through simulations, highlighting its effectiveness compared to maximum-likelihood decoding.

Contribution

It provides new bounds for word and undetected error rates of the bounded distance decoder and demonstrates their accuracy and tractability for larger codes.

Findings

Bounds closely match simulation results for small codes

Bounds are computationally feasible for larger codes

Bounded distance decoding effectively detects errors

Abstract

In contrast to a maximum-likelihood decoder, it is often desirable to use an incomplete decoder that can detect its decoding errors with high probability. One common choice is the bounded distance decoder. Bounds are derived for the total word error rate, Pw, and the undetected error rate, Pu. Excellent agreement is found with simulation results for a small code, and the bounds are shown to be tractable for a larger code.