Optimal soft-output decoder for tail-biting trellis codes

Details Optimal soft-output decoder for tail-biting trellis codes Optimal soft-output decoder for tail-biting trellis codes

1996-04-19

1998-02-24

Baker, Stephen M.

Excavating

H03M 1312

Patent

active

057217467

ABSTRACT:
A circular MAP decoder for error-correcting trellis codes that employ tail biting produces soft-decision outputs provides an estimate of the probabilities of the states in the first stage of the trellis, which probabilities replace the a priori knowledge of the starting state in a conventional MAP decoder. The circular MAP decoder provides the initial state probability distribution in either of two ways. The first involves a solution to an eigenvalue problem for which the resulting eigenvector is the desired initial state probability distribution; with knowledge of the starting state, the circular MAP decoder performs the rest of the decoding according to the MAP decoding algorithm. The second is based on a recursion for which the iterations converge to a starting state distribution. After sufficient iterations, a state on the circular sequence of states is known with high probability, and the circular MAP decoder performs the rest of the decoding according to the MAP decoding algorithm.

REFERENCES:
patent: 5349589 (1994-09-01), Chennakeshu et al.
patent: 5369671 (1994-11-01), Yehushua et al.
patent: 5406570 (1995-04-01), Berrou et al.
patent: 5577053 (1996-11-01), Dent
L.R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate," IEEE Transactions on Information Theory, pp. 284-287, Mar. 1974.
J.B. Anderson and K. Balachandran, "Decision depths of convolutional codes," IEEE Trans. Information Theory, vol. IT-35, pp. 455-459, Mar. 1989.
R.V. Cox and C-E Sundberg, "An Efficient Adaptive Circular Viterbi Algorithm for Decoding Generalized Tailbiting Convolutional Codes," IEEE Transactions on Vehicular Technology, vol. 43, No. 1, pp. 57-68, Feb. 1994.
H.H. Ma and J.K. Wolf, "On tail biting convolutional codes," IEEE Transactions on Communications, vol. 34, No., pp. 104-111, Feb. 1986.
Q. Wang and V.K. Bhargava, "An efficient maximum likelihood decoding algorithm for generalized tailbiting convolutional codes including quasicyclic codes," IEEE Transactions on Communications, vol. 37, No. 8, pp. 875-879, Aug. 1989.
J.B. Anderson and Seshadri Mohan, "Source and Channel Coding," pp. 216 and 336-342.

Affiliated with

Also associated with

Rating

Optimal soft-output decoder for tail-biting trellis codes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimal soft-output decoder for tail-biting trellis codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal soft-output decoder for tail-biting trellis codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1879501