Reduced complexity decoding for trellis coded modulation

Details Reduced complexity decoding for trellis coded modulation Reduced complexity decoding for trellis coded modulation

2006-10-03

2006-10-03

Decady, Albert (Department: 2133)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Digital data error correction

C714S795000

Reexamination Certificate

active

07117427

ABSTRACT:
The present application describes a method of implementing a Viterbi algorithm (VA) for trellis coded modulation (TCM) decoding in communication equipment. According to an embodiment, a branch metric is calculated by adding the absolute value of the real and imaginary parts of a complex vector resulting from the subtraction of a received symbol and a constellation point that is the closest to the symbol in each subset.

REFERENCES:
patent: 5469452 (1995-11-01), Zehavi
patent: 6005898 (1999-12-01), Kaewell, Jr.
patent: 6236685 (2001-05-01), Oppedahl
patent: 6883021 (2005-04-01), Ahmed et al.

Affiliated with

Also associated with

Rating

Reduced complexity decoding for trellis coded modulation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reduced complexity decoding for trellis coded modulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduced complexity decoding for trellis coded modulation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3620022