Minimum error detection in a viterbi decoder

Details Minimum error detection in a viterbi decoder Minimum error detection in a viterbi decoder

H - Electricity

03

M

H03M 13/41 (2006.01) H03M 13/23 (2006.01)

Patent

CA 2353019

A Viterbi decoder for decoding a convolutional code. For each possible state, an accumulated error AE is maintained at 66. As each codeword Rx-GP is received, the errors between it and the code groups of all the transitions are determined at 65. For each possible new state, logic 68 determines the errors of the two transitions leading from old states to that new state, adds them the accumulated errors of those two old states, and determines the smaller of the two sums. Path logic 67 records the corresponding transition, updating a record of the path leading to the new state. Tracing back along a path a predetermined and sufficiently large number of transitions, the input bit or bits corresponding to the transition so reached are taken as the next bit or bits in the stream of decoded bits. The unit 57 comprises a tree of comparators fed with the accumulated errors. The accumulated errors are limited, before being fed to unit 57, by a set of limiters 76 to values less than the maximum error upper bound.

Affiliated with

Also associated with

Rating

Minimum error detection in a viterbi decoder does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Minimum error detection in a viterbi decoder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum error detection in a viterbi decoder will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1908822