Michele A. Wigger
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
Michele A. Wigger has a total of 8 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
9 shared publications - Shlomo Shamai
Department of Electrical and Computer Engineering, Technion—Israel Institute of Technology, Haifa 3200003, Israel
4 shared publications Andreas Malar
Department of Information Technology and Electrical Engineering, ETH Zurich, Zurich, Switzerland
1 shared publicationMichael Gastpar
Comput. & Commun. Sci., Ecole Polytech. Fed. de Lausanne, Lausanne, Switzerland
1 shared publication- Shraga I. Bross
Department of Electrical Engineering Technion, Haifa 32000, Israel
1 shared publication - Shraga I. Bross
School of Enginerring Bar Ilan University Israel
1 shared publication
Latest Publications
- 1 April 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 60 (6) , 3218-3237
Constrained Source-Coding With Side Information
The source-coding problem with side information at the decoder is studied subject to a constraint that the encoder-to whom the side information is unavailable-be able to compute the decoder's reconstruction sequence to within some distortion. For discrete memoryless sources and finite single-letter distortion measures, an expression is given for the minimal description rate as a function of the joint law of the source and side information and of the allowed distortions at the encoder and at the decoder. The minimal description rate is also computed for a memoryless Gaussian source with squared-error distortion measures. A solution is also provided to a more general problem where there are more than two distortion constraints and each distortion measure may be a function of three arguments: the source symbol, the encoder's reconstruction symbol, and the decoder's reconstruction symbol.
- 1 April 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 60 (6) , 3218-3237
Constrained Source-Coding With Side Information
The source-coding problem with side information at the decoder is studied subject to a constraint that the encoder-to whom the side information is unavailable-be able to compute the decoder's reconstruction sequence to within some distortion. For discrete memoryless sources and finite single-letter distortion measures, an expression is given for the minimal description rate as a function of the joint law of the source and side information and of the allowed distortions at the encoder and at the decoder. The minimal description rate is also computed for a memoryless Gaussian source with squared-error distortion measures. A solution is also provided to a more general problem where there are more than two distortion constraints and each distortion measure may be a function of three arguments: the source symbol, the encoder's reconstruction symbol, and the decoder's reconstruction symbol.
- 28 October 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 60 (1) , 54-71
Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback
A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than ±1, the gap between the sum-rate that the scheme achieves and the full-cooperation bound vanishes as the signal-to-noise ratio tends to infinity. When the correlation coefficient is -1, the gains afforded by feedback are unbounded and the prelog is doubled. When the correlation coefficient is +1, we demonstrate a dichotomy that if the noise variances are equal, then feedback is useless, and otherwise, feedback affords unbounded rate gains and doubles the prelog. The unbounded feedback gains, however, require perfect (noiseless) feedback. When the feedback links are noisy, the feedback gains are bounded, unless the feedback noise decays to zero sufficiently fast with the signal-to-noise ratio. Extensions to more receivers are also discussed as is the memoryless Gaussian interference channel with feedback.
- 28 October 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 60 (1) , 54-71
Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback
A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than ±1, the gap between the sum-rate that the scheme achieves and the full-cooperation bound vanishes as the signal-to-noise ratio tends to infinity. When the correlation coefficient is -1, the gains afforded by feedback are unbounded and the prelog is doubled. When the correlation coefficient is +1, we demonstrate a dichotomy that if the noise variances are equal, then feedback is useless, and otherwise, feedback affords unbounded rate gains and doubles the prelog. The unbounded feedback gains, however, require perfect (noiseless) feedback. When the feedback links are noisy, the feedback gains are bounded, unless the feedback noise decays to zero sufficiently fast with the signal-to-noise ratio. Extensions to more receivers are also discussed as is the memoryless Gaussian interference channel with feedback.
- Open Access
On the Capacity of Free-Space Optical Intensity Channels
New upper and lower bounds are presented on the capacity of the free-space optical intensity channel. This channel is characterized by inputs that are nonnegative (representing the transmitted optical intensity) and by outputs that are corrupted by additive white Gaussian noise (because in free space the disturbances arise from many independent sources). Due to battery and safety reasons the inputs are simultaneously constrained in both their average and peak power. For a fixed ratio of the average power to the peak power the difference between the upper and the lower bounds tends to zero as the average power tends to infinity, and the ratio of the upper and lower bounds tends to one as the average power tends to zero. The case where only an average-power constraint is imposed on the input is treated separately. In this case, the difference of the upper and lower bound tends to 0 as the average power tends to infinity, and their ratio tends to a constant as the power tends to zero.
Open AccessOn the Capacity of Free-Space Optical Intensity Channels
New upper and lower bounds are presented on the capacity of the free-space optical intensity channel. This channel is characterized by inputs that are nonnegative (representing the transmitted optical intensity) and by outputs that are corrupted by additive white Gaussian noise (because in free space the disturbances arise from many independent sources). Due to battery and safety reasons the inputs are simultaneously constrained in both their average and peak power. For a fixed ratio of the average power to the peak power the difference between the upper and the lower bounds tends to zero as the average power tends to infinity, and the ratio of the upper and lower bounds tends to one as the average power tends to zero. The case where only an average-power constraint is imposed on the input is treated separately. In this case, the difference of the upper and lower bound tends to 0 as the average power tends to infinity, and their ratio tends to a constant as the power tends to zero.
- 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.
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 325-330
On Cognitive Interference Networks
We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each transmitter is cognizant of the message it wishes to convey to its corresponding receiver and also of the messages that a subset of the other transmitters wish to send. The receivers are assumed not to be able to cooperate in any way so that they must base their decision on the signal they receive only. We focus on the network's pre-log, which is denned as the limiting ratio of the sum-rate capacity to half the logarithm of the transmitted power. We present both upper and lower bounds on the network's pre-log. The lower bounds are based on a linear partial-cancellation scheme which entails linearly transforming Gaussian codebooks so as to eliminate the interference in a subset of the receivers. Inter alias, the bounds give a complete characterization of the networks and side-information settings that result in a full pre-log, i.e., in a pre-log that is equal to the number of transmitters (and receivers) as well as a complete characterization of networks whose pre-log is equal to the full pre-log minus one. They also fully characterize networks where the full pre-log can only be achieved if each transmitter knows the messages of all users, i.e., when the side-information is "full".
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 325-330
On Cognitive Interference Networks
We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each transmitter is cognizant of the message it wishes to convey to its corresponding receiver and also of the messages that a subset of the other transmitters wish to send. The receivers are assumed not to be able to cooperate in any way so that they must base their decision on the signal they receive only. We focus on the network's pre-log, which is denned as the limiting ratio of the sum-rate capacity to half the logarithm of the transmitted power. We present both upper and lower bounds on the network's pre-log. The lower bounds are based on a linear partial-cancellation scheme which entails linearly transforming Gaussian codebooks so as to eliminate the interference in a subset of the receivers. Inter alias, the bounds give a complete characterization of the networks and side-information settings that result in a full pre-log, i.e., in a pre-log that is equal to the number of transmitters (and receivers) as well as a complete characterization of networks whose pre-log is equal to the full pre-log minus one. They also fully characterize networks where the full pre-log can only be achieved if each transmitter knows the messages of all users, i.e., when the side-information is "full".
- Open Access
On Cognitive Interference Networks
We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each transmitter is cognizant of the message it wishes to convey to its corresponding receiver and also of the messages that a subset of the other transmitters wish to send. The receivers are assumed not to be able to cooperate in any way so that they must base their decision on the signal they receive only. We focus on the network's pre-log, which is defined as the limiting ratio of the sum-rate capacity to half the logarithm of the transmitted power. We present both upper and lower bounds on the network's pre-log. The lower bounds are based on a linear partial-cancellation scheme which entails linearly transforming Gaussian codebooks so as to eliminate the interference in a subset of the receivers. Inter alias, the bounds give a complete characterization of the networks and side-information settings that result in a full pre-log, i.e., in a pre-log that is equal to the number of transmitters (and receivers) as well as a complete characterization of networks whose pre-log is equal to the full pre-log minus one. They also fully characterize networks where the full pre-log can only be achieved if each transmitter knows the messages of all users, i.e., when the side-information is "full".
Open AccessOn Cognitive Interference Networks
We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each transmitter is cognizant of the message it wishes to convey to its corresponding receiver and also of the messages that a subset of the other transmitters wish to send. The receivers are assumed not to be able to cooperate in any way so that they must base their decision on the signal they receive only. We focus on the network's pre-log, which is defined as the limiting ratio of the sum-rate capacity to half the logarithm of the transmitted power. We present both upper and lower bounds on the network's pre-log. The lower bounds are based on a linear partial-cancellation scheme which entails linearly transforming Gaussian codebooks so as to eliminate the interference in a subset of the receivers. Inter alias, the bounds give a complete characterization of the networks and side-information settings that result in a full pre-log, i.e., in a pre-log that is equal to the number of transmitters (and receivers) as well as a complete characterization of networks whose pre-log is equal to the full pre-log minus one. They also fully characterize networks where the full pre-log can only be achieved if each transmitter knows the messages of all users, i.e., when the side-information is "full".
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2201-2205
A Linear Interference Network with Local Side-Information
For an interference network where receiver k receives the sum of the signal transmitted by Transmitter k and a scaled version of the signal transmitted by Transmitter k - 1 corrupted by Gaussian noise we compute the pre-log of the sum-rate capacity for the case where each transmitter has side- information consisting of the messages to be sent by its J predecessors.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2201-2205
A Linear Interference Network with Local Side-Information
For an interference network where receiver k receives the sum of the signal transmitted by Transmitter k and a scaled version of the signal transmitted by Transmitter k - 1 corrupted by Gaussian noise we compute the pre-log of the sum-rate capacity for the case where each transmitter has side- information consisting of the messages to be sent by its J predecessors.
- 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 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 203-207
On the Gaussian MAC with Imperfect Feedback
New achievable regions are derived for the two-user additive white Gaussian multiple-access channel (MAC) with noisy feedback. We treat the general scenario as well as the symmetric setting and the partial feedback setting. Unlike previously-known achievable regions, the new regions yield sum-rates that are strictly larger than the no-feedback sum-rate capacity, irrespective of the (positive & finite) Gaussian feedback-noise variance. In the symmetric setting, our proposed coding scheme achieves sum-rates that converge to Ozarow's noiseless-feedback sum-rate capacity as the feedback-noise variance tends to zero. In the partial-feedback setting, where one of the transmitters has a perfect feedback link and the other has no feedback at all, we show that the Cover-Leung region (which was originally proposed for perfect-feedback channels but which was later shown to be achievable also with partial feedback) is not tight. This answers in the negative the question posed by van der Meulen as to whether the Cover-Leung region is tight for the Gaussian multiple-access channel with partial feedback. We also propose a coding scheme for the case where the receiver is cognizant of the realization of the noise on the feedback-link.
- 1 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 203-207
On the Gaussian MAC with Imperfect Feedback
New achievable regions are derived for the two-user additive white Gaussian multiple-access channel (MAC) with noisy feedback. We treat the general scenario as well as the symmetric setting and the partial feedback setting. Unlike previously-known achievable regions, the new regions yield sum-rates that are strictly larger than the no-feedback sum-rate capacity, irrespective of the (positive & finite) Gaussian feedback-noise variance. In the symmetric setting, our proposed coding scheme achieves sum-rates that converge to Ozarow's noiseless-feedback sum-rate capacity as the feedback-noise variance tends to zero. In the partial-feedback setting, where one of the transmitters has a perfect feedback link and the other has no feedback at all, we show that the Cover-Leung region (which was originally proposed for perfect-feedback channels but which was later shown to be achievable also with partial feedback) is not tight. This answers in the negative the question posed by van der Meulen as to whether the Cover-Leung region is tight for the Gaussian multiple-access channel with partial feedback. We also propose a coding scheme for the case where the receiver is cognizant of the realization of the noise on the feedback-link.
- Open Access
On the Capacity of Fading MIMO Broadcast Channels with Imperfect Transmitter Side-Information
A fading broadcast channel is considered where the transmitter employs two antennas and each of the two receivers employs a single receive antenna. It is demonstrated that even if the realization of the fading is precisely known to the receivers, the high signal-to-noise (SNR) throughput is greatly reduced if, rather than knowing the fading realization \emph{precisely}, the trasmitter only knows the fading realization \emph{approximately}. The results are general and are not limited to memoryless Gaussian fading.
Open AccessOn the Capacity of Fading MIMO Broadcast Channels with Imperfect Transmitter Side-Information
A fading broadcast channel is considered where the transmitter employs two antennas and each of the two receivers employs a single receive antenna. It is demonstrated that even if the realization of the fading is precisely known to the receivers, the high signal-to-noise (SNR) throughput is greatly reduced if, rather than knowing the fading realization \emph{precisely}, the trasmitter only knows the fading realization \emph{approximately}. The results are general and are not limited to memoryless Gaussian fading.