• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Efficient blind symbol rate estimation and data symbol detection algorithms for linearly modulated signals

Park, Sang Woo 15 May 2009 (has links)
Blind estimation of unknown channel parameters and data symbol detection represent major open problems in non-cooperative communication systems such as automatic modulation classification (AMC). This thesis focuses on estimating the symbol rate and detecting the data symbols. A blind oversampling-based signal detector under the circumstance of unknown symbol period is proposed. The thesis consists of two parts: a symbol rate estimator and a symbol detector. First, the symbol rate is estimated using the EM algorithm. In the EM algorithm, it is difficult to obtain the closed form of the log-likelihood function and the density function. Therefore, both functions are approximated by using the Particle Filter (PF) technique. In addition, the symbol rate estimator based on cyclic correlation is proposed as an initialization estimator since the EM algorithm requires initial estimates. To take advantage of the cyclostationary property of the received signal, there is a requirement that the sampling period should be at least four times less than the symbol period on the receiver side. Second, the blind data symbol detector based on the PF algorithm is designed. Since the signal is oversampled at the receiver side, a delayed multi-sampling PF detector is proposed to manage inter-symbol interference, which is caused by over- sampling, and to improve the demodulation performance of the data symbols. In the PF algorithm, the hybrid importance function is used to generate both data samples and channel model coe±cients, and the Mixture Kalman Filter (MKF) algorithm is used to marginalize out the fading channel coe±cients. At the end, two resampling schemes are adopted.
2

Digital Modulation Recognition

Erdem, Erem 01 December 2009 (has links) (PDF)
In this thesis work, automatic recognition algorithms for digital modulated signals are surveyed. Feature extraction and classification algorithm stages are the main parts of a modulation recognition system. Performance of the modulation recognition system mainly depends on the prior knowledge of some of the signal parameters, selection of the key features and classification algorithm selection. Unfortunately, most of the features require some of the signal parameters such as carrier frequency, pulse shape, time of arrival, initial phase, symbol rate, signal to noise ratio, to be known or to be extracted. Thus, in this thesis, features which do not require prior knowledge of the signal parameters, such as the number of the peaks in the envelope histogram and the locations of these peaks, the number of peaks in the frequency histogram, higher order moments of the signal are considered. Particularly, symbol rate and signal to noise ratio estimation methods are surveyed. A method based on the cyclostationarity analysis is used for symbol rate estimation and a method based on the eigenvector decomposition is used for the estimation of signal to noise ratio. Also, estimated signal to noise ratio is used to improve the performance of the classification algorithm. Two methods are proposed for modulation recognition: 1) Decision tree based method 2) Bayesian based classification method A method to estimate the symbol rate and carrier frequency offset of minimum-shift keying (MSK) signal is also investigated.

Page generated in 0.0924 seconds