Shlomo Shamai

Shlomo Shamai
Technion - Israel Institute of Technology | technion · Faculty of Electrical Engineering

About

934
Publications
50,074
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
40,940
Citations
Introduction

Publications

Publications (934)
Article
Full-text available
A double-sided variant of the information bottleneck method is considered. Let (X,Y) be a bivariate source characterized by a joint pmf PXY. The problem is to find two independent channels PU|X and PV|Y (setting the Markovian structure U→X→Y→V), that maximize I(U;V) subject to constraints on the relevant mutual information expressions: I(U;X) and I...
Preprint
The information bottleneck problem (IB) of jointly stationary Gaussian sources is considered. A water-filling solution for the IB rate is given in terms of its SNR spectrum and whose rate is attained via frequency domain test-channel realization. A time-domain realization of the IB rate, based on linear prediction, is also proposed, which lends its...
Preprint
Full-text available
Modern computationally-heavy applications are often time-sensitive, demanding distributed strategies to accelerate them. On the other hand, distributed computing suffers from the bottleneck of slow workers in practice. Distributed coded computing is an attractive solution that adds redundancy such that a subset of distributed computations suffices...
Preprint
This paper considers the distributed information bottleneck (D-IB) problem for a primitive Gaussian diamond channel with two relays and Rayleigh fading. Due to the bottleneck constraint, it is impossible for the relays to inform the destination node of the perfect channel state information (CSI) in each realization. To evaluate the bottleneck rate,...
Preprint
Full-text available
Wyner's soft-handoff network is considered where transmitters simultaneously send messages of enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC) services. Due to the low-latency requirements, the URLLC messages are transmitted over fewer channel uses compared to the eMBB messages. To improve the reliability of the...
Preprint
We formulate and analyze the compound information bottleneck programming. In this problem, a Markov chain $ \mathsf{X} \rightarrow \mathsf{Y} \rightarrow \mathsf{Z} $ is assumed with fixed marginal distributions $\mathsf{P}_{\mathsf{X}}$ and $\mathsf{P}_{\mathsf{Y}}$, and the mutual information between $ \mathsf{X} $ and $ \mathsf{Z} $ is sought to...
Preprint
A diamond network is considered in which the central processor is connected, via backhaul noiseless links, to multiple conferencing base stations, which communicate with a single user over a multiple access channel. We propose coding techniques along with lower and upper bounds on the capacity. Our achievability scheme uses a common cloud coding st...
Article
Full-text available
Fifth generation mobile communication systems (5G) have to accommodate both Ultra-Reliable Low-Latency Communication (URLLC) and enhanced Mobile Broadband (eMBB) services. While eMBB applications support high data rates, URLLC services aim at guaranteeing low-latencies and high-reliabilities. eMBB and URLLC services are scheduled on the same freque...
Preprint
Full-text available
Fifth generation mobile communication systems (5G) have to accommodate both Ultra-Reliable Low-Latency Communication (URLLC) and enhanced Mobile Broadband (eMBB) services. While, eMBB applications support high data rates, URLLC services aim at guaranteeing low-latencies and high-reliabilities. eMBB and URLLC services are scheduled on the same frequ...
Preprint
Rate-Splitting Multiple Access (RSMA) for multi-user downlink operates by splitting the message for each user equipment (UE) into a private message and a set of common messages, which are simultaneously transmitted by means of superposition coding. The RSMA scheme can enhance throughput and connectivity as compared to conventional multiple access t...
Preprint
Full-text available
A common way of characterizing minimax estimators in point estimation is by moving the problem into the Bayesian estimation domain and finding a least favorable prior distribution. The Bayesian estimator induced by a least favorable prior, under mild conditions, is then known to be minimax. However, finding least favorable distributions can be chal...
Preprint
Full-text available
For data streaming applications, existing solutions are not yet able to close the gap between high data rates and low delay. This work considers the problem of data streaming under mixed delay constraints over a single communication channel with delayed feedback. We propose a novel layered adaptive causal random linear network coding (LAC-RLNC) app...
Article
Full-text available
Non-orthogonal multiple access (NOMA) is a promising technology for future beyond-5G wireless networks, whose fundamental information-theoretic limits are yet to be fully explored. Considering regular sparse code-domain NOMA (with a fixed and finite number of orthogonal resources allocated to any designated user and vice versa), this paper extends...
Preprint
Immersive video, such as virtual reality (VR) and multi-view videos, is growing in popularity. Its wireless streaming is an instance of general multicast, extending conventional unicast and multicast, whose effective design is still open. This paper investigates general rate splitting for general multicast. Specifically, we consider a multi-carrier...
Preprint
Immersive video, such as virtual reality (VR) and multi-view videos, is growing in popularity. Its wireless streaming is an instance of general multicast, extending conventional unicast and multicast, whose effective design is still open. This paper investigates the optimization of general rate splitting with linear beamforming for general multicas...
Article
In this paper, we consider the uplink multiuser load-modulated array (LMA) multiple-input multiple-output (MIMO) communication system, where multiple users transmit the phase modulation on hypersphere (PMH) signals to a base station (BS). To reduce the detection complexity, we propose a low-complexity detection scheme based on a ball-tree (BT) stru...
Article
Immersive video, such as virtual reality (VR) and multi-view videos, is growing in popularity. Its wireless streaming is an instance of general multicast, extending conventional unicast and multicast, whose effective design is still open. This paper investigates general rate splitting for general multicast. Specifically, we consider a multi-carrier...
Preprint
Broadcast/multicast communication systems are typically designed to optimize the outage rate criterion, which neglects the performance of the fraction of clients with the worst channel conditions. Targeting ultra-reliable communication scenarios, this paper takes a complementary approach by introducing the conditional value-at-risk (CVaR) rate as t...
Article
We present a condition for 1=2 degree of freedom for each user in constant K-user single-antenna interference channels. This condition is sufficient for all and necessary for almost all channel matrices. Moreover, it applies to all channel topologies, i.e., to fully-connected channels as well as channels that have individual links absent, reflected...
Article
For a continuous-time additive white Gaussian noise (AWGN) channel with possible feedback, it has been shown that as sampling gets infinitesimally fine, the mutual information of the associative discrete-time channels converges to that of the original continuous-time channel. We give in this paper more quantitative strengthenings of this result, wh...
Conference Paper
We consider the capacity of a band-limited additive white Gaussian noise channel, with bipolar inputs, a framework motivated by power-efficient faster than Nyquist signaling. We improve the available Ozarow-Wyner-Ziv (OWZ) lower bound on capacity by introducing a new communication scheme, exhibiting two advantages over the OWZ approach based on pea...
Conference Paper
We investigate the special case of diamond relay comprising a Gaussian channel with identical frequency response between the user and the relays and fronthaul links with limited rate from the relays to the destination. We use the oblivious compress and forward (CF) with distributed compression and decode and forward (DF) where each relay decodes th...
Preprint
We study two dual settings of information processing. Let $ \mathsf{Y} \rightarrow \mathsf{X} \rightarrow \mathsf{W} $ be a Markov chain with fixed joint probability mass function $ \mathsf{P}_{\mathsf{X}\mathsf{Y}} $ and a mutual information constraint on the pair $ (\mathsf{W},\mathsf{X}) $. For the first problem, known as Information Bottleneck,...
Article
Full-text available
We study communication systems over band-limited Additive White Gaussian Noise (AWGN) channels in which the transmitter’s output is constrained to be symmetric binary (bipolar). We improve the available Ozarow-Wyner-Ziv (OWZ) lower bound on capacity which is based on peak-power constrained pulse-amplitude modulation, by introducing new schemes (ach...
Article
Full-text available
This paper analyzes the multiplexing gains (MG) for simultaneous transmission of delay-sensitive and delay-tolerant data over interference networks. In the considered model, only delay-tolerant data can profit from coordinated multipoint (CoMP) transmission or reception techniques, because delay-sensitive data has to be transmitted without further...
Article
This work considers a Poisson noise channel with an amplitude constraint. It is well-known that the capacity-achieving input distribution for this channel is discrete with finitely many points. We sharpen this result by introducing upper and lower bounds on the number of mass points. Concretely, an upper bound of order Alog2(A) and a lower bound of...
Preprint
Meta-learning, or learning to learn, offers a principled framework for few-shot learning. It leverages data from multiple related learning tasks to infer an inductive bias that enables fast adaptation on a new task. The application of meta-learning was recently proposed for learning how to demodulate from few pilots. The idea is to use pilots recei...
Article
A communication link aided by a reconfigurable intelligent surface (RIS) is studied in which the transmitter can control the state of the RIS via a finite-rate control link. Channel state information (CSI) is acquired at the receiver based on pilot-assisted channel estimation, and it may or may not be shared with the transmitter. Considering quasi-...
Article
We consider the use of the well-known dual capacity bounding technique for deriving upper bounds on the capacity of indecomposable finite-state channels (FSCs) with finite input and output alphabets. In this technique, capacity upper bounds are obtained by choosing suitable test distributions on the sequence of channel outputs. We propose test dist...
Conference Paper
We consider the use of the well-known dual capacity bounding technique for deriving upper bounds on the capacity of indecomposable finite-state channels (FSCs) with finite input and output alphabets. In this technique, capacity upper bounds are obtained by choosing suitable test distributions on the sequence of channel outputs. We propose test dist...
Preprint
Full-text available
This paper analyses the multiplexing gain (MG) achievable over Wyner's symmetric network with random user activity and random arrival of mixed-delay traffic. The mixed-delay traffic is composed of delay-tolerant traffic and delay-sensitive traffic where only the former can benefit from transmitter and receiver cooperation since the latter is subjec...
Preprint
Full-text available
We study communication systems over band-limited Additive White Gaussian Noise (AWGN) channels in which the transmitter output is constrained to be symmetric binary (bi-polar). In this work we improve the original Ozarov-Wyner-Ziv (OWZ) lower bound on capacity by introducing a new achievability scheme with two advantages over the studied OWZ scheme...
Preprint
Full-text available
This work considers a Poisson noise channel with an amplitude constraint. It is well-known that the capacity-achieving input distribution for this channel is discrete with finitely many points. We sharpen this result by introducing upper and lower bounds on the number of mass points. In particular, the upper bound of order $\mathsf{A} \log^2(\maths...
Article
Full-text available
This paper considers the information bottleneck (IB) problem of a Rayleigh fading multiple-input multiple-out (MIMO) channel with an oblivious relay. The relay is constrained to operating without knowledge of the codebooks, i.e., it performs oblivious processing. Moreover, due to the bottleneck constraint, it is impossible for the relay to inform t...
Article
Mobile cloud and edge computing protocols make it possible to offer computationally heavy applications to mobile devices via computational offloading from devices to nearby edge servers or more powerful, but remote, cloud servers. Previous work assumed that computational tasks can be fractionally offloaded at both cloud processor (CP) and at a loca...
Preprint
Full-text available
Consider a channel ${\bf Y}={\bf X}+ {\bf N}$ where ${\bf X}$ is an $n$-dimensional random vector, and ${\bf N}$ is a Gaussian vector with a covariance matrix ${\bf \mathsf{K}}_{\bf N}$. The object under consideration in this paper is the conditional mean of ${\bf X}$ given ${\bf Y}={\bf y}$, that is ${\bf y} \to E[{\bf X}|{\bf Y}={\bf y}]$. Severa...
Preprint
Mobile cloud and edge computing protocols make it possible to offer computationally heavy applications to mobile devices via computational offloading from devices to nearby edge servers or more powerful, but remote, cloud servers. Previous work assumed that computational tasks can be fractionally offloaded at both cloud processor (CP) and at a loca...
Preprint
Full-text available
This paper considers the information bottleneck (IB) problem of a Rayleigh fading multiple-input multiple-out (MIMO) channel with an oblivious relay. The relay is constrained to operate without knowledge of the codebooks, i.e., it performs oblivious processing. Moreover, due to the bottleneck constraint, it is impossible for the relay to inform the...
Preprint
Full-text available
This paper considers the information bottleneck (IB) problem of a Rayleigh fading multiple-input multiple-out (MIMO) channel. Due to the bottleneck constraint, it is impossible for the oblivious relay to inform the destination node of the perfect channel state information (CSI) in each channel realization. To evaluate the bottleneck rate, we provid...
Preprint
We investigate the special case of diamond relay comprising a Gaussian channel with identical frequency response between the user and the relays and fronthaul links with limited rate from the relays to the destination. We use the oblivious compress and forward (CF) with distributed compression and decode and forward (DF) where each relay decodes th...
Preprint
Full-text available
Reconfigurable intelligent surfaces (RISs) are typically used in multi-user systems to mitigate interference among active transmitters. In contrast, this paper studies a setting with a conventional active encoder as well as a passive encoder that modulates the reflection pattern of the RIS. The RIS hence serves the dual purpose of improving the rat...
Preprint
Full-text available
This paper reviews the theoretical and practical principles of the broadcast approach to communication over state-dependent channels and networks in which the transmitters have access to only the probabilistic description of the time-varying states while remaining oblivious to their instantaneous realizations. When the temporal variations are frequ...
Article
Full-text available
In this paper we review the theoretical and practical principles of the broadcast approach to communication over state-dependent channels and networks in which the transmitters have access to only the probabilistic description of the time-varying states while remaining oblivious to their instantaneous realizations. When the temporal variations are...
Preprint
This paper analyzes the multiplexing gains (MG) for simultaneous transmission of delay-sensitive and delay-tolerant data over interference networks. In the considered model, only delay-tolerant data can profit from coordinated multipoint (CoMP) transmission or reception techniques, because delay-sensitive data has to be transmitted without further...
Preprint
Full-text available
A communication link aided by a reconfigurable intelligent surface (RIS) is studied in which the transmitter can control the state of the RIS via a finite-rate control link. Channel state information (CSI) is acquired at the receiver based on pilot-assisted channel estimation, and it may or may not be shared with the transmitter. Considering quasi-...
Article
This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel without transmitter channel state information (CSI), which is connected to a limited capacity reliable link, known as the bottleneck channel. Two main approaches are considered, the first is an oblivious approach, where the sampled...
Article
In many information-theoretic channel coding problems, adding an input cost constraint to the operational setup amounts to restricting the optimization domain in the capacity formula. This paper shows that, in contrast to common belief, such a simple modification does not hold for the cost-constrained (CC) wiretap channel (WTC). The secrecy-capacit...
Article
Full-text available
This book, composed of the collection of papers that have appeared in the Special Issue of theEntropy journal dedicated to “Information Theory for Data Communications and Processing”,reflects, in its eleven chapters, novel contributions based on the firm basic grounds of informationtheory. The book chapters [1–11] address timely theoretical and pra...
Article
Effective interference management in the multiuser interference channel strongly hinges on the channel state information’s availability at the transmitters (CSIT). In a broad range of emerging large-scale and distributed networks (e.g., the Internet of Things), acquiring the CSIT is prohibitive due to the extensive information exchange that it impo...
Preprint
The feedback capacities of the Gaussian multiple-access channel (GMAC) and the GMAC with noncausal channel state information at the transmitters (NCSIT) are achieved by Ozarow's Schalkwijk-Kailath (SK) type feedback scheme and its extension (also called Rosenzweig's feedback scheme), respectively. In this paper, first, we show that the above Ozarow...
Article
Full-text available
Reconfigurable intelligent surfaces (RISs) have the potential of realizing the emerging concept of smart radio environments by leveraging the unique properties of metamaterials and large arrays of inexpensive antennas. In this article, we discuss the potential applications of RISs in wireless networks that operate at high-frequency bands, e.g., mil...
Preprint
We present a necessary and sufficient condition for $1/2$ degree of freedom for each user in constant $K$-user single-antenna interference channels. This condition applies to all channel topologies, i.e., to fully-connected channels as well as channels that have individual links absent, reflected by corresponding zeros in the channel matrix. Moreov...
Preprint
This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel without transmitter channel state information (CSI), which is connected to a limited capacity reliable link, known as the bottleneck channel. Two main approaches are considered, the first is an oblivious approach, where the sampled...
Preprint
Over-the-air computation (AirComp) is an efficient solution to enable federated learning on wireless channels. AirComp assumes that the wireless channels from different devices can be controlled, e.g., via transmitter-side phase compensation, in order to ensure coherent on-air combining. Intelligent reflecting surfaces (IRSs) can provide an alterna...
Preprint
In many information-theoretic communication problems, adding an input cost constraint to the operational setup amounts to restricting the optimization domain in the capacity formula. This paper shows that, in contrast to common belief, such a simple modification does not hold for the cost-constrained (CC) wiretap channel (WTC). The secrecy-capacity...