Explicit evaluation of Viterbi's union bounds on convolutional code performance for the binary symmetric channel (Corresp.)

Post, KA Karel

doi:10.1109/tit.1977.1055704

Cited by 7 publications

(9 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The state-transition probability matrix of the Viterbi algorithm with elements defined by equation (8) has the form P 0 = ⎡ ⎢ ⎣ P(S (1) ) P(S (2) ) P(S (3) ) P(S (4) ) P(S (1) ) P(S (2) ) P(S (3) ) P(S (4) ) P(S (1) ) P(S (2) ) P(S (3) ) P(S (4) ) P(S (1) ) P(S (2) ) P(S (3) ) P(S (4) )…”

Section: Convolutional Codesmentioning

confidence: 99%

“…The stationary (steady-state) distribution of this chain is given by equation (13) where π is the stationary distribution of relative distance Markov chain with the matrix P = P(S (1) ) + P(S (2) ) + P(S (3) ) + P(S (4) ) According to [2, eq. (6)] this solution is…”

Section: Convolutional Codesmentioning

confidence: 99%

“…Obviously, upper bounds are useful for comparison of different systems if they are "tight", because a small difference between two upper bounds on some values does not necessarily correspond to the small difference between the values. It has been demonstrated [4], [5] and also in this paper that the bounds of [3], [1] are not tight even for small channel error rates.…”

Section: Introductionmentioning

confidence: 96%

“…This bounding approach was generalized to FSM by Omura [1]. The exact union bound was presented by Post [4] for a binary convolutional code in channels with independent errors. This exact bound was generalized to FSM in [5], [6,Appendix 4.3].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Evaluating the Exact Performance of the Viterbi Algorithm

Turin

Jana

2010

2010 IEEE Wireless Communication and Networking Conference

View full text Add to dashboard Cite

A Hidden Markov Modeling technique is used to evaluate the exact performance of the Viterbi algorithm for estimating states of a finite state system. This technique is applied to exact calculation of the bit error probability of the Viterbi decoder of a convolutional code in channels with independent errors and in channels with memory. The results are compared with the widely used upper bounds. The accuracy of the proposed methods is verified via computer simulation.This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 2010 proceedings.978-1-4244-6398-5/10/$26.00 ©2010 IEEE

show abstract

Section: Convolutional Codesmentioning

confidence: 99%

Section: Convolutional Codesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 96%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Evaluating the Exact Performance of the Viterbi Algorithm

Turin

Jana

2010

2010 IEEE Wireless Communication and Networking Conference

View full text Add to dashboard Cite

show abstract

“…In the case of a continuous channel we may also use a transform (characteristic function) technique to obtain a union bound similar to Equation (12) is similar to (5), and therefore we may derive a new union bound for the analog case that is similar to (7):…”

Section: L=l Ulmentioning

confidence: 99%

Union Bounds on Viterbi Algorithm Performance

Turin

1985

At&T Technical Journal

View full text Add to dashboard Cite

In the present paper we use transform methods (characteristic function techniques) and contour integrals to derive a closed-form expression for the performance union bound of a general discrete-time system. We show that previously published results may be derived as particular cases of the general formulation developed in this paper. It is well known that the maximumlikelihood Viterbi algorithm may be employed not only for decoding of convolutional codes but also for optimal detection in other situations. Examples include bandwidth-efficient demodulation, optimal accommodation for intersymbol interference and cross-channel coupling, text recognition, simultaneous carrier phase recovery and data demodulation, digital magnetic recording, nonlinear estimation and smoothing. The union bound is a useful measure of the performance of the Viterbi algorithm. Past closed-form expressions for the union bound have usually involved considerable approximation.

show abstract

Performance of Forward Error-Correction Systems

Turin

2004

Performance Analysis and Modeling of Digital Transmission Systems

View full text Add to dashboard Cite

Explicit evaluation of Viterbi's union bounds on convolutional code performance for the binary symmetric channel (Corresp.)

Cited by 7 publications

References 12 publications

Evaluating the Exact Performance of the Viterbi Algorithm

Evaluating the Exact Performance of the Viterbi Algorithm

Union Bounds on Viterbi Algorithm Performance

Performance of Forward Error-Correction Systems

Contact Info

Product

Resources

About