Publications (13)7.86 Total impact
 [Show abstract] [Hide abstract]
ABSTRACT: In Costa's dirtypaper channel, Gaussian random binning is able to eliminate the effect of interference which is known at the transmitter, and thus achieve capacity. We examine a generalization of the dirtypaper problem to a multiple access channel (MAC) setup, where structured (latticebased) binning seems to be necessary to achieve capacity. In the dirtyMAC, two additive interference signals are present, one known to each transmitter but none to the receiver. The achievable rates using Costa's Gaussian binning vanish if both interference signals are strong. In contrast, it is shown that latticestrategies (“lattice precoding”) can achieve positive rates, independent of the interference power. Furthermore, in some caseswhich depend on the noise variance and power constraintshighdimensional lattice strategies are in fact optimal. In particular, they are optimal in the limit of high SNRwhere the capacity region of the dirty MAC with strong interference approaches that of a clean MAC whose power is governed by the minimum of the users' powers rather than their sum. The rate gap at high SNR between latticestrategies and optimum (rather than Gaussian) random binning is conjectured to be <sup>1</sup>/<sub>2</sub> log<sub>2</sub>(π e /6) ≈ 0.254 bit. Thus, the doubly dirty MAC is another instance of a network setting, like the KörnerMarton problem, where (linear) structured coding is potentially better than random binning.IEEE Transactions on Information Theory 09/2011; · 2.62 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: The general twouser memoryless multipleaccess channel, with common channel state information known to the encoders, has no singleletter solution which explicitly characterizes its capacity region. In this paper a binary “dirty” multipleaccess channel (MAC) with “common interference”, when the interference sequence is known to both encoders, is considered. We determine its sumcapacity, which equals to the capacity when fullcooperation between transmitters is allowed, contrary to the Gaussian case. We further derive an achievable rate region for this channel, by adopting the “onionpeeling” strategies which achieve the capacity region of the “clean” binary MAC. We show that the gap between the capacity region of the clean MAC and the achievable rate region of dirty MAC stems from the loss of the pointtopoint binary dirty channel relative to the corresponding clean channel.01/2010; 
Conference Paper: The capacity region of the binary dirty MAC
[Show abstract] [Hide abstract]
ABSTRACT: The general twouser memoryless multipleaccess channel with partial or full channel state information among the encoders has no singleletter solution which explicitly characterizes its capacity region. In this paper a binary dirty multipleaccess channel with interference known at one/both encoders is considered. Specifically, we derive formulas for the capacity region of the doublydirty multipleaccess channel where each encoder knows one of two independent interference sequences and for the binary dirty multipleaccess channel with a single informed user where the interference is known to only one encoder.Information Theory Workshop, 2009. ITW 2009. IEEE; 11/2009  [Show abstract] [Hide abstract]
ABSTRACT: A generalization of the Gaussian dirtypaper problem to a multiple access setup is considered. There are two additive interference signals, one known to each transmitter but none to the receiver. The rates achievable using Costa's strategies (i.e. by a random binning scheme induced by Costa's auxiliary random variables) vanish in the limit when the interference signals are strong. In contrast, it is shown that lattice strategies ("lattice precoding") can achieve positive rates independent of the interferences, and in fact in some cases  which depend on the noise variance and power constraints  they are optimal. In particular, lattice strategies are optimal in the limit of high SNR. It is also shown that the gap between the achievable rate region and the capacity region is at most 0.167 bit. Thus, the dirty MAC is another instance of a network setup, like the KornerMarton modulotwo sum problem, where linear coding is potentially better than random binning. Lattice transmission schemes and conditions for optimality for the asymmetric case, where there is only one interference which is known to one of the users (who serves as a "helper" to the other user), and for the "common interference" case are also derived. In the former case the gap between the helper achievable rate and its capacity is at most 0.085 bit.05/2009;  [Show abstract] [Hide abstract]
ABSTRACT: In this paper we provide an achievable rate region for the discrete memoryless multiple access channel with correlated state information known noncausally at the encoders using a random binning technique. This result is a generalization of the random binning technique used by Gel'fand and Pinsker for the problem with noncausal channel state information at the encoder in point to point communication.01/2009; 
Conference Paper: The rate loss of single letter characterization for the “dirty” multiple access channel
[Show abstract] [Hide abstract]
ABSTRACT: For general memoryless systems, the typical information theoretic solution, when exists, has a ldquosingleletterrdquo form. This reflects the fact that optimum performance can be approached by a random code (or a random binning scheme), generated using independent and identically distributed copies of some singleletter distribution. Is that the form of the solution of any (information theoretic) problem? In fact, some counter examples are known, perhaps the most famous being the KornerMarton ldquotwo help onerdquo problem, where the modulotwo sum of two binary sources is to be decoded from their independent encodings. In this paper we provide another counter example, the ldquodoublydirtyrdquo multiple access channel (MAC). Like the KornerMarton problem, this example is associated with a multiterminal scenario where side information is distributed among several terminals; each transmitter knows part of the channel interference but the receiver is not aware of any part of it. We give an explicit solution for the capacity region of a binary version of the doublydirty MAC, demonstrate how this capacity region can be approached using a linear coding scheme, and prove that the ldquobest known singleletter regionrdquo is strictly contained in it. We also state a conjecture regarding a similar rate loss of single letter characterization in the Gaussian case.Information Theory Workshop, 2008. ITW '08. IEEE; 06/2008  [Show abstract] [Hide abstract]
ABSTRACT: For general memoryless systems, the typical information theoretic solution  when exists  has a "singleletter" form. This reflects the fact that optimum performance can be approached by a random code (or a random binning scheme), generated using independent and identically distributed copies of some singleletter distribution. Is that the form of the solution of any (information theoretic) problem? In fact, some counter examples are known. The most famous is the "two help one" problem: Korner and Marton showed that if we want to decode the modulotwo sum of two binary sources from their independent encodings, then linear coding is better than random coding. In this paper we provide another counter example, the "doublydirty" multiple access channel (MAC). Like the KornerMarton problem, this is a multiterminal scenario where side information is distributed among several terminals; each transmitter knows part of the channel interference but the receiver is not aware of any part of it. We give an explicit solution for the capacity region of a binary version of the doublydirty MAC, demonstrate how the capacity region can be approached using a linear coding scheme, and prove that the "best known singleletter region" is strictly contained in it. We also state a conjecture regarding a similar rate loss of single letter characterization in the Gaussian case.IEEE Transactions on Information Theory 04/2008; · 2.62 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: We study two generalizations of the writing on dirty paper problem. The first scenario is the cross interference multiple access channel, where each user knows the interference that accompanies the transmission of the other user. In the second scenario we consider a twouser multiple access chancel with a common interference known to both transmitters. For the first scenario, we provide new inner and outer bounds for the capacity region. While the capacity region for the second problem was previously known, we provide a constructive coding scheme which attains it.01/2008;  [Show abstract] [Hide abstract]
ABSTRACT: We investigate the capacity loss for using uncorrelated Gaussian input over a multipleinput multipleoutput (MIMO) linear additivenoise channel. We upperbound the capacity loss by a universal constant C* which is independent of the channel matrix and the noise distribution. For a singleuser MIMO channel with n<sub>t</sub> inputs and n<sub>r</sub> outputs C* = min [ 1/2, n<sub>r</sub>/n<sub>t</sub> log<sub>2</sub> (1+n<sub>t</sub>/n<sub>r</sub>) ] bit per input dimension (or 2C* bit per transmit antenna per second per hertz), under both total and perinput power constraints. If we restrict attention to (colored) Gaussian noise, then the capacity loss is upperbounded by a smaller constant C<sub>G</sub> = n<sub>r</sub>/2n<sub>r</sub> log<sub>2</sub> (n<sub>t</sub>/n<sub>r</sub>) for n<sub>r</sub> ges n<sub>t</sub>/e, and C<sub>G</sub> = 0.265 otherwise, and this bound is tight for certain cases of channel matrix and noise covariance. We also derive similar bounds for the sumcapacity loss in multiuser MIMO channels. This includes in particular uncorrelated Gaussian transmission in a MIMO multipleaccess channel (MAC), and "flat" Gaussian dirtypaper coding (DPC) in a MIMO broadcast channel. In the context of wireless communication, our results imply that the benefit of beamforming and spatial waterfilling over simple isotropic transmission is limited. Moreover, the excess capacity of a pointtopoint MIMO channel over the same MIMO channel in a multiuser configuration is bounded by a universal constant.IEEE Transactions on Information Theory 12/2007; · 2.62 Impact Factor 
Conference Paper: The cost of uncorrelation and noncooperation in MIMO channels
[Show abstract] [Hide abstract]
ABSTRACT: We investigate the sumcapacity loss for using uncorrelated Gaussian inputs over multipleinput multipleoutput (MIMO) powerconstrained linear additivenoise channels in multiuser configurations. We show that the sumcapacity loss is bounded by a universal constant which depends only on the total number of input and output dimensions of the channel, but is independent of the channel matrix, the noise distribution and the number of users. Specifically, for a multipleaccess channel with a total number of n<sub>t</sub> transmit antennas and basestation with n<sub>r</sub> receive antennas, the sumcapacity loss is at most C* = min{1/2, n<sub>r</sub>/2n<sub>t </sub> log<sub>2</sub>(1 + n<sub>t</sub>/n<sub>r</sub>)} bit per input dimension (or 1 bit per transmit antenna per second per Hertz). If we restrict attention to Gaussian noises, then the capacity loss is upper bounded by C<sub>G</sub>* = min{0.265, 0.265n<sub>r</sub>/n<sub>t</sub> log<sub>2</sub>(n<sub>t</sub>/n<sub>r</sub>)}, and this bound is tight for certain channel matrices and noise spectra. We show also that the same bounds hold for the sumcapacity loss of uncorrelated Gaussian input over linear MIMO broadcast channels, input distribution being interpreted either in terms of the equivalent pointtopoint channel with Sato condition, or as the output distribution of a "dirtypaper" transmitter. One implication of these results is the limited value of coherence and waterfilling in spatial transmission. Another implication is the limited capacity loss in multiuser configurations relative to the fully cooperative (pointtopoint) channelInformation Theory, 2005. ISIT 2005. Proceedings. International Symposium on; 10/2005  [Show abstract] [Hide abstract]
ABSTRACT: We investigate the capacity loss of an uncorrelated Gaussian input with equal power (i.i.d. Gaussian input) over a multiinput multioutput linear additive noise (not necessarily Gaussian nor memoryless) channel. Previous work showed that this input is the best input in the case of Gaussian noise, assuming the channel matrix is known at the receiver but unknown at the transmitter. We show that i.i.d. Gaussian is a robust input also when the noise is not Gaussian. Specifically, we show that for n<sub>t</sub> transmit antennas and n<sub>r</sub> receive antennas, the capacity loss of an i.i.d. Gaussian input is smaller than min{n<sub>t</sub>/2, (n<sub>r</sub>/2)log<sub>2</sub>(1 + n<sub>t</sub>/n<sub>r</sub>)} bits, for any noise and channel matrix. This bound is apparently not tight. Nevertheless, for the case of Gaussian noise we derive a stronger bound which is tight for a "critical" channel matrix: (n<sub>r</sub>/2)log<sub>2</sub>(n<sub>t</sub>/n<sub>r</sub>) bits for 1≤ n<sub>r</sub>≤(n<sub>t</sub>/e) and (n<sub>t</sub>/2)(log<sub>2</sub>(e))/e bits for n<sub>r</sub>≥(n<sub>t</sub>/e).Electrical and Electronics Engineers in Israel, 2004. Proceedings. 2004 23rd IEEE Convention of; 10/2004 
Conference Paper: Precoding for interference cancellation at low SNR
[Show abstract] [Hide abstract]
ABSTRACT: We investigate the application of the nested coding framework for cancelling known interference at low SNR, that is P<sub>X</sub>/P<sub>Z</sub>≈1 and below. We consider multidimensional precoding, with anticipation of N<sub>s</sub>>1 "future" interference samples. Unlike nonprecoded transmission, where capacity can be achieved at low SNR without shaping, optimum precoding at low SNR does require shaping. Eyuboglu and Forney's trellis precoding scheme combines TomlinsonHarashima precoding and trellis shaping, to achieve both coding and shaping gains in transmission over intersymbol interference channel with Euclidean distance decoder. However, the standard configuration of this scheme does not support precoding at low SNR, where the capacity is less than 1bit/dim. Inspired by the nested lattices approach, we propose a variant of trellis precoding which combines MMSE estimation, dithering and construction of nested lattices which approach the interference channel capacity at low SNR.Electrical and Electronics Engineers in Israel, 2002. The 22nd Convention of; 01/2003 
Conference Paper: Combined shaping and precoding for interference cancellation at low SNR
[Show abstract] [Hide abstract]
ABSTRACT: We consider multi dimensional dirty paper coding at low SNR, and propose a low rate precoding scheme which combines MMSE estimation, dithering and a variant of nested codes, based on concatenation of a "syndrome dilution" code and a "syndrometocoset" modulation code.Information Theory, 2003. Proceedings. IEEE International Symposium on; 01/2003
Publication Stats
156  Citations  
7.86  Total Impact Points  
Top Journals
Institutions

2003–2011

Tel Aviv University
 School of Electrical Engineering
Tel Aviv, Tel Aviv, Israel
