415 research outputs found

    Optimal channel equalization for filterbank transceivers in presence of white noise

    Get PDF
    Filterbank transceivers are widely employed in data communication networks to cope with inter-symbol-interference (ISI) through the use of redundancies. This dissertation studies the design of the optimal channel equalizer for both time-invariant and time-varying channels, and wide-sense stationary (WSS) and possible non-stationary white noise processes. Channel equalization is investigated via the filterbank transceivers approach. All perfect reconstruction (PR) or zero-forcing (ZF) receiver filterbanks are parameterized in an affine form, which eliminate completely the ISI. The optimal channel equalizer is designed through minimization of the mean-squared-error (MSE) between the detected signals and the transmitted signals. Our main results show that the optimal channel equalizer has the form of state estimators, and is a modified Kalman filter. The results in this dissertation are applicable to discrete wavelet multitone (DWMT) systems, multirate transmultiplexers, orthogonal frequency division multiplexing (OFDM), and direct-sequence/spread-spectrum (DS/SS) based code division multiple access (CDMA) networks. Design algorithms for the optimal channel equalizers are developed for different channel models, and white noise processes, and simulation examples are worked out to illustrate the proposed design algorithms

    Design of optimal equalizers and precoders for MIMO channels

    Get PDF
    Channel equalization has been extensively studied as a method of combating ISI and ICI for high speed MIMO data communication systems. This dissertation focuses on optimal channel equalization in the presence of non-white observation noises with unknown PSD but bounded power-norm. A worst-case approach to optimal design of channel equalizers leads to an equivalent optimal H-infinity filtering problem for the MIMO communication systems. An explicit design algorithm is derived which not only achieves the zero-forcing (ZF) condition, but also minimizes the RMS error between the transmitted symbols and the received symbols. The second part of this dissertation investigates the design of optimal precoders which minimize the bit error rate (BER) subject to a fixed transmit-power constraint for the multiple antennas downlink communication channels under the perfect reconstruction (PR) condition. The closed form solutions are derived and an efficient design algorithm is proposed. The performance evaluations indicate that the optimal precoder design for multiple antennas communication systems proposed herein is an attractive/reasonable alternative to the existing precoder design techniques

    CMF-DFE Based Adaptive Blind Equalization Using Particle Swarm Optimization

    Get PDF
    The channel matched filter (CMF) is the optimum receiver providing the maximum signal to noise ratio (SNR) for the frequency selective channels. The output intersymbol interference (ISI) profile of the CMF convolved by the channel can be blindly obtained by using the autocorrelation of the received signal. Therefore, the inverse of the autocorrelation function can be used to equalize the channel passed through its own CMF. The only missing part to complete the proposed blind operation is the CMF coefficients. Therefore, in this work, the best training algorithm investigation is subjected for blind estimation of the CMF coefficients. The proposed method allows using more effective training algorithms for blind equalizations. However, the expected high performance training is obtained when the swarm intelligence is used. Unlike the stochastic gradient algorithms, the particle swarm optimization (PSO) is known to have fast convergence because its performance is independent of the characteristics of the systems used. The obtained mean square error (MSE) and bit error rate (BER) performances are promising for high performance real-time systems as an alternative to non-blind equalization techniques

    Algorithms for Blind Equalization Based on Relative Gradient and Toeplitz Constraints

    Get PDF
    Blind Equalization (BE) refers to the problem of recovering the source symbol sequence from a signal received through a channel in the presence of additive noise and channel distortion, when the channel response is unknown and a training sequence is not accessible. To achieve BE, statistical or constellation properties of the source symbols are exploited. In BE algorithms, two main concerns are convergence speed and computational complexity. In this dissertation, we explore the application of relative gradient for equalizer adaptation with a structure constraint on the equalizer matrix, for fast convergence without excessive computational complexity. We model blind equalization with symbol-rate sampling as a blind source separation (BSS) problem and study two single-carrier transmission schemes, specifically block transmission with guard intervals and continuous transmission. Under either scheme, blind equalization can be achieved using independent component analysis (ICA) algorithms with a Toeplitz or circulant constraint on the structure of the separating matrix. We also develop relative gradient versions of the widely used Bussgang-type algorithms. Processing the equalizer outputs in sliding blocks, we are able to use the relative gradient for adaptation of the Toeplitz constrained equalizer matrix. The use of relative gradient makes the Bussgang condition appear explicitly in the matrix adaptation and speeds up convergence. For the ICA-based and Bussgang-type algorithms with relative gradient and matrix structure constraints, we simplify the matrix adaptations to obtain equivalent equalizer vector adaptations for reduced computational cost. Efficient implementations with fast Fourier transform, and approximation schemes for the cross-correlation terms used in the adaptation, are shown to further reduce computational cost. We also consider the use of a relative gradient algorithm for channel shortening in orthogonal frequency division multiplexing (OFDM) systems. The redundancy of the cyclic prefix symbols is used to shorten a channel with a long impulse response. We show interesting preliminary results for a shortening algorithm based on relative gradient

    Orthogonal transmultiplexers : extensions to digital subscriber line (DSL) communications

    Get PDF
    An orthogonal transmultiplexer which unifies multirate filter bank theory and communications theory is investigated in this dissertation. Various extensions of the orthogonal transmultiplexer techniques have been made for digital subscriber line communication applications. It is shown that the theoretical performance bounds of single carrier modulation based transceivers and multicarrier modulation based transceivers are the same under the same operational conditions. Single carrier based transceiver systems such as Quadrature Amplitude Modulation (QAM) and Carrierless Amplitude and Phase (CAP) modulation scheme, multicarrier based transceiver systems such as Orthogonal Frequency Division Multiplexing (OFDM) or Discrete Multi Tone (DMT) and Discrete Subband (Wavelet) Multicarrier based transceiver (DSBMT) techniques are considered in this investigation. The performance of DMT and DSBMT based transceiver systems for a narrow band interference and their robustness are also investigated. It is shown that the performance of a DMT based transceiver system is quite sensitive to the location and strength of a single tone (narrow band) interference. The performance sensitivity is highlighted in this work. It is shown that an adaptive interference exciser can alleviate the sensitivity problem of a DMT based system. The improved spectral properties of DSBMT technique reduces the performance sensitivity for variations of a narrow band interference. It is shown that DSBMT technique outperforms DMT and has a more robust performance than the latter. The superior performance robustness is shown in this work. Optimal orthogonal basis design using cosine modulated multirate filter bank is discussed. An adaptive linear combiner at the output of analysis filter bank is implemented to eliminate the intersymbol and interchannel interferences. It is shown that DSBMT is the most suitable technique for a narrow band interference environment. A blind channel identification and optimal MMSE based equalizer employing a nonmaximally decimated filter bank precoder / postequalizer structure is proposed. The performance of blind channel identification scheme is shown not to be sensitive to the characteristics of unknown channel. The performance of the proposed optimal MMSE based equalizer is shown to be superior to the zero-forcing equalizer

    Bacterial Foraging Based Channel Equalizers

    Get PDF
    A channel equalizer is one of the most important subsystems in any digital communication receiver. It is also the subsystem that consumes maximum computation time in the receiver. Traditionally maximum-likelihood sequence estimation (MLSE) was the most popular form of equalizer. Owing to non-stationary characteristics of the communication channel MLSE receivers perform poorly. Under these circumstances ‘Maximum A-posteriori Probability (MAP)’ receivers also called Bayesian receivers perform better. Natural selection tends to eliminate animals with poor “foraging strategies” and favor the propagation of genes of those animals that have successful foraging strategies since they are more likely to enjoy reproductive success. After many generations, poor foraging strategies are either eliminated or shaped into good ones (redesigned). Logically, such evolutionary principles have led scientists in the field of “foraging theory” to hypothesize that it is appropriate to model the activity of foraging as an optimization process. This thesis presents an investigation on design of bacterial foraging based channel equalizer for digital communication. Extensive simulation studies shows that the performance of the proposed receiver is close to optimal receiver for variety of channel conditions. The proposed receiver also provides near optimal performance when channel suffers from nonlinearities

    Wireless Channel Equalization in Digital Communication Systems

    Get PDF
    Our modern society has transformed to an information-demanding system, seeking voice, video, and data in quantities that could not be imagined even a decade ago. The mobility of communicators has added more challenges. One of the new challenges is to conceive highly reliable and fast communication system unaffected by the problems caused in the multipath fading wireless channels. Our quest is to remove one of the obstacles in the way of achieving ultimately fast and reliable wireless digital communication, namely Inter-Symbol Interference (ISI), the intensity of which makes the channel noise inconsequential. The theoretical background for wireless channels modeling and adaptive signal processing are covered in first two chapters of dissertation. The approach of this thesis is not based on one methodology but several algorithms and configurations that are proposed and examined to fight the ISI problem. There are two main categories of channel equalization techniques, supervised (training) and blind unsupervised (blind) modes. We have studied the application of a new and specially modified neural network requiring very short training period for the proper channel equalization in supervised mode. The promising performance in the graphs for this network is presented in chapter 4. For blind modes two distinctive methodologies are presented and studied. Chapter 3 covers the concept of multiple cooperative algorithms for the cases of two and three cooperative algorithms. The select absolutely larger equalized signal and majority vote methods have been used in 2-and 3-algoirithm systems respectively. Many of the demonstrated results are encouraging for further research. Chapter 5 involves the application of general concept of simulated annealing in blind mode equalization. A limited strategy of constant annealing noise is experimented for testing the simple algorithms used in multiple systems. Convergence to local stationary points of the cost function in parameter space is clearly demonstrated and that justifies the use of additional noise. The capability of the adding the random noise to release the algorithm from the local traps is established in several cases

    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

    Estimation and detection techniques for doubly-selective channels in wireless communications

    Get PDF
    A fundamental problem in communications is the estimation of the channel. The signal transmitted through a communications channel undergoes distortions so that it is often received in an unrecognizable form at the receiver. The receiver must expend significant signal processing effort in order to be able to decode the transmit signal from this received signal. This signal processing requires knowledge of how the channel distorts the transmit signal, i.e. channel knowledge. To maintain a reliable link, the channel must be estimated and tracked by the receiver. The estimation of the channel at the receiver often proceeds by transmission of a signal called the 'pilot' which is known a priori to the receiver. The receiver forms its estimate of the transmitted signal based on how this known signal is distorted by the channel, i.e. it estimates the channel from the received signal and the pilot. This design of the pilot is a function of the modulation, the type of training and the channel. [Continues.

    Review of Recent Trends

    Get PDF
    This work was partially supported by the European Regional Development Fund (FEDER), through the Regional Operational Programme of Centre (CENTRO 2020) of the Portugal 2020 framework, through projects SOCA (CENTRO-01-0145-FEDER-000010) and ORCIP (CENTRO-01-0145-FEDER-022141). Fernando P. Guiomar acknowledges a fellowship from “la Caixa” Foundation (ID100010434), code LCF/BQ/PR20/11770015. Houda Harkat acknowledges the financial support of the Programmatic Financing of the CTS R&D Unit (UIDP/00066/2020).MIMO-OFDM is a key technology and a strong candidate for 5G telecommunication systems. In the literature, there is no convenient survey study that rounds up all the necessary points to be investigated concerning such systems. The current deeper review paper inspects and interprets the state of the art and addresses several research axes related to MIMO-OFDM systems. Two topics have received special attention: MIMO waveforms and MIMO-OFDM channel estimation. The existing MIMO hardware and software innovations, in addition to the MIMO-OFDM equalization techniques, are discussed concisely. In the literature, only a few authors have discussed the MIMO channel estimation and modeling problems for a variety of MIMO systems. However, to the best of our knowledge, there has been until now no review paper specifically discussing the recent works concerning channel estimation and the equalization process for MIMO-OFDM systems. Hence, the current work focuses on analyzing the recently used algorithms in the field, which could be a rich reference for researchers. Moreover, some research perspectives are identified.publishersversionpublishe
    corecore