PDF Icon Short Packet Structure for Ultra-Reliable Machine-Type Communication: Tradeoff between Detection and Decoding

Short Packet Structure for Ultra-Reliable Machine-Type Communication: Tradeoff between Detection and Decoding

Bana, A-S., Trillingsgaard, K. F., Popovski, P. & Carvalho, E. D., 13 Sep 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 5 p. (Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing).

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

Machine-type communication requires rethinking of the structure of short packets due to the coding limitations and the significant role of the control information. In ultra-reliable low-latency communication (URLLC), it is crucial to optimally use the limited degrees of freedom (DoFs) to send data and control information. We consider a URLLC model for short packet transmission with acknow 1-edgement (ACK). We compare the detection/decoding performance of two short packet structures: (1) time-multiplexed detection sequence and data; and (2) structure in which both packet detection and data decoding use all DoFs. Specifically, as an instance of the second structure we use superimposed sequences for detection and data. We derive the probabilities of false alarm and misdetection for an AWGN channel and numerically minimize the packet error probability (PER), showing that for delay-constrained data and ACK exchange, there is a tradeoff between the resources spent for detection and decoding. We show that the optimal PER for the superimposed structure is achieved for higher detection overhead. For this reason, the PER is also higher than in the preamble case. However, the superimposed structure is advantageous due to its flexibility to achieve optimal operation without the need to use multiple codebooks.
Original languageEnglish
Title of host publication2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Number of pages5
PublisherIEEE
Publication date13 Sep 2018
ISBN (Print)978-1-5386-4659-5
ISBN (Electronic)978-1-5386-4658-8
DOI
StatePublished - 13 Sep 2018
Publication categoryResearch
Peer-reviewedYes
Event2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) - Calgary, Canada
Duration: 15 Apr 201820 Apr 2018
https://2018.ieeeicassp.org/

Conference

Conference2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
LandCanada
ByCalgary
Periode15/04/201820/04/2018
Internetadresse
SeriesProceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing
ISSN1520-6149

PDF IconDownload ''Short Packet Structure for Ultra-Reliable Machine-Type Communication: Tradeoff between Detection and Decoding''



PDF Icon An Experimental Study of Massive MIMO Properties in 5G Scenarios

An Experimental Study of Massive MIMO Properties in 5G Scenarios

Martinez, A. O., Nielsen, J. Ø., Carvalho, E. D. & Popovski, P., Sep 2018, (Accepted/In press) In : I E E E Transactions on Antennas and Propagation.

Research output: Contribution to journalJournal articleResearchpeer-review

Original languageEnglish
JournalI E E E Transactions on Antennas and Propagation
ISSN0018-926X
DOI
StateAccepted/In press - Sep 2018
Publication categoryResearch
Peer-reviewedYes

PDF IconDownload ''An Experimental Study of Massive MIMO Properties in 5G Scenarios''



PDF Icon Random Access Schemes in Wireless Systems with Correlated User Activity

Random Access Schemes in Wireless Systems with Correlated User Activity

Kalør, A. E., Hanna, O. A. & Popovski, P., 24 Aug 2018, 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018. IEEE, 5 p. 8445866

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

Original languageEnglish
Title of host publication2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018
Number of pages5
PublisherIEEE
Publication date24 Aug 2018
Article number8445866
ISBN (Print)978-1-5386-3513-1
ISBN (Electronic)978-1-5386-3512-4
DOI
StatePublished - 24 Aug 2018
Publication categoryResearch
Peer-reviewedYes
Event19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018 - Kalamata, Greece
Duration: 25 Jun 201828 Jun 2018

Conference

Conference19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018
LandGreece
ByKalamata
Periode25/06/201828/06/2018

PDF IconDownload ''Random Access Schemes in Wireless Systems with Correlated User Activity''



PDF Icon Analysis of the communication traffic for blockchain synchronization of IoT devices

Analysis of the communication traffic for blockchain synchronization of IoT devices

Danzi, P., Kalør, A. E., Stefanović, Č. & Popovski, P., 27 Jul 2018, 2018 IEEE International Conference on Communications, ICC 2018 - Proceedings. IEEE, 7 p. 8422485. (I E E E International Conference on Communications).

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

