English
Related papers

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

200 papers

Large-scale multiple-antenna systems have been identified as a promising technology for the next generation of wireless systems. However, by scaling up the number of receive antennas the energy consumption will also increase. One possible…

Information Theory · Computer Science 2019-10-08 Z. Shao , L. Landau , R. C. de Lamare

This work considers the multihop multiple-input multiple-output relay network under short-packet communications to facilitate not only ultra-reliability but also low-latency communications. We assume that the transmit antenna selection…

Information Theory · Computer Science 2021-12-21 Ngo Hoang Tu , Kyungchun Lee

Using analytical and numerical methods, it is shown that the momentum distribution of a matter wave packet launched in a random potential exhibits a pronounced coherent backscattering (CBS) peak. By analyzing the momentum distribution, key…

Disordered Systems and Neural Networks · Physics 2012-02-06 Nicolas Cherroret , Tomasz Karpiuk , Cord A. Müller , Benoît Grémaud , Christian Miniatura

A multi-antenna transmitter that conveys independent sets of common data to distinct groups of users is herein considered, a model known as physical layer multicasting to multiple co-channel groups. In the recently proposed context of…

Information Theory · Computer Science 2016-11-15 Dimitrios Christopoulos , Symeon Chatzinotas , Bjorn Ottersten

We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for the setup where a priori channel state information is not available. The upper bound relies on a dual formula for…

Information Theory · Computer Science 2016-11-17 Rahul Devassy , Giuseppe Durisi , Johan Östman , Wei Yang , Tome Eftimov , Zoran Utkovski

This paper considers a multi-source multi-relay network, in which relay nodes employ a coding scheme based on random linear network coding on source packets and generate coded packets. If a destination node collects enough coded packets, it…

Information Theory · Computer Science 2022-03-08 Amjad Saeed Khan , Ioannis Chatzigeorgiou

In this paper we investigate the achievable rate of a system that includes a nomadic transmitter with several antennas, which is received by multiple agents, exhibiting independent channel gains and additive circular-symmetric complex…

Information Theory · Computer Science 2007-10-02 Amichai Sanderovich , Shlomo Shamai , Yossef Steinberg

We develop a novel framework for proving converse theorems for channel coding, which is based on the analysis technique of multicast transmission with an additional auxiliary receiver, which serves as a genie to the original receiver. The…

Information Theory · Computer Science 2022-09-02 Anelia Somekh-Baruch

The distributed hypothesis testing problem with full side-information is studied. The trade-off (reliability function) between the two types of error exponents under limited rate is studied in the following way. First, the problem is…

Information Theory · Computer Science 2019-04-24 Nir Weinberger , Yuval Kochman

In this part, we consider the capacity analysis for wireless mobile systems with multiple antenna architectures. We apply the results of the first part to a commonly known baseband, discrete-time multiple antenna system where both the…

Information Theory · Computer Science 2007-07-13 Majid Fozunbal , Steven W. McLaughlin , Ronald W. Schafer

An additive white Gaussian noise energy-harvesting channel with an infinite-sized battery is considered. The energy arrival process is modeled as a sequence of independent and identically distributed random variables. The channel capacity…

Information Theory · Computer Science 2019-01-15 Silas L. Fong , Jing Yang , Aylin Yener

In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically…

Information Theory · Computer Science 2020-10-21 Farhad Shirani , S. Sandeep Pradhan

The sphere-packing bound $E_{sp}(R)$ bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless feedback is allowed from the decoder to the encoder. To…

Information Theory · Computer Science 2007-07-13 Anant Sahai

This paper considers the transmission of an infinite sequence of messages (a streaming source) over a packet erasure channel, where every source message must be recovered perfectly at the destination subject to a fixed decoding delay. While…

Information Theory · Computer Science 2020-05-14 Elad Domanovitz , Silas L. Fong , Ashish Khisti

We study the best exponential decay in the blocklength of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an active noisy Gaussian feedback link. We impose an \emph{expected}…

Information Theory · Computer Science 2009-09-24 Young-Han Kim , Amos Lapidoth , Tsachy Weissman

The problem of lossless data compression with side information available to both the encoder and the decoder is considered. The finite-blocklength fundamental limits of the best achievable performance are defined, in two different versions…

Information Theory · Computer Science 2021-02-23 Lampros Gavalakis , Ioannis Kontoyiannis

We consider a linear multi-hop network composed of multi-state discrete-time memoryless channels over each hop, with orthogonal time-sharing across hops under a half-duplex relaying protocol. We analyze the probability of error and…

Information Theory · Computer Science 2008-10-29 Ozgur Oyman

New non-asymptotic random coding theorems (with error probability $\epsilon$ and finite block length $n$) based on Gallager parity check ensemble and Shannon random code ensemble with a fixed codeword type are established for discrete input…

Information Theory · Computer Science 2013-03-05 En-hui Yang , Jin Meng

This paper investigates fluid antenna systems (FASs) subject to finite-blocklength (FBL) constraints, motivated by the strict reliability-latency and ultra-massive connectivity requirements of future wireless networks. While FAS performance…

Information Theory · Computer Science 2026-04-02 Zhentian Zhang , Kai-Kit Wong , David Morales-Jimenez , Hao Jiang , Hao Xu , Christos Masouros , Zaichen Zhang , Chan-Byoung Chae

We characterise bounds on the optimal broadcast rate for a few classes of pliable-index-coding instances. Unlike the majority of currently solved instances, which belong to a special class where all receivers with a certain side-information…

Information Theory · Computer Science 2025-12-09 Lawrence Ong , Badri N. Vellambi , Parastoo Sadeghi , Jörg Kliewer
‹ Prev 1 8 9 10 Next ›