Trellis-Based Equalization for Sparse ISI Channels Revisited

Sparse intersymbol-interference (ISI) channels are encountered in a variety of high-data-rate communication systems. Such channels have a large channel memory length, but only a small number of significant channel coefficients. In this paper, trellis-based equalization of sparse ISI channels is revisited. Due to the large channel memory length, the complexity of maximum-likelihood detection, e.g., by means of the Viterbi algorithm (VA), is normally prohibitive. In the first part of the paper, a unified framework based on factor graphs is presented for complexity reduction without loss of optimality. In this new context, two known reduced-complexity algorithms for sparse ISI channels are recapitulated: The multi-trellis VA (M-VA) and the parallel-trellis VA (P-VA). It is shown that the M-VA, although claimed, does not lead to a reduced computational complexity. The P-VA, on the other hand, leads to a significant complexity reduction, but can only be applied for a certain class of sparse channels. In the second part of the paper, a unified approach is investigated to tackle general sparse channels: It is shown that the use of a linear filter at the receiver renders the application of standard reduced-state trellis-based equalizer algorithms feasible, without significant loss of optimality. Numerical results verify the efficiency of the proposed receiver structure.Comment: To be presented at the 2005 IEEE Int. Symp. Inform. Theory (ISIT 2005), September 4-9, 2005, Adelaide, Australi

Sparse Filter Design Under a Quadratic Constraint: Low-Complexity Algorithms

This paper considers three problems in sparse filter design, the first involving a weighted least-squares constraint on the frequency response, the second a constraint on mean squared error in estimation, and the third a constraint on signal-to-noise ratio in detection. The three problems are unified under a single framework based on sparsity maximization under a quadratic performance constraint. Efficient and exact solutions are developed for specific cases in which the matrix in the quadratic constraint is diagonal, block-diagonal, banded, or has low condition number. For the more difficult general case, a low-complexity algorithm based on backward greedy selection is described with emphasis on its efficient implementation. Examples in wireless channel equalization and minimum-variance distortionless-response beamforming show that the backward selection algorithm yields optimally sparse designs in many instances while also highlighting the benefits of sparse design.Texas Instruments Leadership University Consortium Progra

A Branch-and-Bound Algorithm for Quadratically-Constrained Sparse Filter Design

This paper presents an exact algorithm for sparse filter design under a quadratic constraint on filter performance. The algorithm is based on branch-and-bound, a combinatorial optimization procedure that can either guarantee an optimal solution or produce a sparse solution with a bound on its deviation from optimality. To reduce the complexity of branch-and-bound, several methods are developed for bounding the optimal filter cost. Bounds based on infeasibility yield incrementally accumulating improvements with minimal computation, while two convex relaxations, referred to as linear and diagonal relaxations, are derived to provide stronger bounds. The approximation properties of the two relaxations are characterized analytically as well as numerically. Design examples involving wireless channel equalization and minimum-variance distortionless-response beamforming show that the complexity of obtaining certifiably optimal solutions can often be significantly reduced by incorporating diagonal relaxations, especially in more difficult instances. In the case of early termination due to computational constraints, diagonal relaxations strengthen the bound on the proximity of the final solution to the optimum.Texas Instruments Leadership University Consortium Progra

Superimposed Training based Estimation of Sparse MIMO Channels for Emerging Wireless Networks

Multiple-input multiple-output (MIMO) systems constitute an important part of todays wireless communication standards and these systems are expected to take a fundamental role in both the access and backhaul sides of the emerging wireless cellular networks. Recently, reported measurement campaigns have established that various outdoor radio propagation environments exhibit sparsely structured channel impulse response (CIR). We propose a novel superimposed training (SiT) based up-link channels’ estimation technique for multipath sparse MIMO communication channels using a matching pursuit (MP) algorithm; the proposed technique is herein named as superimposed matching pursuit (SI-MP). Subsequently, we evaluate the performance of the proposed technique in terms of mean-square error (MSE) and bit-error-rate (BER), and provide its comparison with that of the notable first order statistics based superimposed least squares (SI-LS) estimation. It is established that the proposed SI-MP provides an improvement of about 2dB in the MSE at signal-to-noise ratio (SNR) of 12dB as compared to SI-LS, for channel sparsity level of 21.5%. For BER = 10^−2, the proposed SI-MP compared to SI-LS offers a gain of about 3dB in the SNR. Moreover, our results demonstrate that an increase in the channel sparsity further enhances the performance gai

