English
Related papers

Related papers: Improved Achievable Rates for Regularized Tomlinso…

200 papers

Large-scale multi-user multiple-input multiple-output (MIMO) techniques have the potential to bring tremendous improvements for future communication systems. Counter-intuitively, the practical issues of having uncertain channel knowledge,…

Information Theory · Computer Science 2014-07-25 Axel Müller , Abla Kammoun , Emil Björnson , Mérouane Debbah

Integrated sensing and communication (ISAC) is a very promising technology designed to provide both high rate communication capabilities and sensing capabilities. However, in Massive Multi User Multiple-Input Multiple-Output (Massive MU…

Information Theory · Computer Science 2024-10-22 Jun Zhu , Yin Xu , Dazhi He , Haoyang Li , YunFeng Guan , Wenjun Zhang

A network relying on a large antenna-array-aided base station is designed for delivering multiple information streams to multi-antenna users over high-frequency bands such as the millimeter-wave and sub-Terahertz bands. The state-of-the-art…

Information Theory · Computer Science 2025-09-23 W. Zhu , H. D. Tuan , E. Dutkiewicz , H. V. Poor , L. Hanzo

A hybrid automatic repeat request scheme with Chase combing (HARQ-CC) of polar codes is proposed. The existing analysis tools of the underlying rate-compatible punctured polar (RCPP) codes for additive white Gaussian noise (AWGN) channels…

Information Theory · Computer Science 2014-01-13 Kai Chen , Kai Niu , Zhiqiang He , Jiaru Lin

MIMO systems are considered as most promising for wireless communications. However, with an increasing number of radio front ends the corresponding energy consumption and costs become an issue, which can be relieved by the utilization of…

Information Theory · Computer Science 2019-09-30 Erico S. P. Lopes , Lukas T. N. Landau

The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver…

Information Theory · Computer Science 2016-11-15 Bernd Bandemer , Abbas El Gamal , Young-Han Kim

Power line communication continues to draw increasing interest by promising a wide range of applications including cost-free last-mile communication solution. However, signal transmitted through the power lines deteriorates badly due to the…

Information Theory · Computer Science 2015-03-13 Kai Xie , Jing , Li

Hierarchical modulation (HM) is able to provide different levels of protection for data streams and achieve a rate region that cannot be realized by traditional orthogonal schemes, such as time division (TD). Nevertheless, criterions and…

Information Theory · Computer Science 2016-10-19 Baicen Xiao , Kexin Xiao , Zhiyong Chen , Hui Liu

The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop…

Information Theory · Computer Science 2015-02-17 Ritesh Kolte , Ayfer Özgür , Haim Permuter

We consider a continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. The set of…

Information Theory · Computer Science 2017-09-25 Sandra Bender , Meik Dörpinghaus , Gerhard Fettweis

This paper investigates the idea of exploiting interference among the simultaneous multiuser transmissions in the downlink of multiple antennas systems. Using symbol level precoding, a new approach towards addressing the multiuser…

Information Theory · Computer Science 2015-05-11 Maha Alodeh , Symeon Chatzinotas , Bjorn Ottersten

In this letter, we study the performance of a downlink multiuser massive multiple-input multiple-output (MIMO) system with sub-connected structure over limited feedback channels. Tight rate approximations are theoretically analyzed for the…

Information Theory · Computer Science 2020-06-03 Yaqiong Zhao , Wei Xu , Jindan Xu , Shi Jin , Kezhi Wang , Mohamed-Slim Alouini

The two-user interference channel is a model for multi one-to-one communications, where two transmitters wish to communicate with their corresponding receivers via a shared wireless medium. Two most common and simple coding schemes are time…

Information Theory · Computer Science 2021-08-16 Karl Chahine , Nanyang Ye , Hyeji Kim

The goal of this paper is to obtain a better knowledge of the achievable data rate over noncoherent Rician fading channel with time and frequency memory. We assume that the average-power as well as the peak-power of the input signal are…

Information Theory · Computer Science 2012-07-13 Jean-Michel Passerieux , Francois-Xavier Socheleau , Christophe Laot

We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we consider can have a finite number of states, such as partial…

Information Theory · Computer Science 2016-11-17 Parastoo Sadeghi , Pascal O. Vontobel , Ramtin Shams

In this paper, the downlink of a multi-cell massive MIMO system is considered where the channel state information (CSI) is estimated via pilot symbols that are orthogonal in a cell but re-used in other cells. Re-using the pilots, however,…

Information Theory · Computer Science 2021-12-21 Meysam Shahrbaf Motlagh , Subhajit Majhi , Patrick Mitran , Hideki Ochiai

A low-complexity coding scheme is developed to achieve the rate region of maximum likelihood decoding for interference channels. As in the classical rate-splitting multiple access scheme by Grant, Rimoldi, Urbanke, and Whiting, the proposed…

Information Theory · Computer Science 2017-01-11 Lele Wang , Young-Han Kim , Chiao-Yi Chen , Hosung Park , Eren Sasoglu

Provable lower bounds are presented for the information rate I(X; X+S+N) where X is the symbol drawn from a fixed, finite-size alphabet, S a discrete-valued random variable (RV) and N a Gaussian RV. The information rate I(X; X+S+N) serves…

Information Theory · Computer Science 2011-10-04 Seongwook Jeong , Jaekyun Moon

In this work, we consider a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver. The law of the channel is presumed to be known to the receiver. In addition, we assume the…

Information Theory · Computer Science 2011-03-03 Meik Dörpinghaus , Heinrich Meyr

We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbor decoding and pilot-aided channel estimation. In particular, we…

Information Theory · Computer Science 2014-04-09 A. Taufiq Asyhari , Tobias Koch , Albert Guillén i Fàbregas