Low-complexity iterative receiver algorithms for multiple-input multiple-output underwater wireless communications

This dissertation proposes three low-complexity iterative receiver algorithms for multiple-input multiple-output (MIMO) underwater acoustic (UWA) communications. First is a bidirectional soft-decision feedback Turbo equalizer (Bi-SDFE) which harvests the time-reverse diversity in severe multipath MIMO channels. The Bi-SDFE outperforms the original soft-decision feedback Turbo equalizer (SDFE) while keeping its total computational complexity similar to that of the SDFE. Second, this dissertation proposes an efficient direct adaptation Turbo equalizer for MIMO UWA communications. Benefiting from the usage of soft-decision reference symbols for parameter adaptation as well as the iterative processing inside the adaptive equalizer, the proposed algorithm is efficient in four aspects: robust performance in tough channels, high spectral efficiency with short training overhead, time efficient with fast convergence and low complexity in hardware implementation. Third, a frequency-domain soft-decision block iterative equalizer combined with iterative channel estimation is proposed for the uncoded single carrier MIMO systems with high data efficiency. All the three new algorithms are evaluated by data recorded in real world ocean experiment or pool experiment. Finally, this dissertation also compares several Turbo equalizers in single-input single-output (SISO) UWA channels. Experimental results show that the channel estimation based Turbo equalizers are robust in SISO underwater transmission under harsh channel conditions --Abstract, page iv

A Low-Complexity Graph-Based LMMSE Receiver Designed for Colored Noise Induced by FTN-Signaling

We propose a low complexity graph-based linear minimum mean square error (LMMSE) equalizer which considers both the intersymbol interference (ISI) and the effect of non-white noise inherent in Faster-than-Nyquist (FTN) signaling. In order to incorporate the statistics of noise signal into the factor graph over which the LMMSE algorithm is implemented, we suggest a method that models it as an autoregressive (AR) process. Furthermore, we develop a new mechanism for exchange of information between the proposed equalizer and the channel decoder through turbo iterations. Based on these improvements, we show that the proposed low complexity receiver structure performs close to the optimal decoder operating in ISI-free ideal scenario without FTN signaling through simulations.Comment: 6 pages, 6 figures, IEEE Wireless Communications and Networking Conference 2014, Istanbul, Turke

Turbo equalization for multiple-input multiple-output (MIMO) wireless communication systems

This dissertation investigates both of the frequency domain and time domain turbo equalization with multiple-input multiple-output (MIMO) fading channels for radio frequency and underwater acoustic communications. First, a low complexity frequency domain turbo equalization (FDTE) is proposed for the MIMO systems with zero padding (ZP) or cyclic prefix (CP) inserted between the transmitted data blocks and its performance is tested on the real-world UWA communications experiments. Second, as high speed communication system requires efficient bandwidth usage and power consumption, CP or ZP is not transmitted as auxiliary information. An inter-block interference cancelation and CP reconstruction algorithm is developed to re-arrange the channel matrix into a block diagonal one. This improvement makes the FDTE effectively detects the continuous data stream from the high speed UWA communications and its performance has been verified by processing data collected from the UWA communications experiment. Finally, a low complexity soft interference cancelation (SIC) time domain turbo equalizer for MIMO systems with high level modulation is proposed. Compared with the conventional linear or nonlinear turbo equalizers, the proposed SIC turbo equalizer can theoretically reach the bound set up by the ideal match filter and its bit error rate (BER) performance from Monte Carlo simulation achieves a lower error floor as well as a more rapid convergence speed. --Abstract, page iv

Turbo EP-based Equalization: a Filter-Type Implementation

This manuscript has been submitted to Transactions on Communications on September 7, 2017; revised on January 10, 2018 and March 27, 2018; and accepted on April 25, 2018 We propose a novel filter-type equalizer to improve the solution of the linear minimum-mean squared-error (LMMSE) turbo equalizer, with computational complexity constrained to be quadratic in the filter length. When high-order modulations and/or large memory channels are used the optimal BCJR equalizer is unavailable, due to its computational complexity. In this scenario, the filter-type LMMSE turbo equalization exhibits a good performance compared to other approximations. In this paper, we show that this solution can be significantly improved by using expectation propagation (EP) in the estimation of the a posteriori probabilities. First, it yields a more accurate estimation of the extrinsic distribution to be sent to the channel decoder. Second, compared to other solutions based on EP the computational complexity of the proposed solution is constrained to be quadratic in the length of the finite impulse response (FIR). In addition, we review previous EP-based turbo equalization implementations. Instead of considering default uniform priors we exploit the outputs of the decoder. Some simulation results are included to show that this new EP-based filter remarkably outperforms the turbo approach of previous versions of the EP algorithm and also improves the LMMSE solution, with and without turbo equalization

Coded Modulation Assisted Radial Basis Function Aided Turbo Equalisation for Dispersive Rayleigh Fading Channels

In this contribution a range of Coded Modulation (CM) assisted Radial Basis Function (RBF) based Turbo Equalisation (TEQ) schemes are investigated when communicating over dispersive Rayleigh fading channels. Specifically, 16QAM based Trellis Coded Modulation (TCM), Turbo TCM (TTCM), Bit-Interleaved Coded Modulation (BICM) and iteratively decoded BICM (BICM-ID) are evaluated in the context of an RBF based TEQ scheme and a reduced-complexity RBF based In-phase/Quadrature-phase (I/Q) TEQ scheme. The Least Mean Square (LMS) algorithm was employed for channel estimation, where the initial estimation step-size used was 0.05, which was reduced to 0.01 for the second and the subsequent TEQ iterations. The achievable coding gain of the various CM schemes was significantly increased, when employing the proposed RBF-TEQ or RBF-I/Q-TEQ rather than the conventional non-iterative Decision Feedback Equaliser - (DFE). Explicitly, the reduced-complexity RBF-I/Q-TEQ-CM achieved a similar performance to the full-complexity RBF-TEQ-CM, while attaining a significant complexity reduction. The best overall performer was the RBF-I/Q-TEQ-TTCM scheme, requiring only 1.88~dB higher SNR at BER=10-5, than the identical throughput 3~BPS uncoded 8PSK scheme communicating over an AWGN channel. The coding gain of the scheme was 16.78-dB

Linear MMSE-Optimal Turbo Equalization Using Context Trees

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

A Suboptimal Receiver with Turbo Block Coding for Ultra-Wideband Communications

In this paper, the performance of adaptive equalization and turbo product coding is investigated for pulse-based UWB communications in short-range indoor environments. The sensitivity of adaptive LMS linear and nonlinear (decision-feedback) equalizers with respect to the number of training symbols and number of taps is considered. To reduce the error performance variation with respect to changing channel conditions, a turbo product code (TPC) with two component (31,26,3) Hamming codes is proposed. We report simulation results showing that channel coding not only improves error performance, but also reduces significantly the sensitivity of UWB systems in short-range indoor wireless communications