PDF Icon Common-Message Broadcast Channels with Feedback in the Nonasymptotic Regime: Stop Feedback

Common-Message Broadcast Channels with Feedback in the Nonasymptotic Regime: Stop Feedback

Trillingsgaard, K. F., Yang, W., Durisi, G. & Popovski, P. 13 Jul 2018 (Accepted/In press) In : I E E E Transactions on Information Theory.

Research output: Contribution to journalJournal articleResearchpeer-review

We investigate the maximum coding rate for a given average blocklength and error probability over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback codes. For the point-to-point case, Polyanskiy et al. (2011) demonstrated that variable-length coding
combined with stop-feedback significantly increase the speed of convergence of the maximum coding rate to capacity. This speed-up manifests itself in the absence of a square-root penalty in the asymptotic expansion of the maximum coding rate for large blocklengths, i.e., zero dispersion. In this paper, we present nonasymptotic achievability and converse bounds on the maximum coding rate of the common-message K-user discrete memoryless broadcast channel, which strengthen and generalize the ones reported in Trillingsgaard et al. (2015) for the two-user case. An asymptotic analysis of these bounds reveals that zero dispersion cannot be achieved for certain common-message broadcast channels (e.g., the binary symmetric broadcast channel). Furthermore, we identify conditions under which our converse and achievability bounds are tight up to the second order. Through numerical evaluations, we illustrate that our second-order expansions approximate accurately the maximum coding rate and that the speed of convergence to capacity is indeed slower than for the point-to-point case.
Original languageEnglish
JournalI E E E Transactions on Information Theory
ISSN0018-9448
StateAccepted/In press - 13 Jul 2018
Publication categoryResearch
Peer-reviewedYes

PDF IconDownload ''Common-Message Broadcast Channels with Feedback in the Nonasymptotic Regime: Stop Feedback''



PDF Icon Common-Message Broadcast Channels with Feedback in the Nonasymptotic Regime: Full Feedback

Common-Message Broadcast Channels with Feedback in the Nonasymptotic Regime: Full Feedback

Trillingsgaard, K. F., Yang, W., Durisi, G. & Popovski, P. 13 Jul 2018 (Accepted/In press) In : I E E E Transactions on Information Theory.

Research output: Contribution to journalJournal articleResearchpeer-review

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code setup, we establish nonasymptotic converse and achievability bounds. An asymptotic analysis of these bounds reveals that feedback improves the second-order term compared to the no-feedback case. In particular, for a certain class of anti-symmetric broadcast channels, we show that the dispersion is halved. For the variable-length-code setup, we demonstrate that the channel dispersion is zero.
Original languageEnglish
JournalI E E E Transactions on Information Theory
ISSN0018-9448
StateAccepted/In press - 13 Jul 2018
Publication categoryResearch
Peer-reviewedYes

PDF IconDownload ''Common-Message Broadcast Channels with Feedback in the Nonasymptotic Regime: Full Feedback''



PDF Icon Generalized HARQ Protocols with Delayed Channel State Information and Average Latency Constraints

Generalized HARQ Protocols with Delayed Channel State Information and Average Latency Constraints

Trillingsgaard, K. F. & Popovski, P. Feb 2018 In : I E E E Transactions on Information Theory. 64, 2, p. 1262-1280 19 p.

Research output: Contribution to journalJournal articleResearchpeer-review

In many practical wireless systems, the signal-to-interference-and-noise ratio (SINR) that is applicable to a certain transmission, referred to as channel state information (CSI), can only be learned after the transmission has taken place and is thereby delayed (outdated). In such systems, hybrid automatic repeat request (HARQ) protocols are often used to achieve high throughput with low latency. This paper put forth the family of expandable message space (EMS) protocols that generalize the HARQ protocol and allow for rate adaptation based on delayed CSI at the transmitter (CSIT). Assuming a block-fading channel, the proposed EMS protocols are analyzed using dynamic programming. When full CSIT is available and there is a constraint on the average decoding time, it is shown that the optimal EMS protocol has a particularly simple operational interpretation and that the throughput is identical to that of the backtrack retransmission request (BRQ) protocol. We also devise EMS protocols for the case in which CSIT is only available through a finite number of feedback messages. The numerical results demonstrate that BRQ approaches the ergodic capacity quickly compared to HARQ, while EMS protocols with only three and four feedback messages achieve throughput that are only slightly worse than the throughput of BRQ.
Original languageEnglish
JournalI E E E Transactions on Information Theory
Volume64
Issue number2
Pages (from-to)1262-1280
Number of pages19
ISSN0018-9448
DOI
StatePublished - Feb 2018
Publication categoryResearch
Peer-reviewedYes

