On the Design of Near-Optimal Generalized Block-Based Spatial Modulation With Low Detection Complexity

Spatial Modulation (SM) and Generalized Spatial Modulation (GSM) have attracted significant attention in the development of spectrally and energy-efficient transmission schemes for multiple-input multiple-output (MIMO) systems. However, independently designing the constellation cardinality and TACs...

Full description

Saved in:
Bibliographic Details
Main Authors: Yen-Ming Chen, Wei-Lun Lin, Heng Lee, Tsung-Lin Chen
Format: Article
Language:English
Published: IEEE 2025-01-01
Series:IEEE Open Journal of Signal Processing
Subjects:
Online Access:https://ieeexplore.ieee.org/document/10994453/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850119869083680768
author Yen-Ming Chen
Wei-Lun Lin
Heng Lee
Tsung-Lin Chen
author_facet Yen-Ming Chen
Wei-Lun Lin
Heng Lee
Tsung-Lin Chen
author_sort Yen-Ming Chen
collection DOAJ
description Spatial Modulation (SM) and Generalized Spatial Modulation (GSM) have attracted significant attention in the development of spectrally and energy-efficient transmission schemes for multiple-input multiple-output (MIMO) systems. However, independently designing the constellation cardinality and TACs leads to limited performance gains and an exponential increase in complexity, particularly under maximum-likelihood (ML) detection. To address these limitations, the generalized block-based spatial modulation (GBSM) scheme was proposed, enabling greater flexibility by jointly designing GSM signals across a block of time indices. Building on this idea, this paper first proposes a near-optimal codebook search method based on three-dimensional (3-D) mapping, applicable to both fast and slow Rayleigh fading channels. Secondly, a codebook-assisted tree-search detector (CATSD) is introduced, offering a 98% reduction in complexity compared to ML detection while maintaining near-ML error performance. Finally, an alternative codebook search method is presented, accompanied by a complexity analysis that reveals a favorable trade-off between performance and computational cost.
format Article
id doaj-art-76bbb3feb3d947a081a1cdbea9f66e33
institution OA Journals
issn 2644-1322
language English
publishDate 2025-01-01
publisher IEEE
record_format Article
series IEEE Open Journal of Signal Processing
spelling doaj-art-76bbb3feb3d947a081a1cdbea9f66e332025-08-20T02:35:32ZengIEEEIEEE Open Journal of Signal Processing2644-13222025-01-01655557010.1109/OJSP.2025.356867510994453On the Design of Near-Optimal Generalized Block-Based Spatial Modulation With Low Detection ComplexityYen-Ming Chen0https://orcid.org/0000-0002-0786-3314Wei-Lun Lin1https://orcid.org/0000-0001-6174-9945Heng Lee2https://orcid.org/0009-0003-7851-057XTsung-Lin Chen3Institute of Communications Engineering and the Department of Electrical Engineering, National Sun Yat-sen University, Kaohsiung, TaiwanDepartment of Communications Engineering, Feng Chia University, Taichung, TaiwanInstitute of Communications Engineering, National Sun Yat-sen University, Kaohsiung, TaiwanInstitute of Communications Engineering, National Sun Yat-sen University, Kaohsiung, TaiwanSpatial Modulation (SM) and Generalized Spatial Modulation (GSM) have attracted significant attention in the development of spectrally and energy-efficient transmission schemes for multiple-input multiple-output (MIMO) systems. However, independently designing the constellation cardinality and TACs leads to limited performance gains and an exponential increase in complexity, particularly under maximum-likelihood (ML) detection. To address these limitations, the generalized block-based spatial modulation (GBSM) scheme was proposed, enabling greater flexibility by jointly designing GSM signals across a block of time indices. Building on this idea, this paper first proposes a near-optimal codebook search method based on three-dimensional (3-D) mapping, applicable to both fast and slow Rayleigh fading channels. Secondly, a codebook-assisted tree-search detector (CATSD) is introduced, offering a 98% reduction in complexity compared to ML detection while maintaining near-ML error performance. Finally, an alternative codebook search method is presented, accompanied by a complexity analysis that reveals a favorable trade-off between performance and computational cost.https://ieeexplore.ieee.org/document/10994453/Massive MIMOspatial modulationgeneralized spatial modulationgeneralized block-based spatial modulationspace-time code
spellingShingle Yen-Ming Chen
Wei-Lun Lin
Heng Lee
Tsung-Lin Chen
On the Design of Near-Optimal Generalized Block-Based Spatial Modulation With Low Detection Complexity
IEEE Open Journal of Signal Processing
Massive MIMO
spatial modulation
generalized spatial modulation
generalized block-based spatial modulation
space-time code
title On the Design of Near-Optimal Generalized Block-Based Spatial Modulation With Low Detection Complexity
title_full On the Design of Near-Optimal Generalized Block-Based Spatial Modulation With Low Detection Complexity
title_fullStr On the Design of Near-Optimal Generalized Block-Based Spatial Modulation With Low Detection Complexity
title_full_unstemmed On the Design of Near-Optimal Generalized Block-Based Spatial Modulation With Low Detection Complexity
title_short On the Design of Near-Optimal Generalized Block-Based Spatial Modulation With Low Detection Complexity
title_sort on the design of near optimal generalized block based spatial modulation with low detection complexity
topic Massive MIMO
spatial modulation
generalized spatial modulation
generalized block-based spatial modulation
space-time code
url https://ieeexplore.ieee.org/document/10994453/
work_keys_str_mv AT yenmingchen onthedesignofnearoptimalgeneralizedblockbasedspatialmodulationwithlowdetectioncomplexity
AT weilunlin onthedesignofnearoptimalgeneralizedblockbasedspatialmodulationwithlowdetectioncomplexity
AT henglee onthedesignofnearoptimalgeneralizedblockbasedspatialmodulationwithlowdetectioncomplexity
AT tsunglinchen onthedesignofnearoptimalgeneralizedblockbasedspatialmodulationwithlowdetectioncomplexity