Low-Complexity Sphere Decoding Detector for Generalized Spatial Modulation Systems

Cal-Braz, João; Sampaio‐Neto, Raimundo

doi:10.1109/lcomm.2014.2320936

Cited by 54 publications

(23 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This simulation is performed with

N_{normald} = 2

and th = 8 for the set of transmit and receive antennas 4, 5, 6. As expected, it is seen that increasing the number of antennas increases the diversity gain, and the performance of the proposed method is equal to that of the SD method in for this choice of threshold (Figure ). In terms of complexity, this increase in the number of antennas leads to an increase in the complexity (Figure ).…”

Section: Simulation Resultssupporting

confidence: 73%

“…In terms of complexity, this increase in the number of antennas leads to an increase in the complexity (Figure ). Again, it can be seen that the number of visited nodes is significantly smaller than that of the sphere decoding method in . Figures and show the configuration in which the number of transmit and receive antennas are different.…”

Section: Simulation Resultsmentioning

confidence: 96%

“…In this simulation, th = 7, N r ¼ N t ¼ 6, and N d ¼ 3. It is observed that the proposed method achieves a near ML performance with a lower computational complexity in comparison with the method of[28].…”

mentioning

confidence: 93%

See 2 more Smart Citations

Zero forcing based sphere decoder for generalized spatial modulation systems

2019

View full text Add to dashboard Cite

To reduce the number of radio frequency (RF) chains in multiple input multiple output (MIMO) systems, generalized spatial modulation (GSM) techniques have been proposed in the literature. In this paper, we propose a zero‐forcing (ZF)‐based detector, which performs an initial pruning of the search tree that will be considered as the initial condition in a sphere decoding (SD) algorithm. The proposed method significantly reduces the computational complexity of GSM systems while achieving a near maximum likelihood (ML) performance. We analyze the performance of the proposed method and provide an analytic performance difference between the proposed method and the ML detector. Simulation results show that the performance of the proposed method is very close to that of the ML detector, while achieving a significant computational complexity reduction in comparison with the conventional SD method, in terms of the number of visited nodes. We also present some simulations to assess the accuracy of our theoretical results.

show abstract

“…This simulation is performed with

N_{normald} = 2

Section: Simulation Resultssupporting

confidence: 73%

Section: Simulation Resultsmentioning

confidence: 96%

See 1 more Smart Citation

Zero forcing based sphere decoder for generalized spatial modulation systems

2019

View full text Add to dashboard Cite

show abstract

“…As benchmarks, the complexity of the SD-Rx and the SD-Tx is also provided. It is shown that although the complexity of the proposed scheme increases as M increases, it still achieves a considerable complexity reduction of 56% compared to SDRx [12], 78% compared to PIC-R-SIC and 98% compared to ML detector at K=4 and M =4. Moreover, for a large value of K=128, the size of χ is as large as |χ| = 4 128 .…”

Section: B Complexity Analysismentioning

confidence: 99%

“…As indicated in [8]- [12], the achieved beneficial bit-error rate (BER) performance of GSM is dominated by the detectors. However, these existing detection algorithms for GSM scheme are conceived for Rayleigh frequency-flat fading channels.…”

Section: Introductionmentioning

confidence: 99%

A Low-Complexity Detection Scheme for Generalized Spatial Modulation Aided Single Carrier Systems

et al. 2015

View full text Add to dashboard Cite

Generalized spatial modulation (GSM), which combines spatial modulation (SM) and vertical Bell laboratories layered space-time (V-BLAST), is a novel attractive multi-input multi-output (MI-MO) technique. In this Letter, a low-complexity nearoptimal detection scheme is presented for GSM aided single carrier (SC) transmission over dispersive channels. Compared to the conventional partial interference cancellation receiver with successive interference cancellation (PIC-R-SIC), the proposed scheme offers a near maximum likelihood (ML) detection performance while avoiding complicated matrix operations, which allows it to exhibit a lower computational complexity. Simulation results show that the proposed scheme provides a considerable performance improvement compared to PIC-R-SIC, especially in rank-deficient channels scenarios.Index Terms-Generalized spatial modulation (GSM), single carrier (SC), maximum likelihood (ML) detection, rank-deficient.

show abstract