Pulse or digital communications – Receivers – Particular pulse demodulator or detector
Reexamination Certificate
2005-02-15
2005-02-15
Burd, Kevin (Department: 2631)
Pulse or digital communications
Receivers
Particular pulse demodulator or detector
C714S795000
Reexamination Certificate
active
06856657
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 P1that is before the beginning of a window up to the beginning of the window and decoding a backward recursion from a point P2that is after the end of a window back to the end of the window to define known states at the beginning and end of the window. A next step includes decoding the window using backward recursion from the known state at the end of the window back to the beginning of the window to define a set of backward recursion state metrics. A next step includes decoding using forward recursion starting from a known state at the beginning of the window and moving forward to the end of the window to define a set of forward recursion state metrics. A next step includes calculating a soft output at each stage of the window using the forward and backward recursion state metrics, and branch metrics at each stage, and outputting the soft output for that stage.
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: 20020029362 (2002-03-01), Stephen et al.
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-7.
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-7.
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-9.
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-4.
Berrou et al. “Near Shannon Limit Error-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-97.
Classon Brian K.
Desai Vipul A.
Schaffner Terry M.
Burd Kevin
Mancini Brian M.
Motorola Inc.
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-3452649