• Corpus ID: 237532713

Gaussian Broadcast Channels in Heterogeneous Blocklength Constrained Networks

  title={Gaussian Broadcast Channels in Heterogeneous Blocklength Constrained Networks},
  author={Pin-Hsun Lin and Shih-Chun Lin and Peng-Wei Chen and Marcel Mross and Eduard Axel Jorswieck},
Future wireless access networks will support simultaneously a large number of devices with heterogeneous service requirements. These include data rates, error rates, and latencies. While there exist achievable rate and capacity results for Gaussian broadcast channels in the asymptotic regime, the characterization of second-order achievable rate regions for different blocklength constraints are not available. Therefore, we investigate a two-user Gaussian broadcast channel (GBC) with… 

Figures and Tables from this paper


Early Decoding for Gaussian Broadcast Channels with Heterogeneous Blocklength Constraints
  • Pin-Hsun Lin, Shih-Chun Lin, E. Jorswieck
  • Computer Science
    2021 IEEE International Symposium on Information Theory (ISIT)
  • 2021
This work derives an explicit lower bound on the necessary blocklength for successful early decoding, using an independent and identically distributed Gaussian input, given a maximal input power constraint and an average error probability constraint.
Early decoding for transmission over finite transport blocks
Numerical results suggest that despite its low computational complexity the proposed scheme significantly reduces the coding latency to achieve rates near the channel capacity.
Transmission Energy Minimization for Heterogeneous Low-Latency NOMA Downlink
This paper investigates the transmission energy minimization problem for the two-user downlink with strictly heterogeneous latency constraints and proposes a concave approximation of the FBC rate/capacity formula, by which the studied NOMA problems can be globally solved semi-analytically and with low complexity.
Coherent Multiple-Antenna Block-Fading Channels at Finite Blocklength
This paper addresses the finite blocklength fundamental limits of this channel model and gives a formula for the channel dispersion—a quantity governing the delay required to achieve capacity.
A Unified Approach to Gaussian Channels with Finite Blocklength
This dissertation builds upon a recent line of work on non-asymptotic information theory to characterize second-order approximations for channel coding rates over a variety of Gaussian settings at finite blocklength and applies a convenient yet powerful form of the Central Limit Theorem to analyze certain dependent information random variables.
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
Using results one can argue that the suboptimality of previously proposed protocols stems from their use of orthogonal subspaces rather than the half-duplex constraint, allowing for a more efficient use of resources.
A Second-Order Achievable Rate Region for Gaussian Multi-Access Channels via a Central Limit Theorem for Functions
By applying central limit theorem (CLT) approximations to non-asymptotic information-spectrum inner bounds, second-order achievable rate regions are obtained for the Gaussian MAC with a positive average error probability and per-codeword power constraints.
Channel Coding Rate in the Finite Blocklength Regime
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.
The dispersion of superposition coding for Gaussian broadcast channels
The performance of superposition coding for Gaussian broadcast channels with finite blocklength is analyzed and two different achievability bounds, the dependence testing and the κβ bounds introduced by Polyanskiy et al. in 2010 are adapted.
Joint Power and Resource Block Allocation for Mixed-Numerology-Based 5G Downlink Under Imperfect CSI
This article addresses the radio access network (RAN) slicing problem and focus on the three 5G primary services, namely, enhanced mobile broadband, ultra-reliable and low-latency communications (URLLC) and massive machine-type communications (mMTC).