Index Modulation–Aided Mixed Massive Random Access

In this study, a mixed massive random access scheme is considered where part of users transmit both common information and user-specific information, while others transmit only common information. In this scheme, common information is transmitted by index modulation (IM)–aided unsourced random acces...

Full description

Bibliographic Details
Main Authors: Zijie Liang, Jianping Zheng, Jie Ni
Format: Article
Language:English
Published: Frontiers Media S.A. 2021-06-01
Series:Frontiers in Communications and Networks
Subjects:
Online Access:https://www.frontiersin.org/articles/10.3389/frcmn.2021.694557/full
id doaj-c21717489b40408ba414fa5aa2f48bbc
record_format Article
spelling doaj-c21717489b40408ba414fa5aa2f48bbc2021-06-14T05:30:30ZengFrontiers Media S.A.Frontiers in Communications and Networks2673-530X2021-06-01210.3389/frcmn.2021.694557694557Index Modulation–Aided Mixed Massive Random AccessZijie LiangJianping ZhengJie NiIn this study, a mixed massive random access scheme is considered where part of users transmit both common information and user-specific information, while others transmit only common information. In this scheme, common information is transmitted by index modulation (IM)–aided unsourced random access (URA), while user-specific information is by IM-aided sourced random access (SRA). Practically, IM-aided URA partitions channel blocks of one transmission frame into multiple groups and then employs the IM principle to activate only part of the channel blocks in each group. IM-aided SRA allocates multiple pilot sequences to each user and activates only one pilot sequence whose index carries the data information. At the receiver, the covariance-based maximum likelihood detection (CB-MLD) is employed to recover the active compressed sensing (CS) code words of URA and information of SRA jointly. To stitch the common information at different blocks of URA, a modified tree decoder is proposed to take the IM constraint into account. Furthermore, to relax the strict threshold requirement and improve the performance, an iterative CS detector and tree decoder are employed to decode the common information, where successive signal reconstruction and interference cancellation are utilized. Finally, computer simulations are given to demonstrate the performance of the proposed scheme.https://www.frontiersin.org/articles/10.3389/frcmn.2021.694557/fullindex modulationrandom accesscompressed sensingiterative receivernon-Bayesian detectiontree decoder
collection DOAJ
language English
format Article
sources DOAJ
author Zijie Liang
Jianping Zheng
Jie Ni
spellingShingle Zijie Liang
Jianping Zheng
Jie Ni
Index Modulation–Aided Mixed Massive Random Access
Frontiers in Communications and Networks
index modulation
random access
compressed sensing
iterative receiver
non-Bayesian detection
tree decoder
author_facet Zijie Liang
Jianping Zheng
Jie Ni
author_sort Zijie Liang
title Index Modulation–Aided Mixed Massive Random Access
title_short Index Modulation–Aided Mixed Massive Random Access
title_full Index Modulation–Aided Mixed Massive Random Access
title_fullStr Index Modulation–Aided Mixed Massive Random Access
title_full_unstemmed Index Modulation–Aided Mixed Massive Random Access
title_sort index modulation–aided mixed massive random access
publisher Frontiers Media S.A.
series Frontiers in Communications and Networks
issn 2673-530X
publishDate 2021-06-01
description In this study, a mixed massive random access scheme is considered where part of users transmit both common information and user-specific information, while others transmit only common information. In this scheme, common information is transmitted by index modulation (IM)–aided unsourced random access (URA), while user-specific information is by IM-aided sourced random access (SRA). Practically, IM-aided URA partitions channel blocks of one transmission frame into multiple groups and then employs the IM principle to activate only part of the channel blocks in each group. IM-aided SRA allocates multiple pilot sequences to each user and activates only one pilot sequence whose index carries the data information. At the receiver, the covariance-based maximum likelihood detection (CB-MLD) is employed to recover the active compressed sensing (CS) code words of URA and information of SRA jointly. To stitch the common information at different blocks of URA, a modified tree decoder is proposed to take the IM constraint into account. Furthermore, to relax the strict threshold requirement and improve the performance, an iterative CS detector and tree decoder are employed to decode the common information, where successive signal reconstruction and interference cancellation are utilized. Finally, computer simulations are given to demonstrate the performance of the proposed scheme.
topic index modulation
random access
compressed sensing
iterative receiver
non-Bayesian detection
tree decoder
url https://www.frontiersin.org/articles/10.3389/frcmn.2021.694557/full
work_keys_str_mv AT zijieliang indexmodulationaidedmixedmassiverandomaccess
AT jianpingzheng indexmodulationaidedmixedmassiverandomaccess
AT jieni indexmodulationaidedmixedmassiverandomaccess
_version_ 1721378738039422976