Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Michael L. Honig is active.

Publication


Featured researches published by Michael L. Honig.


IEEE Transactions on Information Theory | 1995

Blind adaptive multiuser detection

Michael L. Honig; Upamanyu Madhow; Sergio Verdú

The decorrelating detector and the linear minimum mean-square error (MMSE) detector are known to be effective strategies to counter the presence of multiuser interference in code-division multiple-access channels; in particular, those multiuser detectors provide optimum near-far resistance. When training data sequences are available, the MMSE multiuser detector can be implemented adaptively without knowledge of signature waveforms or received amplitudes. This paper introduces an adaptive multiuser detector which converges (for any initialization) to the MMSE detector without requiring training sequences. This blind multiuser detector requires no more knowledge than does the conventional single-user receiver: the desired users signature waveform and its timing. The proposed blind multiuser detector is made robust with respect to imprecise knowledge of the received signature waveform of the user of interest. >


IEEE Transactions on Communications | 1994

MMSE interference suppression for direct-sequence spread-spectrum CDMA

Upamanyu Madhow; Michael L. Honig

We consider interference suppression for direct-sequence spread-spectrum code-division multiple-access (CDMA) systems using the minimum mean squared error (MMSE) performance criterion. The conventional matched filter receiver suffers from the near-far problem, and requires strict power control (typically involving feedback from receiver to transmitter) for acceptable performance. Multiuser detection schemes previously proposed mitigate the near-far problem, but are complex and require explicit knowledge or estimates of the interference parameters. In this paper, we present and analyze several new MMSE interference suppression schemes, which have the advantage of being near-far resistant (to varying degrees, depending on their complexity), and can be implemented adaptively when interference parameters are unknown and/or time-varying, Numerical results are provided that show that these schemes offer significant performance gains relative to the matched filter receiver. We conclude that MMSE detectors can alleviate the need for stringent power control. In CDMA systems, and may be a practical alternative to the matched filter receiver. >


allerton conference on communication, control, and computing | 2006

Distributed interference compensation for wireless networks

Jianwei Huang; Randall A. Berry; Michael L. Honig

We consider a distributed power control scheme for wireless ad hoc networks, in which each user announces a price that reflects compensation paid by other users for their interference. We present an asynchronous distributed algorithm for updating power levels and prices. By relating this algorithm to myopic best response updates in a fictitious game, we are able to characterize convergence using supermodular game theory. Extensions of this algorithm to a multichannel network are also presented, in which users can allocate their power across multiple frequency bands.


IEEE Transactions on Communications | 2002

Adaptive reduced-rank interference suppression based on the multistage Wiener filter

Michael L. Honig; J.S. Goldstein

A class of adaptive reduced-rank interference suppression algorithms is presented based on the multistage Wiener filter (MSWF). The performance is examined in the context of direct-sequence (DS) code division multiple access (CDMA). Unlike the principal components method for reduced-rank filtering, the algorithms presented can achieve near full-rank performance with a filter rank much less than the dimension of the signal subspace. We present batch and recursive algorithms for estimating the filter parameters, which do not require an eigen-decomposition. The algorithm performance in a heavily loaded DS-CDMA system is characterized via computer simulation. The results show that the reduced-rank algorithms require significantly fewer training samples than other reduced- and full-rank algorithms.


IEEE Transactions on Information Theory | 2001

Performance of reduced-rank linear interference suppression

Michael L. Honig; Weimin Xiao

The performance of reduced-rank linear filtering is studied for the suppression of multiple-access interference. A reduced-rank filter resides in a lower dimensional space, relative to the full-rank filter, which enables faster convergence and tracking. We evaluate the large system output signal-to-interference plus noise ratio (SINR) as a function of filter rank D for the multistage Wiener filter (MSWF) presented by Goldstein and Reed. The large system limit is defined by letting the number of users K and the number of dimensions N tend to infinity with K/N fixed. For the case where all users are received with the same power, the reduced-rank SINR converges to the full-rank SINR as a continued fraction. An important conclusion from this analysis is that the rank D needed to achieve a desired output SINR does not scale with system size. Numerical results show that D=8 is sufficient to achieve near-full-rank performance even under heavy loads (K/N=1). We also evaluate the large system output SINR for other reduced-rank methods, namely, principal components and cross-spectral, which are based on an eigendecomposition of the input covariance matrix, and partial despreading. For those methods, the large system limit lets D/spl rarr//spl infin/ with D/N fixed. Our results show that for large systems, the MSWF allows a dramatic reduction in rank relative to the other techniques considered.


asilomar conference on signals, systems and computers | 2009

Minimum Mean Squared Error interference alignment

David A. Schmidt; Changxin Shi; Randall A. Berry; Michael L. Honig; Wolfgang Utschick

