English
Related papers

Related papers: Diversity versus Multiplexing at Finite Blocklengt…

200 papers

Random access protocols relying on the transmission of packet replicas in multiple slots and exploiting interference cancellation at the receiver have been shown to achieve per- formance competitive with that of orthogonal schemes. So far…

Information Theory · Computer Science 2017-07-03 Federico Clazzer , Enrico Paolini , Iacopo Mambelli , Cedomir Stefanovic

We investigate asymptotic capacity limits of the Gaussian MIMO broadcast channel (BC) with spatially correlated fading to understand when and how much transmit correlation helps the capacity. By imposing a structure on channel covariances…

Information Theory · Computer Science 2014-10-13 Junyoung Nam

For open-ended language generation tasks such as storytelling and dialogue, choosing the right decoding algorithm is critical to controlling the tradeoff between generation quality and diversity. However, there presently exists no consensus…

Computation and Language · Computer Science 2020-04-23 Hugh Zhang , Daniel Duckworth , Daphne Ippolito , Arvind Neelakantan

The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Anne Savard , Matthieu R. Bloch

We characterize the capacity of Rayleigh block-fading multiple-input multiple-output (MIMO) channels in the noncoherent setting where transmitter and receiver have no a priori knowledge of the realizations of the fading channel. We prove…

Information Theory · Computer Science 2012-10-02 Wei Yang , Giuseppe Durisi , Erwin Riegler

A general fading model for multipath channels between two non-parallel continuous-aperture arrays (CAPAs) is proposed. Building on this model, the performance of diversity and multiplexing achieved by CAPAs over fading channels is analyzed.…

Signal Processing · Electrical Eng. & Systems 2025-03-31 Chongjun Ouyang , Zhaolin Wang , Xingqi Zhang , Yuanwei Liu

In this paper, we address the finite Signal-to-Noise Ratio (SNR) Diversity-Multiplexing Tradeoff (DMT) of the Multiple Input Multiple Output (MIMO) wiretap channel, where a Zero-Forcing (ZF) transmit scheme, that intends to send the secret…

Cryptography and Security · Computer Science 2011-12-30 Zouheir Rezki , Mohamed-Slim Alouini

A class of channels is introduced for which there is memory inside blocks of a specified length and no memory across the blocks. The multi-user model is called an information network with in-block memory (NiBM). It is shown that…

Information Theory · Computer Science 2016-11-17 Gerhard Kramer

The capacity of discrete-time, non-coherent, multipath fading channels is considered. It is shown that if the delay spread is large in the sense that the variances of the path gains do not decay faster than geometrically, then capacity is…

Information Theory · Computer Science 2016-11-18 Tobias Koch , Amos Lapidoth

Data streaming transmission over a block fading channel is studied. It is assumed that the transmitter receives a new message at each channel block at a constant rate, which is fixed by an underlying application, and tries to deliver the…

Information Theory · Computer Science 2012-09-20 Giuseppe Cocco , Deniz Gündüz , Christian Ibars

In this paper, we study ultra-reliable and low-latency communication (URLLC) under fading using multiple frequency or time bins. We investigate an approach to find an upper-bound on the packet error rate when a finite-length code is used.…

Information Theory · Computer Science 2019-04-08 Jinho Choi

Low-latency communication plays an increasingly important role in delay-sensitive applications by ensuring the real-time information exchange. However, due to the constraint on the maximum instantaneous power, guaranteeing bounded latency…

Information Theory · Computer Science 2024-11-05 Lintao Li , Wei Chen , Petar Popovski , Khaled B. Letaief

In many wireless systems, the channel state information at the transmitter (CSIT) can not be learned until after a transmission has taken place and is thereby outdated. In this paper, we study the benefits of delayed CSIT on a block-fading…

Information Theory · Computer Science 2014-01-29 Kasper Fløe Trillingsgaard , Petar Popovski

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

For broadband wireless communication systems, Orthogonal Frequency Division Multiplexing (OFDM) has been combined with Multi-Input Multi-Output (MIMO) techniques. Bit-Interleaved Coded Multiple Beamforming (BICMB) can achieve both spatial…

Information Theory · Computer Science 2015-12-10 Boyu Li , Ender Ayanoglu

This paper examines the problem of rate allocation for multicasting over slow Rayleigh fading channels using network coding. In the proposed model, the network is treated as a collection of Rayleigh fading multiple access channels. In this…

Networking and Internet Architecture · Computer Science 2014-03-27 Avi Zanko , Amir Leshem , Ephraim Zehavi

The multiple access channel (MAC) capacity with feedback is considered under feedback models designed to tease out which factors contribute to the MAC feedback capacity benefit. Comparing the capacity of a MAC with ``perfect'' feedback,…

Information Theory · Computer Science 2023-05-11 Oliver Kosut , Michelle Effros , Michael Langberg

In this article, the first general constructions of fast-decodable, more specifically (conditionally) $g$-group decodable, space-time block codes for the Nonorthogonal Amplify and Forward (NAF) Multiple-Input Multiple-Output (MIMO) relay…

Information Theory · Computer Science 2015-12-11 Amaro Barreal , Camilla Hollanti , Nadya Markin

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

We study the network spectral efficiency of decentralized vector multiple access channels (MACs) when the number of accessible dimensions per transmitter is strategically limited. Considering each dimension as a frequency band, we call this…

Information Theory · Computer Science 2009-05-19 Samir M. Perlaza , Merouane Debbah , Samson Lasaulce , Hanna Bogucka
‹ Prev 1 8 9 10 Next ›