2,846 research outputs found

    Linear MMSE-Optimal Turbo Equalization Using Context Trees

    Get PDF
    Formulations of the turbo equalization approach to iterative equalization and decoding vary greatly when channel knowledge is either partially or completely unknown. Maximum aposteriori probability (MAP) and minimum mean square error (MMSE) approaches leverage channel knowledge to make explicit use of soft information (priors over the transmitted data bits) in a manner that is distinctly nonlinear, appearing either in a trellis formulation (MAP) or inside an inverted matrix (MMSE). To date, nearly all adaptive turbo equalization methods either estimate the channel or use a direct adaptation equalizer in which estimates of the transmitted data are formed from an expressly linear function of the received data and soft information, with this latter formulation being most common. We study a class of direct adaptation turbo equalizers that are both adaptive and nonlinear functions of the soft information from the decoder. We introduce piecewise linear models based on context trees that can adaptively approximate the nonlinear dependence of the equalizer on the soft information such that it can choose both the partition regions as well as the locally linear equalizer coefficients in each region independently, with computational complexity that remains of the order of a traditional direct adaptive linear equalizer. This approach is guaranteed to asymptotically achieve the performance of the best piecewise linear equalizer and we quantify the MSE performance of the resulting algorithm and the convergence of its MSE to that of the linear minimum MSE estimator as the depth of the context tree and the data length increase.Comment: Submitted to the IEEE Transactions on Signal Processin

    Channel equalization based on decision trees

    Get PDF
    This paper analyzes the application of decision trees to the problem of communication channel equalization. Decision trees are interesting structures because they are nonlinear and relatively simple from a computational standpoint. They are tested for channel models that give rise to classification tasks of different complexity and compared to the Bayesian equalizer and the Wiener linear equalizer. The results are quite encouraging, as they show that the tree-based equalizer reaches, in many cases, a performance similar to that of the Bayesian filter at a lower computational cost351150161CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTĂŤFICO E TECNOLĂ“GICO - CNPQ305621/2015-7; 134058/2016-

    Trainable COSFIRE filters for vessel delineation with application to retinal images

    Get PDF
    Retinal imaging provides a non-invasive opportunity for the diagnosis of several medical pathologies. The automatic segmentation of the vessel tree is an important pre-processing step which facilitates subsequent automatic processes that contribute to such diagnosis. We introduce a novel method for the automatic segmentation of vessel trees in retinal fundus images. We propose a filter that selectively responds to vessels and that we call B-COSFIRE with B standing for bar which is an abstraction for a vessel. It is based on the existing COSFIRE (Combination Of Shifted Filter Responses) approach. A B-COSFIRE filter achieves orientation selectivity by computing the weighted geometric mean of the output of a pool of Difference-of-Gaussians filters, whose supports are aligned in a collinear manner. It achieves rotation invariance efficiently by simple shifting operations. The proposed filter is versatile as its selectivity is determined from any given vessel-like prototype pattern in an automatic configuration process. We configure two B-COSFIRE filters, namely symmetric and asymmetric, that are selective for bars and bar-endings, respectively. We achieve vessel segmentation by summing up the responses of the two rotation-invariant B-COSFIRE filters followed by thresholding. The results that we achieve on three publicly available data sets (DRIVE: Se = 0.7655, Sp = 0.9704; STARE: Se = 0.7716, Sp = 0.9701; CHASE_DB1: Se = 0.7585, Sp = 0.9587) are higher than many of the state-of-the-art methods. The proposed segmentation approach is also very efficient with a time complexity that is significantly lower than existing methods.peer-reviewe

    Experimental Testing and Validation of Adaptive Equalizer Using Machine Learning Algorithm

    Get PDF
    Due to the increasing demand for high-speed data transmission, wireless communication has become more advanced. Unfortunately, the various kinds of impairments that can occur when carrying data symbols through a wireless channel can affect the network performance. Some of the solutions that are proposed to address these issues include channel equalization, and that can be solved through machine learning techniques. In this paper, a hybrid approach is proposed that combines the features of tracking mode and training mode of adaptive equalizer. This method utilizes the concept of machine learning (ML) to classify different environments (highly, medium, low, open space cluttered) based on the measurements of their RF signal. The results of the study revealed that the proposed method can perform well in real-time deployments. The performance of ML algorithms namely Logistic Regression, KNN Classifier, SVM Classifier, Naive Bayes, Decision Tree classifier and Random Forest classifier is analyzed for different number of samples such as 10, 50 and 100. The performance of these algorithms is evaluated by comparing their accuracy, sensitivity, specificity, F1 score and Confusion Matrix. The objective of this study is to demonstrate that a single ML algorithm cannot perform well in all kinds of environments. In order to choose the best algorithm for a given environment, the decision device has to analyze the various factors that affect the performance of the system. For instance, the random forest classifier performed well in terms of accuracy (100 percent), specificity (100 percent), sensitivity (100 percent), and F1_score (100 percent). On the other hand, the logistic regression algorithm did not perform well in low cluttered environment

    Tree-Structured Nonlinear Adaptive Signal Processing

    Get PDF
    In communication systems, nonlinear adaptive filtering has become increasingly popular in a variety of applications such as channel equalization, echo cancellation and speech coding. However, existing nonlinear adaptive filters such as polynomial (truncated Volterra series) filters and multilayer perceptrons suffer from a number of problems. First, although high Order polynomials can approximate complex nonlinearities, they also train very slowly. Second, there is no systematic and efficient way to select their structure. As for multilayer perceptrons, they have a very complicated structure and train extremely slowly Motivated by the success of classification and regression trees on difficult nonlinear and nonparametfic problems, we propose the idea of a tree-structured piecewise linear adaptive filter. In the proposed method each node in a tree is associated with a linear filter restricted to a polygonal domain, and this is done in such a way that each pruned subtree is associated with a piecewise linear filter. A training sequence is used to adaptively update the filter coefficients and domains at each node, and to select the best pruned subtree and the corresponding piecewise linear filter. The tree structured approach offers several advantages. First, it makes use of standard linear adaptive filtering techniques at each node to find the corresponding Conditional linear filter. Second, it allows for efficient selection of the subtree and the corresponding piecewise linear filter of appropriate complexity. Overall, the approach is computationally efficient and conceptually simple. The tree-structured piecewise linear adaptive filter bears some similarity to classification and regression trees. But it is actually quite different from a classification and regression tree. Here the terminal nodes are not just assigned a region and a class label or a regression value, but rather represent: a linear filter with restricted domain, It is also different in that classification and regression trees are determined in a batch mode offline, whereas the tree-structured adaptive filter is determined recursively in real-time. We first develop the specific structure of a tree-structured piecewise linear adaptive filter and derive a stochastic gradient-based training algorithm. We then carry out a rigorous convergence analysis of the proposed training algorithm for the tree-structured filter. Here we show the mean-square convergence of the adaptively trained tree-structured piecewise linear filter to the optimal tree-structured piecewise linear filter. Same new techniques are developed for analyzing stochastic gradient algorithms with fixed gains and (nonstandard) dependent data. Finally, numerical experiments are performed to show the computational and performance advantages of the tree-structured piecewise linear filter over linear and polynomial filters for equalization of high frequency channels with severe intersymbol interference, echo cancellation in telephone networks and predictive coding of speech signals
    • …
    corecore