arXiv subjects

Natasha Devroye

Publications and source records attributed to Natasha Devroye.

At least 19 recordsLinked to original sources

arXiv2025

Deep Broadcast Feedback Codes

Recent advances in deep learning for wireless communications have renewed interest in channel output feedback codes. In the additive white Gaussian broadcast channel with feedback (AWGN-BC-F), feedback can expand the channel capacity region beyond that of the no-feedback case, but linear analytical codes perform poorly with even small amounts of feedback noise. Deep learning enables the design of nonlinear feedback codes that are more resilient to feedback noise. We extend single-user learned feedback codes for the AWGN channel to the broadcast setting, and compare their performance with existing analytical codes, as well as a newly proposed analytical scheme inspired by the learned schemes. Our results show that, for a fixed code rate, learned codes outperform analytical codes at the same blocklength by using power-efficient nonlinear structures and are more robust to feedback noise. Analytical codes scale more easily to larger blocklengths with perfect feedback and surpass learned codes at higher SNRs.

eess.SP↗

arXiv2025

Feedback Lunch: Learned Feedback Codes for Secure Communications

We consider reversely-degraded secure-communication channels, for which the secrecy capacity is zero if there is no channel feedback. Specifically, we focus on a seeded modular code design for the block-fading Gaussian wiretap channel with channel-output feedback, combining universal hash functions for security and learned feedback-based codes for reliability. The trade-off between communication reliability and information leakage is studied, illustrating that feedback enables agreeing on a secret key shared between legitimate parties, overcoming the security advantage of the eavesdropper. Our findings motivate code designs for sensing-assisted secure communications in the context of integrated sensing and communication (ISAC).

cs.IT↗

arXiv2025

On Estimation of Angles of Arrival in Monostatic ISAC Without Instantaneous Transmit CSI

This paper explores the fundamental limits of Integrated Sensing and Communication (ISAC) in a more realistic setting compared to previous literature when the Base Staion (BS) has only statistical CSI of the communication user rather than full CSI. We analyze a monostatic setting where the BS performs multi-target Angle of Arrival (AoA) estimation while simultaneously communicating with one of the targets. We assume that the BS has statistical CSI about all AoAs, with less uncertainty in the AoA of the communication receiver. The communication receiver is assumed to have perfect CSI. Utilizing a Bayesian Cram\'er-Rao Bound (BCRB) framework to characterize the fundamental limits of sensing under minimum mean square error (MMSE) criteria, we derive achievable BCRB-rate trade-off regions. Our approach introduces a number of transmission strategies that share power across sensing and communication beams over a coherence time. Our analysis reveals that beam allocation strategies leveraging the principal eigenvectors of the target-specific sensing matrices minimize individual AoA estimation errors, while strategies balancing sensing and communication directions optimize joint estimation performance at the cost of individual accuracy. We demonstrate that leveraging updated BCRB-based sensing information for the communication receiver, due to its lower channel uncertainty, enables significantly improved communication rates.

cs.IT↗

arXiv2024

Miniature UAV-Aided Cooperative THz Networks with Reconfigurable Energy Harvesting Holographic Surfaces

This paper focuses on enhancing the energy efficiency (EE) of a cooperative network that features a miniature unmanned aerial vehicle (UAV) operating at terahertz (THz) frequencies and equipped with holographic surfaces to improve network performance. Unlike traditional reconfigurable intelligent surfaces (RIS), which serve as passive relays for signal reflection, this work introduces a novel concept: energy harvesting (EH) using reconfigurable holographic surfaces (RHS). These surfaces provide more powerful and focused energy delivery during wireless power transfer than RIS and are mounted on the miniature UAV. In this system, a source node enables the UAV to simultaneously receive both information and energy signals, with the harvested energy powering data transmission to a specific destination. The EE optimization problem involves adjusting non-orthogonal multiple access (NOMA) power coefficients and the UAV's flight path while accounting for the unique characteristics of the THz channel. The problem is solved in two stages to maximize EE and meet a target transmission rate. The UAV trajectory is optimized using a successive convex approximation (SCA) method, followed by the adjustment of NOMA power coefficients through a quadratic transform technique. Simulation results demonstrate the effectiveness of the proposed algorithm, showing significant improvements over baseline methods.

eess.SP↗

arXiv2024

Learned codes for broadcast channels with feedback

