Finite Blocklength Regime Research Articles

Covert Communications With a Full-Duplex Receiver in the Finite Blocklength Regime: Analysis and Optimization

Covert Communications With a Full-Duplex Receiver in the Finite Blocklength Regime: Analysis and Optimization

Security-aware energy-efficient design for mobile edge computing network operating with finite blocklength codes

Energy efficiency and physical-layer security are crucial considerations in the advancement of mobile edge computing systems. This paper addresses the trade-off between secure-reliability and energy consumption in finite blocklength (FBL) communications. Specifically, we examine a three-node scenario involving a user, a legitimate edge computing server, and an eavesdropper, where the user offloads sensitive data to the edge server while facing potential eavesdropping threats. We propose an optimization framework aimed at minimizing energy consumption while ensuring secure-reliability by decomposing the problem into manageable subproblems. By demonstrating the convexity of the objective function concerning the variables, we establish the existence of an optimal parameter selection for the problem. This implies that practical optimization of parameters can significantly enhance system performance. Our numerical results demonstrate that the application of FBL regime and retransmission mechanism can effectively reduce the energy consumption of the system while ensuring secure-reliability. For the quantitative analyses, the retransmission mechanism is 33.1% better than no retransmission, and the FBL regime is 13.1% better than infinite blocklength (IBL) coding.

Evaluating energy harvesting UAV-NOMA network with random user pairing in the finite blocklength regime

This study proposes an integrated system that combines energy harvesting (EH) enabled unmanned aerial vehicles (UAVs) with non-orthogonal multiple access (NOMA) to enhance communication system performance within a cellular network. Addressing the limitations of existing analyses that often assume an infinite blocklength scenario, we explore EH-enabled UAV-NOMA systems within a cellular framework under a finite blocklength (FBL) scenario. The study investigates the complex interactions and advantages resulting from the integration of EH, NOMA, and UAV technologies, aiming to assess whether EH can sustain communication within this framework. The network model considers base stations (BSs), UAVs, and terrestrial devices distributed with independent Poisson point processes (PPPs) over a large area. In this network, BSs employ NOMA to serve cell center devices directly, while cell edge devices, which are nor in direct contact with BS, are served via simultaneous wireless information and power transfer (SWIPT) enabled UAVs. The study derives metrics including joint harvesting and decoding probability for a randomly selected UAV, coverage probability (CP) for cell devices, and end-to-end block error rate (BLER) probabilities for typical device pairs. The findings demonstrate that the proposed scheme effectively supplies all the necessary transmit power for communication purposes through EH, achieving reasonable reliability. Additionally, the study highlights the importance of considering a combination of blocklengths from different phases to achieve optimal performance, rather than solely relying on an increment in blocklength. Finally, the effects of parameter variations on network performance are examined.

Rate Outage and Meta-Distribution for Uplink Networks in Finite Block-Length Regime

Rate Outage and Meta-Distribution for Uplink Networks in Finite Block-Length Regime

Effective Energy Efficiency under Delay-Outage Probability Constraints and F-Composite Fading.

