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

Base station clustering is necessary in large interference networks, where the channel state information (CSI) acquisition overhead otherwise would be overwhelming. In this paper, we propose a novel long-term throughput model for the…

The key idea of non-orthogonal multiple access (NOMA) is to serve multiple users simultaneously at the same time and frequency, which can result in excessive multiple-access interference. As a crucial component of NOMA systems, successive…

We define a multiaccess communication scheme that effectively eliminates interference and resolves collisions in many-to-one and many-to-many communication scenarios. Each transmitter is uniquely identified by a steering vector. All signals…

In this paper, we analyze binary-tree algorithms in a setup in which the receiver can perform multi-packet reception (MPR) of up to and including K packets simultaneously. The analysis addresses both traffic-independent performance as well…

It is known that interference alignment (IA) plays an important role in improving the degree of freedom (DoF) of multi-input and multi-output (MIMO) systems. However, most of the traditional IA schemes suffer from the high computational…

This paper presents a detailed comparison of a recently proposed algorithm for optimizing decision trees, tree alternating optimization (TAO), with other popular, established algorithms. We compare their performance on a number of…

This paper proposes a unified approach to joint adaptive parameter estimation and interference cancellation (IC) for direct sequence code-division-multiple-access (DS-CDMA) systems in multipath channels. A unified framework is presented in…

In this paper, a general tree algorithm processing a random flow of arrivals is analyzed. Capetanakis--Tsybakov--Mikhailov's protocol in the context of communication networks with random access is an example of such an algorithm. In…

A major issue with Time of Flight sensors is the presence of multipath interference. We present Sparse Reflections Analysis (SRA), an algorithm for removing this interference which has two main advantages. First, it allows for very general…

A skew-symmetric graph $(D=(V,A),\sigma)$ is a directed graph $D$ with an involution $\sigma$ on the set of vertices and arcs. In this paper, we introduce a separation problem, $d$-Skew-Symmetric Multicut, where we are given a…

Adaptive designs(AD) are a broad class of trial designs that allow preplanned modifications based on patient data providing improved efficiency and flexibility. However, a delay in observing the primary outcome variable can harm this added…

We introduce an improved structure of distance sensitivity oracle (DSO). The task is to pre-process a non-negatively weighted graph so that a data structure can quickly answer replacement path length for every triple of source, terminal and…

We consider the problem of inferring the conditional independence graph (CIG) of a multivariate stationary dicrete-time Gaussian random process based on a finite length observation. Using information-theoretic methods, we derive a lower…

This work presents a data-driven analysis of minimal length necessary for coherency detection considering a recursive form of the typicality-based Data analysis (TDA). It proposes a methodology that encloses the observation of the variance…

Fractional cascading is one of the influential techniques in data structures, as it provides a general framework for solving the important iterative search problem. In the problem, the input is a graph $G$ with constant degree and a set of…

We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted ALOHA (IRSA) scheme is investigated and achievability bounds…

One of the main obstacles in full-duplex radios is analog-to-digital converter (ADC) saturation on a receiver due to the strong self-interference (SI). To solve this issue, researchers have proposed two different types of analog…

We study the estimation of the ATE in randomized controlled trials under a dynamically evolving interference structure. This setting arises in applications such as ride-sharing, where drivers move over time, and social networks, where…

We generalize the combinatorial algebraic approach first proposed by Dhurandhar et al. to construct various classes of modified second-generation time-delay interferometry (TDI) solutions. The main idea behind the algorithm is to enumerate,…

Disassembly is a crucial yet challenging step in binary analysis. While emerging neural disassemblers show promise for efficiency and accuracy, they frequently generate outputs violating fundamental structural constraints, which…