English
Related papers

Related papers: Performance Analysis of Multiple-Antenna Ambient B…

200 papers

We investigate the maximum coding rate for a given average blocklength and error probability over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

We investigate the constrained capacity of multiple-antenna fading coherent channels, where the receiver knows the channel state but the transmitter knows only the channel distribution, driven by arbitrary equiprobable discrete inputs in a…

Information Theory · Computer Science 2012-10-26 Miguel Rodrigues

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

Information Theory · Computer Science 2016-11-18 Jeffrey G. Andrews , Steven Weber , Marios Kountouris , Martin Haenggi

We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that…

Information Theory · Computer Science 2014-10-28 Marco Baldi , Marco Bianchi , Franco Chiaraluce , Nicola Laurenti , Stefano Tomasin , Francesco Renna

Ambient Backscatter Communication (AmBC) is an emerging communication technology that can enable green Internet-of-Things deployments. The widespread acceptance of this paradigm is limited by low Signal-to-Interference-Plus-Noise Ratio…

Signal Processing · Electrical Eng. & Systems 2020-08-25 Xiyu Wang , Hüseyin Yiğitler , Ruifeng Duan , Estifanos Yohannes Menta , Riku Jäntti

This work investigates the fundamental limits of communication over a noisy discrete memoryless channel that wears out, in the sense of signal-dependent catastrophic failure. In particular, we consider a channel that starts as a memoryless…

Information Theory · Computer Science 2018-08-07 Ting-Yi Wu , Lav R. Varshney , Vincent Y. F. Tan

In this paper, the blocklength-limited performance of a relaying system is studied, where channels are assumed to experience quasi-static Rayleigh fading while at the same time only the average channel state information (CSI) is available…

Information Theory · Computer Science 2016-11-15 Yulin Hu , Anke Schmeink , James Gross

Massive connectivity with ultra-low latency and high reliability necessitates fundamental advances in future communication networks operating under finite-blocklength (FBL) transmission. Fluid antenna systems (FAS) have emerged as a…

The communication scenario under consideration in this paper corresponds to a multiuser channel with side information and consists of a broadcast channel with two legitimate receivers and an eavesdropper. Mainly, the results obtained are as…

Information Theory · Computer Science 2012-10-24 Maël Le Treust , Abdellatif Zaidi , Samson Lasaulce

In this paper, we study the Bernstein polynomial model for estimating the multivariate distribution functions and densities with bounded support. As a mixture model of multivariate beta distributions, the maximum (approximate) likelihood…

Methodology · Statistics 2019-01-23 Tao Wang , Zhong Guan

Effective Capacity (EC) indicates the maximum communication rate subject to a certain delay constraint while effective energy efficiency (EEE) denotes the ratio between EC and power consumption. In this paper, we analyze the EEE of…

Information Theory · Computer Science 2018-01-30 Mohammad Shehab , Endrit Dosti , Hirley Alves , Matti Latva-aho

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

This paper considers the massive random access problem in MIMO quasi-static Rayleigh fading channels. Specifically, we derive achievability and converse bounds on the minimum energy-per-bit required for each active user to transmit $J$ bits…

Information Theory · Computer Science 2022-10-24 Junyuan Gao , Yongpeng Wu , Shuo Shao , Wei Yang , H. Vincent Poor

In future wireless networks, we anticipate that a large number of devices will connect to mobile networks through moving relays installed on vehicles, in particular in public transport vehicles. To provide high-speed moving relays with…

Information Theory · Computer Science 2020-09-01 Hao Guo , Behrooz Makki , Tommy Svensson

Multiple-antenna backscatter is emerging as a promising approach to offer high communication performance for the data-intensive applications of ambient backscatter communications (AmBC). Although much has been understood about…

Signal Processing · Electrical Eng. & Systems 2019-12-24 Zhiang Niu , Wei Wang , Tao Jiang

In this paper, the trade-off between the number of transmissions (or burstiness) $K_n=e^{n\nu}$ of a user, the asynchronism level $A_n=e^{n\alpha}$ in a slotted strongly asynchronous channel, and the ability to distinguish $M_n=e^{nR}$…

Information Theory · Computer Science 2018-07-27 Sara Shahi , Daniela Tuninetti , Natasha Devroye

A concatenated coding scheme over binary memoryless symmetric (BMS) channels using a polarization transformation followed by outer sub-codes is analyzed. Achievable error exponents and upper bounds on the error rate are derived. The first…

Information Theory · Computer Science 2017-10-24 Dina Goldin , David Burshtein

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

We study the determination problem of the channel capacity for the discrete memoryless channels in the finite blocklength regime. We derive explicit lower and upper bounds of the capacity. We shall demonstrate that the information spectrum…

Information Theory · Computer Science 2019-04-11 Yasutada Oohama

We investigate the achievable error probability in communication over an AWGN discrete time memoryless channel with noiseless delay-less rate-limited feedback. For the case where the feedback rate R_FB is lower than the data rate R…

Information Theory · Computer Science 2012-04-24 Reza Mirghaderi , Andrea Goldsmith , Tsachy Weissman