Excavating
Patent
1995-06-26
1998-07-21
Lee, Thomas O.
Excavating
371 435, 371 436, G06F 1110
Patent
active
057843929
ABSTRACT:
This invention teaches a method, and circuits that operate in accordance with the method, for decoding data received from a communications channel. The method includes the steps of: (a) receiving a modulated communications signal that conveys block encoded data having at least a data field and a syndrome data field; and (b) determining transition metrics and path metrics for the block encoded data. The step of determining path metrics includes a step of retaining path metrics only for a Maximum-Likelihood (ML) path and for a second best ML path. The method further includes a step of: (c) decoding the block encoded data by performing either a full or a partial traceback operation for both the ML path metrics and also for the second best ML path metrics. In a full traceback there is obtained from the ML path a first plurality of detected bits representing the data field, a second plurality of detected bits from the ML path representing the syndrome data field, a third plurality of detected bits from the second best ML path representing the data field, and a fourth plurality of detected bits from the second best ML path representing the syndrome data field. A next step (d) determines a syndrome from the first plurality of detected bits, and then compares the determined syndrome to the second plurality of detected bits. Upon a match a next step (e) outputs the first plurality of detected bits as a received frame of data. If the step of comparing the determined syndrome to the second plurality of detected bits does not indicate a match, the method instead: (f) determines a syndrome from the third plurality of detected bits; (g) compares the determined syndrome to the fourth plurality of detected bits and, upon a match, (h) outputs the third plurality of detected bits as a received frame of data.
REFERENCES:
patent: 5327439 (1994-07-01), Estola et al.
patent: 5375129 (1994-12-01), Cooper
patent: 5574751 (1996-11-01), Trelewicz
patent: 5577053 (1996-11-01), Dert
M. Biver, "Architectural Design and Realization of a Single-Chip Viterbi Decoder", 8220 Integration, the VSLI Journal 8 (1989) Oct., No. 1, Amsterdam, NL, pp. 3-16.
G.D. Forney, "The Viterbi Algorithm", Proc. IEEE, vol. 61, May 1973.
J.H. Lodge et al., "Separable Map Filters for Decoding of Product and Concatenated Codes", Proc. IEEE ICC '93.
J.Hagenauer et al., "A Viterbi Algorithm with Soft-Decision Outputs and Its Application", Proc. IEEE Globecomm 1989.
N. Seshardi et al., "On Post Detection Symbol Reliability Generation", Proc. IEE ICC 1993, Geneva, May 1993.
T. Hashimoto, "A List-Type-Reduced-Constraint Generalization of the Viterbi Algorithm", IEEE Trans. Info. Theory, Nov. 1987.
"Adaptive Maximum-Likelihood Receiver for Carrier-Modulated Data-Transmission Systems", G. Ungerboeck, IEEE Trans. Comm., May 1974, pp. 624-636.
"New VLSI Architechtures for Fast Soft-Decision Threshold Decoders", P. Lavoie, IEEE Trans. Comm., vol. 39, No. 2, Feb. 1991.
"Viterbi Algorithms with List and Soft Symbols Output: Extensions and Comparisons", C. Nill et al., IEEE, 1993, pp. 788-792.
G. Battail, "Weighting the Symbols Decoded by the Viterbi Algorithm", IEEE Int. Symp. Info. Theory, Oct. 1986, p. 141.
Czaja Stash
Niva Ilkka J.
Robertson Jim
Brown Thomas E.
Lee Thomas O.
Nokia Mobile Phones Ltd.
LandOfFree
Viterbi decoder with l=2 best decoding paths does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Viterbi decoder with l=2 best decoding paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Viterbi decoder with l=2 best decoding paths will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1654297