10.4 Dmt: constellation mapping

Constellation mapping

In the constellation mapping process, length B segments of the bitstreams are assigned a single complex value in a constellation . This is similar to quadrature ampliture modulation (QAM), because the IFFT of these complex points maps to various sinusoids with amplitudes proportional to the real part and phase shifts proportional to the complex part. We mostly used 2-bit (4 point) and 4-bit (16 point) constellations in our system, but we also coded a function that generates a mapping with an arbitrary number of points. In comparison, constellations used in actual DMT systems can have as many as 240 points. Important characteristics of these constellations include the area occupied by the points and the spacing between points. The power neccessary to transmit the actual signal is proportional to the area, so it is key not to let the points be too far apart. However, the channel introduces noise which results in the constellation points being recieved with error. If the points are too close together, it is impossible to correctly match the received points with the correct value in the constellation. We implemented constellation mapping with a home-cooked parser: it would examine every 2 or 4 bits (depending on the mapping), look up the current segment in a table and assign the next element in a new vector the corresponding constellation point.

Our related MATLAB functions: constmap.m , deconstmap.m

Home | Previous: Implementation | Next: Mirror/IFFT, De-Mirror/FFT