2010 International Conference on Computational Intelligence and Software Engineering 2010
DOI: 10.1109/wicom.2010.5600976
|View full text |Cite
|
Sign up to set email alerts
|

A Review of Sphere Decoding for MIMO Systems and Its Improvement

Abstract: The sphere decoding algorithm for signal transmitted on multiple antennas channel is considered. In this paper, the preprocessing stage is analyzed in order to seek a reduced complexity and some improvements are made to enhance the performance. The computer simulation results show that the improved algorithm by applying Pohst Enumeration with selected initial radius is more efficient than that by applying Schnorr-Euchner Enumeration. For example, the average floating-point operations in 6×6 MIMO using 64-QAM m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…It aims to find the transmitted-signal vector by means of the minimum Max Likelihood (ML). The basic principle is to try to find the nearest lattice x-point at the y-point within the radius, R [20]. Because the performance of the system depends on the choice of R and the status of the channel prediction, the pre-processing is important.…”
Section: Related Workmentioning
confidence: 99%
“…It aims to find the transmitted-signal vector by means of the minimum Max Likelihood (ML). The basic principle is to try to find the nearest lattice x-point at the y-point within the radius, R [20]. Because the performance of the system depends on the choice of R and the status of the channel prediction, the pre-processing is important.…”
Section: Related Workmentioning
confidence: 99%