.png){kind=icon}
返回
Hyper-Dimensional Modulation for Robust Short Packets in Massive Machine-Type Communications
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2023.3239512.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we introduce Hyper-Dimensional Modulation (HDM) for massive machine-type communications (mMTC). HDM enables robust communication of short packets by spreading information bits across many elements in a hyper-dimensional vector and superimposing a set of such non-orthogonal vectors. The proposed CRC-aided K-best decoding algorithm for HDM can achieve a very low packet error rate (PER) in additive white Gaussian noise (AWGN) channels for short packets. Furthermore, extended decoding algorithms are proposed to combat overwhelming interference in an mMTC network. Comprehensive simulation and real-world experiment results show that HDM outperforms sparse superposition codes in AWGN channels and state-of-the-art short codes such as polar and tail-biting convolutional codes in interference-heavy channels for short packet transmissions.
Keyword:
Massive machine-type communications (mMTC)
multiple access (MA) interference
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
Hyperdimensional Computing: An Introduction to Computing in Distributed Representation with High-Dimensional Random Vectors超维计算: 高维随机向量分布式表示计算简介
PREAI
分享收藏
分享收藏
查看更多内容