The paradigm of the Next Generation cellular network (6G) and beyond is machine-type communications (MTCs), where numerous Internet of Things (IoT) devices operate autonomously without human intervention over wireless channels. IoT's autonomous and energy-intensive characteristics highlight effective energy efficiency (EEE) as a crucial key performance indicator (KPI) of 6G. However, there is a lack of investigation on the EEE of random arrival traffic, which is the underlying platform for MTCs. In this work, we explore the distinct characteristics of F-composite fading channels, which specify the combined impact of multipath fading and shadowing. Furthermore, we evaluate the EEE over such fading under a finite blocklength regime and QoS constraints where IoT applications generate constant and sporadic traffic. We consider a point-to-point buffer-aided communication system model, where (1) an uplink transmission under a finite blocklength regime is examined; (2) we make realistic assumptions regarding the perfect channel state information (CSI) available at the receiver, and the channel is characterized by the F-composite fading model; and (3) due to its effectiveness and tractability, application data are found to have an average arrival rate calculated using Markovian sources models. To this end, we derive an exact closed-form expression for outage probability and the effective rate, which provides an accurate approximation for our analysis. Moreover, we determine the arrival and required service rates that satisfy the QoS constraints by applying effective bandwidth and capacity theories. The EEE is shown to be quasiconcave, with a trade-off between the transmit power and the rate for maximising the EEE. Measuring the impact of transmission power or rate individually is quite complex, but this complexity is further intensified when both variables are considered simultaneously. Thus, we formulate power allocation (PA) and rate allocation (RA) optimisation problems individually and jointly to maximise the EEE under a QoS constraint and solve such a problem numerically through a particle swarm optimization (PSO) algorithm. Finally, we examine the EEE performance in the context of line-of-sight and shadowing parameters.

Energy Efficiency of RIS-Assisted NOMA-Based MEC Networks in the Finite Blocklength Regime

Energy Efficiency of RIS-Assisted NOMA-Based MEC Networks in the Finite Blocklength Regime

Joint Trajectory Design and Resource Optimization in UAV-Assisted Caching-Enabled Networks with Finite Blocklength Transmissions

In this study, we design and analyze a reliability-oriented downlink wireless network assisted by unmanned aerial vehicles (UAVs). This network employs non-orthogonal multiple access (NOMA) transmission and finite blocklength (FBL) codes. In the network, ground user equipments (GUEs) request content from a remote base station (BS), and there are no direct connections between the BS and the GUEs. To address this, we employ a UAV with a limited caching capacity to assist the BS in completing the communication. The UAV can either request uncached content from the BS and then serve the GUEs or directly transmit cached content to the GUEs. In this paper, we first introduce the decoding error rate within the FBL regime and explore caching policies for the UAV. Subsequently, we formulate an optimization problem aimed at minimizing the average maximum end-to-end decoding error rate across all GUEs while considering the coding length and maximum UAV transmission power constraints. We propose a two-step alternating optimization scheme embedded within a deep deterministic policy gradient (DDPG) algorithm to jointly determine the UAV trajectory and transmission power allocations, as well as blocklength of downloading phase, and our numerical results show that the combined learning-optimization algorithm efficiently addresses the considered problem. In particular, it is shown that a well-designed UAV trajectory, relaxing the FBL constraint, increasing the cache size, and providing a higher UAV transmission power budget all lead to improved performance.

Design of Autoconfigurable Random Access NOMA for URLLC Industrial IoT Networking

Low power devices are massively deployed to facilitate real time sensing and data transmission requested in low power wide-area network (LPWAN). However, the dominating signaling, i.e. continuous phase modulation (CPM), barely gains attention in the context of supporting massive connectivity, not to mention ultra-reliable low-latency communications (URLLC), a primary concern in industrial network automation. To this end, auto-configurable nonorthogonal multiple access (AC-NOMA) based on CPM signaling is proposed. The term auto-configuration is used since each device selects a setup from a pool of configurations whenever connecting to the access point in a random and distributive way. It is proven, using ideal power allocation and phase shaping technique, AC-NOMA offers drastically improved user load and near capacity performance even in finite blocklength regime. Moreover, to enable massive yet sporadic access, slotted ALOHA is combined with AC-NOMA. It is proven that the resultant scheme outperforms power-domain NOMA in terms of throughput even with reduced transmit power and simple forward error correction schemes such as repetition and convolutional coding. The throughput is further improved using semi AC-NOMA with slightly increased latency. It is demonstrated that both designs can support very high user load while enabling URLLC in finite blocklength regime, where the packet size is merely 256 bits while the error rate is <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$10^{-5}$</tex-math></inline-formula> , which are also desirable in a number of applications including satellite communications, visible light communications, etc.

