521 research outputs found

    Convergence analysis of blind equalization algorithms using constellation-matching

    Get PDF
    Two modified blind equalization algorithms are analyzed for performance. These algorithms add a constellation-matched error term to the cost functions of the generalized Sato and multimodulus algorithms. The dynamic convergence behavior and steady-state performance of these algorithms, and of a related version of the constant modulus algorithm, are characterized. The analysis establishes the improved performance of the proposed algorithms

    Convergence analysis of blind equalization algorithms using constellation-matching

    Full text link

    Blind equalization based on pdf distance criteria and performance analysis

    No full text
    In this report, we address M-QAM blind equalization by fitting the probability density functions (pdf) of the equalizer output with the constellation symbols. We propose two new cost functions, based on kernel pdf approximation, which force the pdf at the equalizer output to match the known constellation pdf. The kernel bandwidth of a Parzen estimator is updated during iterations to improve the convergence speed and to decrease the residual error of the algorithms. Unlike related existing techniques, the new algorithms measure the distance error between observed and assumed pdfs for the real and imaginary parts of the equalizer output separately. The advantage of proceeding this way is that the distributions show less modes, which facilitates equalizer convergence, while as for multi-modulus methods phase recovery keeps being preserved. The proposed approaches outperform CMA and classical pdf fitting methods in terms of convergence speed and residual error. We also analyse the convergence properties of the most efficient proposed equalizer via the ordinary differential equation (ODE) method

    Hybrid solutions to instantaneous MIMO blind separation and decoding: narrowband, QAM and square cases

    Get PDF
    Future wireless communication systems are desired to support high data rates and high quality transmission when considering the growing multimedia applications. Increasing the channel throughput leads to the multiple input and multiple output and blind equalization techniques in recent years. Thereby blind MIMO equalization has attracted a great interest.Both system performance and computational complexities play important roles in real time communications. Reducing the computational load and providing accurate performances are the main challenges in present systems. In this thesis, a hybrid method which can provide an affordable complexity with good performance for Blind Equalization in large constellation MIMO systems is proposed first. Saving computational cost happens both in the signal sep- aration part and in signal detection part. First, based on Quadrature amplitude modulation signal characteristics, an efficient and simple nonlinear function for the Independent Compo- nent Analysis is introduced. Second, using the idea of the sphere decoding, we choose the soft information of channels in a sphere, and overcome the so- called curse of dimensionality of the Expectation Maximization (EM) algorithm and enhance the final results simultaneously. Mathematically, we demonstrate in the digital communication cases, the EM algorithm shows Newton -like convergence.Despite the widespread use of forward -error coding (FEC), most multiple input multiple output (MIMO) blind channel estimation techniques ignore its presence, and instead make the sim- plifying assumption that the transmitted symbols are uncoded. However, FEC induces code structure in the transmitted sequence that can be exploited to improve blind MIMO channel estimates. In final part of this work, we exploit the iterative channel estimation and decoding performance for blind MIMO equalization. Experiments show the improvements achievable by exploiting the existence of coding structures and that it can access the performance of a BCJR equalizer with perfect channel information in a reasonable SNR range. All results are confirmed experimentally for the example of blind equalization in block fading MIMO systems

    Blind adaptive equalizer for broadband MIMO time reversal STBC based on PDF fitting

    Get PDF
    In this paper, we propose a new blind adaptive technique used for the equalisation of space-time block coded (STBC) signals transmitted over a dispersive MIMO channel. The proposed approach is based on minimising the difference between the probability density function (PDF) of the equalizer output — estimated via the Parzen window method — and a desired PDF based on the source symbols. The cost function combines this PDF fitting with an orthogonality criterion derived from the STBC structure of the transmitted data in order to discourage the extraction of identical signals. This cost function motivates an effective and low-cost stochastic gradient descent algorithm for adapting the equaliser. The performance is demonstrated in a number of simulations and benchmarked against other blind schemes for the equalisation of STBC over broadband MIMO channels

    Energy and spectrum efficient blind equalization with unknown constellation for air-to-ground multipath UAV communications

    Get PDF
    In unmanned aerial vehicle (UAV) communications, frequency-selective fading can severely deteriorate the quality of transmitted signal by generating undesired and disordered constellation diagrams due to scatters in the air-to-ground (ATG) mutipath channels. In this paper, we propose a low-overhead blind equalization method to combat frequency-selective fading in air-ground multipath UAV channels. Specifically, a pre-equalization method is proposed based on a constant modulus algorithm to restore the contour of the constellation diagram. Moreover, the similarity measure function and the difference measure function are derived using template matching to identify the constellation of M-ary quadrature amplitude modulation. Furthermore, we propose a weighted constant cross algorithm (WXA) to reduce the residual mean square error and construct a cross-shaped modulus value, by utilizing the statistical information of the identified normalized standard constellation diagrams and the equalizer output decision symbols’ weighting value. The proposed method requires less information and no training sequences and pilots, therefore, if achieves energy and spectrum efficient ATG multipath UAV communications. Simulation results show that the proposed WXA algorithm can reduce the residual mean square error convergence value between -22dB and -25dB, making it very useful for the equalization of the frequency-selective fading channel in typical UAV communication scenarios

    Signal Processing Design of Low Probability of Intercept Waveforms

    Get PDF
    This thesis investigates a modification to Differential Phase Shift Keyed (DPSK) modulation to create a Low Probability of Interception/Exploitation (LPI/LPE) communications signal. A pseudorandom timing offset is applied to each symbol in the communications stream to intentionally create intersymbol interference (ISI) that hinders accurate symbol estimation and bit sequence recovery by a non-cooperative receiver. Two cooperative receiver strategies are proposed to mitigate the ISI due to symbol timing offset: a modified minimum Mean Square Error (MMSE) equalization algorithm and a multiplexed bank of equalizer filters determined by an adaptive Least Mean Square (LMS) algorithm. Both cooperative receivers require some knowledge of the pseudorandom symbol timing dither to successfully demodulate the communications waveform. Numerical MatlabÂź simulation is used to demonstrate the bit error rate performance of cooperative receivers and notional non-cooperative receivers for binary, 4-ary, and 8-ary DPSK waveforms transmitted through a line-of-sight, additive white Gaussian noise channel. Simulation results suggest that proper selection of pulse shape and probability distribution of symbol timing offsets produces a waveform that is accurately demodulated by the proposed cooperative receivers and significantly degrades non-cooperative receiver symbol estimation accuracy. In typical simulations, non-cooperative receivers required 2-8 dB more signal power than cooperative receivers to achieve a bit error rate of 1.0%. For nearly all reasonable parameter selections, non-cooperative receivers produced bit error rates in excess of 0.1%, even when signal power is unconstrained
    • 

    corecore