A reliability output Viterbi algorithm with applications to hybrid ARQ

Raghavan, Arvind; Baum, C.W.

doi:10.1109/18.669289

Cited by 22 publications

(28 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Information feedback of the symbol posterior probabilities, obtained from the BCJR algorithm [23], determines subsequent transmissions, as in [20]. Raghavan and Baum [24] and Fricke and Hoeher [19], [25], [26] present reliability-based type-I HARQ schemes using terminated CCs in a VLF decisionfeedback setting. In [19], the reliability-based scheme is also compared to a code-based scheme using CRCs for error detection.…”

Section: Introductionmentioning

confidence: 99%

Variable-Length Convolutional Coding for Short Blocklengths With Decision Feedback

Williamson

Chen

Wesel

2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-This paper presents a variable-length decisionfeedback coding scheme that achieves high rates at short blocklengths. This scheme uses the Reliability-Output Viterbi Algorithm (ROVA) to determine when the receiver's decoding estimate satisfies a given error constraint. We evaluate the performance of both terminated and tail-biting convolutional codes at average blocklengths less than 300 symbols, using the ROVA and tailbiting ROVA, respectively. Comparing with recent results from finite-blocklength information theory, simulations for both the BSC and the AWGN channel show that the reliability-based decision-feedback scheme can surpass the random-coding lower bound on throughput for feedback codes at some blocklengths less than 100 symbols. This is true both when decoding after every symbol is permitted, and when decoding is limited to a small number of increments. Finally, the performance of the reliability-based stopping rule with the ROVA is compared to retransmission decisions based on CRCs. For short blocklengths where the latency overhead of the CRC bits is severe, the ROVAbased approach delivers superior rates.

show abstract

Section: Introductionmentioning

confidence: 99%

Variable-Length Convolutional Coding for Short Blocklengths With Decision Feedback

Williamson

Chen

Wesel

2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…(22)]. • There are some improved algorithms (with higher complexity) of the Yamamoto-Itoh algorithm, [27], with respect to the error exponent, [17], [18], however for the purpose of analyzing performance (bit error probability and retransmission probability as functions of E c /N 0 and γ) in this paper, it is hard to know whether these algorithms are better than the Yamamoto-Itoh algorithm or not. For example, if we assume that…”

Section: B Decoding Algorithmmentioning

confidence: 99%

Performance of Viterbi Decoding With and Without ARQ on Rician Fading Channels

Truong

2019

IEEE Trans. Commun.

View full text Add to dashboard Cite

In this paper, we investigate the performance of the Viterbi decoding algorithm with/without Automatic Repeat reQuest (ARQ) over a Rician flat fading channel with unlimited interleaving. We show that the decay rate of the average bit error probability with respect to the bit energy to noise ratio is at least equal to d f at high bit energy to noise ratio for both cases (with ARQ and without ARQ), where d f is the free distance of the convolutional code. The Yamamoto-Itoh flag helps to reduce the average bit error probability by a factor of 4 d f with a negligible retransmission rate. We also prove an interesting result that the average bit error probability decays exponentially fast with respect to the Rician factor for any fixed bit energy per noise ratio. In addition, the average bit error exponent with respect to the Rician factor is shown to be d f .

show abstract

“…Since the original objective of erasure decoding is to keep the computational requirements of decoding as small as possible while making the error probability small, if the computational requirements of the decision criterion are large this defeats the purpose. Therefore, it is possible to regard the schemes presented by Raghavan and Baum [9] and Hashimoto [3] that attempt to minimize the probability of a resend based on a fixed decoding error and the decision feedback scheme of Yamamoto and Itoh [1] as efficient in practice.…”

Section: The Decision Criterion Used In Yamamoto and Itoh's Decision mentioning

confidence: 99%

On error exponents for a variable size list decoder using the Viterbi algorithm with likelihood testing

Niinomi

Matsushima

Hirasawa

2007

Electron Comm Jpn Pt III

View full text Add to dashboard Cite

SUMMARYThe likelihood ratio (LR) decision criterion [3] employed by Yamamoto and Itoh's decision feedback (ARQ) scheme [1] is known to be highly compatible with the Viterbi algorithm (VA) due to the fact that it requires a small amount of computational effort. In addition, Forney has derived an extension of the coding theorem to the variable size list decoder for maximum likelihood decoding of block codes. In this paper we propose an algorithm for extending LR-based variable size list decoding for decoding convolutional codes using the Viterbi algorithm; assuming a discrete memoryless channel we also derive a lower bound on the decoder's error exponents.

show abstract

A reliability output Viterbi algorithm with applications to hybrid ARQ

Cited by 22 publications

References 7 publications

Variable-Length Convolutional Coding for Short Blocklengths With Decision Feedback

Variable-Length Convolutional Coding for Short Blocklengths With Decision Feedback

Performance of Viterbi Decoding With and Without ARQ on Rician Fading Channels

On error exponents for a variable size list decoder using the Viterbi algorithm with likelihood testing

Contact Info

Product

Resources

About