Journal Article10.1109/TIT.1980.1056245
Viterbi decoding algorithm for convolutional codes with repeat request
Hirosuke Yamamoto,Kohji Itoh +1 more
165
TL;DR: It is shown that the reliability function of the proposed decoding algorithm is asymptotically twice that of the Viterbi decoding algorithm without repeat request, and that in certain practical situations the proposed algorithm can save about 50 percent in constraint length over the ordinary Viterba algorithm for a given performance.
read more
Abstract: Using the Viterbi decoding algorithm with repeat request for convolutional codes is proposed, and the resulting performance is analyzed by random coding and generating function arguments and by simulation. It is shown that the reliability function of the proposed decoding algorithm is asymptotically twice that of the Viterbi decoding algorithm without repeat request, and that in certain practical situations the proposed algorithm can save about 50 percent in constraint length over the ordinary Viterbi algorithm for a given performance.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Viterbi algorithm with soft-decision outputs and its applications
Joachim Hagenauer,Peter Adam Hoeher +1 more
- 27 Nov 1989
TL;DR: The Viterbi algorithm is modified to deliver the most likely path sequence in a finite-state Markov chain, as well as either the a posteriori probability for each bit or a reliability value, with the aim of producing soft decisions to be used in the decoding of outer codes.
1.9K
Automatic-repeat-request error-control schemes
TL;DR: In this article, a survey of various types of ARQ and hybrid ARQ schemes, and error detection using linear block codes is presented, where a properly chosen code is used for error detection, virtually error-free data transmission can be attained.
List Viterbi decoding algorithms with applications
TL;DR: A list Viterbi decoding algorithm (LVA) that produces a rank ordered list of the L globally best candidates after a trellis search and a serial LVA that iteratively produces the k/sup th/ best candidate based on knowledge of the previously found k-1 best paths is presented.
445
A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes
S. Benedetto
- 01 Jul 1996
TL;DR: This article describes the SISO module in a form that continuously updates the maximum a posteriori (MAP) probabilities of input and output code symbols and shows how to embed it into iterative decoders for parallel and serially concatenated codes.
References
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
TL;DR: The upper bound is obtained for a specific probabilistic nonsequential decoding algorithm which is shown to be asymptotically optimum for rates above R_{0} and whose performance bears certain similarities to that of sequential decoding algorithms.
7.6K
Convolutional Codes and Their Performance in Communication Systems
TL;DR: This tutorial paper begins with an elementary presentation of the fundamental properties and structure of convolutional codes and proceeds with the development of the maximum likelihood decoder, which yields for arbitrary codes both the distance properties and upper bounds on the bit error probability.
1K
Viterbi Decoding for Satellite and Space Communication
J. Heller,I. Jacobs +1 more
TL;DR: Convolutional coding and Viterbi decoding, along with binary phase-shift keyed modulation, is presented as an efficient system for reliable communication on power limited satellite and space channels.
463