Data-Oriented View for Convolutional Coding With Adaptive Irregular Constellations
Open Access
- 11 February 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (6) , 1771-1775
Abstract
Current wireless systems offer various use-cases where conventional channel capacity focused performance criteria might not apply. Following the similar perspective, convolutional encoding can find more room due to its low complexity and low decoding delay. Besides, it has been also shown that error performance of a convolutional encoder can be improved further by using adaptive irregular constellations. A new performance measure, data-oriented approach, was recently proposed for the transmission of small data packets, i.e. mission-critical IoT applications, over fading channels. In this letter, delay performance gain resulting from convolution coding optimized irregular constellations is investigated. Then, we derive a new performance criterion based on delay and finite block length constraints. Based on this criterion, we design irregular constellations together with convolutional coding for short packet transmission.Keywords
Funding Information
- Research Council of Finland (334000)
This publication has 29 references indexed in Scilit:
- Revisiting Error Analysis in Convolutionally Coded Systems: The Irregular Constellation CaseIEEE Transactions on Communications, 2017
- Narrowband Wireless Access for Low-Power Massive Internet of Things: A Bandwidth PerspectiveIEEE Wireless Communications, 2017
- Low-Density Parity-Check Codes for ATSC 3.0IEEE Transactions on Broadcasting, 2016
- BER Upper Bound Expressions in Coded Two-Transmission Schemes With Arbitrarily Spaced Signal ConstellationsIEEE Communications Letters, 2015
- Variable-Length Convolutional Coding for Short Blocklengths With Decision FeedbackIEEE Transactions on Communications, 2015
- Finite Block-Length Analysis of the Incremental Redundancy HARQIEEE Wireless Communications Letters, 2014
- Quasi-Static Multiple-Antenna Fading Channels at Finite BlocklengthIEEE Transactions on Information Theory, 2014
- Channel Coding Rate in the Finite Blocklength RegimeIEEE Transactions on Information Theory, 2010
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009
- Efficient Computation of Trellis Code Generating FunctionsIEEE Transactions on Communications, 2004