To achieve the full multiplexing gain of MIMO interference networks at high SNRs, the interference from different transmitters must be aligned in lower-dimensional subspaces at the receivers. Recently a distributed “max-SINR” algorithm for precoder optimization has been proposed that achieves interference alignment for sufficiently high SNRs. We show that this algorithm can be interpreted as a variation of an algorithm that minimizes the sum Mean Squared Error (MSE). To maximize sum utility, where the utility depends on rate or SINR, a weighted sum MSE objective is used to compute the beams, where the weights are updated according to the sum utility objective. We specify a class of utility functions for which convergence of the sum utility to a local optimum is guaranteed with asynchronous updates of beams, receiver filters, and utility weights. Numerical results are presented, which show that this method achieves interference alignment at high SNRs, and can achieve different points on the boundary of the achievable rate region by adjusting the MSE weights.


IEEE Signal Processing Magazine | 2000

Adaptive techniques for multiuser CDMA receivers

Michael L. Honig; Michail K. Tsatsanis

A number of CDMA receivers have been proposed that cover the whole spectrum of performance/complexity from the simple matched filter to the optimal Viterbi (1995) processor. Adaptive solutions, in particular, have the potential of providing the anticipated multiuser detection (MD) performance gains with a complexity that would be manageable for third generation systems. Our goal, in this article, is to provide an overview of previous work in MD with an emphasis on adaptive methods. We start with (suboptimal) linear receivers and discuss the data-aided MMSE receiver. Blind (nondata-aided) implementations are also reviewed together with techniques that can mitigate possible multipath effects and channel dispersion. In anticipation of those developments, appropriate discrete-time (chip rate) CDMA models are reviewed, which incorporate asynchronism and channel dispersion. For systems with large spreading factors, the convergence and tracking properties of conventional adaptive filters may be inadequate due to the large number of coefficients which must be estimated. In this context, reduced rank adaptive filtering is discussed. In this approach, the number of parameters is reduced by restricting the receiver tap vector to belong to a carefully chosen subspace. In this way the number of coefficients to be estimated is significantly reduced with minimal performance loss.


IEEE Journal on Selected Areas in Communications | 1992

Suppression of near- and far-end crosstalk by linear pre- and post-filtering

Michael L. Honig; Pedro M. Crespo; Kenneth Steiglitz

Full-duplex data communication over a multi-input/multi-output linear time-invariant channel is considered. The minimum mean square error (MMSE) linear equalizer is derived in the presence of both near- and far-end crosstalk and independent additive noise. The MMSE equalizer is completely specified in terms of the channel and crosstalk transfer functions by using a generalization of previous work due to Salz (1985). Conditions are given under which the equalizer can completely eliminate both near- and far-end crosstalk and intersymbol interference. The MMSE transmitter filter, subject to a transmitted power constraint, is specified when the channel and crosstalk transfer functions are bandlimited to the Nyquist frequency. Also considered is the design of MMSE transmitter and receiver filters when the data signals are arbitrary wide-sense stationary continuous or discrete-time signals, corresponding to the situation where the crosstalk is not phase-synchronous with the desired signal. >


IEEE Transactions on Information Theory | 2009

Capacity of a Multiple-Antenna Fading Channel With a Quantized Precoding Matrix

Wiroonsak Santipach; Michael L. Honig

Given a multiple-input multiple-output (MIMO) channel, feedback from the receiver can be used to specify a transmit precoding matrix, which selectively activates the strongest channel modes. Here we analyze the performance of random vector quantization (RVQ), in which the precoding matrix is selected from a random codebook containing independent, isotropically distributed entries. We assume that channel elements are independent and identically distributed (i.i.d.) and known to the receiver, which relays the optimal (rate-maximizing) precoder codebook index to the transmitter using B bits. We first derive the large system capacity of beamforming (rank-one precoding matrix) as a function of B, where large system refers to the limit as B and the number of transmit and receive antennas all go to infinity with fixed ratios. RVQ for beamforming is asymptotically optimal, i.e., no other quantization scheme can achieve a larger asymptotic rate. We subsequently consider a precoding matrix with arbitrary rank, and approximate the asymptotic RVQ performance with optimal and linear receivers (matched filter and minimum mean squared error (MMSE)). Numerical examples show that these approximations accurately predict the performance of finite-size systems of interest. Given a target spectral efficiency, numerical examples show that the amount of feedback required by the linear MMSE receiver is only slightly more than that required by the optimal receiver, whereas the matched filter can require significantly more feedback.


international symposium on information theory | 2004

Asymptotic capacity of beamforming with limited feedback

Wiroonsak Santipach; Michael L. Honig

We study the capacity of a single-user channel with multiple antennas and limited feedback. The receiver has perfect channel knowledge, and can relay B bits, which specify a beamforming vector, to the transmitter. We show that a random vector quantization scheme is asymptotically optimal, and give a simple expression for the associated capacity.

Collaboration


Dive into the Michael L. Honig's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Dongning Guo

Northwestern University

View shared research outputs
Top Co-Authors

Avatar

Rakesh V. Vohra

University of Pennsylvania

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Yakun Sun

Northwestern University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Junjik Bae

Northwestern University

View shared research outputs
Top Co-Authors

Avatar

Scott Jordan

University of California

View shared research outputs
Top Co-Authors

Avatar

Changxin Shi

Northwestern University

View shared research outputs
Top Co-Authors

Avatar

Hang Zhou

Northwestern University

View shared research outputs
Researchain Logo
Decentralizing Knowledge