Symbol reliability determination and symbol pre-selection...

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

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C375S262000, C375S265000, C714S792000, C714S794000, C714S795000

Reexamination Certificate

active

10368017

ABSTRACT:
A method and apparatus for processing demodulated data comprising received symbol data is disclosed. A decoder is used to compute estimated symbols and corresponding reliability metrics. The reliability metrics are transformed into reliability weights. Optionally, residuals relating to the difference between the received symbol data and the estimated symbols are computed. Output data are generated comprising any combination of the following: estimated symbols, reliability weights, residuals, and received symbol data. The residuals may be weighted by the reliability metrics and used by demodulation or error compensation loops to instantaneously reduce or increase the bandwidth of these loops.

REFERENCES:
patent: 6023783 (2000-02-01), Divsalar et al.
patent: 6470047 (2002-10-01), Kleinerman et al.
patent: 6677865 (2004-01-01), Xu
patent: 6769093 (2004-07-01), Krieger
patent: 6813743 (2004-11-01), Eidson
patent: 2002/0122507 (2002-09-01), Eidson
Bahl, L. R., et al.,Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate; IEEE Transactions on Information Theory, Mar. 1974, pp. 284-287.
Benedetto, S., et al.,A Soft-Input Soft-Output Maximum A Posteriori(MAP)Module to Decode Parallel and Serial Concatenated Codes; TDA Progress Report, 42-127, Nov. 1996, pp. 1-20.
Benedetto, S. and Montorsi, G.,Iterative decoding of serially concatenated convolutional codes; Electronics Letters, vol. 32, No. 13, Jun. 1996, pp. 1186-1188.
Benedetto, S. and Montorsi, G.,Serial concatenation of block and convolutional codes; Electronics Letters, vol. 32, No. 10, May 1996, pp. 887-888.
Berrou, Claude, et al.,Near Shannon Limit Error—Correcting Coding and Decoding: Turbo-Codes(1); IEEE, May 1993, pp. 1064-1070.
Divsalar, D. and Pollara, F.,Serial and Hydrid Concatenated Codes with Applications; Jet Propulsion Laboratory, California Institute of Technology, pp. 1-8.
Divsalar, D. and Pollara, F.,Turbo Trellis Coded Modulation with Iterative Decoding for Mobile Satellite Communications; Jet Propulsion Laboratory, California Institute of Technology, pp. 1-7.
Hagenauer, Joachim and Hoeher, P.,A Viterbi Algorithm with Soft-Decision Outputs and its Applications; Proceedings of IEEE Globecom '89; Dallas, Texas, Nov. 1989; pp. 47.1.1-47.1.7.
Hoeher, Peter and Lodge, John,“Turbo DPSK”: Iterative Differential PSK Demodulation and Channel Decoding; IEEE Transactions on Communications, vol. 47, No. 6, Jun. 1999, pp. 837-843.
Narayanan, Krishna R. and Stüber, Gordon L.,A Serial Concatenation Approach to Iterative Demodulation and Decoding; IEE Transactions on Communications, vol. 47, No. 7, Jul. 1999, pp. 956-961.
Robertson, P., et al.,A Comparison of Optimal and Sub-Optimal MAP Decoding Algorithms Operating in the Log Domain; IEEE, 1995, pp. 1009-1013.
Viterbi, Andrew J.,An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes; IEEE Journal on Selected Areas in Communications, vol. 16, No. 2, Feb. 1998, pp. 260-264.

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

Symbol reliability determination and symbol pre-selection... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Symbol reliability determination and symbol pre-selection..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symbol reliability determination and symbol pre-selection... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3867293

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