We focus on designing error-correcting codes for the symmetric Gaussian broadcast channel with feedback. Feedback not only expands the capacity region of the broadcast channel but also enhances transmission reliability. In this work, we study the construction of learned finite blocklength codes for broadcast channels with feedback. Learned error-correcting codes, in which both the encoder and decoder are jointly trained, have shown impressive performance in point-to-point channels, particularly with noisy feedback. However, few learned schemes exist for multi-user channels. Here, we develop a lightweight code for the broadcast channel with feedback that performs well and operates effectively at short blocklengths.

cs.IT↗

arXiv2024

Higher-order Interpretations of Deepcode, a Learned Feedback Code

We present an interpretation of Deepcode, a learned feedback code that showcases higher-order error correction relative to an earlier interpretable model. By interpretation, we mean succinct analytical encoder and decoder expressions (albeit with learned parameters) in which the role of feedback in achieving error correction is easy to understand. By higher-order, we mean that longer sequences of large noise values are acted upon by the encoder (which has access to these through the feedback) and used in error correction at the decoder in a two-stage decoding process.

cs.IT↗

arXiv2024

On the Response Entropy of APUFs

A Physically Unclonable Function (PUF) is a hardware security primitive used for authentication and key generation. It takes an input bit-vector challenge and produces a single-bit response, resulting in a challenge-response pair (CRP). The truth table of all challenge-response pairs of each manufactured PUF should look different due to inherent manufacturing randomness, forming a digital fingerprint. A PUF's entropy (the entropy of all the responses, taken over the manufacturing randomness and uniformly selected challenges) has been studied before and is a challenging problem. Here we explore a related notion -- the response entropy, which is the entropy of an arbitrary response given knowledge of one (and two) other responses. This allows us to explore how knowledge of some CRP(s) impacts the ability to guess another response. The Arbiter PUF (APUF) is a well-known PUF architecture based on accumulated delay differences between two paths. In this paper, we obtain in closed form the probability mass function of any arbitrary response given knowledge of one or two other arbitrary CRPs for the APUF architecture. This allows us to obtain the conditional response entropy and then to define and obtain the size of the entropy bins (challenge sets with the same conditional response entropy) given knowledge of one or two CRPs. All of these results depend on the probability that two different challenge vectors yield the same response, termed the response similarity of those challenges. We obtain an explicit closed form expression for this. This probability depends on the statistical correlations induced by the PUF architecture together with the specific known and to-be-guessed challenges. As a by-product, we also obtain the optimal (minimizing probability of error) predictor of an unknown challenge given access to one (or two) challenges and the associated predictability.

cs.CR↗

arXiv2024

Interpreting Deepcode, a learned feedback code

Deep learning methods have recently been used to construct non-linear codes for the additive white Gaussian noise (AWGN) channel with feedback. However, there is limited understanding of how these black-box-like codes with many learned parameters use feedback. This study aims to uncover the fundamental principles underlying the first deep-learned feedback code, known as Deepcode, which is based on an RNN architecture. Our interpretable model based on Deepcode is built by analyzing the influence length of inputs and approximating the non-linear dynamics of the original black-box RNN encoder. Numerical experiments demonstrate that our interpretable model -- which includes both an encoder and a decoder -- achieves comparable performance to Deepcode while offering an interpretation of how it employs feedback for error correction.

cs.IT↗

arXiv2023

Active learning for fast and slow modeling attacks on Arbiter PUFs

Modeling attacks, in which an adversary uses machine learning techniques to model a hardware-based Physically Unclonable Function (PUF) pose a great threat to the viability of these hardware security primitives. In most modeling attacks, a random subset of challenge-response-pairs (CRPs) are used as the labeled data for the machine learning algorithm. Here, for the arbiter-PUF, a delay based PUF which may be viewed as a linear threshold function with random weights (due to manufacturing imperfections), we investigate the role of active learning in Support Vector Machine (SVM) learning. We focus on challenge selection to help SVM algorithm learn ``fast'' and learn ``slow''. Our methods construct challenges rather than relying on a sample pool of challenges as in prior work. Using active learning to learn ``fast'' (less CRPs revealed, higher accuracies) may help manufacturers learn the manufactured PUFs more efficiently, or may form a more powerful attack when the attacker may query the PUF for CRPs at will. Using active learning to select challenges from which learning is ``slow'' (low accuracy despite a large number of revealed CRPs) may provide a basis for slowing down attackers who are limited to overhearing CRPs.

