Shraga I. Bross
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shraga I. Bross has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Amos Lapidoth
Department of Information Technology and Electrical Engineering, ETH Zurich, Zurich, Switzerland
4 shared publications - Ligong Wang
Signal and Information Processing Laboratory ETH Zurich Switzerland
1 shared publication - Michele A. Wigger
ETH Zürich, CH-8092 Zürich, Switzerland
1 shared publication - Stephan Tinguely
Signal and Information Processing Laboratory, Swiss Federal Institute of Technology (ETH) Zurich, Switzerland
1 shared publication
Latest Publications
- Open Access
The State-Dependent Multiple-Access Channel with States Available at a Cribbing Encoder
The two-user discrete memoryless state-dependent multiple-access channel (MAC) models a scenario in which two encoders transmit independent messages to a single receiver via a MAC whose channel law is governed by the pair of encoders' inputs and by an i.i.d. state random variable. In the cooperative state-dependent MAC model it is further assumed that Message 1 is shared by both encoders whereas Message 2 is known only to Encoder 2 - the cognitive transmitter. The capacity of the cooperative state-dependent MAC where the realization of the state sequence is known non-causally to the cognitive encoder has been derived by Somekh-Baruch et. al. In this work we dispense of the assumption that Message 1 is shared a-priori by both encoders. Instead, we study the case in which Encoder 2 cribs causally from Encoder 1. We determine the capacity region for both, the case where Encoder 2 cribs strictly causal and the case where Encoder 2 cribs causally from Encoder 1.
Open AccessThe State-Dependent Multiple-Access Channel with States Available at a Cribbing Encoder
The two-user discrete memoryless state-dependent multiple-access channel (MAC) models a scenario in which two encoders transmit independent messages to a single receiver via a MAC whose channel law is governed by the pair of encoders' inputs and by an i.i.d. state random variable. In the cooperative state-dependent MAC model it is further assumed that Message 1 is shared by both encoders whereas Message 2 is known only to Encoder 2 - the cognitive transmitter. The capacity of the cooperative state-dependent MAC where the realization of the state sequence is known non-causally to the cognitive encoder has been derived by Somekh-Baruch et. al. In this work we dispense of the assumption that Message 1 is shared a-priori by both encoders. Instead, we study the case in which Encoder 2 cribs causally from Encoder 1. We determine the capacity region for both, the case where Encoder 2 cribs strictly causal and the case where Encoder 2 cribs causally from Encoder 1.
- Open Access
The Poisson Channel with Side Information
The continuous-time, peak-limited, infinite-bandwidth Poisson channel with spurious counts is considered. It is shown that if the times at which the spurious counts occur are known noncausally to the transmitter but not to the receiver, then the capacity is equal to that of the Poisson channel with no spurious counts. Knowing the times at which the spurious counts occur only causally at the transmitter does not increase capacity.
Open AccessThe Poisson Channel with Side Information
The continuous-time, peak-limited, infinite-bandwidth Poisson channel with spurious counts is considered. It is shown that if the times at which the spurious counts occur are known noncausally to the transmitter but not to the receiver, then the capacity is equal to that of the Poisson channel with no spurious counts. Knowing the times at which the spurious counts occur only causally at the transmitter does not increase capacity.
- Open Access
Broadcasting Correlated Gaussians
We consider the transmission of a memoryless bivariate Gaussian source over an average-power-constrained one-to-two Gaussian broadcast channel. The transmitter observes the source and describes it to the two receivers by means of an average-power-constrained signal. Each receiver observes the transmitted signal corrupted by a different additive white Gaussian noise and wishes to estimate the source component intended for it. That is, Receiver~1 wishes to estimate the first source component and Receiver~2 wishes to estimate the second source component. Our interest is in the pairs of expected squared-error distortions that are simultaneously achievable at the two receivers. We prove that an uncoded transmission scheme that sends a linear combination of the source components achieves the optimal power-versus-distortion trade-off whenever the signal-to-noise ratio is below a certain threshold. The threshold is a function of the source correlation and the distortion at the receiver with the weaker noise.
Open AccessBroadcasting Correlated Gaussians
We consider the transmission of a memoryless bivariate Gaussian source over an average-power-constrained one-to-two Gaussian broadcast channel. The transmitter observes the source and describes it to the two receivers by means of an average-power-constrained signal. Each receiver observes the transmitted signal corrupted by a different additive white Gaussian noise and wishes to estimate the source component intended for it. That is, Receiver~1 wishes to estimate the first source component and Receiver~2 wishes to estimate the second source component. Our interest is in the pairs of expected squared-error distortions that are simultaneously achievable at the two receivers. We prove that an uncoded transmission scheme that sends a linear combination of the source components achieves the optimal power-versus-distortion trade-off whenever the signal-to-noise ratio is below a certain threshold. The threshold is a function of the source correlation and the distortion at the receiver with the weaker noise.
- Open Access
The Gaussian MAC with Conferencing Encoders
We derive the capacity region of the Gaussian version of Willems's two-user MAC with conferencing encoders. This setting differs from the classical MAC in that, prior to each transmission block, the two transmitters can communicate with each other over noise-free bit-pipes of given capacities. The derivation requires a new technique for proving the optimality of Gaussian input distributions in certain mutual information maximizations under a Markov constraint. We also consider a Costa-type extension of the Gaussian MAC with conferencing encoders. In this extension, the channel can be described as a two-user MAC with Gaussian noise and Gaussian interference where the interference is known non-causally to the encoders but not to the decoder. We show that as in Costa's setting the interference sequence can be perfectly canceled, i.e., that the capacity region without interference can be achieved.
Open AccessThe Gaussian MAC with Conferencing Encoders
We derive the capacity region of the Gaussian version of Willems's two-user MAC with conferencing encoders. This setting differs from the classical MAC in that, prior to each transmission block, the two transmitters can communicate with each other over noise-free bit-pipes of given capacities. The derivation requires a new technique for proving the optimality of Gaussian input distributions in certain mutual information maximizations under a Markov constraint. We also consider a Costa-type extension of the Gaussian MAC with conferencing encoders. In this extension, the channel can be described as a two-user MAC with Gaussian noise and Gaussian interference where the interference is known non-causally to the encoders but not to the decoder. We show that as in Costa's setting the interference sequence can be perfectly canceled, i.e., that the capacity region without interference can be achieved.