Decoding symbols representing digital words

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S755000, C714S800000

Reexamination Certificate

active

06611940

ABSTRACT:

The present invention relates to a method and apparatus for decoding input symbols representing words including a plurality of information bits. The invention has particular application to the decoding of encoded symbols which have been subjected to phase shift key (PSK) modulation. The invention is advantageously employed in decoding phase shift key modulated signals for digital television signal reception.
BACKGROUND OF INVENTION
Recently, a new class of error-control codes, termed “turbo-codes”, has been introduced. These codes provide error performance close to the Shannon limit by using an iterative decoding technique that relies upon simple constituent codes. A natural extension to improve the bandwidth efficiency of turbo-codes is to apply them to trellis coded modulation (TCM) and pragmatic trellis coded modulation (PCTM) systems.
In a known modulation system, a turbo-encoder encodes a serial stream of input data bits at a rate R of 1/3 to produce two parity bits in parallel with each input data bit. The information and parity bits are subject to demultiplexing in a demultiplexer so as to form symbols each of which includes a number of information bits and a number of parity bits. The parity bits are punctured in a puncturing module so as to reduce the number of parity bits and thereby increase the data rate of the system. The bits of each symbol are interleaved in an interleaver and passed to a signal mapping module. The output from the mapping module comprises the I and Q components necessary for input to a PSK modulator.
One of the serious drawbacks associated with the application of turbo-codes is the effect of “flattening error degradation” by which is meant the effect whereby the bit error ratio at the output of the turbo-decoder cannot be reduced below certain values which depend on the type of turbo-code and are in the range of 10
−8
to 10
−9
. Although this figure is acceptable for most applications, digital television broadcasting requires quasi-error free performance in which the bit error ratio is 10
−11
. In order to meet this requirement, the conventional solution has been the serial concatenation of the Reed Solomon code and a binary turbo-code. However, the concatenated technique is not bandwidth efficient as the turbo-codes are not associated with any trellis coded modulation. Furthermore this technique has not used the full error correction power of the concatenated scheme because it has relied on hard decision information from the turbo-decoder.
It is one aim of the present invention to achieve the desired data rate whilst improving the bit-error ratio.
SUMMARY OF THE INVENTION
According to the present invention, there is now provided decoder apparatus to decode symbols each representing a digital wording comprising a turbo encoded bit, a parity bit and at least one uncoded bit, the apparatus comprising: a first soft metric generator to produce a soft metric of the encoded bit in each symbol; one or more second soft metric generators to generate a soft metric of the uncoded bit in each symbol; a turbo decoder to decode the soft metric of the encoded bit so as to produce a hard value and a soft estimate of the encoded bit; a turbo encoder to encode the hard value of the encoded bit to produce a reconstruction of the encoded bit and two parity bits; a puncture module to puncture the parity bits once; and, one or more hard decision modules to produce a hard decision for the uncoded bit of each symbol.
Further according to the present invention, there is provided a method of decoding symbols each representing a digital word comprising a turbo encoded bit, a parity bit and at least one uncoded bit the method comprising the steps of: producing a soft metric of the encoded bit in each symbol; generating a soft metric of the uncoded bit in each symbol; employing a turbo-decoder to decode the soft metric of the encoded bit so as to produce a hard value and a soft estimate of the encoded bit; employing a turbo encoder to encode the hard value of the encoded bit to produce a reconstruction of the encoded bit and two parity bits, puncturing the parity bits once; and, producing a hard decision for the uncoded bit of each symbol.


REFERENCES:
patent: 6163571 (2000-12-01), Asokan et al.
patent: 6236685 (2001-05-01), Oppedahl
patent: 0526201 (1993-02-01), None
patent: 0577085 (1994-01-01), None
patent: 9737322 (1997-10-01), None
Inspec Abstract No. B9608-6120B-049 & K. Fazel et al, IEEE Globecom '95 Conference, 1995, IEEE, USA, vol. 1, pp. 649-653 (see abstract).
Papke L. et al—Combined Multilevel Turbo-Code with Mr-Modulation, Proceedings of the Conference on Communications (ICC), US, New York? IEEE, p. 668-672 XPOOO533098 ISBN: 0-7803-2487-0 Nov. 14, 1995.
Fazel K. et al—Combined Multilevel Turbo-Code with 8PSK Modulation, IEEE Global Telecommunications Conference (Globecom), US, New York, IEEE, p. 649-653 XPOOO621563 ISBN: 0-7803-2510-9 Jun. 18, 1995.
Robertson P. et al—Coded Modulation Scheme Employing Turbo Codes, Electronics Letters, GB, IEE Stevenage, vol. 31, No. 18, p. 1546 1547XP000530944 ISSN: 0013-5194 Aug. 31, 1995.

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

Decoding symbols representing digital words does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Decoding symbols representing digital words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding symbols representing digital words will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3098789

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