2012
DOI: 10.1109/tvt.2012.2190435
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis and Algorithm Designs for Transmit Antenna Selection in Linearly Precoded Multiuser MIMO Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
53
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 49 publications
(54 citation statements)
references
References 33 publications
1
53
0
Order By: Relevance
“…However, previous works on antenna selection for low dimensional systems[42] showed that the performances of decremental approaches are close to the ones achieved by exhaustive search methods.…”
mentioning
confidence: 81%
See 1 more Smart Citation
“…However, previous works on antenna selection for low dimensional systems[42] showed that the performances of decremental approaches are close to the ones achieved by exhaustive search methods.…”
mentioning
confidence: 81%
“…Results obtained in (43), (44) can be generalized to identify the global loss caused by the selection of a subset of beams as where Hence the loss is a function of γ and approaches an upper bound [42] as γ → ∞, defined in the following equation…”
Section: Performance Analysis-spectral Efficiency Lossmentioning
confidence: 99%
“…This chapter compares the performance and complexity of the proposed algorithms with those of existing methods: capacity-based reduced-complexity selection (CBRCS) [11], norm-based selection (NBS) [12], and no antenna selection ( = ). The Shannon spectral efficiency (SE) for the transmit-antenna selection schemes is evaluated and compared.…”
Section: Performance Evaluationmentioning
confidence: 99%
“…Even though the performance of this exhaustive search can be optimized, its complexity still increases linearly with the total number of antennas and the number of antennas to be selected. Therefore, much research on transmission antenna selection schemes has been performed, in an attempt to achieve lower complexity than that of exhaustive search methods [8][9][10][11][12]. With that purpose, greedy search schemes were proposed in [11].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation