Non-Coherent Multi-Level Index Modulation

Fazeli, A; Nguyen, HH; Tuan, HD; Poor, HV

Non-Coherent Multi-Level Index Modulation

Fazeli, A Nguyen, HH Tuan, HD Poor, HV

Permalink

Publisher:: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Publication Type:: Journal Article
Citation:: IEEE Transactions on Communications, 2022, 70, (4), pp. 2240-2255
Issue Date:: 2022-04-01

Closed Access

	Filename	Description	Size
	Non-Coherent Multi-Level Index Modulation.pdf	Published version	1.45 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Fazeli, A
dc.contributor.author	Nguyen, HH
dc.contributor.author	Tuan, HD
dc.contributor.author	Poor, HV
dc.date.accessioned	2023-04-06T03:06:49Z
dc.date.available	2023-04-06T03:06:49Z
dc.date.issued	2022-04-01
dc.identifier.citation	IEEE Transactions on Communications, 2022, 70, (4), pp. 2240-2255
dc.identifier.issn	0090-6778
dc.identifier.issn	1558-0857
dc.identifier.uri	http://hdl.handle.net/10453/169282
dc.description.abstract	This paper develops a non-coherent index modulation (IM) system in which activation patterns are characterized by multi-level block codes. We analyze performance of such a system under the maximum-likelihood (ML) receiver and when the set of activation patterns follows a multi-level code generated from asymptotically optimal alphabets. An asymptotic analysis of the pair-wise error probability (PEP) shows that the system can exploit a diversity order that is determined by the distance of the worst codeword pair in the $l_{1}$ metric, known as the Manhattan norm. We then explore the rate-diversity tradeoff for the developed non-coherent IM system as a function of the code length. Specifically, Gilbert-style bounds on the data rates for systems based on binary and ternary codes are obtained that can ensure a given diversity order. We approach the problem of packing in the l1 metric by partitioning codes into permutation modulation codes (PMCs) and obtaining Gilbert-style bounds on PMCs. Several achievable rates for non-coherent binary and ternary IM systems, as well as a tradeoff between the information rate and codeword error probability (CEP) are also derived. Finally, simulation results are provided to corroborate the theoretical analysis.
dc.language	English
dc.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
dc.relation.ispartof	IEEE Transactions on Communications
dc.relation.isbasedon	10.1109/TCOMM.2022.3142159
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0804 Data Format, 0906 Electrical and Electronic Engineering, 1005 Communications Technologies
dc.title	Non-Coherent Multi-Level Index Modulation
dc.type	Journal Article
utslib.citation.volume	70
utslib.for	0804 Data Format
utslib.for	0906 Electrical and Electronic Engineering
utslib.for	1005 Communications Technologies
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access	*
dc.date.updated	2023-04-06T03:06:47Z
pubs.issue	4
pubs.publication-status	Published
pubs.volume	70
utslib.citation.issue	4

Abstract:

This paper develops a non-coherent index modulation (IM) system in which activation patterns are characterized by multi-level block codes. We analyze performance of such a system under the maximum-likelihood (ML) receiver and when the set of activation patterns follows a multi-level code generated from asymptotically optimal alphabets. An asymptotic analysis of the pair-wise error probability (PEP) shows that the system can exploit a diversity order that is determined by the distance of the worst codeword pair in the $l_{1}$ metric, known as the Manhattan norm. We then explore the rate-diversity tradeoff for the developed non-coherent IM system as a function of the code length. Specifically, Gilbert-style bounds on the data rates for systems based on binary and ternary codes are obtained that can ensure a given diversity order. We approach the problem of packing in the l1 metric by partitioning codes into permutation modulation codes (PMCs) and obtaining Gilbert-style bounds on PMCs. Several achievable rates for non-coherent binary and ternary IM systems, as well as a tradeoff between the information rate and codeword error probability (CEP) are also derived. Finally, simulation results are provided to corroborate the theoretical analysis.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/169282