English
Related papers

Related papers: Towards Generalised Half-Duplex Systems

200 papers

Gaitonde and Tardos recently studied a model of queueing networks where queues compete for servers and re-send returned packets in future rounds. They quantify the amount of additional processing power that guarantees a decentralized…

Computer Science and Game Theory · Computer Science 2022-10-18 Hu Fu , Qun Hu , Jia'nan Lin

This paper presents digital hardware for computing polynomial multiplication using Number Theoretic Transform (NTT), specifically designed for implementation on Field Programmable Gate Arrays (FPGAs). Multiplying two large polynomials…

Hardware Architecture · Computer Science 2025-01-22 Moslem Heidarpur , Mitra Mirhassani , Norman Chang

This paper addresses the task allocation problem for multi-robot systems. The main issue with the task allocation problem is inherent complexity that makes finding an optimal solution within a reasonable time almost impossible. To hand the…

Multiagent Systems · Computer Science 2019-01-11 Hyo-Sang Shin , Teng Li , Pau Segui-Gasco

In many quantum information processing protocols, entangled states shared among parties are an important resource. In this article, we study how bipartite states may be distributed in the context of a quantum network limited by timing…

Quantum Physics · Physics 2022-03-01 Kfir Dolev , Alex May , Kianna Wan

In a bi-directional relay channel, a pair of nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has mostly considered information theoretic limits of the…

Information Theory · Computer Science 2010-02-02 Sang Joon Kim , Besma Smida , Natasha Devroye

We consider an infinite sequence consisting of agents of several types and goods of several types, with a bipartite compatibility graph between agent and good types. Goods are matched with agents that appear earlier in the sequence using…

Probability · Mathematics 2019-12-03 Gideon Weiss

Federated learning (FL) has been considered as a promising learning framework for future machine learning systems due to its privacy preservation and communication efficiency. In beyond-5G/6G systems, it is likely to have multiple FL groups…

Information Theory · Computer Science 2021-07-21 Tung T. Vu , Hien Quoc Ngo , Thomas L. Marzetta , Michail Matthaiou

This paper is a survey of extensions to finite automata theory to model real-time systems as well as systems exhibiting mixed discrete-continuous behavior. Real-time systems maintain a continuous and timely interaction with the environment,…

Formal Languages and Automata Theory · Computer Science 2018-11-27 Lakhan Shiva Kamireddy

Massive multiple-input multiple-output (MIMO) systems hold the potential to be an enabling technology for 5G cellular. Uniform planar array (UPA) antenna structures are a focus of much commercial discussion because of their ability to…

Information Theory · Computer Science 2015-02-04 Junil Choi , Taeyoung Kim , David J. Love , Ji-yun Seol

We consider a class of finite state three-tape transducers which models the operation of shuffling and splitting words. We present them as automata over the so-called Shuffling Monoid. These automata can be seen as either shufflers or…

Formal Languages and Automata Theory · Computer Science 2024-07-04 Ignacio Mollo Cunningham

In this paper, we consider the performance of a random-access time-slotted wireless network with a single access point and a mix of half- and full- duplex stations. Full-duplex transmissions involve data transmitted simultaneously in both…

Information Theory · Computer Science 2014-07-15 Vaneet Aggarwal , N. K. Shankaranarayanan

In this work, we consider solving a distributed optimization problem (DOP) in a multi-agent network with multiple agent clusters. In each cluster, the agents manage separable cost functions composed of possibly non-smooth components and aim…

Optimization and Control · Mathematics 2023-09-15 Jianzheng Wang , Guoqiang Hu

We provide a categorical notion called uncertain bisimilarity, which allows to reason about bisimilarity in combination with a lack of knowledge about the involved systems. Such uncertainty arises naturally in automata learning algorithms,…

Discrete Mathematics · Computer Science 2023-03-28 Jurriaan Rot , Thorsten Wißmann

In this article, we show that the now classical protocol complex approach to distributed task solvability of Herlihy et al. can be understood in standard categorical terms. First, protocol complexes are functors, from chromatic (semi-)…

Logic in Computer Science · Computer Science 2025-05-16 Eric Goubault , Bernardo Hummes Flores , Roman Kniazev , Jeremy Ledent , Sergio Rajsbaum

Cellular automata are topological dynamical systems. We consider the problem of deciding whether two cellular automata are conjugate or not. We also consider deciding strong conjugacy, that is, conjugacy by a map that commutes with the…

Dynamical Systems · Mathematics 2019-06-04 Joonatan Jalonen , Jarkko Kari

Full-duplex small-cell relays with multiple antennas constitute a core element of the envisioned 5G network architecture. In this paper, we use stochastic geometry to analyze the performance of wireless networks with full-duplex…

Information Theory · Computer Science 2015-07-06 Italo Atzeni , Marios Kountouris

Full-duplex voice interaction is crucial for natural human computer interaction. We present a framework that decomposes complex dialogue into minimal conversational units, enabling the system to process each unit independently and predict…

Computation and Language · Computer Science 2026-01-30 Haoyuan Yu , Yuxuan Chen , Minjie Cai

We consider a multi-pair two-way amplify-and-forward massive multi-input multi-output (MIMO) hybrid relay with MIMO user-pairs. A hybrid relay has lesser number of radio frequency (RF) chains than the antennas, which significantly reduces…

Information Theory · Computer Science 2018-09-18 Arpita Singh Chauhan , Ekant Sharma , Rohit Budhiraja

In this paper, we consider a queue-aware distributive resource control algorithm for two-hop MIMO cooperative systems. We shall illustrate that relay buffering is an effective way to reduce the intrinsic half-duplex penalty in cooperative…

Machine Learning · Computer Science 2015-05-20 Rui Wang , Vincent K. N. Lau , Ying Cui

The decidability and complexity of reachability problems and model-checking for flat counter machines have been explored in detail. However, only few results are known for flat (lossy) FIFO machines, only in some particular cases (a single…

Computational Complexity · Computer Science 2023-06-22 Alain Finkel , M. Praveen