English
Related papers

Related papers: Random Spreading for Unsourced MAC with Power Dive…

200 papers

Over the past decade, polar codes have received significant traction and have been selected as the coding method for the control channel in fifth-generation (5G) wireless communication systems. However, conventional polar codes are reliant…

Information Theory · Computer Science 2023-05-09 Hossein Rezaei , Elham Abbasi , Nandana Rajatheva , Matti Latva-aho

A new polar coding scheme for higher order modulation is presented. The proposed scheme is based on multi-level coding (MLC) with natural labeling, where the bit-level corresponding to the sign-bit is generated in dependence on the previous…

Information Theory · Computer Science 2019-10-30 Onurcan İşcan , Ronald Böhnke , Wen Xu

Most of the existing P2P content distribution schemes implement a random or rarest piece first dissemination procedure to avoid duplicate transmission of the same pieces of data and rare pieces of data occurring in the network. This problem…

Networking and Internet Architecture · Computer Science 2019-09-10 M Anandaraj , K Selvaraj , P Ganeshkumar , K P Vijayakumar

Linear precoding and cooperative jamming for multiuser broadcast channel is studied to enhance the physical layer security. We consider the system where multiple independent data streams are transmitted from the base station to multiple…

Information Theory · Computer Science 2014-08-01 Jun Yang , Il-Min Kim , Dong In Kim

We study the use of polar codes for both discrete and continuous variables Quantum Key Distribution (QKD). Although very large blocks must be used to obtain the efficiency required by quantum key distribution, and especially continuous…

Quantum Physics · Physics 2013-07-30 Paul Jouguet , Sébastien Kunz-Jacques

For multiuser MISO systems with bounded uncertainties in the Channel State Information (CSI), we consider two classical robust design problems: maximizing the minimum rate subject to a transmit power constraint, and power minimization under…

Information Theory · Computer Science 2016-01-21 Hamdi Joudeh , Bruno Clerckx

Random access is a multiple access communication protocol where the users simultaneously communicate with a base station (BS) in an uncoordinated fashion. In this work, we consider the problem of multiuser detection in a random access…

Information Theory · Computer Science 2016-07-15 Md Mashud Hyder

A joint sparse-regression-code (SPARC) and low-density-parity-check (LDPC) coding scheme for multiple-input multiple-output (MIMO) massive unsourced random access (URA) is proposed in this paper. Different from the state-of-the-art…

Information Theory · Computer Science 2022-01-12 Tianya Li , Yongpeng Wu , Mengfan Zheng , Dongming Wang , Wenjun Zhang

In this paper we focus on a feedback mechanism for unsourced random access (URA) communications. We propose an algorithm to construct feedback packets broadcasted to the users by the base station (BS) as well as the feedback packet format…

Information Theory · Computer Science 2022-11-23 Murwan Bashir , Ehsan Nassaji , Dmitri Truhachev , Alireza Bayesteh , Monirosharieh Vameghestahbanati

The integration of mobile edge computing (MEC) and wireless power transfer (WPT) technologies has recently emerged as an effective solution for extending battery life and increasing the computing power of wireless devices. In this paper, we…

Networking and Internet Architecture · Computer Science 2020-02-25 Yuegui Chen , Suzhi Bi , Xian Li , Xiaohui Lin , Hui Wang

We propose a scheme that universally achieves the smallest possible compression rate for a class of sources with side information, and develop an application of this result for a joint source channel coding problem over a broadcast channel.

Information Theory · Computer Science 2014-09-30 Min Ye , Alexander Barg

In this paper, we consider a system in which multiple users communicate with a destination with the help of multiple half-duplex relays. Based on the compute-and-forward scheme, each relay, instead of decoding the users' messages, decodes…

Information Theory · Computer Science 2014-10-20 Mohieddine El Soussi , Abdellatif Zaidi , Luc Vandendorpe

Recently, Ar{\i}kan introduced the method of channel polarization on which one can construct efficient capacity-achieving codes, called polar codes, for any binary discrete memoryless channel. In the thesis, we show that decoding algorithm…

Information Theory · Computer Science 2010-02-19 Ryuhei Mori

This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…

Information Theory · Computer Science 2016-11-18 Paolo Minero , Massimo Franceschetti , David N. C. Tse

This work presents another look at an analog network coding scheme for multi-user spread-spectrum communication systems. Our proposed system combines coding and cooperation between a relay and users to boost the throughput and to exploit…

Information Theory · Computer Science 2015-12-25 Georges Kaddoum , Pascal Giard

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is…

Information Theory · Computer Science 2007-07-13 Pierre Moulin , Ying Wang

Polar coding is a method for communication over noisy classical channels which is provably capacity-achieving and has an efficient encoding and decoding. Recently, this method has been generalized to the realm of quantum information…

Quantum Physics · Physics 2016-02-01 Christoph Hirche , Ciara Morgan , Mark M. Wilde

In cell-free massive multiple-input multiple-output systems, downlink power control is essential to ensure uniformly high service quality across users. Existing methods range from centralized iterative approaches requiring global channel…

Signal Processing · Electrical Eng. & Systems 2026-05-27 Giovanni Di Gennaro , Amedeo Buonanno , Gianmarco Romano , Francesco Verde , Stefano Buzzi , Francesco A. N. Palmieri

We consider a coded compressed sensing approach for the unsourced random access and replace the outer tree code proposed by Amalladinne et al. with the list recoverable code capable of correcting t errors. A finite-length random coding…

Information Theory · Computer Science 2022-01-20 Kirill Andreev , Pavel Rybin , Alexey Frolov

We propose a novel distributed resource allocation scheme for the up-link of a cellular multi-carrier system based on the message passing (MP) algorithm. In the proposed approach each transmitter iteratively sends and receives information…

Information Theory · Computer Science 2008-10-27 Andrea Abrardo , Paolo Detti , Marco Moretti
‹ Prev 1 4 5 6 7 8 10 Next ›