English
Related papers

Related papers: Efficient evaluation of the error probability for …

200 papers

We propose a framework to evaluate the so-called random-coding union bound with parameter $s$ (RCUs) on the achievable error probability in the finite-blocklength regime for a pilot-assisted transmission scheme operating over an imperfectly…

Information Theory · Computer Science 2024-09-10 A. Oguz Kislal , Madhavi Rajiv , Giuseppe Durisi , Erik G. Ström , Urbashi Mitra

The fast adoption of Massive MIMO for high-throughput communications was enabled by many research contributions mostly relying on infinite-blocklength information-theoretic bounds. This makes it hard to assess the suitability of Massive…

Information Theory · Computer Science 2021-05-11 Johan Östman , Alejandro Lancho , Giuseppe Durisi , Luca Sanguinetti

This paper presents a saddlepoint approximation of the random-coding union bound of Polyanskiy et al. for i.i.d. random coding over discrete memoryless channels. The approximation is single-letter, and can thus be computed efficiently.…

Information Theory · Computer Science 2014-04-28 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

Error probabilities of random codes for memoryless channels are considered in this paper. In the area of communication systems, admissible error probability is very small and it is sometimes more important to discuss the relative gap…

Information Theory · Computer Science 2015-06-11 Junya Honda

This paper applies error-exponent and dispersion-style analyses to derive finite-blocklength achievability bounds for low-density parity-check (LDPC) codes over the point-to-point channel (PPC) and multiple access channel (MAC). The…

Information Theory · Computer Science 2020-05-14 Yuxin Liu , Michelle Effros

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

We propose a simple and accurate method to evaluate the outage probability at the output of arbitrarily fading L-branch diversity combining receiver. The method is based on the saddlepoint approximation, which only requires the knowledge of…

Information Theory · Computer Science 2011-05-24 Mohammed Jabi , Leszek Szczecinski , Mustapha Benjillali

In recent years, the derivation of nonasymptotic converse and achievability bounds on the maximum coding rate as a function of the error probability and blocklength has gained attention in the information theory literature. While these…

Information Theory · Computer Science 2020-09-25 Alejandro Lancho , Jöhan Ostman , Giuseppe Durisi , Tobias Koch , Gonzalo Vazquez-Vilar

This paper investigates the effective capacity of a point-to-point ultra-reliable low latency communication (URLLC) transmission over multiple parallel sub-channels at finite blocklength (FBL) with imperfect channel state information (CSI).…

Information Theory · Computer Science 2022-10-20 Hongsen Peng , Meixia Tao

We present a general framework for the characterization of the packet error probability achievable in cell-free Massive multiple-input multiple output (MIMO) architectures deployed to support ultra-reliable low-latency (URLLC) traffic. The…

Information Theory · Computer Science 2023-04-17 Alejandro Lancho , Giuseppe Durisi , Luca Sanguinetti

Resource allocation is conceived for cell-free (CF) massive multi-input multi-output (MIMO)-aided ultra-reliable and low latency communication (URLLC) systems. Specifically, to support multiple devices with limited pilot overhead, pilot…

Signal Processing · Electrical Eng. & Systems 2023-03-22 Qihao Peng , Hong Ren , Mianxiong Dong , Maged Elkashlan , Kai-Kit Wong , Lajos Hanzo

The Fourth Industrial Revolution (Industrial 4.0) is coming, and this revolution will fundamentally enhance the way the factories manufacture products. The conventional wired lines connecting central controller to robots or actuators will…

Signal Processing · Electrical Eng. & Systems 2020-01-01 Hong Ren , Cunhua Pan , Yansha Deng , Maged Elkashlan , Arumugam Nallanathan

We present nonasymptotic bounds on the maximum coding rate achievable over a Rician block-fading channel for a fixed packet size and a fixed packet error probability. Our bounds, which apply to the scenario where no a priori channel state…

Information Theory · Computer Science 2017-05-24 Johan Östman , Giuseppe Durisi , Erik G. Ström

This paper proposes novel pilot optimization and channel estimation algorithm for the downlink multiuser massive multiple input multiple output (MIMO) system with $K$ decentralized single antenna mobile stations (MSs), and time division…

Applications · Statistics 2014-02-07 Tadilo Endeshaw Bogale , Long Bao Le

Leveraging recent results in finite-blocklength information theory, we investigate the problem of designing a control channel in a 5G system. The setup involves the transmission, under stringent latency and reliability constraints, of a…

Information Theory · Computer Science 2018-02-02 Guido Carlo Ferrante , Johan Östman , Giuseppe Durisi , Kittipong Kittichokechai

This paper introduces an upper bound on the absolute difference between: (a) the cumulative distribution function (CDF) of the sum of a finite number of independent and identically distributed random variables with finite absolute third…

Information Theory · Computer Science 2020-07-22 Dadja Anade , Jean-Marie Gorce , Philippe Mary , Samir Perlaza

This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…

Information Theory · Computer Science 2014-03-05 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

In URLLC the performance of short message communications highly depends on the training sequence length due to the stringent latency and reliability requirements. In this paper, we study the performance of cooperative and non-cooperative…

Information Theory · Computer Science 2019-03-07 Parisa Nouri , Hirley Alves , Richard Demo Souza , Matti Latva-aho

The non-orthogonal coexistence between the enhanced mobile broadband (eMBB) and the ultra-reliable low-latency communication (URLLC) in the downlink of a multi-cell massive MIMO system is rigorously analyzed in this work. We provide a…

Information Theory · Computer Science 2023-01-10 Giovanni Interdonato , Stefano Buzzi , Carmen D'Andrea , Luca Venturino , Ciro D'Elia , Paolo Vendittelli

The precoding in cell-free massive multiple-input multiple-output (MIMO) technology relies on accurate knowledge of channel responses between users (UEs) and access points (APs). Obtaining high-quality channel estimates in turn requires the…

Information Theory · Computer Science 2021-01-27 Giovanni Interdonato , Pål Frenger , Erik G. Larsson
‹ Prev 1 2 3 10 Next ›