Finite Blocklength Regime Performance of Downlink Large Scale Networks

Some emerging 5G and beyond use-cases impose stringent latency constraints, which necessitates a paradigm shift towards finite blocklength performance analysis. In contrast to Shannon capacity-achieving codes, the codeword length in the finite blocklength regime (FBR) is a critical design parameter that imposes an intricate tradeoff between delay, reliability, and information coding rate. In this context, this paper presents a novel mathematical analysis to characterize the performance of large-scale downlink networks using short codewords. Theoretical achievable rates, outage probability, and reliability expressions are derived using the finite blocklength coding theory in conjunction with stochastic geometry, and compared to the performance in the asymptotic regime (AR). Achievable rates under practical modulation schemes as well as multilevel polar coded modulation (MLPCM) are investigated. Numerical results provide theoretical performance benchmarks, highlight the potential of MLPCM in achieving close to optimal performance with short codewords, and confirm the discrepancy between the performance in the FBR and that predicted by analysis in the AR. Finally, the meta distribution of the coding rate is derived, providing the percentiles of users that achieve a predefined target rate in a network.

Joint Optimization for Secure and Reliable Communications in Finite Blocklength Regime

To realize ultra-reliable low latency communications with high spectral efficiency and security, we investigate a joint optimization problem for downlink communications with multiple users and eavesdroppers in the finite blocklength (FBL) regime. We formulate a multi-objective optimization problem to maximize a sum secrecy rate by developing a secure precoder and to minimize a maximum error probability and information leakage rate. The main challenges arise from the complicated multi-objective problem, non-tractable back-off factors from the FBL assumption, non-convexity and non-smoothness of the secrecy rate, and the intertwined optimization variables. To address these challenges, we adopt an alternating optimization approach by decomposing the problem into two phases: secure precoding design, and maximum error probability and information leakage rate minimization. In the first phase, we obtain a lower bound of the secrecy rate and derive a first-order Karush–Kuhn–Tucker (KKT) condition to identify local optimal solutions with respect to the precoders. Interpreting the condition as a generalized eigenvalue problem, we solve the problem by using a power iteration-based method. In the second phase, we adopt a weighted-sum approach and derive KKT conditions in terms of the error probabilities and leakage rates for given precoders. Simulations validate the proposed algorithm.

F-Divergences and Their Applications in Lossy Compression and Bounding Generalization Error

In this paper, we provide three applications for f-divergences: (i) we introduce Sanov’s upper bound on the tail probability of the sum of independent random variables based on super-modular f-divergence and show that our generalized Sanov’s bound strictly improves over ordinary one, (ii) we consider the lossy compression problem which studies the set of achievable rates for a given distortion and code length. We extend the rate-distortion function using mutual f-information and provide new and strictly better bounds on achievable rates in the finite blocklength regime using super-modular f-divergences, and (iii) we provide a connection between the generalization error of algorithms with bounded input/output mutual f-information and a generalized rate-distortion problem. This connection allows us to bound the generalization error of learning algorithms using lower bounds on the f-rate-distortion function. Our bound is based on a new lower bound on the rate-distortion function that (for some examples) strictly improves over previously best-known bounds.

Optimizing Finite-Blocklength Nested Linear Secrecy Codes: Using the Worst Code to Find the Best Code.

Nested linear coding is a widely used technique in wireless communication systems for improving both security and reliability. Some parameters, such as the relative generalized Hamming weight and the relative dimension/length profile, can be used to characterize the performance of nested linear codes. In addition, the rank properties of generator and parity-check matrices can also precisely characterize their security performance. Despite this, finding optimal nested linear secrecy codes remains a challenge in the finite-blocklength regime, often requiring brute-force search methods. This paper investigates the properties of nested linear codes, introduces a new representation of the relative generalized Hamming weight, and proposes a novel method for finding the best nested linear secrecy code for the binary erasure wiretap channel by working from the worst nested linear secrecy code in the dual space. We demonstrate that our algorithm significantly outperforms the brute-force technique in terms of speed and efficiency.

