DMT: Implementation 1.3 2003/12/16 21:38:53 US/Central 2003/12/17 13:50:54.876 US/Central Chris Sramek goof@rice.edu Chris Sramek goof@rice.edu Describes our implementation of a DMT system.

DMT System

Our DMT system can be represented by the following block diagram:

Block Diagram

Visit the following links to find out more about the particular subsystems: A/D & D/A Serial/Parallel, Parallel/Serial Constellation Mapping Mirror/IFFT, De-Mirror/FFT Cyclic Prefix The Channel Equalization & Approximation

Operation of the System Before we talk about our implementation, we need to describe how DMT may be used to send and receive an analog signal:

A sampled analog signal passes through an A/D converter (Q bits/sample) where it is represented as a bitstream. The bitstream is divided into S length N parallel blocks with a serial-to-parallel converter. Each block undergoes a constellation mapping, where segments of bits (length B) are represented as single complex values in a constellation. The mapped blocks are mirrored to give them conjugate symmetry (which increases their lengths to 2N/B), then the IFFT of each block is taken. A cyclic prefix (length C) is inserted at the beginning of each block to combat problems introduced by the channel. The blocks (now known as symbols) are concatenated to form a length S(2N/B+C) time domain signal, which is transmitted into the channel. On the other side of the channel, the received signal is again broken up into S parallel blocks. The cyclic prefixes are removed, the FFT of each block is taken and each is de-mirrored so that the block length is once again N/B. Because the channel filtered the time domain signal and added noise, each block is equalized through multiplication by the inverse transfer function of the channel (which is known by the receiver). The complex numbers in each block, which have been distorted by noise, are approximated by values in the original constellation. A de-constellation mapping then occurs, which converts the complex values back to bits and increases the block length back to N. The blocks of bits are concatenated back into a single bitstream, which then undergoes a D/A conversion back to a sampled analog signal. This is an approximation of the original signal.

Implementation

We implemented our DMT system through a collection of MATLAB functions. Some of them, such as the IFFT and FFT, were standard built-in functions while others, such as the constellation mapping and approximation routines, were coded from scratch. We directed the use of each function with a separate script, run.m, which allowed us to easily change input parameters. The MATLAB code for each function can be found below: MATLAB code used: run.m constbuilder.m a2d.m constmap.m series2parallel.m mirror.m cyclicpad.m matlaberr.m parallel2series.m channel.m decyclicpad.m filterchannel.m demirror.m approximate.m deconstmap.m d2a.m Home | Previous: Introduction | Next: Results & Conclusions