Pulse or digital communications – Receivers – Particular pulse demodulator or detector
Reexamination Certificate
2011-08-02
2011-08-02
Lugo, David (Department: 2611)
Pulse or digital communications
Receivers
Particular pulse demodulator or detector
C375S262000, C714S794000, C714S796000
Reexamination Certificate
active
07991082
ABSTRACT:
A method is provided for performing a MAP probability decoding of a sequence R(n) including N bits of encoded data. The method includes the steps of: (a) generating a sequence rnof sot-values by processing the sequence R(n); (b) performing a forward recursion by computing alpha values αS,SGutilizing the soft-decision values; (c) performing a backward recursion by computing beta values βS,SGutilizing the soft-decision values; and (d) performing an extrinsic computation by computing probability values p′k. The alpha values αS,SGare relative log-likelihoods of an encoding process arriving at various states. The beta values βS,SGare relative log-likelihoods of the encoding process arriving at various states. The probability values p′krepresent a set of probabilities indicating that each data bit of an input sequence dKhad a value equal to zero or one. The sequence R(n) represents an encoded form of the input sequence dK.
REFERENCES:
patent: 6029264 (2000-02-01), Kobayashi et al.
patent: 6202189 (2001-03-01), Hinedi et al.
patent: 6263466 (2001-07-01), Hinedi et al.
patent: 6323788 (2001-11-01), Kim et al.
patent: 6690739 (2004-02-01), Mui
patent: 6775800 (2004-08-01), Edmonston et al.
patent: 6789218 (2004-09-01), Edmonston et al.
patent: 6983412 (2006-01-01), Fukumasa et al.
patent: 7093179 (2006-08-01), Shea
patent: 7200798 (2007-04-01), Bickerstaff
patent: 7246296 (2007-07-01), Yokokawa et al.
patent: 7302621 (2007-11-01), Edmonston et al.
patent: 7673213 (2010-03-01), Chugg et al.
patent: 7730378 (2010-06-01), Li et al.
patent: 7770087 (2010-08-01), Laprade et al.
patent: 7770093 (2010-08-01), Divsalar et al.
patent: 7870458 (2011-01-01), Laprade et al.
patent: 2004/0225940 (2004-11-01), Kerr et al.
patent: 2005/0229087 (2005-10-01), Kim et al.
patent: 2007/0079223 (2007-04-01), Mondin et al.
patent: 2008/0229171 (2008-09-01), Laprade et al.
patent: 2010/0031122 (2010-02-01), Laprade et al.
Benedetto et al., “A Soft-Input Soft-Output APP Module for Iterative Decoding of Concatenated Codes,” IEEE Comm. Letters, vol. 1, No. 1, pp. 22-24 (1997).
Benedetto et al., “Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding,” IEEE Transactions on Information Theory, Vo 44, No. 3, pp. 906-926 (1988).
Garello et al., “Computing the Free Distance of Turbo Codes and Serially Concatenated Codes with Interleavers: Algorithms and Applications,” IEEE Jnl on Selected Areas in Communications, vol. 19, No. 5, pp. 800-812 (2001).
Bosco et al., “A New Algorithm for ‘Hard’ Iterative Decoding of Concatenated Codes,” IEEE Transactions on Communications, vol. 51, No. 8, pp. 1229-1232 (2003).
Benedetto et al., “Serial Concatenation of Block and Convolutional Codes,” Electronics Letters, vol. 32, No. 10, pp. 887-888 (1996).
Benedetto et al., “Iterative decoding of serially concatenated convolutional codes,” Electronics Letters, vol. 32, No. 13, pp. 1186-1188 (1996).
Benedetto et al., “Concatenated codes with interleaver for digital transmission over mobile channels,” IEEE International Conference on Communications, vol. 10, pp. 3026-3030 (2001).
Scanavino et al., “Convergance properties of iterative decoders working a bit and symbol level,” Global Telecommunications Conference, IEEE vol. 2, No. 25-29, pp. 1037-1041 (2001).
Benedetto et al., “On the Design of Binary Serially Concatenated Convolutional Codes,” Communication Theory Mini-Conference, pp. 32-36 (1999).
Benedetto et al., “Serial Concatenated Trellis Coded Modulation with Iterative Decoding,” Proceedings, IEEE International Symposium on Information Theory, p. 8, (1997).
Benedetto et al., “Serial concatenation of Interleaved codes: performance analysis, design and iterative decoding,” IEEE International Sumposium on Information Theory, p. 106 (1997).
Benedetto et al., “Serial concatenation of interleaved codes: analytical performance bounds,” Global Telecommunications Conf., “Communications: The Key to Global Prosperity,” vol. 1, pp. 106-110 (1996).
Chandran, “MAP Algorithm FAQ,” found on the WWW at <<http://www.ittc.ku.edu/˜rvc/projects/faq/map.htm>> printed on Feb. 5, 2007.
Cobb Matthew C.
Dyson Timothy F.
Laprade Maria
Fox Rothschild LLP
Harris Corporation
Lugo David
Sacco Robert J.
LandOfFree
Maximum a posteriori probability decoder does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Maximum a posteriori probability decoder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum a posteriori probability decoder will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2706576