Decoder for implementing an approximation of the Viterbi algorit

Communications: electrical – Digital comparator systems

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 1112

Patent

active

040877876

ABSTRACT:
The present invention relates to two novel approaches for implementing an approximation of the Viterbi decoding algorithm using analog processing techniques which offer the potential for decoding at higher rates than currently achievable with digital processing decoders. The first approach employs at least one tapped delay means having a plurality of taps to enable the provision of the inverted and noninverted received analog channel waveform while path metric operations are performed by selectively switching between corresponding inverting and noninverting provisions of the at least one delay means according to the contents of a decision-directed digital memory. The second approach employs sample-and-hold circuits to store and update the path metrics based upon previous maximum-likelihood decisions.

REFERENCES:
patent: 3789360 (1974-01-01), Clark, Jr. et al.
patent: 3815028 (1974-06-01), Rabow
patent: 4015238 (1977-03-01), Davis
Rudolph, Generalized Threshold Decoding of Convolutional Codes, IEEE Transactions on Info. Theory, vol. IT-16, No. 6, Nov. 1970, pp. 739-745.

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

Decoder for implementing an approximation of the Viterbi algorit does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Decoder for implementing an approximation of the Viterbi algorit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoder for implementing an approximation of the Viterbi algorit will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2161413

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