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
Proceedings ArticleDOI

Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full Feedback

TL;DR: Simulation results demonstrate that achievable rates for this full, noiseless feedback system approach capacity rapidly as a function of average blocklength, faster than known finite-blocklength lower bounds on achievable rate withNoiseless active feedback and significantly faster than finite-blocks length lower bounds for a stop feedback system.
Journal ArticleDOI

Interactive Communication for Data Exchange

TL;DR: In this article, a new interactive protocol for data exchange, which increases the communication size in steps until the task is done, is proposed, and a lower bound on the minimum number of bits that is based on relating the data exchange problem to the secret key agreement problem is derived.
Posted Content

Uplink Grant-Free Random Access Solutions for URLLC services in 5G New Radio

TL;DR: An overview of grant-free random access in 5G New Radio is provided, and two reliability-enhancing solutions are presented that result in significant performance gains, in terms of reliability as well as resource efficiency.
Journal ArticleDOI

On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels

TL;DR: In this article, the exact order of the optimal subexponentially decaying factor in the classical bounds on the error probability of fixed-length codes over a Gallager-symmetric discrete memoryless channel with and without ideal feedback is determined for rates above the critical rate.
Posted Content

Closed-form Output Statistics of MIMO Block-Fading Channels

TL;DR: This work characterize in closed form, the probability density function of the output of multiple-input and multiple-output block-fading channels, for an arbitrary signal-to-noise ratio value, and provides compact expressions for such output statistics.
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.