Results 31 to 40 of about 300 (171)
Covert communication with finite blocklength in AWGN channels [PDF]
2017 IEEE International Conference on Communications (ICC), 2017 Accepted by IEEE ICC ...
Shihao Yan +3 more
openaire +2 more sources
IET Communications, Volume 17, Issue 9, Page 1048-1058, June 2023., 2023 We formulate the EE problem of URLLC and parameterize the power allocation function to be optimized through a DNN. The DNN is trained through the primal‐dual iterative algorithm offline in the unsupervised manner, and can be deployed online to achieve real time power allocation results.
Haitao Zhao +5 more
wiley +1 more source
Quantifying equivocation for finite blocklength wiretap codes [PDF]
2017 IEEE International Conference on Communications (ICC), 2017 Submitted to ICC ...
Jack Pfister +3 more
openaire +2 more sources
IET Signal Processing, Volume 16, Issue 8, Page 897-908, October 2022., 2022 Abstract A digital twin (DT) framework for Internet‐of‐thing (IoT) networks is proposed where unmanned aerial vehicles (UAVs) acting as flying mobile edge computing (MEC) servers support the task offloading on the fly. The considered DT model is very well suitable for industrial automation with the strict constraints of mission‐critical services' ultra‐
Yijiu Li +4 more
wiley +1 more source
IEEE Access, 2021 The advent of the Internet-of-Things (IoT) and proliferation of wireless devices and systems have put stringent requirements on reliability and latency, in addition to the scarcity of energy and spectrum resources. More importantly, ultra-reliability and
Mohammad Reza Amini, Mohammed W. Baidas
doaj +1 more source
IET Signal Processing, Volume 16, Issue 8, Page 925-934, October 2022., 2022 Abstract Ultra‐reliable low‐latency communication (URLLC) has gained significant interest since it deals with short packet transmission adopted to reduce latency; however, this implies that the conventional Shannon capacity formula is not applicable, and the achievable data rate becomes a complex function of the decoding error probability and ...
Amr A. AbdelNabi, Mark F. Flanagan
wiley +1 more source
The importance of tie-breaking in finite-blocklength bounds [PDF]
2013 IEEE International Symposium on Information Theory, 2013 We consider upper bounds on the error probability in channel coding. We derive an improved maximum-likelihood union bound, which takes into account events where the likelihood of the correct codeword is tied with that of some competitors. We compare this bound to various previous results, both qualitatively and quantitatively.
Eli Haim, Yuval Kochman, Uri Erez
openaire +2 more sources
A Finite-Blocklength Analysis for URLLC with Massive MIMO
ICC 2021 - IEEE International Conference on Communications, 2021 This paper presents a rigorous finite-blocklength framework for the characterization and the numerical evaluation of the packet error probability achievable in the uplink and downlink of Massive MIMO for ultra-reliable low-latency communications (URLLC).
Lancho A. +3 more
openaire +3 more sources
Reliability‐based quantization for soft decoding of LDPC codes in short‐reach optical links
IET Communications, Volume 16, Issue 1, Page 91-99, January 2022., 2022 Abstract Efficient quantizer design is vital in high‐speed optical receivers. In this paper, the authors propose a three‐level (1.5‐bit) reliability‐based quantizer for low‐complexity soft decoding of low‐density parity‐check (LDPC) codes, and show that it outperforms a conventional quantizer employing eight levels (3 bits).
Sadjad Haddadi +2 more
wiley +1 more source
Finite Blocklength Converse Bounds for Quantum Channels [PDF]
IEEE Transactions on Information Theory, 2014 15 pages, 4 figures (v2: improved notation; one mistake fixed; results unchanged)
William Matthews, Stephanie Wehner
openaire +2 more sources