Please use this identifier to cite or link to this item:
Title: Iterative receiver design for broadband wireless communication systems via expectation maximization (EM) based algorithms
Keywords: Channel Estimation, Data Detection, Iterative receiver, Multi-Input Multi-Output (MIMO), Expectation Maximization (EM) algorithm
Issue Date: 1-May-2008
Citation: PHAM THE HANH (2008-05-01). Iterative receiver design for broadband wireless communication systems via expectation maximization (EM) based algorithms. ScholarBank@NUS Repository.
Abstract: Wireless communication systems are good choices to satisfy the growing demands on high-rate, high-quality communications for today's users. Due to the severe propagation environment, the quality of communication relies heavily on the channel information at the receiving side. In this thesis, the Expectation Maximization (EM) algorithm, an iterative algorithm to find the Maximum-Likelihood (ML) estimates, is used to design iterative receivers in wireless communications. More explicitly, in this thesis, the EM algorithm is used to estimate the channel coefficient as well as the frequency offset in Multi-Input Multi-Output (MIMO) systems with a general assumption of having multiple frequency offsets. It is also used for joint channel estimation and data detection in Single-Input Multi-Output (SIMO) systems under the correlated noise environment. The channel estimation and detection in the popular block-based transmission such as Single carrier cyclic-prefix (SCCP), Multicarrier code division multiple access (MC-CDMA), Cyclic-prefix code division multiple access (CP-CDMA) and Interleaved frequency division multiple access (IFDMA) are also investigated using the EM algorithm.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
PhamTheHanh_PhD_ECE_2007.pdf678.82 kBAdobe PDF



Page view(s)

checked on May 22, 2019


checked on May 22, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.