Orthogonal frequency-division multiplexing (OFDM) has been adopted by many
broadband wireless communication systems for the simplicity of the receiver technique to support high data rates and user mobility. However, studies also show
that the advantage of OFDM over the single-carrier modulation schemes could be
substantially compromised by timing or frequency estimation errors at the receiver.
In this thesis we investigate the synchronization problem for practical OFDM systems using a system model generalized from the IEEE 802.11 and IEEE 802.16
standards.
For preamble based synchronization schemes, which are most common in the
downlink of wireless communication systems, we propose a novel timing acquisition algorithm which minimizes false alarm probability and indirectly improves correct detection probability. We then introduce a universal fractional carrier frequency offset (CFO) estimator that outperforms conventional methods at low signal to noise ratio with lower complexity. More accurate timing and frequency estimates can be obtained by our proposed frequency-domain algorithms incorporating channel knowledge. We derive four joint frequency, timing, and channel estimators with different approximations, and then propose a hybrid integer CFO estimation scheme to provide flexible performance and complexity tradeoffs. When the exact channel delay profile is unknown at the receiver, we present a successive timing estimation algorithm to solve the timing ambiguity. Both analytical and simulation results are presented to confirm the performance of the proposed methods in various realistic channel conditions.
The ranging based synchronization scheme is most commonly used in the uplink
of wireless communication systems. Here we propose a successive multiuser detection algorithm to mitigate multiple access interference and achieve better performance than that of conventional single-user based methods. A reduced-complexity version of the successive algorithm feasible for hardware real-time implementation is also presented in the thesis. To better understand the performance of a ranging detector from a system point of view, we develop a technique that can directly translate a detector�s missed detection probability into the maximum number of users that the method can support in one cell with a given number of ranging opportunities. The analytical results match the simulations reasonably well and show that the proposed successive algorithms allow a base station to serve more than double the number of users supported by the conventional methods.
Finally, we investigate inter-carrier interference which is caused by the timevarying
communication channels. We derive the bounds on the power of residual inter-carrier interference that cannot be mitigated by a frequency-domain equalizer with a given number of taps. We also propose a Turbo equalization scheme using the novel grouped Particle filter, which approaches the performance of the Maximum A Posterior algorithm with much lower complexity.
| Identifer | oai:union.ndltd.org:ADTP/285716 |
| Date | January 2009 |
| Creators | Ruan, Matt (Ming), mattruan@gmail.com |
| Publisher | The Australian National University. ANU College of Engineering & Computer Science |
| Source Sets | Australiasian Digital Theses Program |
| Language | English |
| Detected Language | English |
| Rights | http://www.anu.edu.au/legal/copyrit.html), Copyright Matt (Ming) Ruan |
Page generated in 0.0018 seconds