Original languageEnglish
Title of host publication2018 IEEE International Conference on Communications, ICC 2018 - Proceedings
Number of pages7
PublisherIEEE
Publication date27 Jul 2018
Article number8422485
ISBN (Print)978-1-5386-3181-2
ISBN (Electronic) 978-1-5386-3180-5
DOI
StatePublished - 27 Jul 2018
Publication categoryResearch
Peer-reviewedYes
Event2018 IEEE International Conference on Communications, ICC 2018 - Kansas City, United States
Duration: 20 May 201824 May 2018

Conference

Conference2018 IEEE International Conference on Communications, ICC 2018
LandUnited States
ByKansas City
Periode20/05/201824/05/2018
SponsorCisco, et al., Huawei, National Instruments, Qualcomm, Sprint
SeriesI E E E International Conference on Communications
ISSN1938-1883

PDF IconDownload ''Analysis of the communication traffic for blockchain synchronization of IoT devices''



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 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 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

Kalør, A. E., Guillaume, R., Nielsen, J. J., Mueller, A. & Popovski, P., 22 May 2018, (Accepted/In press) In : IEEE Transactions on Industrial Informatics.

Research output: Contribution to journalJournal articleResearchpeer-review

Original languageEnglish
JournalIEEE Transactions on Industrial Informatics
ISSN1551-3203
DOI
StateAccepted/In press - 22 May 2018
Publication categoryResearch
Peer-reviewedYes

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



PDF Icon Wireless Access for Ultra-Reliable Low-Latency Communication: Principles and Building Blocks

Wireless Access for Ultra-Reliable Low-Latency Communication: Principles and Building Blocks

Popovski, P., Nielsen, J. J., Stefanovic, C., Carvalho, E. D., Strom, E., Trillingsgaard, K. F., Bana, A. S., Kim, D. M., Kotaba, R., Park, J. & Sorensen, R. B., 1 Mar 2018, In : IEEE Network. 32, 2, p. 16-23 8 p.

Research output: Contribution to journalJournal articleResearchpeer-review

Original languageEnglish
JournalIEEE Network
Volume32
Issue number2
Pages (from-to)16-23
Number of pages8
ISSN0890-8044
DOI
StatePublished - 1 Mar 2018
Publication categoryResearch
Peer-reviewedYes

PDF IconDownload ''Wireless Access for Ultra-Reliable Low-Latency Communication: Principles and Building Blocks''



PDF Icon Ultra-Reliable Low Latency Communication (URLLC) using Interface Diversity

Ultra-Reliable Low Latency Communication (URLLC) using Interface Diversity

Nielsen, J. J., Liu, R. & Popovski, P., Mar 2018, In : I E E E Transactions on Communications. 66, 3, p. 1322-1334 13 p.

Research output: Contribution to journalJournal articleResearchpeer-review

An important ingredient of the future 5G systems will be Ultra-Reliable Low-Latency Communication (URLLC). A way to offer URLLC without intervention in the baseband/PHY layer design is to use interface diversity and integrate multiple communication interfaces, each interface based on a different technology. In this work, we propose to use rateless codes to seamlessly distribute coded payload and redundancy data across multiple available communication interfaces. We formulate an optimization problem to find the payload allocation weights that maximize the reliability at specific target latency values.
In order to estimate the performance in terms of latency and reliability of such an integrated communication system, we propose an analysis framework that combines traditional reliability models with technology-specific latency probability distributions.
Our model is capable to account for failure correlation among interfaces/technologies. By considering different scenarios, we find that optimized strategies can significantly outperform strategies based on k-out-of-n erasure codes, where the latter do not account for the characteristics of the different interfaces. The model has been validated through simulation.
Original languageEnglish
JournalI E E E Transactions on Communications
Volume66
Issue number3
Pages (from-to)1322-1334
Number of pages13
ISSN0090-6778
DOI
StatePublished - Mar 2018
Publication categoryResearch
Peer-reviewedYes

PDF IconDownload ''Ultra-Reliable Low Latency Communication (URLLC) using Interface Diversity''



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''



Viewing page 1 of 18|Next Page