PDF IconDownload ''Generalized HARQ Protocols with Delayed Channel State Information and Average Latency Constraints''



PDF Icon Wireless Channel Modeling Perspectives for Ultra-Reliable Low Latency Communications

Ultra-Reliable Low Latency Communication (URLLC) is one of the distinctive features of the upcoming 5G wireless communication, going down to packet error rates (PER) of 10^-9. In this paper we discuss the properties and statistical behavior of number of wireless channel models in the operational regime that is relevant for URLLC applications. In particular, we analyze the tail of the Cumulative Distribution Function (CDF) of block fading channels in the regime of extremely rare events and show that, for a wide range of channel models, the outage probability can be approximated by a simple power law expression, whose exponent and offset depend on the actual channel model. Besides their
practical significance in terms of characterizing the wireless channel via only two parameters, the tail approximations also provide an insightful tool for immediate qualitative characterization and comparison of wireless channel models in URLLC applications. We apply our power law approximation results to analyze the performance of receiver diversity schemes and obtain a new simplified expression for Maximum Ratio Combining.
Original languageEnglish
JournalIEEE Transactions on Wireless Communications
ISSN1536-1276
StateSubmitted - 2018
Publication categoryResearch
Peer-reviewedYes

PDF IconDownload ''Wireless Channel Modeling Perspectives for Ultra-Reliable Low Latency Communications''



PDF Icon Multi-Channel Access Solutions for 5G New Radio

Multi-Channel Access Solutions for 5G New Radio

Mahmood, N. H., Laselva, D., Palacios, D., Emara, M., Filippou, M. C., Kim, D. M. & de-la-Bandera, I. 2018 (Submitted) In : I E E E Communications Magazine.

Research output: Contribution to journalJournal articleResearchpeer-review

The arrival of 5G New Radio Release-15 opens the door for introducing Radio Resource Management solutions targeting enhanced mobile broadband and ultra-reliable low latency communication service classes. Multi-Channel Access is a family of such multi-service solution, which enables a user equipment to aggregate radio resources from multiple sources, either from the same or from different nodes. The objective is multi-fold; throughput enhancement through access to a larger bandwidth, reliability improvement by increasing the diversity order and/or coordinated transmission/reception, or more flexible load balance and performance increase by decoupling the downlink and the uplink access points. This paper presents a number of multi-channel solutions for the 5G New Radio multi-service scenario. In particular, we discuss throughput enhancement and latency reduction concepts like multinode connectivity, carrier aggregation, downlink-uplink decoupled access and coordinated multi-point connectivity. A number of design challenges for these concepts are then highlighted, followed by novel solution proposals. All the proposed solutions are numerically validated, and found to result in significant performance gains over state-of-the-art solutions; for example, our proposed component carrier selection mechanism leads to an average median throughput gain of around 66% by means of an implicit load balance.
Original languageEnglish
JournalI E E E Communications Magazine
ISSN0163-6804
StateSubmitted - 2018
Publication categoryResearch
Peer-reviewedYes

PDF IconDownload ''Multi-Channel Access Solutions for 5G New Radio''



PDF Icon Network Slicing in Industry 4.0 Applications: Abstraction Methods and End-to-End Analysis

Network Slicing in Industry 4.0 Applications: Abstraction Methods and End-to-End Analysis

Nielsen, J. J., Popovski, P. & Kalør, A. E. 2018 (Submitted) In : I E E E Network.

Research output: Contribution to journalJournal articleResearchpeer-review

