Comparison of iterative MAP and SOVA receivers for the frequency non-selective fading channel
| dc.contributor.author | Li, Yim Cheung | en_US |
| dc.date.accessioned | 2007-05-18T19:57:32Z | |
| dc.date.available | 2007-05-18T19:57:32Z | |
| dc.date.issued | 1999-08-01T00:00:00Z | en_US |
| dc.degree.discipline | Electrical and Computer Engineering | en_US |
| dc.degree.level | Master of Science (M.Sc.) | en_US |
| dc.description.abstract | The Rayleigh frequency non-selective fading channel is a typical wireless communication channel model. When signals are transmitted over this kind of channel, the received signals experience a time-varying multiplicative gain plus the usual additive white Gaussian noise. The multiplicative gain can be modelled as a correlated Gaussian random variable. For interleaved coded signals transmitted over fading channels, a suboptimal yet practical two stage receiver has been proposed by Vitetta and Taylor. The first stage is a channel demodulator to combat the fading distortion and the second stage is a decoder. Later research by Gertsman and Lodge has shown that error performance can be greatly enhanced when the entire detection scheme is carried out iteratively because channel equalization can benefit from the coding structure. Both demodulator and decoder should be able to deliver soft-outputs for a better error correction capability. In this thesis, two receivers, which use Bahl 'et al''s MAP algorithm and Hagenauer and Hoeher's soft-output Viterbi algorithm (SOVA), are implemented and their error performances are compared. (Abstract shortened by UMI.) | en_US |
| dc.format.extent | 6566405 bytes | |
| dc.format.extent | 184 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | text/plain | |
| dc.identifier.uri | http://hdl.handle.net/1993/1758 | |
| dc.language.iso | eng | en_US |
| dc.rights | open access | en_US |
| dc.title | Comparison of iterative MAP and SOVA receivers for the frequency non-selective fading channel | en_US |
| dc.type | master thesis | en_US |