相关论文: On d-ary tree algorithms with successive interfere…

This work is to popularize the method of computing the distribution of the excursion times for a Gaussian process that involves extended and multivariate Rice's formula. The approach was used in numerical implementations of the…

This paper proposes a novel joint channel-estimation and source-detection algorithm using successive interference cancellation (SIC)-aided generative score-based diffusion models. Prior work in this area focuses on massive MIMO scenarios,…

This document serves as supplementary material for our journal submission, providing detailed mathematical proofs and derivations that support the results presented in the main manuscript. Specifically, under a modeling framework that…

Limitation of the cost of coordination and contention among a large number of nodes calls for grant-free approaches, exploiting physical layer techniques to solve collisions. Successive Interference Cancellation (SIC) is becoming a key…

Confounding bias and selection bias bring two significant challenges to the validity of conclusions drawn from applied causal inference. The latter can stem from informative missingness, such as in cases of attrition. We introduce the…

In this paper, we consider the K-user interference channel with partial cooperation, where a strict subset of the K users cooperate. For the K-user interference channel with cooperating subsets of length M, the outer bound of the total…

The temporal assumptions underpinning conventional Identity and Access Management collapse under agentic execution regimes. A sixty-second revocation window permits on the order of $6 \times 10^3$ unauthorized API calls at 100 ops/tick; at…

We study a new IA strategy which is referred to as "Partial Interference Cancelation-based Interference Alignment" (PIC-IA). Unlike the conventional IA strategy, PIC-IA does not strive to eliminate interference from all users. Instead, it…

This article investigates the robustness of rate-splitting multiple access (RSMA) in multi-user multiple-input single-output (MISO) systems to interference attacks against channel acquisition induced by beyond-diagonal RISs (BD-RISs). Two…

In order to attain the requisite sensitivity for LISA - a joint space mission of the ESA and NASA- the laser frequency noise must be suppressed below the secondary noises such as the optical path noise, acceleration noise etc. By combining…

This paper investigates the problem of joint massive devices separation and channel estimation for a reconfigurable intelligent surface (RIS)-aided unsourced random access (URA) scheme in the sixth-generation (6G) wireless networks. In…

We establish a multi-user extrinsic information transfer (EXIT) chart area theorem for the interleave-division multiple-access (IDMA) scheme, a special form of superposition coding, in multiple access channels (MACs). A low-cost multi-user…

In this work we define a metric structure to compare functions defined on different merge trees. The metric introduced possesses some stability properties, which we illustrate within a standard topological data analysis (TDA) framework, and…

A cross-layer optimization approach is adopted for the design of symmetric random access wireless systems. Instead of the traditional collision model, a more realistic physical layer model is considered. Based on this model, an Incremental…

We consider Activated Random Walks on arbitrary finite networks, with particles being inserted at random and absorbed at the boundary. Despite the non-reversibility of the dynamics and the lack of knowledge on the stationary distribution,…

Complex, multi-objective missions require the coordination of heterogeneous robots at multiple inter-connected levels, such as coalition formation, scheduling, and motion planning. This challenge is exacerbated by dynamic changes, such as…

This paper characterizes the performance of interference alignment (IA) technique taking into account the dynamic traffic pattern and the probing/feedback cost. We consider a time-division duplex (TDD) system where transmitters acquire…

Parameterized complexity seeks to use input structure to obtain faster algorithms for NP-hard problems. This has been most successful for graphs of low treewidth: Many problems admit fast algorithms relative to treewidth and many of them…

Interference alignment (IA) has attracted enormous research interest as it achieves optimal capacity scaling with respect to signal to noise ratio on interference networks. IA has also recently emerged as an effective tool in engineering…

Gomory-Hu tree [Gomory and Hu, 1961] is a succinct representation of pairwise minimum cuts in an undirected graph. When the input graph has general edge weights, classic algorithms need at least cubic running time to compute a Gomory-Hu…