cs.CR↗

arXiv2022

On Second Order Rate Regions for the Static Scalar Gaussian Broadcast Channel

This paper considers the single antenna, static Gaussian broadcast channel in the finite blocklength regime. Second order achievable and converse rate regions are presented. Both a global reliability requirement and per-user reliability requirements are considered. The two-user case is analyzed in detail, and generalizations to the $K$-user case are also discussed. The largest second order achievable region presented here requires both superposition and rate splitting in the code construction, as opposed to the (infinite blocklength, first order) capacity region which does not require rate splitting. Indeed, the finite blocklength penalty causes superposition alone to under-perform other coding techniques in some parts of the region. In the two-user case with per-user reliability requirements, the capacity achieving superposition coding order (with the codeword of the user with the smallest SNR as cloud center) does not necessarily gives the largest second order region. Instead, the message of the user with the smallest point-to-point second order capacity should be encoded in the cloud center in order to obtain the largest second order region for the proposed scheme.

cs.IT↗

arXiv2021

Capacity and Stability Regions for Layered Packet Erasure Broadcast Channels with Feedback

This paper focuses on the Layered Packet Erasure Broadcast Channel (LPE-BC) with Channel Output Feedback (COF) available at the transmitter. The LPE-BC is a high-SNR approximation of the fading Gaussian BC recently proposed by Tse and Yates, who characterized the capacity region for any number of users and any number of layers when there is no COF. This paper provides a comparative overview of this channel model along the following lines: First, inner and outer bounds to the capacity region (set of achievable rates with backlogged arrivals) are presented: a) a new outer bound based on the idea of the physically degraded broadcast channel, and b) an inner bound of the LPE-BC with COF for the case of two users and any number of layers. Next, an inner bound on the stability region (set of exogenous arrival rates for which packet arrival queues are stable) for the same model is derived. The capacity region inner bound generalizes past results for the two-user erasure BC, which is a special case of the LPE-BC with COF with only one layer. The novelty lies in the use of inter-user and inter-layer network coding retransmissions (for those packets that have only been received by the unintended user), where each random linear combination may involve packets intended for any user originally sent on any of the layers. For the case of $K = 2$ users and $Q \geq 1$ layers, the inner bounds to the capacity region and the stability region coincide; both strategically employ the novel retransmission protocol. For the case of $Q = 2$ layers, sufficient conditions are derived by Fourier-Motzkin elimination for the inner bound on the stability region to coincide with the capacity outer bound, thus showing that in those cases the capacity and stability regions coincide.

cs.IT↗

arXiv2019

On Code Design for Wireless Channels with Additive Radar Interference

This paper considers the problem of code design for a channel where communications and radar systems coexist, modeled as having both Additive White Gaussian Noise (AWGN) and Additive Radar Interference (ARI). The issue of how to adapt or re-design convolutional codes (decoded by the Viterbi algorithm) and LDPC codes (decoded by the sum-product algorithm and optimized by using the EXIT chart method) to effectively handle the overall non-Gaussian ARI noise is investigated. A decoding metric is derived from the non-Gaussian ARI channel transition probability as a function of the Signal-to-Noise Ratio (SNR) and Interference-to-Noise Ratio (INR). Two design methodologies are benchmarked against a baseline "unaltered legacy system", where a code designed for AWGN-only noise, but used on the non-Gaussian ARI channel, is decoded by using the AWGN-only metric (i.e., as if INR is zero). The methodologies are: M1) codes designed for AWGN-only noise, but decoded with the new metric that accounts for both SNR and INR; and M2) codes optimized for the overall non-Gaussian ARI channel. Both methodologies give better average Bit Error Rate (BER) in the high INR regime compared to the baseline. In the low INR regime, both methodologies perform as the baseline since in this case the radar interference is weak. Interestingly, the performance improvement of M2 over M1 is minimal. In practice, this implies that specifications in terms of channel error correcting codes for commercially available wireless systems need not be changed, and that it suffices to use an appropriate INR-based decoding metric in order to effectively cope with the ARI.

cs.IT↗

arXiv2019

Achievable Error Exponents of One-Way and Two-Way AWGN Channels