Resource Allocation for Multicarrier Communication in the Finite Blocklength Regime

Resource Allocation for Multicarrier Communication in the Finite Blocklength Regime

Comments on “Channel Coding Rate in the Finite Blocklength Regime”: On the Quadratic Decaying Property of the Information Rate Function

The quadratic decaying property of the information rate function states that given a fixed conditional distribution $p_{\mathsf{Y}|\mathsf{X}}$, the mutual information between the (finite) discrete random variables $\mathsf{X}$ and $\mathsf{Y}$ decreases at least quadratically in the Euclidean distance as $p_\mathsf{X}$ moves away from the capacity-achieving input distributions. It is a property of the information rate function that is particularly useful in the study of higher order asymptotics and finite blocklength information theory, where it was already implicitly used by Strassen [1] and later, more explicitly, by Polyanskiy-Poor-Verd\'u [2]. However, the proofs outlined in both works contain gaps that are nontrivial to close. This comment provides an alternative, complete proof of this property.

Two-way UAV-aided systems with short packet communications

In this paper, we investigate a two-way unmanned aerial vehicle (UAV)-aided system, where two sources communicate with each other with the aid of an UAV relay. Two downlink transmission schemes consisting of non-orthogonal multiple access (NOMA) and network coding (NC) have been studied under finite blocklength regime. Considering imperfect successive interference cancellation (SIC), we have derived the exact and approximate expressions of the systems’ average block-error rates (BLERs). In particular, we propose a solution to maximize system throughput by optimizing packet length. In addition, we have also quantified the effects of the system parameters on the BLER performance, including the transmit power, the power allocation coefficients, and the UAV’s altitude. Numerical results demonstrate that the performance gap between the NOMA-based and NC-based systems is negligible.

Age of Loop for Wireless Networked Control System in the Finite Blocklength Regime: Average, Variance and Outage Probability

Age of information (AoI) is an effective measure of the information freshness for wireless networked control systems (WNCSs). However, the AoI performance for a closed loop of WNCS with two-way delays has remained unexplored, especially in the finite blocklength (FBL) regime. In this paper, we investigate the peak age of loop (PAoL) performances, including the average, variance and outage probability of PAoL, for WNCSs with FBL over fading channels. Their closed-form expressions are respectively derived regarding the blocklength and the maximum number of allowable transmissions. We prove that the average PAoL is less than the sum of the average peak AoI in uplink (UL) and downlink (DL) due to the coupling between UL and DL. We also show that there is a tradeoff between the average PAoL and the variance/outage probability of PAoL. Based on the comprehensive performance analysis, we study a PAoL-oriented communication and control co-design with an adaptation scheme for transmission power, blocklength and the maximum number of allowable transmissions. Simulation results verify the correctness of the analytical results and show that the proposed PAoL-oriented scheme significantly outperforms the UL only and DL only optimization schemes, with an up to 8-fold reduction in the average control cost.

Average age upon decisions with truncated HARQ and optimization in the finite blocklength regime

We consider an update-and-decide IoT-based wireless network, where information packets generated from dual sources are co-stored in the transmitter’s buffer, while decisions are made at the destination. Two practical assumptions about the communications between the transmitter and destination are taken into account: the communications are operating with finite blocklength (FBL) codes, and truncated hybrid automatic repeat request (HARQ) schemes are exploited to improve the FBL reliability, i.e., the number of allowed rounds of (re)transmissions is finite. For the first time, this paper characterizes the timeliness of status updates, namely age upon decisions (AuD) (which highlights the timeliness of the information at decisions in comparison to the concept of age of information), for such truncated HARQ-assisted wireless network. First, we characterize the inter-arrival time between two adjacent successfully transmitted packets, while taking into consideration the preemption policy and the randomness of the number of preempted packets from the same source. In particular, the probability density function, statistical performance of such inter-arrival time are derived. Following these characterizations, we propose a new approach to determine the average AuD and obtain a closed-form expression accordingly. Subsequently, a joint blocklength and arrival rate optimization problem is considered to minimize the obtained average AuD. Before addressing the formulated problem, we prove the convexity of decoding error probability in CC-HARQ and IR-HARQ with respect to blocklength. Then, we prove the convexity of average AuD with respect to blocklength and arrival rate, respectively. By an efficient alternating algorithm, we obtain a efficient solution. Via simulations, we evaluate the performance and conclude a set of guidelines for designs on the considered network.

