Methods and apparatus for robust and low-complexity QAM modulation

• US 20010028630A1
• Filed: 02/06/2001
• Published: 10/11/2001
• Est. Priority Date: 11/09/1998
• Status: Abandoned Application

• Current Assignee: Texas Instruments, Inc.
• Original Assignee: Texas Instruments, Inc.
• Inventors: Burshtein, Doron, Shalvi, Ofir
• Application Number:
  US09/778,221
• Publication Number:
  US 20010028630A1
• Time in Patent Office: Days
• US Class Current: 370/207
• CPC Class Codes: H04L 2025/0342 QAM
• CPC Class Codes: H04L 27/34 Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems

Abstract

The present invention provides low complexity methods and apparatus for improving the performance of conventional QAM modulations. These methods provide (a) larger noise margins than conventional constellations and/or (b) improved labeling schemes. Additionally, the invention provides fixed-point approximations of these constellations to allow for low complexity VLSI implementations of these schemes.

Claims

1. A QAM constellation, comprising:

points arranged in a non-square grid to achieve a large noise margin, and

to allow for fast convergence of blind equalization algorithms.

2. The QAM constellation of

claim 1

, wherein said points are selected to use low word widths.

3. A method for improved shell mapping comprising:

providing a non-square grid QAM constellation and employing points of said constellation in said mapping.

4. A transmitter, comprising:

a symbol mapper for receiving inputs,

a filter for each output of said mapper, and

a modulator for receiving said filter'"'"'s outputs and providing an output signal.

5. The transmitter of

claim 4

, wherein said mapper employs a non-square grid QAM constellation.

6. A slicer for a receiver, comprising:

a pre-programmed look-up-table for receiving I and Q components and generating indexes of n constellation elements, and

a distance calculator which calculates the Euclidean distance from a slicer input to the n constellation elements pointed to by the look-up-table to determine the constellation element to be output.

7. The slicer of

claim 6

, wherein said distance calculator employs an adder and squaring unit.

8. A receiver, comprising:

a demodulator for receiving an input signal and outputting a data stream,

a filter for said data stream, and

a slicer for converting said data stream to a constellation point.

9. The receiver of

claim 8

, wherein said receiver is a blind receiver employing a super exponential algorithm or a CMA.

10. The receiver of

claim 9

, wherein said constellation points are selected from {0,1e^2π

j/7,e<sup>4π

j/7</sup>,e<sup>6π

j/7</sup>,e<sup>8π

j/7</sup>,e<sup>10π

j/7</sup>,e<sup>12π

j/7</sup>}.

11. A QAM constellation labelling method, comprising:

labelling each point so that the Hamming distance between each neighboring pair is one, and

labelling such pairs to minimizing the Hamming distance when the distance can not be set to one.

12. A method for minimizing bit error for Trellis code modulation, comprising:

labelling uncoded bits to minimize bit error rates, and labelling coded bits in accordance with Trellis coding modulation while minimizing the Hamming distance between source bits.