Please use this identifier to cite or link to this item:
|Title:||On viterbi-like algorithms and their application to Reed–Muller codes||Authors:||Ling, San
|Keywords:||DRNTU::Science::Mathematics::Discrete mathematics::Algorithms||Issue Date:||2004||Source:||Tang, Y., & Ling, S. (2004). On Viterbi-like algorithms and their application to Reed–Muller codes. Journal of Complexity, 20(2-3), 438-457.||Series/Report no.:||Journal of complexity||Abstract:||For a Viterbi-like algorithm over a sectionalized trellis of a linear block code, the decoding procedure consists of three parts: computingthe metrics of the edges, selectingthe 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 computingthe 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 decodingis significantly reduced in comparison to the best-known ones. For the RM codes, a direct method for constructingtheir trellis-oriented-generator-matrices is proposed and some shift invariances are deduced.||URI:||https://hdl.handle.net/10356/96402
|ISSN:||0885064X||DOI:||http://dx.doi.org/10.1016/j.jco.2004.01.003||Rights:||© 2004 Elsevier Inc. This is the author created version of a work that has been peer reviewed and accepted for publication by Journal of Complexity, Elsevier Inc. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1016/j.jco.2004.01.003].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Files in This Item:
|41. On Viterbi-like algorithms and their applications to Reed-Muller codes.pdf||394.2 kB||Adobe PDF|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.