142 research outputs found

    Harnessing machine learning for fiber-induced nonlinearity mitigation in long-haul coherent optical OFDM

    Get PDF
    © 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).Coherent optical orthogonal frequency division multiplexing (CO-OFDM) has attracted a lot of interest in optical fiber communications due to its simplified digital signal processing (DSP) units, high spectral-efficiency, flexibility, and tolerance to linear impairments. However, CO-OFDM’s high peak-to-average power ratio imposes high vulnerability to fiber-induced non-linearities. DSP-based machine learning has been considered as a promising approach for fiber non-linearity compensation without sacrificing computational complexity. In this paper, we review the existing machine learning approaches for CO-OFDM in a common framework and review the progress in this area with a focus on practical aspects and comparison with benchmark DSP solutions.Peer reviewe

    Low Complexity Blind Equalization for OFDM Systems with General Constellations

    Get PDF
    This paper proposes a low-complexity algorithm for blind equalization of data in OFDM-based wireless systems with general constellations. The proposed algorithm is able to recover data even when the channel changes on a symbol-by-symbol basis, making it suitable for fast fading channels. The proposed algorithm does not require any statistical information of the channel and thus does not suffer from latency normally associated with blind methods. We also demonstrate how to reduce the complexity of the algorithm, which becomes especially low at high SNR. Specifically, we show that in the high SNR regime, the number of operations is of the order O(LN), where L is the cyclic prefix length and N is the total number of subcarriers. Simulation results confirm the favorable performance of our algorithm

    Efficient Adaptive Filter Algorithms Using Variable Tap-length Scheme

    Get PDF
    Today the usage of digital signal processors has increased, where adaptive filter algorithms are now routinely employed in mostly all contemporary devices such as mobile phones, camcorders, digital cameras, and medical monitoring equipment, to name few. The filter tap-length, or the number of taps, is a significant structural parameter of adaptive filters that can influences both the complexity and steady-state performance characteristics of the filter. Traditional implementation of adaptive filtering algorithms presume some fixed filter-length and focus on estimating variable filter\u27s tap-weights parameters according to some pre-determined cost function. Although this approach can be adequate in some applications, it is not the case in more complicated ones as it does not answer the question of filter size (tap-length). This problem can be more apparent when the application involves a change in impulse response, making it hard for the adaptive filter algorithm to achieve best potential performance. A cost-effective approach is to come up with variable tap-length filtering scheme that can search for the optimal length while the filter is adapting its coefficients. In direct form structure filtering, commonly known as a transversal adaptive filter, several schemes were used to estimate the optimum tap-length. Among existing algorithms, pseudo fractional tap-length (FT) algorithm, is of particular interest because of its fast convergence rate and small steady-state error. Lattice structured adaptive filters, on the other hand, have attracted attention recently due to a number of desirable properties. The aim of this research is to develop efficient adaptive filter algorithms that fill the gap where optimal filter structures were not proposed by incorporating the concept of pseudo fractional tap-length (FT) in adaptive filtering algorithms. The contribution of this research include the development of variable length adaptive filter scheme and hence optimal filter structure for the following applications: (1) lattice prediction; (2) Least-Mean-Squares (LMS) lattice system identification; (3) Recursive Least-Squares (RLS) lattice system identification; (4) Constant Modulus Algorithm (CMA) blind equalization. To demonstrate the capability of proposed algorithms, simulations examples are implemented in different experimental conditions, where the results showed noticeable improvement in the context of mean square Error (MSE), as well as in the context of convergence rate of the proposed algorithms with their counterparts adaptive filter algorithms. Simulation results have also proven that with affordable extra computational complexity, an optimization for both of the adaptive filter coefficients and the filter tap-length can be attained

    Blind adaptive equalization for QAM signals: New algorithms and FPGA implementation.

    Get PDF
    Adaptive equalizers remove signal distortion attributed to intersymbol interference in band-limited channels. The tap coefficients of adaptive equalizers are time-varying and can be adapted using several methods. When these do not include the transmission of a training sequence, it is referred to as blind equalization. The radius-adjusted approach is a method to achieve blind equalizer tap adaptation based on the equalizer output radius for quadrature amplitude modulation (QAM) signals. Static circular contours are defined around an estimated symbol in a QAM constellation, which create regions that correspond to fixed step sizes and weighting factors. The equalizer tap adjustment consists of a linearly weighted sum of adaptation criteria that is scaled by a variable step size. This approach is the basis of two new algorithms: the radius-adjusted modified multitmodulus algorithm (RMMA) and the radius-adjusted multimodulus decision-directed algorithm (RMDA). An extension of the radius-adjusted approach is the selective update method, which is a computationally-efficient method for equalization. The selective update method employs a stop-and-go strategy based on the equalizer output radius to selectively update the equalizer tap coefficients, thereby, reducing the number of computations in steady-state operation. (Abstract shortened by UMI.) Source: Masters Abstracts International, Volume: 45-01, page: 0401. Thesis (M.A.Sc.)--University of Windsor (Canada), 2006

    Steady-State Performance Analyses of Adaptive Filters

    Get PDF

    System Identification Based on Errors-In-Variables System Models

    Get PDF
    We study the identification problem for errors-in-variables (EIV) systems. Such an EIV model assumes that the measurement data at both input and output of the system involve corrupting noises. The least square (LS) algorithm has been widely used in this area. However, it results in biased estimates for the EIV-based system identification. In contrast, the total least squares (TLS) algorithm is unbiased, which is now well-known, and has been effective for estimating the system parameters in the EIV system identification. In this dissertation, we first show that the TLS algorithm computes the approximate maximum likelihood estimate (MLE) of the system parameters and that the approximation error converges to zero asymptotically as the number of measurement data approaches infinity. Then we propose a graph subspace approach (GSA) to tackle the same EIV-based system identification problem and derive a new estimation algorithm that is more general than the TLS algorithm. Several numerical examples are worked out to illustrate our proposed estimation algorithm for the EIV-based system identification. We also study the problem of the EIV system identification without assuming equal noise variances at the system input and output. Firstly, we review the Frisch scheme, which is a well-known method for estimating the noise variances. Then we propose a new method which is GSA in combination with the Frisch scheme (GSA-Frisch) algorithm via estimating the ratio of the noise variances and the system parameters iteratively. Finally, a new identification algorithm is proposed to estimate the system parameters based on the subspace interpretation without estimating noise variances or the ratio. This new algorithm is unbiased, and achieves the consistency of the parameter estimates. Moreover, it is low in complexity. The performance of the identification algorithm is examined by several numerical examples, and compared to the N4SID algorithm that has the Matlab codes available in Matlab toolboxes, and also to the GSA-Frisch algorithm
    • …
    corecore