Enhanced Sparse Vector Coding for Ultra-Reliable and Low Latency Communications
- 30 March 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (5) , 5698-5702
Abstract
An important observation in the ultra-reliable and low latency communications is that the size of transmit information is tiny. To support the effective short packet transmission, a sparse vector coding (SVC) scheme where an information is encoded into the positions of the sparse vector was proposed. In this paper, we propose a novel SVC technique further improving the reliability of the short packet transmission. Key idea of the proposed technique is to encode information both in the position as well as symbols. From the performance analysis and numerical evaluations on realistic channel models, we demonstrate that the proposed scheme outperforms the conventional SVC scheme in terms of the block error rate (BLER) and transmission latency.Keywords
Funding Information
- Ministry of Science and ICT, South Korea (GK19P0500)
- Development of Ultra Low-Latency Radio Access Technologies
- Samsung Research Funding and Incubation Center for Future Technology (SRFC-IT1901-17)
This publication has 7 references indexed in Scilit:
- Sparse Vector Coding for Ultra Reliable and Low Latency CommunicationsIEEE Transactions on Wireless Communications, 2018
- Ultra-Reliable and Low-Latency Communications in 5G Downlink: Physical Layer AspectsIEEE Wireless Communications, 2018
- Compressed Sensing for Wireless Communications: Useful Tips and TricksIEEE Communications Surveys & Tutorials, 2017
- Toward Massive, Ultrareliable, and Low-Latency Wireless Communication With Short PacketsProceedings of the IEEE, 2016
- Orthogonal Frequency Division Multiplexing With Index ModulationIEEE Transactions on Signal Processing, 2013
- Channel Coding Rate in the Finite Blocklength RegimeIEEE Transactions on Information Theory, 2010
- Signal Recovery From Random Measurements Via Orthogonal Matching PursuitIEEE Transactions on Information Theory, 2007