English
Related papers

Related papers: Energy efficient coded random access for the wirel…

200 papers

Network coding is a novel solution that significantly improve the throughput and energy consumed of wireless networks by mixing traffic flows through algebraic operations. In conventional network coding scheme, a packet has to wait for…

Information Theory · Computer Science 2014-01-27 Hongyi Zeng , Wei Chen

In this paper, we investigate unsourced random access for massive machine-type communications (mMTC) in the sixth-generation (6G) wireless networks. Firstly, we establish a high-efficiency uncoupled framework for massive unsourced random…

Information Theory · Computer Science 2024-05-07 Feiyan Tian , Xiaoming Chen , Yong Liang Guan , Chau Yuen

Probabilistic amplitude shaping (PAS) is a coded modulation strategy in which constellation shaping and channel coding are combined. PAS has attracted considerable attention in both wireless and optical communications. Achievable…

Information Theory · Computer Science 2020-07-14 Yunus Can Gültekin , Alex Alvarado , Frans M. J. Willems

In wireless networks, communication links may be subject to random fatal impacts: for example, sensor networks under sudden power losses or cognitive radio networks with unpredictable primary user spectrum occupancy. Under such…

Information Theory · Computer Science 2016-11-15 Meng Zeng , Rui Zhang , Shuguang Cui

For data streaming applications, existing solutions are not yet able to close the gap between high data rates and low delay. This work considers the problem of data streaming under mixed delay constraints over a single communication channel…

Information Theory · Computer Science 2022-02-08 Alejandro Cohen , Muriel Médard , Shlomo Shamai

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…

Information Theory · Computer Science 2018-11-20 Anton Glebov , Nikolay Matveev , Kirill Andreev , Alexey Frolov , Andrey Turlikov

Random linear network coding (RLNC) in theory achieves the max-flow capacity of multicast networks, at the cost of high decoding complexity. To improve the performance-complexity tradeoff, we consider the design of sparse network codes. A…

Information Theory · Computer Science 2016-04-20 Ye Li , Wai-Yip Chan , Steven D. Blostein

Random network coding (RNC) is an efficient coding scheme to improve the performance of the broadband networks, especially for multimedia applications which are popular in 5G network. However, it is a challenging work to transmit the real…

Information Theory · Computer Science 2020-12-10 Xianzhen Guo , Bin Li , Jiayi Cong , Ruonan Zhang

The problem of reliable communication over the multiple-access channel (MAC) with states is investigated. We propose a new coding scheme for this problem which uses quasi-group codes (QGC). We derive a new computable single-letter…

Information Theory · Computer Science 2017-02-09 Mohsen Heidari , Farhad Shirani , S. Sandeep Pradhan

This paper considers cell-free massive multiple-input multiple-output systems where the multiple-antenna access points (APs) assist the single-antenna user equipments (UEs) by wireless power transfer. The UEs utilize the energy harvested in…

Information Theory · Computer Science 2020-01-28 Özlem Tuğfe Demir , Emil Björnson

Emerging 5G/6G use cases span various industries, necessitating flexible solutions that leverage emerging technologies to meet diverse and stringent application requirements under changing network conditions. The standard 5G RAN solution,…

Networking and Internet Architecture · Computer Science 2024-08-13 Osel Lhamo , Tung V. Doan , Elif Tasdemir , Mahdi Attawna , Giang T. Nguyen , Patrick Seeling , Martin Reisslein , Frank H. P. Fitzek

In this work, we consider a multiuser cooperative wireless network where the energy-constrained sources have independent information to transmit to a common destination, which is assumed to be externally powered and responsible for…

Information Theory · Computer Science 2015-06-18 Guilherme Luiz Moritz , João Luiz Rebelatto , Richard Demo Souza , Bartolomeu F. Uchôa-Filho , Yonghui Li

This article examines the queueing performance of communication systems that transmit encoded data over unreliable channels. A fading formulation suitable for wireless environments is considered where errors are caused by a discrete channel…

Information Theory · Computer Science 2013-09-16 Fatemeh Hamidi-Sepehr , Henry D. Pfister , Jean-Francois Chamberland

This paper investigates the maximal achievable rate for a given blocklength and error probability over quasi-static multiple-input multiple-output (MIMO) fading channels, with and without channel state information (CSI) at the transmitter…

Information Theory · Computer Science 2014-04-17 Wei Yang , Giuseppe Durisi , Tobias Koch , Yury Polyanskiy

We apply linear network coding (LNC) to broadcast a block of data packets from one sender to a set of receivers via lossy wireless channels, assuming each receiver already possesses a subset of these packets and wants the rest. We aim to…

Information Theory · Computer Science 2018-02-09 Mingchao Yu , Alex Sprintson , Parastoo Sadeghi

This paper studies the achievable rates of Gaussian interference channels with additive white Gaussian noise (AWGN), when improper or circularly asymmetric complex Gaussian signaling is applied. For the Gaussian multiple-input…

Information Theory · Computer Science 2016-11-18 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

A major challenge of wireless multicast is to be able to support a large number of users while simultaneously maintaining low delay and low feedback overhead. In this paper, we develop a joint coding and feedback scheme named Moving Window…

Information Theory · Computer Science 2014-09-23 Fei Wu , Yin Sun , Yang Yang , Kannan Srinivasan , Ness B. Shroff

Sparse code multiple access (SCMA) is a promising technique for the enabling of massive connectivity in future machine-type communication networks, but it suffers from a limited diversity order which is a bottleneck for significant…

Information Theory · Computer Science 2023-08-28 Qu Luo , Zilong Liu , Gaojie Chen , Pei Xiao

Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an…

Information Theory · Computer Science 2023-02-07 Mohammad Fereydounian , Hamed Hassani , Mohammad Vahid Jamali , Hessam Mahdavifar

In this work we demonstrate how a lack of synchronization can in fact be advantageous in the problem of random access. Specifically, we consider a multiple-access problem over a frame-asynchronous 2-user binary-input adder channel in the…

Information Theory · Computer Science 2023-05-12 Alexander Fengler , Alejandro Lancho , Krishna Narayanan , Yury Polyanskiy
‹ Prev 1 8 9 10 Next ›