2003Unpublished venueRequires access

Sequential Decoding of Convolutional Codes

Yunghsiang S. Han, Po‐Ning Chen

Open publisher page 21 citations

Abstract

Abstract This article surveys many variants of sequential decoding in literature. Rather than introducing them chronologically, this article first presents the Algorithm A, a general sequential search algorithm. The stack algorithm and the Fano algorithm are then described in details. Next, trellis variants of sequential decoding, including the recently proposed maximum‐likelihood sequential decoding algorithm, are discussed. Additionally, decoding complexity and error performance of sequential decoding are investigated, followed by a discussion on the implementation of sequential decoding from various practical aspects. Moreover, classes of convolutional codes that are particularly appropriate for sequential decoding are outlined.

About this research paper

What this paper is about

Abstract This article surveys many variants of sequential decoding in literature. Rather than introducing them chronologically, this article first presents the Algorithm A, a general sequential search algorithm. The stack algorithm and the Fano algorithm are then described in details. Next, trellis variants of sequential decoding, including the recently proposed maximum‐likelihood sequential decoding algorithm, are discussed. Additionally, decoding complexity and error performance of sequential decoding are investigated, followed by a discussion on the implementation of sequential decoding from various practical aspects. Moreover, classes of convolutional codes that are particularly appropriate for sequential decoding are outlined.

Why it matters

OpenAlex reports 21 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract This article surveys many variants of sequential decoding in literature. Rather than introducing them chronologically, this article first presents the Algorithm A, a general sequential search algorithm. The stack algorithm and the Fano algorithm are then described in details. Next, trellis variants of sequential decoding, including the recently proposed maximum‐likelihood sequential decoding algorithm, are discussed. Additionally, decoding complexity and error performance of sequential decoding are investigated, followed by a discussion on the implementation of sequential decoding from various practical aspects. Moreover, classes of convolutional codes that are particularly appropriate for sequential decoding are outlined.

Key concepts: Sequential decoding, Decoding methods, List decoding, Computer science, Convolutional code, Algorithm, Berlekamp–Welch algorithm, Trellis (graph)

Related papers

Back to paper searchBrowse research topicsOriginal source
Sequential Decoding of Convolutional Codes — Research Paper | ScholarLens