ScholarLens Back to search
2002•Unpublished venueRequires access

A circular Viterbi algorithm for decoding tailbiting convolutional codes

R.V. Cox, C.-E.W. Sundberg

Open publisher page 1 citations

Abstract

These algorithms are used in blockwide transmission to save the overhead of a known tail. The basic ideas are: (1) continue conventional seamless continuous Viterbi decoding beyond the block boundary by recording and repeating the received block of (soft) symbols; (2) start the decoding process in all states; and (3) end the decoding process either adaptively or with a fixed length. Three robust adaptive stopping rules are constructed and evaluated. Simulation results and a comparison to previously known algorithms are presented.

About this research paper

What this paper is about

These algorithms are used in blockwide transmission to save the overhead of a known tail. The basic ideas are: (1) continue conventional seamless continuous Viterbi decoding beyond the block boundary by recording and repeating the received block of (soft) symbols; (2) start the decoding process in all states; and (3) end the decoding process either adaptively or with a fixed length. Three robust adaptive stopping rules are constructed and evaluated. Simulation results and a comparison to previously known algorithms are presented.

Why it matters

OpenAlex reports 1 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

These algorithms are used in blockwide transmission to save the overhead of a known tail. The basic ideas are: (1) continue conventional seamless continuous Viterbi decoding beyond the block boundary by recording and repeating the received block of (soft) symbols; (2) start the decoding process in all states; and (3) end the decoding process either adaptively or with a fixed length. Three robust adaptive stopping rules are constructed and evaluated. Simulation results and a comparison to previously known algorithms are presented.

Key concepts: Convolutional code, Viterbi decoder, Viterbi algorithm, Sequential decoding, Decoding methods, Computer science, Iterative Viterbi decoding, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A circular Viterbi algorithm for decoding tailbiting convolutional codes — Research Paper | ScholarLens