Pulse or digital communications – Receivers – Particular pulse demodulator or detector
Reexamination Certificate
2005-05-31
2005-05-31
Burd, Kevin (Department: 2631)
Pulse or digital communications
Receivers
Particular pulse demodulator or detector
C714S795000
Reexamination Certificate
active
06901117
ABSTRACT:
Decoding signals represented by a trellis of block length N divided into windows of length L includes a step of decoding a forward recursion from a point P that is before the beginning of a window up to the beginning of the window. P is chosen at a sufficient distance from the beginning of the window such that forward recursion determines a known state metric at the beginning of the window. A next step includes decoding the window using forward recursion from the known state at the beginning of the window up to the end of the window to define a set of known forward recursion state metrics which are stored. A next step includes decoding using backward recursion starting from a known state at the end of the window and moving backward. A next step includes calculating a soft output at each stage of the backward recursion using the stored forward recursion state metrics, and branch metrics at each stage, and outputting the soft output for that stage in a LIFO format.
REFERENCES:
patent: 5442627 (1995-08-01), Viterbi et al.
patent: 5933462 (1999-08-01), Viterbi et al.
patent: 6598204 (2003-07-01), Giese et al.
patent: 2002/0029362 (2002-03-01), Stephen et al.
patent: 1030457 (2000-08-01), None
patent: 1115209 (2001-07-01), None
patent: 1122890 (2001-08-01), None
Bahl et al., “Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate”, IEEE Trans. Inform. Theory, vol. IT-20, Mar. 1974, pp. 284-287.
Benedetto et al., “Algorithm for Continuous Decoding of Turbo Codes”, Electronics Letters, vol. 32, Feb. 15, 1996, pp. 314-5.
Pietrobon et al., “A Simplification of the Modified Bahl Decoding Algorithm for Systematic Convolutional Codes”, Int. Symp. On Inform. Theory and its Applications, Sydney, Australia, Nov. 1994, Revised Jan. 4, 1996, pp. 1073-1077.
Pietrobon et al., “A Simplification of the Modified Bahl et al. Decoding Algorithm for Systematic Convolutional Codes”, Int. Symp. On Inform. Theory and its Applications, Sydney, Australia, Nov. 1994.
Pietrobon, Steven, “Efficient Implementation of Continuous MAP Decoders and a Synchronous Technique for Turbo Decoders”, Int. Symp. On Inform. Theory and its Applications, Victoria, BC, Canada, Sep. 1996, pp. 586-589.
Viterbi, Andrew, “An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolution Codes”, IEEE Journal on Select. Areas Commun., vol. 16, No. 2, Feb. 1998, pp. 260-264.
Berrou et al. “Near Shannon Limit Erroe-Correcting Coding and Decoding: Turbo-Codes(1)”, Proc. ICC, 1993, pp. 1064-70.
Ariel et al. “Soft Syndrome Decoding of Binary Convolutional Codes”, IEEE Trans. Communications, vol. 43, No. 2, Apr. 1995, pp. 288-297.
U.S. Appl. No. 09/755,656 A, Chass et al., Jan. 7, 2000.
Classon Brian K.
Schaffner Terry M.
Burd Kevin
Mancini Brian M.
Vaas Randall S.
LandOfFree
Soft output decoder for convolutional codes 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 output decoder for convolutional codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Soft output decoder for convolutional codes will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3379544