Analysis of Timing Synchronization Algorithms in Multi-Carrier Schemes

Abstract

Multi-carrier modulation (MCM) is need of todays Wireless communication networks. MCM is a technique for transmitting data by sending the data over multiple carriers. Various multi-carrier modulation schemes have been developed in the past few years, Orthogonal frequency division multiplexing (OFDM), Filter bank multi-carrier modulation (FBMC) and Universal filtered multi-carrier (UFMC) are some of them. In this thesis we present a performance comparison between two different multi-carrier transmission techniques Orthogonal Frequency Division Multiplexing (OFDM) and Filter Bank MultiCarrier (FBMC). FBMC technique is recognized as one of the potential scheme that is capable of resolving some of the major problems associated with other multi-carrier communication techniques like OFDM. To cope channel impairment burst mode of transmission is usually used in high data rate wireless networks. Specifically we focus on burst detection which means detecting the correct start point of each burst. Four algorithms including Minn’s algorithm, S&C’s algorithm, Park’s algorithm, and Leila’s algorithm have been investigated based on their detection performance and computational complexity for OFDM. In OFDM, the results show that Leila’s and Park’s algorithms give sharp timing metric without any significant distortion compared to Minn’s and S&C’s algorithm. We also implement these three algorithms except S&C’s method for FBMC scheme. Simulation results shows Park’s method achieve probability of detection equal to 1 as quick as other two algorithms. We analyze these algorithms for changing different parameters of FBMC e.g FFT size, Overlapping factor (K). The detection performance is improved by increasing in number of subcarriers. From the results, it can be concluded that Park’s and Leila’s are the best techniques for OFDM and FBMC, but in terms of complexity, Park’s algorithm is better than Leila’s algorithm. For practical implementation computational complexity comparison of all techniques is also presented.