English
Related papers

Related papers: Reduced Complexity Detection for Network-Coded Slo…

200 papers

Leveraging recent progress in physical-layer network coding we propose a new approach to random access: When packets collide, it is possible to recover a linear combination of the packets at the receiver. Over many rounds of transmission,…

Information Theory · Computer Science 2012-12-27 Jasper Goseling , Michael Gastpar , Jos H. Weber

Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The associated computational complexity often poses significant challenges for practical receiver implementations, in particular in the context of…

Information Theory · Computer Science 2008-11-27 Christoph Studer , Helmut Bölcskei

Contention Resolution Diversity Slotted ALOHA (CRDSA) and its burst degree optimizations (CRDSA++, IRSA) make use of MAC burst repetitions and Interference Cancellation (IC) making possible to reach throughput values as high as $T \simeq…

Information Theory · Computer Science 2015-01-26 Alessio Meloni , Maurizio Murroni , Christian Kissling , Matteo Berioli

Long range communication with LoRa has become popular as it avoids the complexity of multi-hop communication at low cost and low energy consumption. LoRa is openly accessible, but its packets are particularly vulnerable to collisions due to…

Networking and Internet Architecture · Computer Science 2025-05-14 José Álamos , Thomas C. Schmidt , Matthias Wählisch

Non-orthogonal multiple access (NOMA) has been proposed for massive connectivity in future generations of wireless communications. A dominant NOMA scheme is based on power optimization, in which decoding of target user is assumed to be…

Information Theory · Computer Science 2018-10-23 Kun Wang

This paper considers a data collection network consisting of uncoordinated, heterogeneous, and possibly mobile devices. These devices use medium and short-range radio technologies, which require multi-hop communication to deliver data to…

Networking and Internet Architecture · Computer Science 2018-12-31 Cédric Adjih , Michel Kieffer , Claudio Greco

This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully…

Information Theory · Computer Science 2023-07-04 Alexander Fengler , Alejandro Lancho , Yury Polyanskiy

Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability and spectral efficiency of such schemes, the use of multiple…

Information Theory · Computer Science 2019-03-11 Andrea Munari , Federico Clazzer , Gianluigi Liva , Michael Heindlmaier

In Multiple-Input Multiple-Output (MIMO) systems, Sphere Decoding (SD) can achieve performance equivalent to full search Maximum Likelihood (ML) decoding, with reduced complexity. Several researchers reported techniques that reduce the…

Information Theory · Computer Science 2015-03-13 Boyu Li , Ender Ayanoglu

We introduce a framework to study slotted Aloha with cooperative base stations. Assuming a geographic-proximity communication model, we propose several decoding algorithmswith different degrees of base stations' cooperation…

Information Theory · Computer Science 2015-01-30 Dusan Jakovetic , Dragana Bajovic , Dejan Vukobratovic , Vladimir Crnojevic

In this paper, network error control coding is studied for robust and efficient multicast in a directed acyclic network with imperfect links. The block network error control coding framework, BNEC, is presented and the capability of the…

Information Theory · Computer Science 2008-09-25 Hossein Bahramgiri , Farshad Lahouti

Recently a new Random Access technique based on Aloha and using Interference Cancellation (IC) named Sliding Window Contention Resolution Diversity Slotted Aloha (SW-CRDSA) has been introduced. Differently from classic CRDSA that operates…

Information Theory · Computer Science 2015-01-27 Alessio Meloni , Maurizio Murroni

We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. We show that when symbol erasures occur in a…

Information Theory · Computer Science 2012-09-25 Vitaly Skachek , Olgica Milenkovic , Angelia Nedic

We consider a frame-asynchronous coded slotted ALOHA (FA-CSA) system where users become active according to a Poisson random process. In contrast to standard frame-synchronous CSA (FS-CSA), users transmit a first replica of their message in…

Information Theory · Computer Science 2016-06-15 Erik Sandgren , Alexandre Graell i Amat , Fredrik Brännström

This paper investigates the unsourced random access (URA) scheme to accommodate numerous machine-type users communicating to a base station equipped with multiple antennas. Existing works adopt a slotted transmission strategy to reduce…

Information Theory · Computer Science 2022-02-17 Xinyu Xie , Yongpeng Wu , Jianping An , Junyuan Gao , Wenjun Zhang , Chengwen Xing , Kai-Kit Wong , Chengshan Xiao

Networked control systems (NCSs) are feedback control loops that are closed over a communication network. Emerging applications, such as telerobotics, drones and autonomous driving are the most prominent examples of such systems. Regular…

Systems and Control · Electrical Eng. & Systems 2022-09-23 Onur Ayan , Polina Kutsevol , Hasan Yağız Özkan , Wolfgang Kellerer

While feasibility and obtaining a solution of a given network coding problem are well studied, the decoding procedure and complexity have not garnered much attention. We consider the decoding problem in a network wherein the sources…

Information Theory · Computer Science 2015-10-14 Anindya Gupta , B. Sundar Rajan

Non-orthogonal multiple access (NOMA) is one of the key techniques to address the high spectral efficiency and massive connectivity requirements for the fifth generation (5G) wireless system. To efficiently realize NOMA, we propose a joint…

Information Theory · Computer Science 2018-02-14 Jincheng Dai , Kai Niu , Zhongwei Si , Chao Dong , Jiaru Lin

In object detection, post-processing methods like Non-maximum Suppression (NMS) are widely used. NMS can substantially reduce the number of false positive detections but may still keep some detections with low objectness scores. In order to…

Computer Vision and Pattern Recognition · Computer Science 2023-04-04 Angzhi Fan , Benjamin Ticknor , Yali Amit

Next-generation multiple access (NGMA) serves as an umbrella term for transmission schemes distinct from conventional orthogonal methods. A key candidate of NGMA, non-orthogonal multiple access (NOMA), emerges as a solution to enhance…

Information Theory · Computer Science 2024-10-02 Hamid Jafarkhani , Hossein Maleki , Mojtaba Vaezi
‹ Prev 1 3 4 5 6 7 10 Next ›