Optimal sectionalization of a trellis
IEEE Transactions on Information Theory
On the BCJR trellis for linear block codes
IEEE Transactions on Information Theory
Quasi-cyclic structure of Reed-Muller codes and their smallest regular trellis diagram
IEEE Transactions on Information Theory
A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes
IEEE Transactions on Information Theory
Codes on graphs: constraint complexity of cycle-free realizations of linear codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
For a Viterbi-like algorithm over a sectionalized trellis of a linear block code, the decoding procedure consists of three parts: computing the metrics of the edges, selecting the survivor edge between each pair of adjacent vertices and determining the survivor path from the origin to each vertex. In this paper, some new methods for computing the metrics of the edges are proposed. Our method of "partition of index set" for computing the metrics is shown to be near-optimal. The proposed methods are then applied to Reed-Muller (RM) codes. For some RM codes, the computational complexity of decoding is significantly reduced in comparison to the best-known ones. For the RM codes, a direct method for constructing their trellisoriented-generator-matrices is proposed and some shift invariances are deduced.