Shraga I. Bross
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Shraga I. Bross has a total of 10 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
2 shared publications - Stephan Tinguely
Signal and Information Processing Laboratory, Swiss Federal Institute of Technology (ETH) Zurich, Switzerland
2 shared publications Bassel Haddad
Zoran Microelectronics, Haifa 31024, Israel
1 shared publication- Eran Hof
Department of Electrical Engineering Technion -Israel Institute of Technology Haifa 32000 Israel
1 shared publication - Michele A. Wigger
ETH Zürich, CH-8092 Zürich, Switzerland
1 shared publication Sefi (Yosef) Ronen
EE Department, Arizona State University, Tempe, AZ 85287-5706, USA
1 shared publication
Latest Publications
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1051-1055
A Schalkwijk-Kailath Type Encoding Scheme for the Gaussian Relay Channel with Receiver-Transmitter Feedback
We propose an encoding scheme for the Gaussian relay channel with receiver-transmitter feedback based on the Schalkwijk-Kailath coding strategy for the memoryless Gaussian single-user channel with feedback. The scheme has the advantage over previous schemes for the relay channel of being of very low complexity and, for certain channel parameters, achieving much higher rates.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1051-1055
A Schalkwijk-Kailath Type Encoding Scheme for the Gaussian Relay Channel with Receiver-Transmitter Feedback
We propose an encoding scheme for the Gaussian relay channel with receiver-transmitter feedback based on the Schalkwijk-Kailath coding strategy for the memoryless Gaussian single-user channel with feedback. The scheme has the advantage over previous schemes for the relay channel of being of very low complexity and, for certain channel parameters, achieving much higher rates.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1241-1245
On the Discrete Memoryless Partially Cooperative Broadcast Relay Channel
A partially cooperative relay broadcast channel is a network with one source node and two destination nodes wherein destination 1 acts as a relay to assist destination 2. We derive two inner bounds on the rate region of this model. The first inner bound is based on the Cover-El Gamal generalized strategy for the original relay channel, while the second inner bound is based on the strategy proposed by Chong-Motani-Garg, for the relay channel, which combines backward decoding and simultaneous decoding. Both rate regions subsume the inner bound reported by Liang and Kramer which is based just on the decode-and-forward strategy for the common message.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1241-1245
On the Discrete Memoryless Partially Cooperative Broadcast Relay Channel
A partially cooperative relay broadcast channel is a network with one source node and two destination nodes wherein destination 1 acts as a relay to assist destination 2. We derive two inner bounds on the rate region of this model. The first inner bound is based on the Cover-El Gamal generalized strategy for the original relay channel, while the second inner bound is based on the strategy proposed by Chong-Motani-Garg, for the relay channel, which combines backward decoding and simultaneous decoding. Both rate regions subsume the inner bound reported by Liang and Kramer which is based just on the decode-and-forward strategy for the common message.
- 12 February 2007
- Published by Wiley in European Transactions on Telecommunications
- Vol. 18 (7) , 719-734
Iterative channel estimation and decoding in turbo coded space‐time systems
A noncoherent multiple antenna coded communication system over both block fading and time‐selective flat fading Rayleigh channel is considered. Several iterative decoding strategies consisting of pilot symbol assisted demodulation and turbo decoding are proposed. It is shown that, at a system rate of 0.9 bits per channel use, the SNR required to achieve a BER of 10−4is only about 2dB from the imperfect CSI capacity lower bound. The channel estimation error variance is demonstrated to be close to the theoretical limit set by the Modified Cramér‐Rao bound. The simulation results coincide with the trends dictated by recent information‐theoretic analysis and demonstrate the effect that inaccuracy of the channel estimation has on the performance of the iterative decoding scheme. Copyright © 2007 John Wiley & Sons, Ltd.
- 12 February 2007
- Published by Wiley in European Transactions on Telecommunications
- Vol. 18 (7) , 719-734
Iterative channel estimation and decoding in turbo coded space‐time systems
A noncoherent multiple antenna coded communication system over both block fading and time‐selective flat fading Rayleigh channel is considered. Several iterative decoding strategies consisting of pilot symbol assisted demodulation and turbo decoding are proposed. It is shown that, at a system rate of 0.9 bits per channel use, the SNR required to achieve a BER of 10−4is only about 2dB from the imperfect CSI capacity lower bound. The channel estimation error variance is demonstrated to be close to the theoretical limit set by the Modified Cramér‐Rao bound. The simulation results coincide with the trends dictated by recent information‐theoretic analysis and demonstrate the effect that inaccuracy of the channel estimation has on the performance of the iterative decoding scheme. Copyright © 2007 John Wiley & Sons, Ltd.
- 1 December 2006
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 42 (4) , 298-318
On the reliability exponent of the additive exponential noise channel
We study the reliability exponent of the additive exponential noise channel (AENC) in the absence as well as in the presence of noiseless feedback. For rates above the critical rate, the fixed-transmission-time reliability exponent of the AENC is completely determined, while below the critical rate an expurgated exponent is obtained. Using a fixed-block-length code ensemble (with block length denoting the number of recorded departures), we obtain a lower bound on the random-transmission-time reliability exponent of the AENC. Finally, with a variable-block-length code ensemble, a lower bound on the random-transmission-time zero-error capacity of the AENC with noiseless feedback is obtained.
- 1 December 2006
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 42 (4) , 298-318
On the reliability exponent of the additive exponential noise channel
We study the reliability exponent of the additive exponential noise channel (AENC) in the absence as well as in the presence of noiseless feedback. For rates above the critical rate, the fixed-transmission-time reliability exponent of the AENC is completely determined, while below the critical rate an expurgated exponent is obtained. Using a fixed-block-length code ensemble (with block length denoting the number of recorded departures), we obtain a lower bound on the random-transmission-time reliability exponent of the AENC. Finally, with a variable-block-length code ensemble, a lower bound on the random-transmission-time zero-error capacity of the AENC with noiseless feedback is obtained.
- 1 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 141-145
On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel with Degraded Message Sets
An inner bound on the deterministic-code capacity region of the two-user discrete memoryless arbitrarily varying general broadcast channel (AVGBC) was characterized by Jahn, assuming that the common message capacity is nonzero; however, he did not indicate how one could decide whether the latter capacity is positive. Csiszar and Narayan's result for the single- user AVC establishes the missing part in Jahn's characterization. Nevertheless, being based on Ahlswede's elimination technique, Jahn's characterization is not applicable for symmetrizable channels under state constraint. Here, the various notions of symmetrizability for the two-user broadcast AVC are defined. Sufficient nonsymmetrizability condition that renders the common message capacity of the AVGBC positive is identified using an approach different from Jahn's. The decoding rules we use establish an achievable region under state and input constraints for the family of degraded message sets codes over the AVGBC.
- 1 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 141-145
On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel with Degraded Message Sets
An inner bound on the deterministic-code capacity region of the two-user discrete memoryless arbitrarily varying general broadcast channel (AVGBC) was characterized by Jahn, assuming that the common message capacity is nonzero; however, he did not indicate how one could decide whether the latter capacity is positive. Csiszar and Narayan's result for the single- user AVC establishes the missing part in Jahn's characterization. Nevertheless, being based on Ahlswede's elimination technique, Jahn's characterization is not applicable for symmetrizable channels under state constraint. Here, the various notions of symmetrizability for the two-user broadcast AVC are defined. Sufficient nonsymmetrizability condition that renders the common message capacity of the AVGBC positive is identified using an approach different from Jahn's. The decoding rules we use establish an achievable region under state and input constraints for the family of degraded message sets codes over the AVGBC.
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2153-2155
Superimposed Coded and Uncoded Transmissions of a Gaussian Source over the Gaussian Channel
We propose to send a Gaussian source over an average-power limited additive white Gaussian noise channel by transmitting a linear combination of the source sequence and the result of its quantization using a high dimensional Gaussian vector quantizer. We show that, irrespective of the rate of the vector quantizer (assumed to be fixed and smaller than the channel's capacity), this transmission scheme is asymptotically optimal (as the quantizer's dimension tends to infinity) under the mean squared-error fidelity criterion. This generalizes the classical result of Goblick about the optimality of scaled uncoded transmission, which corresponds to choosing the rate of the vector quantizer as zero, and the classical source-channel separation approach, which corresponds to choosing the rate of the vector quantizer arbitrarily close to the capacity of the channel
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2153-2155
Superimposed Coded and Uncoded Transmissions of a Gaussian Source over the Gaussian Channel
We propose to send a Gaussian source over an average-power limited additive white Gaussian noise channel by transmitting a linear combination of the source sequence and the result of its quantization using a high dimensional Gaussian vector quantizer. We show that, irrespective of the rate of the vector quantizer (assumed to be fixed and smaller than the channel's capacity), this transmission scheme is asymptotically optimal (as the quantizer's dimension tends to infinity) under the mean squared-error fidelity criterion. This generalizes the classical result of Goblick about the optimality of scaled uncoded transmission, which corresponds to choosing the rate of the vector quantizer as zero, and the classical source-channel separation approach, which corresponds to choosing the rate of the vector quantizer arbitrarily close to the capacity of the channel
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1663-1667
On the Discrete Memoryless Relay Channel with Relay-Transmitter Feedback
A coding technique is proposed for the discrete memoryless relay channel with noiseless feedback from relay to transmitter. The achievability result we obtain is analogous to a result proposed by Cover and El Gamal that combines cooperation and transmission of compressed data
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1663-1667
On the Discrete Memoryless Relay Channel with Relay-Transmitter Feedback
A coding technique is proposed for the discrete memoryless relay channel with noiseless feedback from relay to transmitter. The achievability result we obtain is analogous to a result proposed by Cover and El Gamal that combines cooperation and transmission of compressed data
- Open Access
Superimposed Coded and Uncoded Transmissions of a Gaussian Source over the Gaussian Channel
We propose to send a Gaussian source over an average-power limited additive white Gaussian noise channel by transmitting a linear combination of the source sequence and the result of its quantization using a high dimensional Gaussian vector quantizer. We show that, irrespective of the rate of the vector quantizer (assumed to be fixed and smaller than the channel's capacity), this transmission scheme is asymptotically optimal (as the quantizer's dimension tends to infinity) under the mean squared-error fidelity criterion. This generalizes the classical result of Goblick about the optimality of scaled uncoded transmission, which corresponds to choosing the rate of the vector quantizer as zero, and the classical source-channel separation approach, which corresponds to choosing the rate of the vector quantizer arbitrarily close to the capacity of the channel.
Open AccessSuperimposed Coded and Uncoded Transmissions of a Gaussian Source over the Gaussian Channel
We propose to send a Gaussian source over an average-power limited additive white Gaussian noise channel by transmitting a linear combination of the source sequence and the result of its quantization using a high dimensional Gaussian vector quantizer. We show that, irrespective of the rate of the vector quantizer (assumed to be fixed and smaller than the channel's capacity), this transmission scheme is asymptotically optimal (as the quantizer's dimension tends to infinity) under the mean squared-error fidelity criterion. This generalizes the classical result of Goblick about the optimality of scaled uncoded transmission, which corresponds to choosing the rate of the vector quantizer as zero, and the classical source-channel separation approach, which corresponds to choosing the rate of the vector quantizer arbitrarily close to the capacity of the channel.
- 21 April 2005
- Published by Wiley in European Transactions on Telecommunications
- Vol. 17 (1) , 63-75
Amplitude modulated multipulse PPM for bandwidth‐limited optical systems
Optical direct‐detection systems have been considered before for high‐speed intersatellite links. In this paper, we consider a three‐level amplitude modulated multipulse pulse‐position modulation (PPM) for use in bandwidth limited direct detection optical systems. Specifically, we investigate the capacity, cutoff rate and error probability of this modulation scheme. This facilitates the evaluation of the bandwidth efficiency of the proposed modulation as compared to regular multipulse PPM, which delivers the same throughput and detection quality under the same average‐power constraint. Copyright © 2005 AEIT.
- 21 April 2005
- Published by Wiley in European Transactions on Telecommunications
- Vol. 17 (1) , 63-75
Amplitude modulated multipulse PPM for bandwidth‐limited optical systems
Optical direct‐detection systems have been considered before for high‐speed intersatellite links. In this paper, we consider a three‐level amplitude modulated multipulse pulse‐position modulation (PPM) for use in bandwidth limited direct detection optical systems. Specifically, we investigate the capacity, cutoff rate and error probability of this modulation scheme. This facilitates the evaluation of the bandwidth efficiency of the proposed modulation as compared to regular multipulse PPM, which delivers the same throughput and detection quality under the same average‐power constraint. Copyright © 2005 AEIT.