Soft decision Viterbi decoding with large constraint lengths

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

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

371 437, G06F 1110, H03M 1312

Patent

active

058021167

ABSTRACT:
A method and apparatus for obtaining a soft symbol decoded output of a received signal by a two pass Viterbi operation. The technique is especially advantageous where the signal is convolutionally encoded with large constraint lengths. During the first pass, the error-correction co-processor (ECCP) is programmed for hard decoded output alone. After all the received symbol sets are hard-bit decoded, a second pass Viterbi operation is performed. Using the previously decoded hard bit to identify the most likely next state at an initial time instant, and initializing the present states at that initial time instant with pre-saved accumulated costs from the first pass Viterbi operation, branch metrics are computed for those state transitions leading to the most likely next state at that time instant. The accumulated cost values of the present states leading to the most likely next state are updated, and the absolute value of their difference is coded as a reliability of the hard decoded output corresponding to that time instant. The combination of the hard decoded output and the reliability obtained from the second pass Viterbi operation results in a soft symbol decoded output. At this point, the symbol set received at this time instant during the first pass Viterbi operation is reloaded into the ECCP which updates the accumulated cost values of all possible next states. These steps are repeated until all desired soft symbols are obtained.

REFERENCES:
patent: 5099499 (1992-03-01), Hammar
patent: 5181209 (1993-01-01), Hagenauer et al.
patent: 5406570 (1995-04-01), Berrou et al.
patent: 5414738 (1995-05-01), Bienz
patent: 5432804 (1995-07-01), Diamondstein et al.
patent: 5454014 (1995-09-01), Blaker et al.
patent: 5465275 (1995-11-01), Blaker et al.
patent: 5471500 (1995-11-01), Blaker et al.
patent: 5537444 (1996-07-01), Nill et al.
patent: 5550870 (1996-08-01), Blaker et al.
patent: 5581568 (1996-12-01), Togami
Peyton Z. Peebles, Jr., Digital Communication Systems, pp. 87-102.
M. Morris Mano, Computer Engineering Hardware Design, pp. 11-17 (1988).
Giovanna D'Aria et al., Simulation and Performance of the Pan European Land Mobile Radio System, in IEEE Transactions On Vehicular Technology, vol. 41, No. 2 (May 1992).
Renato D'Avella et al., An Adaptive MLSE Receiver for TDMA Digital Mobile Radio, in IEEE Journal On Selected Areas In Communications, vol. 7, No. 1, (Jan. 1989).
G. David Forney, Jr., The Viterbi Algorithm, in Proceedings of the IEEE, vol. 61, No.3 (Mar. 1973).
Joachim Hagenauer and Peter Hoeher, A Viterbi Algorithm with Soft-Decision Outputs and its Applications, In IEEE Global Telecommunications Conf. & Exhibition, vol. 3, pp. 1680-1686 (1989).
Wern-Ho Sheen and Gordon L. Stuber, MLSE Equilization and Dedocing for Multipath-Fading Channels, in IEEE Transactions On Communications, vol. 39. No. 10 (Oct. 1991).
Kazuhiko Fukawa and Hiroshi Suzuki, Adaptive Equalization With RLS-MLSE For Frequency-Selective Fast Fading Mobile Radio Channel, in IEEE Global Telecommunications Conf., vol. 1, (Dec. 1991).

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

Soft decision Viterbi decoding with large constraint lengths does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Soft decision Viterbi decoding with large constraint lengths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Soft decision Viterbi decoding with large constraint lengths will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-277841

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