scispace - formally typeset
Journal ArticleDOI

Channel Coding Rate in the Finite Blocklength Regime

Reads0
Chats0
TLDR
It is shown analytically that the maximal rate achievable with error probability ¿ isclosely approximated by C - ¿(V/n) Q-1(¿) where C is the capacity, V is a characteristic of the channel referred to as channel dispersion, and Q is the complementary Gaussian cumulative distribution function.
Abstract
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bounds are given, which are tighter than existing bounds for wide ranges of parameters of interest, and lead to tight approximations of the maximal achievable rate for blocklengths n as short as 100. It is also shown analytically that the maximal rate achievable with error probability ? isclosely approximated by C - ?(V/n) Q-1(?) where C is the capacity, V is a characteristic of the channel referred to as channel dispersion , and Q is the complementary Gaussian cumulative distribution function.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Wireless Energy and Information Transmission Using Feedback: Infinite and Finite Block-Length Analysis

TL;DR: The simulation and analytical results demonstrate that the retransmission-based protocols are efficient techniques to reduce the energy-limited outage probability of wireless energy and information transmission systems.
Journal ArticleDOI

Ultra-Reliable and Low-Latency Vehicular Transmission: An Extreme Value Theory Approach

TL;DR: This work proposes two queue-aware power allocation solutions that achieve lower mean and variance of the maximal queue length by leveraging Lyapunov stochastic optimization to deal with network dynamics.
Journal ArticleDOI

Throughput analysis of buffer-constrained wireless systems in the finite blocklength regime

TL;DR: Interactions and tradeoffs between the throughput, queueing constraints, coding blocklength, decoding error probabilities, and signal-to-noise ratio are investigated, and several conclusions with important practical implications are drawn.
Journal ArticleDOI

Arimoto–Rényi Conditional Entropy and Bayesian $M$ -Ary Hypothesis Testing

TL;DR: In this article, upper and lower bounds on the minimum error probability of Bayesian hypothesis testing in terms of the Arimoto-Renyi conditional entropy of an arbitrary order were derived.
Proceedings ArticleDOI

Finite Blocklength Information Theory: What Is the Practical Impact on Wireless Communications?

TL;DR: The true outage probability in Ricean and Nakagami-m block fading channels is investigated and it is proved that the asymptotic outage capacity is the Laplace approximation of the average error probability in finite blocklength regime.
References
More filters
Journal ArticleDOI

A mathematical theory of communication

TL;DR: This final installment of the paper considers the case where the signals or the messages or both are continuously variable, in contrast with the discrete nature assumed until now.

An Introduction To Probability Theory And Its Applications

TL;DR: A First Course in Probability (8th ed.) by S. Ross is a lively text that covers the basic ideas of probability theory including those needed in statistics.