English
Related papers

Related papers: A Class of Errorless Codes for Over-loaded Synchro…

200 papers

In this paper we are going to estimate the sum capacity of a binary CDMA system in presence of the near-far effect. We model the near-far effect as a random variable that is multiplied by the users binary data before entering the noisy…

Information Theory · Computer Science 2010-03-30 P. Pad , M. H. Shafinia , S. M. Mansouri , P. Kabir , F. Marvasti

This paper considers coordinated linear precoding in downlink multicell multiuser orthogonal frequency-division multiple access (OFDMA) network. A less-complex, fast and provably convergent algorithm that maximizes the weighted sum-rate…

Information Theory · Computer Science 2017-08-17 Mirza Golam Kibria , Hidekazu Murata , Susumu Yoshida

The wide-band code division multiple access (WCDMA) based 3G and beyond cellular mobile wireless networks are expected to provide a diverse range of multimedia services to mobile users with guaranteed quality of service (QoS). To serve…

Networking and Internet Architecture · Computer Science 2010-07-15 K. Ayyappan , R. Kumar

In this paper, we present error-correcting codes which are the results of our research on the sub-exceeding functions. For a short and medium distance data transmission (wifi network, bluetooth, cable, ...), we see that these codes…

Information Theory · Computer Science 2018-12-05 Luc Rabefihavanana , Harinaivo Andriatahiny , Toussaint Rabeherimanana

In this work we study the problem of hard-deadline constrained data offloading in cellular networks. A single-Base-Station (BS) single-frequency-channel downlink system is studied where users request the same packet from the BS at the…

Information Theory · Computer Science 2019-05-22 Ahmed Ewaisha , Cihan Tepedelenlioglu

A conflict-avoiding code (CAC) of length L and weight w is used for deterministic multiple-access without feedback. When the number of simultaneous active users is less than or equal to w, such a code is able to provide a hard guarantee…

Information Theory · Computer Science 2026-04-20 Tsai-Lien Wong , Kangkang Xu , Yuan-Hsun Lo , Kenneth W. Shum , Yijin Zhang

Optical Wireless Communication networks (OWC) has emerged as a promising technology that enables high-speed and reliable communication bandwidth for a variety of applications. In this work, we investigated applying Random Linear Network…

Information Theory · Computer Science 2023-05-09 Ahmed Ali Hassan , Ahmed Adnan Qidan , Taisir Elgorashi , Jaafar Elmirghani

We consider asynchronous CDMA systems in no-fading environments with a particular focus on a certain user. This certain user is called a desired user in this paper. In such a situation, an optimal sequence, maximum Signal-to-Interference…

Information Theory · Computer Science 2019-06-11 Hirofumi Tsuda

The throughput of users with poor channel conditions, such as those at a cell edge, is a bottleneck in wireless systems. A major part of the power budget must be allocated to serve these users in guaranteeing their quality-of-service (QoS)…

Information Theory · Computer Science 2017-06-07 Van-Dinh Nguyen , Hoang Duong Tuan , Trung Q. Duong , H. Vincent Poor , and Oh-Soon Shin

We propose a two-layer coding architecture for communication of multiple users over a shared slotted medium enabling joint collision resolution and decoding. Each user first encodes its information bits with an outer code for reliability,…

Information Theory · Computer Science 2020-08-18 MohammadReza Ebrahimi , Farshad Lahouti , Victoria Kostina

An index coding scheme in which the source (transmitter) transmits binary symbols over a wireless fading channel is considered. Index codes with the transmitter using minimum number of transmissions are known as optimal index codes.…

Information Theory · Computer Science 2015-04-14 Anoop Thomas , Kavitha R. , Chandramouli A. , B. Sundar Rajan

Opportunistic scheduling and beamforming schemes are proposed for multiuser MIMO-SDMA downlink systems with linear combining in this work. Signals received from all antennas of each mobile terminal (MT) are linearly combined to improve the…

Information Theory · Computer Science 2016-11-18 Man-On Pun , Visa Koivunen , H. Vincent Poor

OCDMA systems can support multiple classes of service by differentiating code parameters, power level and diversity order. In this paper, we analyze BER performance of a multi-class 1D/2D OCDMA system and propose a new approximation method…

Information Theory · Computer Science 2017-06-28 Mohammad Hadi , Mohammad Reza Pakravan

Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic model for wireless random networks. We prove that the capacity of…

Information Theory · Computer Science 2008-11-11 Salah A. Aly , Vishal Kapoor , Jie Meng , Andreas Klappenecker

Large-scale distributed computing systems face two major bottlenecks that limit their scalability: straggler delay caused by the variability of computation times at different worker nodes and communication bottlenecks caused by shuffling…

Information Theory · Computer Science 2017-07-04 Amirhossein Reisizadeh , Ramtin Pedarsani

We consider coded caching over the fading broadcast channel, where the users, equipped with a memory of finite size, experience asymmetric fading statistics. It is known that a naive application of coded caching over the channel at hand…

Information Theory · Computer Science 2018-01-16 Richard Combes , Asma Ghorbel , Mari Kobayashi , Sheng Yang

In this paper, we describe direct-sequence code-division multiple-access (DS-CDMA) systems with quadriphase-shift keying in which channel estimation, coherent demodulation, and decoding are iteratively performed without the use of any…

Information Theory · Computer Science 2016-11-18 Don Torrieri , Amitav Mukherjee , Hyuck Kwon

Grant-free sparse code multiple access (GF-SCMA) is considered to be a promising multiple access candidate for future wireless networks. In this paper, we focus on characterizing the performance of uplink GF-SCMA schemes in a network with…

Information Theory · Computer Science 2021-03-19 Ke Lai , Jing Lei , Yansha Deng , Lei Wen , Gaojie Chen

Spinal codes, a family of rateless codes introduced in 2011, have been proved to achieve Shannon capacity over both the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC). In this paper, we derive explicit…

Information Theory · Computer Science 2023-04-28 Xiaomeng Chen , Aimin Li , Shaohua Wu

We study the fundamental network capacity of a multi-user wireless downlink under two assumptions: (1) Channels are not explicitly measured and thus instantaneous states are unknown, (2) Channels are modeled as ON/OFF Markov chains. This is…

Information Theory · Computer Science 2010-04-23 Chih-ping Li , Michael J. Neely