Sparse equalizer filter design for multi-path channels

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.Cataloged from PDF version of thesis.Includes bibliographical references (p. 81-82).In this thesis, sparse Finite Impulse Response (FIR) equalizers are designed for sparse multi-path channels under a pre-defined Mean Squared Error (MSE) constraint. We start by examining the intrinsic sparsity of the Zero Forcing equalizers and the FIR Minimum MSE (MMSE) equalizers. Next the equalization MSE is formulated as a quadratic function of the equalizer coefficients. Both the Linear Equalizer (LE) and the Decision Feedback Equalizer (DFE) are analyzed. Utilizing the quadratic form, designing a sparse equalizer under a single MSE constraint becomes an 10-norm minimization problem under a quadratic constraint, as described in [2]. Three previously developed methods for solving this problem are applied, namely the successive thinning algorithm, the branch-and-bound algorithm, and the simple linear programming algorithm. Simulations under various channel specifications, equalizer specifications and algorithm specifications are conducted to show the dependency of the sparsity on these factors. The channels include the ideal discrete multipath channels and the Vehicular A multi-path channels in both the Single-Input-Single- Output (SISO) and the Multiple-Input-Multiple-Output scenarios. Additionally, the sparse FIR equalizer is designed for MIMO channels under two MSE constraints. This is formulated as an 10-norm minimization problem under two quadratic constraints. A sub-optimal solution by decoupling the two constraints is proposed.by Xue Feng.S.M

High bit-rate digital communication through metal channels

The need to transmit digital information across metallic barriers arises frequently in industrial control applications. In some applications, the barrier can be penetrated with wiring, while in others this may not be possible. For example, metal bulkheads, pressure vessels, or pipelines may require a level of mechanical integrity that prohibits mechanical penetration. This study investigates the use of ultrasonic signaling for data transmission across metallic barriers, discusses the associated challenges, and analyzes several alternative communication system implementations.Several recent e orts have been made to develop through-metal ultrasonic communication systems, with approaches ranging widely in bitrate, complexity, and power requirements. The transceiver designs presented here are intended to cover a range of target applications. In systems having low data rate requirements, simple transceivers with low hardware/software complexity can be used. At high data rates, however, severe echoing in the ultrasonic channel leads to intersymbol interference. Reliable high speed communication therefore requires the use of channel equalizers, and results in a transceiver with higher hardware/software complexity.In this thesis, issues related to the design of reliable through-metal ultrasonic communication systems are discussed. These include (1) the development of mathematical models used to characterize the channel, (2) application of equalization techniques needed to achieve high-speed communication, and (3) analysis of hardware/software complexity for alternative transceiver designs.Several groups have developed through-metal ultrasonic communication systems in the recent past, though none has produced a mathematical model that accurately describes the phenomena found within the channel. The channel model developed in this thesis can be used at several stages of the transceiver design process, from transducer selection through channel equalizer design and ultimately system performance simulation.Using this channel model, we go on to develop and test several ultrasonic throughmetal transceiver designs. Ultrasonic through-metal communication systems are finding use in a wide variety of applications. Some require high throughput, while others require low power consumption. The motivation for developing several designs { ranging from low complexity, low power to high complexity, high throughput { is so that the best design can be matched to each application.After these transceiver designs are developed, we present an analysis of their computational requirements so that the most appropriate transceiver can be chosen for a given application.Ph.D., Electrical Engineering -- Drexel University, 201

Design of discrete-time filters for efficient implementation

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.Cataloged from PDF version of thesis.Includes bibliographical references (p. 325-333).The cost of implementation of discrete-time filters is often strongly dependent on the number of non-zero filter coefficients or the precision with which the coefficients are represented. This thesis addresses the design of sparse and bit-efficient filters under different constraints on filter performance in the context of frequency response approximation, signal estimation, and signal detection. The results have applications in several areas, including the equalization of communication channels, frequency-selective and frequency-shaping filtering, and minimum-variance distortionless-response beamforming. The design problems considered admit efficient and exact solutions in special cases. For the more difficult general case, two approaches are pursued. The first develops low-complexity algorithms that are shown to yield optimal or near-optimal designs in many instances, but without guarantees. The second focuses on optimal algorithms based on the branch-and-bound procedure. The complexity of branch-and-bound is reduced through the use of bounds that are good approximations to the true optimal cost. Several bounding methods are developed, many involving relaxations of the original problem. The approximation quality of the bounds is characterized and efficient computational methods are discussed. Numerical experiments show that the bounds can result in substantial reductions in computational complexity.by Dennis Wei.Ph.D

Spatial diversity in MIMO communication systems with distributed or co-located antennas

The use of multiple antennas in wireless communication systems has gained much attention during the last decade. It was shown that such multiple-input multiple-output (MIMO) systems offer huge advantages over single-antenna systems. Typically, quite restrictive assumptions are made concerning the spacing of the individual antenna elements. On the one hand, it is typically assumed that the antenna elements at transmitter and receiver are co-located, i.e., they belong to some sort of antenna array. On the other hand, it is often assumed that the antenna spacings are sufficiently large, so as to justify the assumption of independent fading. In this thesis, the above assumptions are relaxed. In the first part, it is shown that MIMO systems with distributed antennas and MIMO systems with co-located antennas can be treated in a single, unifying framework. In the second part this fact is utilized, in order to develop appropriate transmit power allocation strategies for co-located and distributed MIMO systems. Finally, the third part focuses on specific synchronization problems that are of interest for distributed MIMO systems