Sequential stack decoding of binary Reed-Muller codes

Abstract

In this paper we propose a sequential stack algorithm to decode binary Reed-Muller codes which is based on the GC structure of these codes. A key problem of sequential decoding is the estimation of errors in the unexplored part of the code tree which in case of convolutional codes is traditionally done using the Fano-metric. We show that with proper defined soft values it is possible to calculate for each element in the stack a lower bound on the squared Euclidean distance between the received sequence and all codewords containing the element. This value can be used as a metric to evaluate the elements in the stack. It is further shown how this metric can be improved by lower bounding the metric increase in future decoding steps. The influence of this improvement on the necessary stack size is demonstrated by simulation results which underline the performance of sequential decoding of binary ReedMuller codes.

Cite this paper

@article{stolte2000sequential,
  title = {{Sequential stack decoding of binary Reed-Muller codes}},
  author = {Stolte, N. and Sorger, Ulrich and Sessler, G. M.},
  year = {2000}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers