Results 101 to 110 of about 4,347 (195)

Fog Computing Meets URLLC: Energy Minimization of Task Partial Offloading for URLLC Services

IEEE Access
Ultra-high reliability and ultra-low latency communication (URLLC) are critical challenges for upcoming 6G applications. Cloud computing and mobile edge computing (MEC) offer potential solutions but incur high deployment and maintenance costs due to ...
Chenhao Shi, Jingrui Wei, Yao Zhu, Anke Schmeink   +3 more
doaj   +1 more source

Variable-Rate Incremental-Redundancy HARQ for Finite Blocklengths

IEEE Open Journal of the Communications Society
Incremental redundancy (IR) hybrid automatic repeat request (HARQ) is a staple component of modern wireless systems, instrumental for efficient and reliable low-latency communication.
Yu Fu, Angel Lozano, Hongwen Yang
doaj   +1 more source

Min-Max Decoding Error Probability Optimization in RIS-Aided Hybrid TDMA-NOMA Networks

IEEE Access
One of the primary objectives for future wireless communication networks is to facilitate the provision of ultra-reliable and low-latency communication services while simultaneously ensuring the capability for vast connection.
Tra Huong Thi Le, Yan Kyaw Tun, Ngo Thien Thu, Luong Vuong Nguyen, Eui-Nam Huh   +4 more
doaj   +1 more source

HARQ Buffer Management: An Information-Theoretic View

, 2015
A key practical constraint on the design of Hybrid automatic repeat request (HARQ) schemes is the size of the on-chip buffer that is available at the receiver to store previously received packets. In fact, in modern wireless standards such as LTE and LTE-
Kang, Joonhyuk, Lee, Wonju, Popovski, Petar, Rangan, Sundeep, Simeone, Osvaldo   +4 more
core   +1 more source

Minimizing Age of Information in Slotted ALOHA With Short-Packet Communications

IEEE Access
Age of information (AoI) has emerged as a novel metric for quantifying the freshness of information at the receiver side. This metric has found numerous applications in real-time monitoring and control systems where stale information may lead to critical
Yoora Kim
doaj   +1 more source

Feedback Capacity of the Compound Channel

, 2007
In this work we find the capacity of a compound finite-state channel with time-invariant deterministic feedback. The model we consider involves the use of fixed length block codes. Our achievability result includes a proof of the existence of a universal
Permuter, Haim, Shrader, Brooke
core   +2 more sources

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

Entropy (Basel), 2023
Shoushtari M, Harrison W.
europepmc   +1 more source

Coding in the Finite-Blocklength Regime: Bounds based on Laplace Integrals and their Asymptotic Approximations

, 2016
In this paper we provide new compact integral expressions and associated simple asymptotic approximations for converse and achievability bounds in the finite blocklength regime.
Erseghe, Tomaso
core   +1 more source

On Channel Reciprocity to Activate Uplink Channel Training for Downlink Wireless Transmission in Tactile Internet Applications

, 2018
We determine, for the first time, the requirement on channel reciprocity to activate uplink channel training, instead of downlink channel training, to achieve a higher data rate for the downlink transmission from a multi-antenna base station to a single ...
Li, Chunhui, Yan, Shihao, Yang, Nan
core   +1 more source

Power Allocation for Finite-Blocklength IR-HARQ

IEEE Communications Letters
This letter concerns the power allocation across the multiple transmission rounds under the Incremental Redundancy Hybrid Automatic Repeat reQuest (IR-HARQ) policy, in pursuit of an energy-efficient way of fulfilling the outage probability target in the finite-blocklength regime.
Wenyu Wang, Minhao Zhu, Kaiming Shen, Zhaorui Wang 0001, Shuguang Cui   +4 more
openaire   +2 more sources