5,264 research outputs found

    Estimation of phase noise in oscillators with colored noise sources

    Get PDF
    In this letter we study the design of algorithms for estimation of phase noise (PN) with colored noise sources. A soft-input maximum a posteriori PN estimator and a modified soft-input extended Kalman smoother are proposed. The performance of the proposed algorithms are compared against those studied in the literature, in terms of mean square error of PN estimation, and symbol error rate of the considered communication system. The comparisons show that considerable performance gains can be achieved by designing estimators that employ correct knowledge of the PN statistics

    Timing and Frequency Synchronization and Channel Estimation in OFDM-based Systems

    Get PDF
    Orthogonal frequency division multiplexing (OFDM) due to its appealing features, such as robustness against frequency selective fading and simple channel equalization, is adopted in communications systems such as WLAN, WiMAX and DVB. However, OFDM systems are sensitive to synchronization errors caused by timing and frequency offsets. Besides, the OFDM receiver has to perform channel estimation for coherent detection. The goal of this thesis is to investigate new methods for timing and frequency synchronization and channel estimation in OFDM-based systems. First, we investigate new methods for preamble-aided coarse timing estimation in OFDM systems. Two novel timing metrics using high order statistics-based correlation and differential normalization functions are proposed. The performance of the new timing metrics is evaluated using different criteria including class-separability, robustness to the carrier frequency offset, and computational complexity. It is shown that the new timing metrics can considerably increase the class-separability due to their more distinct values at correct and wrong timing instants, and thus give a significantly better detection performance than the existing timing metrics do. Furthermore, a new method for coarse estimation of the start of the frame is proposed, which remarkably reduces the probability of inter-symbol interference (ISI). The improved performances of the new schemes in multipath fading channels are shown by the probabilities of false alarm, missed-detection and ISI obtained through computer simulations. Second, a novel pilot-aided algorithm is proposed for the detection of integer frequency offset (IFO) in OFDM systems. By transforming the IFO into two new integer parameters, the proposed method can largely reduce the number of trial values for the true IFO. The two new integer parameters are detected using two different pilot sequences, a periodic pilot sequence and an aperiodic pilot sequence. It is shown that the new scheme can significantly reduce the computational complexity while achieving almost the same performance as the previous methods do. Third, we propose a method for joint timing and frequency synchronization and channel estimation for OFDM systems that operate in doubly selective channels. Basis expansion modeling (BEM) that captures the time variations of the channel is used to reduce the number of unknown channel parameters. The BEM coefficients along with the timing and frequency offsets are estimated by using a maximum likelihood (ML) approach. An efficient algorithm is then proposed for reducing the computational complexity of the joint estimation. The complexity of the new method is assessed in terms of the number of multiplications. The mean square estimation error of the proposed method is evaluated in comparison with previous methods, indicating a remarkable performance improvement by the new method. Fourth, we present a new scheme for joint estimation of CFO and doubly selective channel in orthogonal frequency division multiplexing systems. In the proposed preamble-aided method, the time-varying channel is represented using BEM. CFO and BEM coefficients are estimated using the principles of particle and Kalman filtering. The performance of the new method in multipath time-varying channels is investigated in comparison with previous schemes. The simulation results indicate a remarkable performance improvement in terms of the mean square errors of CFO and channel estimates. Fifth, a novel algorithm is proposed for timing and frequency synchronization and channel estimation in the uplink of orthogonal frequency division multiple access (OFDMA) systems by considering high-mobility situations and the generalized subcarrier assignment. By using BEM to represent a doubly selective channel, a maximum likelihood (ML) approach is proposed to jointly estimate the timing and frequency offsets of different users as well as the BEM coefficients of the time-varying channels. A space-alternating generalized expectation-maximization algorithm is then employed to transform the maximization problem for all users into several simpler maximization problems for each user. The computational complexity of the new timing and frequency offset estimator is analyzed and its performance in comparison with that of existing methods using the mean square error is evaluated . Finally, two novel approaches for joint CFO and doubly selective channel estimation in the uplink of multiple-input multiple-output orthogonal frequency division multiple access (MIMO-OFDMA) systems are presented. Considering high-mobility situations, where channels change within an OFDMA symbol interval, and the time varying nature of CFOs, BEM is employed to represent the time variations of the channel. Two new approaches are then proposed based on Schmidt Kalman filtering (SKF). The first approach utilizes Schmidt extended Kalman filtering for each user to estimate the CFO and BEM coefficients. The second approach uses Gaussian particle filter along with SKF to estimate the CFO and BEM coefficients of each user. The Bayesian Cramer Rao bound is derived, and performance of the new schemes are evaluated using mean square error. It is demonstrated that the new schemes can significantly improve the mean square error performance in comparison with that of the existing methods

    Stochastic Digital Backpropagation with Residual Memory Compensation

    Full text link
    Stochastic digital backpropagation (SDBP) is an extension of digital backpropagation (DBP) and is based on the maximum a posteriori principle. SDBP takes into account noise from the optical amplifiers in addition to handling deterministic linear and nonlinear impairments. The decisions in SDBP are taken on a symbol-by-symbol (SBS) basis, ignoring any residual memory, which may be present due to non-optimal processing in SDBP. In this paper, we extend SDBP to account for memory between symbols. In particular, two different methods are proposed: a Viterbi algorithm (VA) and a decision directed approach. Symbol error rate (SER) for memory-based SDBP is significantly lower than the previously proposed SBS-SDBP. For inline dispersion-managed links, the VA-SDBP has up to 10 and 14 times lower SER than DBP for QPSK and 16-QAM, respectively.Comment: 7 pages, accepted to publication in 'Journal of Lightwave Technology (JLT)

    Infinite Factorial Finite State Machine for Blind Multiuser Channel Estimation

    Full text link
    New communication standards need to deal with machine-to-machine communications, in which users may start or stop transmitting at any time in an asynchronous manner. Thus, the number of users is an unknown and time-varying parameter that needs to be accurately estimated in order to properly recover the symbols transmitted by all users in the system. In this paper, we address the problem of joint channel parameter and data estimation in a multiuser communication channel in which the number of transmitters is not known. For that purpose, we develop the infinite factorial finite state machine model, a Bayesian nonparametric model based on the Markov Indian buffet that allows for an unbounded number of transmitters with arbitrary channel length. We propose an inference algorithm that makes use of slice sampling and particle Gibbs with ancestor sampling. Our approach is fully blind as it does not require a prior channel estimation step, prior knowledge of the number of transmitters, or any signaling information. Our experimental results, loosely based on the LTE random access channel, show that the proposed approach can effectively recover the data-generating process for a wide range of scenarios, with varying number of transmitters, number of receivers, constellation order, channel length, and signal-to-noise ratio.Comment: 15 pages, 15 figure

    Software Defined Radio Implementation of Carrier and Timing Synchronization for Distributed Arrays

    Full text link
    The communication range of wireless networks can be greatly improved by using distributed beamforming from a set of independent radio nodes. One of the key challenges in establishing a beamformed communication link from separate radios is achieving carrier frequency and sample timing synchronization. This paper describes an implementation that addresses both carrier frequency and sample timing synchronization simultaneously using RF signaling between designated master and slave nodes. By using a pilot signal transmitted by the master node, each slave estimates and tracks the frequency and timing offset and digitally compensates for them. A real-time implementation of the proposed system was developed in GNU Radio and tested with Ettus USRP N210 software defined radios. The measurements show that the distributed array can reach a residual frequency error of 5 Hz and a residual timing offset of 1/16 the sample duration for 70 percent of the time. This performance enables distributed beamforming for range extension applications.Comment: Submitted to 2019 IEEE Aerospace Conferenc

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

    Get PDF
    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

    Calculation of the Performance of Communication Systems from Measured Oscillator Phase Noise

    Get PDF
    Oscillator phase noise (PN) is one of the major problems that affect the performance of communication systems. In this paper, a direct connection between oscillator measurements, in terms of measured single-side band PN spectrum, and the optimal communication system performance, in terms of the resulting error vector magnitude (EVM) due to PN, is mathematically derived and analyzed. First, a statistical model of the PN, considering the effect of white and colored noise sources, is derived. Then, we utilize this model to derive the modified Bayesian Cramer-Rao bound on PN estimation, and use it to find an EVM bound for the system performance. Based on our analysis, it is found that the influence from different noise regions strongly depends on the communication bandwidth, i.e., the symbol rate. For high symbol rate communication systems, cumulative PN that appears near carrier is of relatively low importance compared to the white PN far from carrier. Our results also show that 1/f^3 noise is more predictable compared to 1/f^2 noise and in a fair comparison it affects the performance less.Comment: Accepted in IEEE Transactions on Circuits and Systems-I: Regular Paper
    corecore