Abstract This thesis is concerned with the `FER and Outage Capacity Analysis of Space-Time Trellis Coding (STTC)

using Modulation Techniques'. The analysis of channel codes for improving the data rate and the reliability of communications over fading channels using multiple transmit antennas convolutional encoder and the encoded data is split into streams that are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals with noise. Performance criteria for designing such codes, under the assumption that the fading is slow and frequency nonselective, is also analysed. Space-Time Codes (STC) were rst introduced by Tarokh et al. from AT&T research labs in 1998 as a novel means of providing transmit diversity for the multiple-antenna fading channel. Previously, multipath fading in multiple antenna wireless systems was mostly dealt with by other diversity techniques, such as temporal diversity, frequency diversity and receive antenna diversity, with receive antenna diversity being the most widely applied technique.
There are two main types of STC [1], namely 1. Space-Time Block Codes (STBC) 2. Space-Time Trellis Codes (STTC) Space-time block codes operate on a block of input symbols, producing a matrix output whose columns represent time and rows represent antennas.

Space-time trellis codes encode the input symbol stream into an output vector symbol stream.
Trellis codes for band limited channels result from the treatment of modulation and coding as a combined entity rather than two separate operations. This combination itself referred to as Trellis code modulation (TCM). This form of signaling has three basic features [5]: 1. The number of signal points in the constellation used is larger than what is required for the modulation format of interest with the same data rate; the additional points allow redundancy for Forward Error Control (FEC) coding without sacricing bandwidth. 2. Convolution coding is used to introduce a certain dependency between successive signal points, such that only certain patterns or sequences of signal points are permitted. 3. Soft decision decoding is performed on the receiver, in which the permissible sequence of signals is modelled as a trellis structure; hence the name trellis codes. Space-time trellis codes encode the input symbol stream into an output vector symbol stream. Unlike space-time block codes, space-time trellis codes map one input symbol at a time to an Mt 1 vector output. Since the encoder has memory, these vector codewords are correlated in time. Decoding is performed via maximum likelihood [5][7] sequence estimation.

Shown above is a general block diagram for a STTC system. The input data bits coming at the rate of m bits/symbol are encoded by a channel (convolutional) encoder, to produce m + r bits which are mapped with the help of a constellation mapper to give on of the possible states of the encoder. This is then further modulated using techniques like PSK, FSK, QAM etc. and transmitted through Nt transmit antennas to the channel, where the signal gets corrupted by noise. At the receiving end, Nr receive antennas are used to receive the transmitted signal which is then demodulated and the resultant noise aected signal is feed to a Viterbi Decoder. It is a maximum likelihood (ML) decoder that gets back the original signal by construction a trellis structure. The decoder is designed such as to minimize the error due to noise or any other factors.

Gaussian noise is a noise that has its PDF equal to that of the normal distribution, which is also known as the Gaussian distribution. Gaussian noise is most commonly known as additive white Gaussian noise. Gaussian noise is properly defined as the noise with a Gaussian amplitude distribution. Labeling Gaussian noise as 'white' describes the correlation of the noise. It is necessary to use the term "white Gaussian noise" to be precise. B. Salt-and-Pepper Noise Salt and pepper noise is a noise seen on images. It represents itself as randomly occurring white and black dots. An effective filter for this type of noise involves the usage of a median filter. Salt and pepper noise creeps into images in situations where quick transients, such as faulty switching, take place[9]. C. Speckle Noise Speckle noise is caused by signals from elementary scatterers, the gravity-capillary ripples, and manifests as a pedestal image.Several different methods are used to eliminate speckle noise, based upon different WAVELET TRANSFORM Wavelets are mathematical functions that cut up data into different frequency components, and then study each component with a resolution matched to its scale. They have advantages over traditional Fourier methods in analyzing physical situations where the signal contains discontinuities and sharp spikes[20]. Wavelets were developed independently in the fields of mathematics, quantum physics, electrical engineering, and

seismic geology. Interchanges between these fields during the last ten years have led to many new wavelet applications such as image compression, turbulence, human vision, radar, and earthquake prediction[12] [18]. A wavelet transform is the representation of a function by wavelets. The wavelets are scaled and translated copies of a mother wavelet. Wavelet analysis represents the next logical step: a windowing technique with variable-sized regions. Wavelet analysis allows the use of long time intervals where we want more precise low-frequency information, and shorter regions where we want high frequency information.Wavelet transforms are classified into discrete wavelet transforms (DWTs) and continuous wavelet transforms (CWTs). Both DWT and CWT are continuous-time (analog) transforms. They can be used to represent continuoustime (analog) signals. CWTs operate over every possible scale and translation whereas DWTs use a specific subset of scale and translation values or representation grid
Forwar d wavele Estimatio n of wavelet Inv. of wavelet transfor m

At the input we have noisy image and at the output we get estimated clean image. The goal of image denoising is to remove noise by differentiating it from the signal. The wavelet transforms energy compactness helps greatly in denoising. Energy compactness refers to the fact that most of the signal energy is contained in a few large wavelet coefficients, whereas a small portion of the energy is spread across

a large number of small wavelet coefficients. These coefficients represent details as well as high frequency noise in the image. By appropriately thresholding these wavelet coefficients, image denoising is achieved while preserving fine structures in the image.The other properties of the wavelet transform that help in the image denoising are sparseness, clustering, and correlation between neighboring wavelet coefficients. The wavelet coefficients of natural images are sparse. The histogram of the wavelet coefficients of natural images tends to peak at zero. As they move away from zero, the graph falls sharply. Step General Method 1. Decompose signal using DWT; Choose wavelet and number of decomposition levels. Compute Y=Wy 2. Perform thresholding in the Wavelet domain.Shrink coefficients by thresholding (hard /soft). 3. Reconstruct the signal from thresholded DWT coefficients Compute

retained or modified depending on the threshold rule.

The term wavelet thresholding is explained as decomposition of the data or the image into wavelet coefficients, comparing the detail coefficients with a given threshold value, and shrinking these coefficients close to zero to take away the effect of noise in the data. The image is reconstructed from the modified coefficients. This process is also known as the inverse discrete wavelet transform. During thresholding, a wavelet coefficient is compared with a given threshold and is set to zero if its magnitude is less than the threshold; otherwise, it is