Ram Zamir

Ram Zamir

Auto-generated profile, based on publicly available information

Ram Zamir

EE -Systems Department Tel Aviv University Israel

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 September 2009 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JØJan Østergaard
Jan Østergaard
RZRam Zamir
Ram Zamir
We address the connection between the multiple-description (MD) problem and delta-sigma quantization. The inherent redundancy due to oversampling in delta-sigma quantization, and the simple linear-additive noise model resulting from dithered lattice quantization, allow us to construct a symmetric and time-invariant MD coding scheme. We show that the use of a noise-shaping filter makes it possible to trade off central distortion for side distortion. Asymptotically, as the dimension of the lattice vector quantizer and order of the noise-shaping filter approach infinity, the entropy rate of the dithered delta-sigma quantization scheme approaches the symmetric two-channel MD rate-distortion function for a memoryless Gaussian source and mean square error (MSE) fidelity criterion, at any side-to-central distortion ratio and any resolution. In the optimal scheme, the infinite-order noise-shaping filter must be minimum phase and have a piecewise flat power spectrum with a single jump discontinuity. An important advantage of the proposed design is that it is symmetric in rate and distortion by construction, so the coding rates of the descriptions are identical and there is therefore no need for source splitting.

1 June 2007
Verified
Conference Paper
Closed access
TPTal Philosof
Tal Philosof
AKAshish Khisti
Ashish Khisti
UEUri Erez
Uri Erez
RZRam Zamir
Ram Zamir
We consider a generalization of the Gaussian dirty- paper problem to a multiple access setup. There are two additive interferences, one known to each transmitter but none to the receiver. The rates achievable using random binning schemes (i.e. schemes based on Costa's auxiliary random variables) vanish in the limit when the interferences are strong. In contrast, we show that lattice strategies ("lattice preceding") can achieve positive rates independent of the interferences. Furthermore, we derive an outer bound for the capacity region for arbitrary interferences, which is strictly smaller than the clean MAC capacity region. We then show that lattice strategies meet this outer bound for some combinations of noise variance and power constraints. In particular, lattice strategies are optimal in the limit of high SNR. Thus, the dirty MAC is another instance of a network setup, like the Korner-Marton modulo-two sum problem, where linear coding is better than random binning. We also derive 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, and in particular for the helper problem, where the user which knows the interference does not have a message it wishes to transmit.

29 October 2007 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
TPTal Philosof
Tal Philosof
RZRam Zamir
Ram Zamir
We investigate the capacity loss for using uncorrelated Gaussian input over a multiple-input multiple-output (MIMO) linear additive-noise channel. We upper-bound the capacity loss by a universal constant C* which is independent of the channel matrix and the noise distribution. For a single-user MIMO channel with nt inputs and nr outputs C* = min [ 1/2, nr/nt log2 (1+nt/nr) ] bit per input dimension (or 2C* bit per transmit antenna per second per hertz), under both total and per-input power constraints. If we restrict attention to (colored) Gaussian noise, then the capacity loss is upper-bounded by a smaller constant CG = nr/2nr log2 (nt/nr) for nr ges nt/e, and CG = 0.265 otherwise, and this bound is tight for certain cases of channel matrix and noise covariance. We also derive similar bounds for the sum-capacity loss in multiuser MIMO channels. This includes in particular uncorrelated Gaussian transmission in a MIMO multiple-access channel (MAC), and "flat" Gaussian dirty-paper coding (DPC) in a MIMO broadcast channel. In the context of wireless communication, our results imply that the benefit of beamforming and spatial water-filling over simple isotropic transmission is limited. Moreover, the excess capacity of a point-to-point MIMO channel over the same MIMO channel in a multiuser configuration is bounded by a universal constant.

1 July 2008
Verified
Conference Paper
Closed access
YKYuval Kochman
Yuval Kochman
AKAnatoly Khina
Anatoly Khina
UEUri Erez
Uri Erez
RZRam Zamir
Ram Zamir
The Gaussian parallel relay network problem consists of transmitting a message from a single source node to a single destination node, through a layer of parallel relay nodes. The source is connected to the relays by a Gaussian broadcast channel, while the relays are connected to the destination by a Gaussian multiple access channel. When the channels are all white with the same bandwidth, and the relays cannot decode the message, the best known strategy is "amplify and forward", which achieves the coherence gain of multiple relays. We propose a strategy which achieves this gain even when the noises are colored or the channels have different bandwidths. To that end we use analog modulo-lattice modulation of the codewords in the BC, and then forward the estimated codeword by each of the relays to the MAC. This modulation allows the relays to re-match the signal to the optimal spectrum of the MAC, thus demonstrating how a channel problem can gain from a joint source/channel approach. We show that this strategy is asymptotically optimal in some limiting cases, and that it outperforms the known alternatives in most other cases, where the optimum is unknown. We also demonstrate how to improve the achievable rate in the original white problem, for some signal to noise ratio values.

1 November 1998 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
RZR. Zamir
R. Zamir
Meir FederMeir Feder
Meir Feder
We derive a version of the Brunn-Minkowski inequality which gives a nontrivial lower bound on the volume of the Minkowski sum of degenerate sets, namely, line sets. This inequality parallels a recently obtained matrix generalization of the entropy-power inequality.

31 October 2013 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
YKYuval Kochman
Yuval Kochman
AKAnatoly Khina
Anatoly Khina
UEUri Erez
Uri Erez
RZRam Zamir
Ram Zamir
The Gaussian parallel relay network, introduced by Schein and Gallager, consists of a concatenation of a Gaussian additive broadcast channel from a single encoder to a layer of relays followed by a Gaussian multiple-access channel from the relays to the final destination (decoder), where all noises are independent. This setup exhibits an inherent conflict between digital and analog relaying; while analog relaying [known as amplify-and-forward (A&F)] suffers from noise accumulation, digital relaying (known as decode-and-forward) looses the potential coherence gain in combining the relay noises at the decoder. For a large number of relays, the coherence gain is large, and thus analog relaying has better performance; however, it is limited to white channels of equal bandwidth. In this paper, we present a generalization of the analog approach to the case of bandwidth mismatch. Our strategy, coined rematch and forward (R&F), is based upon applying joint source-channel coding techniques that belong to a certain class of maximally analog schemes. Using such techniques, R&F converts the bandwidth of the broadcast section to that of the multiple-access section, creating an equivalent matched-bandwidth network over which A&F is applied. It is shown that this strategy exploits the full bandwidth of the individual channels, without sacrificing the coherence gain offered by A&F. Specifically, for given individual-link capacities, R&F remains within a constant gap from the network capacity for any number of relays and any bandwidth ratio between the sections. Finally, the approach is extended to the case of colored channels.