Yuval Kochman

Learn More
In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed finite quantization block length. We show that the excess coding rate above the rate-distortion function is inversely proportional (to the first order) to the square root of the block(More)
In this work we investigate the behavior of the distortion threshold that can be guaranteed in joint source-channel coding, to within a prescribed excess-distortion probability. We show that the gap between this threshold and the optimal average distortion is governed by a constant that we call the joint source-channel dispersion. This constant can be(More)
The "water-filling" solution for the quadratic rate-distortion function of a stationary Gaussian source is given in terms of its power spectrum. This formula naturally lends itself to a frequency domain "test-channel" realization. We provide an alternative time-domain realization for the rate-distortion function, based on linear prediction. This solution(More)
Analog (uncoded) transmission provides a simple and robust scheme for communicating a Gaussian source over a Gaussian channel under the mean-squared-error (MSE) distortion measure. Unfortunately, its performance is usually inferior to the all-digital, separation-based source-channel coding solution, which requires exact knowledge of the channel at the(More)
The combination of source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-information (Gel’fand-Pinsker problem) can be optimally solved using the separation principle. In this work we show an alternative scheme for the quadratic-Gaussian case, which merges source and channel coding. This scheme achieves the(More)
The physical-layer network coding (PNC) approach provides improved performance in many scenarios over “traditional” relaying techniques or network coding. This work addresses the generalization of PNC to wireless scenarios where network nodes have multiple antennas. We use a recent matrix decomposition, which allows, by linear pre- and(More)
An efficient sparse antenna array architecture is developed for coherent imaging of sparse but otherwise unknown scenes. In this architecture, the array elements form a periodic nonuniform pattern. Using analysis that explicitly takes into account the presence of noise, we develop an efficient pattern design procedure based on co-arrays, describe an(More)
This paper considers communication networks where individual links can be described as those based on multiple-input multiple-output channels. Unlike orthogonal modulation methods (such as the singular-value decomposition), we allow interference between subchannels, which can be removed by the receivers via successive cancellation. The degrees of freedom(More)
The ldquowater-fillingrdquo solution for the quadratic rate-distortion function of a stationary Gaussian source is given in terms of its power spectrum. This formula naturally lends itself to a frequency domain ldquotest-channelrdquo realization. We provide an alternative time-domain realization for the rate-distortion function, based on linear prediction.(More)