On Second Order Rate Regions for the Static Scalar Gaussian Broadcast Channel

This paper considers the single antenna, static, scalar Gaussian broadcast channel in the finite blocklength regime. Second order achievable and converse rate regions are presented. Both a global reliability and per-user reliability requirements are considered. The two-user case is analyzed in detail, and generalizations to the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> -user case are also discussed. The largest second order achievable regions presented here require both superposition and rate splitting in the code construction, as opposed to the (infinite blocklength, first order) capacity region which does not require rate splitting. Indeed, the finite blocklength penalty causes superposition alone to underperform other coding techniques in some parts of the region. In addition, the proposed scheme uses joint simultaneous decoding as opposed to successive interference cancellation. Interestingly, in the two-user case with per-user reliability requirements, the capacity achieving superposition encoding order (with the codeword intended for the user with the smallest received SNR as cloud center) does not necessarily give the largest second order region. Instead, the message of the user with the smallest point-to-point second order capacity should be encoded in the cloud center in order to obtain the largest second order region for the proposed scheme.

Trade Reliability for Security: Leakage-Failure Probability Minimization for Machine-Type Communications in URLLC

How to provide information security while fulfilling ultra reliability and low-latency requirements is one of the major concerns for enabling the next generation of ultra-reliable and low-latency communications service (xURLLC), specially in machine-type communications. In this work, we investigate the reliability-security tradeoff by defining the leakage-failure probability, a metric that jointly characterizes both reliability and security performances for short-packet transmissions. We discover that the system performance can be enhanced, counter-intuitively, by allocating fewer resources for the transmission with finite blocklength (FBL) codes. In order to solve the corresponding optimization problem for the joint resource allocation, we propose an optimization framework, that leverages lower-bounded approximations for the decoding error probability in the FBL regime. We characterize the convexity of the reformulated problem and establish an efficient iterative searching method, the convergence of which is guaranteed. To show the extendability of the framework, we further discuss the blocklength allocation schemes with practical requirements of reliable-secure performance, as well as the transmissions with the statistical channel state information (CSI). Numerical results verify the accuracy of the proposed approach and demonstrate the reliability-security tradeoff under various setups.

Efficient Evaluation of the Error Probability for Pilot-Assisted URLLC With Massive MIMO

We propose a numerically efficient method for evaluating the random-coding union bound with parameter <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</i> on the error probability achievable in the finite-blocklength regime by a pilot-assisted transmission scheme employing Gaussian code-books and operating over a memoryless block-fading channel. Our method relies on the saddlepoint approximation, which, differently from previous results reported for similar scenarios, is performed with respect to the number of fading blocks (a.k.a. diversity branches) spanned by each codeword, instead of the number of channel uses per block. This different approach avoids a costly numerical averaging of the error probability over the realizations of the fading process and of its pilot-based estimate at the receiver and results in a significant reduction of the number of channel realizations required to estimate the error probability accurately. Our numerical experiments for both single-antenna communication links and massive multiple-input multiple-output (MIMO) networks show that, when two or more diversity branches are available, the error probability can be estimated accurately with the saddlepoint approximation with respect to the number of fading blocks using a numerical method that requires about two orders of magnitude fewer Monte-Carlo samples than with the saddlepoint approximation with respect to the number of channel uses per block.