Achievable error exponents for the one-way with noisy feedback and two-way AWGN channels are derived for the transmission of a finite number of messages $M$ using fixed block length $n$, under the almost sure (AS) and the expected block (EXP) power constraints. In the one-way setting under noisy AWGN feedback, it is shown that under the AS constraint and when the feedback link is much stronger than the direct link, active feedback leads to a larger gain over the non-feedback error exponent than passive feedback. Under the EXP constraint, a previously known error exponent for the transmission of two messages is generalized to any arbitrary but finite number of messages $M$. In the two-way setting, where each user has its own message to send in addition to (possibly) aiding in the transmission of feedback for the opposite direction, error exponent regions are defined and derived for the first time for the AWGN two-way channel under both AS and EXP power constraints. It is shown that feedback or interaction may lead to error exponent gains in one direction, possibly at the expense of a decrease in the error exponents attained in the other direction. The relationship between $M$ and $n$ supported by our achievability strategies is explored.

cs.IT↗

arXiv2019

On the Capacity Region of the Layered Packet Erasure Broadcast Channel with Feedback

In this paper, the capacity region of the Layered Packet Erasure Broadcast Channel (LPE-BC) with Channel Output Feedback (COF) available at the transmitter is investigated. The LPE-BC is a high-SNR approximation of the fading Gaussian BC recently proposed by Tse and Yates, who characterized the capacity region for any number of users and any number of layers when there is no COF. This paper derives capacity inner and outer bounds for the LPE-BC with COF for the case of two users and any number of layers. The inner bounds generalize past results for the two-user erasure BC, which is a special case of the LPE-BC with COF with only one layer. The novelty lies in the use of \emph{inter-user \& inter-layer network coding} retransmissions (for those packets that have only been received by the unintended user), where each random linear combination may involve packets intended for any user originally sent on any of the layers. Analytical and numerical examples show that the proposed outer bound is optimal for some LPE-BCs.

cs.IT↗

arXiv2018

On Erasure Broadcast Channels with Hard Deadlines

This paper considers packet scheduling over a broadcast channel with packet erasures to multiple receivers with different messages (multiple uni-cast) each with possibly different hard deadline constraints. A novel metric is proposed and evaluated: the global deadline outage probability, which gives the probability that the hard communication deadline is not met for at least one of the receivers. The cut-set upper bound is derived and a scheduling policy is proposed to determine which receiver's packets should be sent in each time slot. This policy is shown to be optimal among all scheduling policies, i.e., it achieves all boundary points of cut-set upper bounds when the transmitter knows the erasure patterns for all the receivers ahead of making the scheduling decision. An expression for the global deadline outage probability is obtained for two receivers and is plotted and interpreted for various system parameters. These plots are not Monte-Carlo simulations, and hence the obtained expression may be used in the design of future downlink broadcast networks. Future extensions to per-user deadline outage probabilities as well as to scenarios with causal knowledge of the channel states are briefly discussed.

cs.NI↗

arXiv2018

The Strongly Asynchronous Massive Access Channel

This paper considers a Strongly Asynchronous and Slotted Massive Access Channel (SAS-MAC) where $K_n:=e^{n\nu}$ different users transmit a randomly selected message among $M_n:=e^{nR}$ ones within a strong asynchronous window of length $A_n:=e^{n\alpha}$ blocks, where each block lasts $n$ channel uses. A global probability of error is enforced, ensuring that all the users' identities and messages are correctly identified and decoded. Achievability bounds are derived for the case that different users have similar channels, the case that users' channels can be chosen from a set which has polynomially many elements in the blocklength $n$, and the case with no restriction on the users' channels. A general converse bound on the capacity region and a converse bound on the maximum growth rate of the number of users are derived.

cs.IT↗

arXiv2018

On Identifying a Massive Number of Distributions

Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of observed sequences, are let to grow with the observation blocklength $n$. Asymptotically matching upper and lower bounds on the probability of error are derived.

cs.IT↗

arXiv2017

The adaptive zero-error capacity for a class of channels with noisy feedback

The adaptive zero-error capacity of discrete memoryless channels (DMC) with noiseless feedback has been shown to be positive whenever there exists at least one channel output "disprover", i.e. a channel output that cannot be reached from at least one of the inputs. Furthermore, whenever there exists a disprover, the adaptive zero-error capacity attains the Shannon (small-error) capacity. Here, we study the zero-error capacity of a DMC when the channel feedback is noisy rather than perfect. We show that the adaptive zero-error capacity with noisy feedback is lower bounded by the forward channel's zero-undetected error capacity, and show that under certain conditions this is tight.

cs.IT↗