Saddlepoint Approximations for Short-Packet Wireless Communications

被引：31

作者：

Lancho, Alejandro ^{[1
]}

Ostman, Johan ^{[1
]}

Durisi, Giuseppe ^{[1
]}

Koch, Tobias ^{[2
,3
]}

Vazquez-Vilar, Gonzalo ^{[2
,3
]}

机构：

[1] Chalmers Univ Technol, Dept Elect Engn, S-41296 Gothenburg, Sweden

[2] Univ Carlos III Madrid, Signal Theory & Commun Dept, Leganes 28911, Spain

[3] Gregorio Maranon Hlth Res Inst, Madrid 28007, Spain

来源：

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS | 2020年 / 19卷 / 07期

基金：

瑞典研究理事会; 欧洲研究理事会;

关键词：

Encoding; Error probability; Wireless communication; Capacity planning; Signal to noise ratio; Europe; Channel models; Fading channels; finite-blocklength information theory; saddlepoint approximations; short packets; ultra-reliable low-latency communications; BLOCK-FADING CHANNELS; ERROR EXPONENTS; LENGTH ANALYSIS; CODING RATE; FINITE; TRANSMISSION; CAPACITY;

D O I：

10.1109/TWC.2020.2987573

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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 bounds are accurate for many scenarios of interest, they need to be evaluated numerically for most wireless channels of practical interest, and their evaluation is computationally demanding. This paper presents saddlepoint approximations of state-of-the-art converse and achievability bounds for noncoherent, single-antenna, Rayleigh block-fading channels. These approximations can be calculated efficiently and are shown to be accurate for SNR values as small as 0 dB and blocklengths of 168 channel uses or more.

引用

页码：4831 / 4846

页数：16

共 42 条

[1]

Abou-Faycal I., 1999, CODING REQUIREMENTS

[2] Refinement of the Random Coding Bound [J].

Altug, Yuecel ;

Wagner, Aaron B. .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (10) :6005-6023

[3]

[Anonymous], 1976, Principles of Mathematical Analysis

[4]

[Anonymous], 1971, An introduction to probability theory and its applications, DOI DOI 10.2307/2282584

[5] Coherent Multiple-Antenna Block-Fading Channels at Finite Blocklength [J].

Collins, Austin ;

Polyanskiy, Yury .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (01) :380-405

[6] Efficient error-correcting codes in the short blocklength regime [J].

Coskun, Mustafa Cemil ;

Durisi, Giuseppe ;

Jerkovits, Thomas ;

Liva, Gianluigi ;

Ryan, William ;

Stein, Brian ;

Steiner, Fabian .

PHYSICAL COMMUNICATION, 2019, 34 :66-79

[7] Toward Massive, Ultrareliable, and Low-Latency Wireless Communication With Short Packets [J].

Durisi, Giuseppe ;

Koch, Tobias ;

Popovski, Petar .

PROCEEDINGS OF THE IEEE, 2016, 104 (09) :1711-1726

[8] Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels [J].

Durisi, Giuseppe ;

Koch, Tobias ;

Ostman, Johan ;

Polyanskiy, Yury ;

Yang, Wei .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (02) :618-629

[9] Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations [J].

Erseghe, Tomaso .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (12) :6854-6883

[10] On the Evaluation of the Polyanskiy-Poor-Verdu Converse Bound for Finite Block-Length Coding in AWGN [J].

Erseghe, Tomaso .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (12) :6578-6590

← 1 2 3 4 5 →