Industry 4.0 refers to the fourth industrial revolution, and
introduces modern communication and computation technologies such as
5G, cloud computing and Internet of Things to industrial manufacturing
systems. As a result, many devices, machines and applications will
rely on connectivity, while having different requirements from the
network, ranging from high reliability and low latency to high data
rates. Furthermore, these industrial networks will be highly
heterogeneous as they will feature a number of diverse communication
technologies. In this article, we propose network slicing as a mechanism
to handle the diverse set of requirements to the network. We present
methods for slicing deterministic and packet-switched industrial
communication protocols at an abstraction level which is decoupled
from the specific implementation of the underlying technologies, and
hence simplifies the slicing of heterogeneous networks. Finally, we
show how network calculus can be used to assess the end-to-end properties
of the network slices.
Original languageEnglish
JournalI E E E Network
ISSN0890-8044
DOI
StateSubmitted - 2018
Publication categoryResearch
Peer-reviewedYes

PDF IconDownload ''Network Slicing in Industry 4.0 Applications: Abstraction Methods and End-to-End Analysis''



PDF Icon Hybrid Precoding for Massive MIMO Systems in Cloud RAN Architecture with Capacity-Limited Fronthauls



PDF Icon Grant-Free Radio Access for Short-Packet Communications over 5G Networks

Grant-Free Radio Access for Short-Packet Communications over 5G Networks

Azari, A., Popovski, P., Miao, G. & Stefanovic, C. 2018 Proceedings of IEEE Globecom 2017. IEEE

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

Original languageEnglish
Title of host publicationProceedings of IEEE Globecom 2017
PublisherIEEE
Publication date2018
ISBN (Print)978-1-5090-5020-8
ISBN (Electronic)978-1-5090-5019-2
DOI
StatePublished - 2018
Publication categoryResearch
Peer-reviewedYes
EventIEEE GLOBECOM 2017: Global Hub: Connecting East and West - , Singapore
Duration: 4 Dec 20178 Dec 2017
http://globecom2017.ieee-globecom.org/

Conference

ConferenceIEEE GLOBECOM 2017
LandSingapore
Periode04/12/201708/12/2017
Internetadresse

PDF IconDownload ''Grant-Free Radio Access for Short-Packet Communications over 5G Networks''



PDF Icon Distributed proportional-fairness control in microgrids via blockchain smart contracts

Distributed proportional-fairness control in microgrids via blockchain smart contracts

Danzi, P., Angjelichinoski, M., Stefanovic, C. & Popovski, P. 2018 Smart Grid Communications (SmartGridComm), 2017 IEEE International Conference on. IEEE

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

Original languageEnglish
Title of host publicationSmart Grid Communications (SmartGridComm), 2017 IEEE International Conference on
PublisherIEEE
Publication date2018
ISBN (Print)978-1-5386-2401-2
ISBN (Electronic)978-1-5386-0943-9
DOI
StatePublished - 2018
Publication categoryResearch
Peer-reviewedYes
EventIEEE International Conference on Smart Grid Communications - Dresden, Germany
Duration: 23 Oct 201726 Oct 2017
http://sgc2017.ieee-smartgridcomm.org/

Conference

ConferenceIEEE International Conference on Smart Grid Communications
LandGermany
ByDresden
Periode23/10/201726/10/2017
Internetadresse

PDF IconDownload ''Distributed proportional-fairness control in microgrids via blockchain smart contracts''



PDF Icon Frameless ALOHA with Reliability-Latency Guarantees

Frameless ALOHA with Reliability-Latency Guarantees

Stefanovic, C., Lazaro, F. & Popovski, P. 2018 Proceedings of IEEE Globecom 2017. IEEE

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

Original languageEnglish
Title of host publicationProceedings of IEEE Globecom 2017
PublisherIEEE
Publication date2018
ISBN (Print)978-1-5090-5020-8
ISBN (Electronic)978-1-5090-5019-2
DOI
StatePublished - 2018
Publication categoryResearch
Peer-reviewedYes
Event2017 IEEE Globecom Workshops (GC Wkshps): WORKSHOP ON 5G NETWORKS USING UNLICENSED SPECTRUM - , Singapore
Duration: 8 Dec 20178 Dec 2017

Conference

Conference2017 IEEE Globecom Workshops (GC Wkshps)
LandSingapore
Periode08/12/201708/12/2017

PDF IconDownload ''Frameless ALOHA with Reliability-Latency Guarantees''



Viewing page 1 of 17|Next Page