Letter soft‐decision decoding of linear block codes as optimization problem

In this contribution the problem of channel decoding is considered from the viewpoint of optimization theory. The decoding problem is at first denoted as integer optimization problem. To solve this problem, well‐known methods from optimization theory are suitable. Two examples are presented: First, an Omura‐type algorithm from [13] can be derived from the Simplex algorithm. Second, the decoding problem is reformulated such that it can be solved by a Branch‐and‐Bound algorithm. By simulation results, questions concerning bit error rate and complexity will be discussed.