检索结果-内蒙古大学图书馆

Reliability-Latency-Rate Tradeoff in Low-Latency Communications With finite-blocklength coding

IEEE TRANSACTIONS ON INFORMATION THEORY 2025年第1期71卷 360-389页

作者： Li, Lintao Chen, Wei Popovski, Petar Letaief, Khaled B. Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China State Key Lab Space Network & Commun Beijing 100084 Peoples R China Beijing Natl Res Ctr Informat Sci & Technol Beijing 100084 Peoples R China Aalborg Univ Dept Elect Syst DK-9220 Aalborg Denmark Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Hong Kong Peoples R China

Low-latency communication plays an increasingly important role in delay-sensitive applications by ensuring the real-time information exchange. However, due to the constraint on the maximum instantaneous power, guaranteeing bounded latency is challenging. In this paper, we investigate the reliability-latency-rate tradeoff in low-latency communication systems with finite-blocklength coding (FBC). Specifically, we are interested in the fundamental tradeoff between error probability, delay-violation probability (DVP), and service rate. Based on the effective capacity (EC), we present the gain-conservation equations to characterize the reliability-latency-rate tradeoffs in low-latency communication systems. In particular, we investigate the low-latency transmissions over an additive white Gaussian noise (AWGN) channel and a Nakagami- $m$ fading channel. By defining the service rate gain, reliability gain, and real-time gain, we conduct an asymptotic analysis to reveal the fundamental reliability-latency-rate tradeoff of ultra-reliable and low-latency communications in the high signal-to-noise-ratio (SNR) regime. To analytically evaluate and optimize the quality-of-service-constrained throughput of low-latency communication systems adopting FBC, an EC-approximation method is conceived to derive the closed-form expression of that throughput. Our results may offer some insights into the efficient scheduling of low-latency wireless communications, in which statistical latency and reliability metrics are crucial.

关键词： Reliability Quality of service Delays Analytical models Signal to noise ratio Mathematical models Error probability Ultra reliable low latency communication Real-time systems Measurement Low-latency communications reliability-latency-rate tradeoff finite-blocklength coding effective capacity delay-violation probability

来源：评论

学校读者我要写书评

暂无评论

Queue-Aware finite-blocklength coding for Ultra-Reliable and Low-Latency Communications: A Cross-Layer Approach

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2022年第10期21卷 8786-8802页

作者： Zhao, Xiaoyu Chen, Wei Poor, H. Vincent Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China Tsinghua Univ Beijing Natl Res Ctr Informat Sci & Technol Beijing 100084 Peoples R China Princeton Univ Dept Elect & Comp Engn Princeton NJ 08544 USA

To provide reliable transmissions with low-latency requirements, we focus on finite-blocklength coding (FBC) in Ultra-Reliable and Low-Latency Communications (URLLC). However, ensuring the reliability and latency of FBC has remained an open issue in URLLC. In this paper, we develop a queue-aware FBC scheme under random arrivals. With the awareness of queue length, we employ variable-length coding to jointly encode packets, through which we obtain a benefit on reliability. Meanwhile, we optimize latency under a cross-layer approach, in which two classes of variable-length codes are investigated with resources allocated in the frequency and time domains, respectively. To obtain an optimal reliability-latency tradeoff under variable-length FBC, we first present the reliability and latency performance for single links based on a Constrained Markov Decision Process (CMDP). Providing reliability with a power allocation, we then obtain the optimal tradeoff by a Linear Programming (LP) problem, in which the probability of violation of the constraints on queue length and the number of transmitted packets is minimized under average constraints on resources. Moreover, we show an optimal threshold-based policy under Bernoulli arrivals. We finally consider some extensions of the optimal tradeoff for multi-user downlinks as well as single links with retransmission.

关键词： Reliability Encoding Delays Ultra reliable low latency communication Bandwidth Quality of service Power control Ultra-reliable and low-latency communications finite-blocklength coding cross-layer design variable-length coding optimal tradeoff between reliability and latency

来源：评论

学校读者我要写书评

暂无评论

Achieving Extremely Low-Latency in Industrial Internet of Things: Joint finite blocklength coding, Resource Block Matching, and Performance Analysis

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2021年第10期69卷 6529-6544页

作者： Zhao, Xiaoyu Chen, Wei Poor, H. Vincent Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Tsinghua Univ Beijing Natl Res Ctr Informat Sci & Technol Beijing 100084 Peoples R China Princeton Univ Dept Elect & Comp Engn Princeton NJ 08544 USA

To enable a number of emerging applications, efforts from industry and academia have started to focus on defining 6G systems, in which more stringent requirements than those imposed on 5G systems are being considered. In particular, some 6G applications may require extremely low-latency on the order of 0.1ms, through which practical designs of channel coding can be investigated based on finite-blocklength coding (FBC). In this paper, we focus on a joint FBC scheme over multi-user downlinks in the Industrial Internet of Things (IIoT), in which only several symbol durations are available for users within a requirement of extremely low-latency. Since a higher coding rate is obtained by enlarging the blocklength of FBC, we jointly encode users' data bits over their allocated resources, through which an enlarged blocklength is attained. Specifically, we first formulate the multi-user joint encoding design with a matrix-based method. Then, we present the optimal power-constrained throughput within the extremely low-latency requirement by formulating a nonlinear bipartite matching problem. We finally demonstrate the benefit resulting from the joint FBC in terms of each user's maximum obtainable distance. With the distance to each user varying, we also perform an analysis of the variation of the optimal power-constrained throughput.

关键词： Downlink Throughput Delays Industrial Internet of Things Channel coding 6G mobile communication Data communication Industrial internet of things extremely low-latency communications finite-blocklength coding multi-user downlink nonlinear bipartite matching

来源：评论

学校读者我要写书评

暂无评论

Grant-Free Massive Random Access With Retransmission: Receiver Optimization and Performance Analysis

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2024年第2期72卷 786-800页

作者： Bian, Xinyu Mao, Yuyi Zhang, Jun Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Hong Kong Peoples R China Hong Kong Polytech Univ Dept Elect & Elect Engn Hong Kong Peoples R China

There is an increasing demand of massive machine-type communication (mMTC) to provide scalable access for a large number of devices, which has prompted extensive investigation on grant-free massive random access (RA) in 5G and beyond wireless networks. Although many efficient signal processing algorithms have been developed, the limited radio resource for pilot transmission in grant-free massive RA systems makes accurate user activity detection and channel estimation challenging, which thereby compromises the communication reliability. In this paper, we adopt retransmission as a means to improve the quality of service (QoS) for grant-free massive RA. Specifically, by jointly leveraging the user activity correlation between adjacent transmission blocks and the historical channel estimation results, we first develop an activity-correlation-aware receiver for grant-free massive RA systems with retransmission based on the correlated approximate message passing (AMP) algorithm. Then, we analyze the performance of the proposed receiver, including the user activity detection, channel estimation, and data error, by resorting to the state evolution of the correlated AMP algorithm and the random matrix theory (RMT). Our analysis admits a tight closed-form approximation for frame error rate (FER) evaluation. Simulation results corroborate our theoretical analysis and demonstrate the effectiveness of the proposed receiver for grant-free massive RA with retransmission, compared with a conventional design that disregards the critical user activity correlation.

关键词： Grant-free massive random access (RA) retransmission user activity detection channel estimation approximate message passing (AMP) finite-blocklength coding frame error rate (FER)

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：