Method and implemention of a traceback-free parallel viterbi...

Pulse or digital communications – Receivers – Particular pulse demodulator or detector

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C375S262000, C375S265000, C714S795000, C714S796000

Reexamination Certificate

active

06904105

ABSTRACT:
The traceback operation for a Viterbi algorithm can be minimized by producing optimal path values for each state in the trellis, and updating the optimal path values at each state for each symbol. The optimal path value can be used to quickly determine the output values for the system without requiring a traceback which would typically require a memory read for each transmitted symbol.

REFERENCES:
patent: 5878098 (1999-03-01), Wang et al.
patent: 5923713 (1999-07-01), Hatakeyama
patent: 5966534 (1999-10-01), Cooke et al.
patent: 5970254 (1999-10-01), Cooke et al.
patent: 6330684 (2001-12-01), Yamanaka et al.
patent: 6438181 (2002-08-01), Setlur et al.
patent: 6637004 (2003-10-01), Mizuno et al.
patent: 6680986 (2004-01-01), Hemmati
Andrew J. Viterbi, “Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm”, Published in IEEE Transactions on Information Theory, vol. IT-13, pp. 260-269, in Apr. 1967.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and implemention of a traceback-free parallel viterbi... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and implemention of a traceback-free parallel viterbi..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and implemention of a traceback-free parallel viterbi... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3503272

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.