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

Sub-Modularity and Antenna Selection in MIMO Systems

Abstract: In this paper, we show that the optimal receive antenna subset selection problem for maximizing the mutual information in a point-to-point MIMO system is sub-modular. Consequently, a greedy step-wise optimization approach, where at each step, an antenna that maximizes the incremental gain is added to the existing antenna subset, is guaranteed to be within a (1 − 1/e)-fraction of the global optimal value independent of all parameters. For a single-antenna-equipped source and destination with multiple relays, we… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 34 publications
(25 citation statements)
references
References 27 publications
0
25
0
Order By: Relevance
“…Submodularity enables the use of a "greedy selection" algorithm that performs this optimization to within a constant factor of the global maximum, while requiring a significantly lower number of computations. In wireless MIMO systems, it is known that the problem of selecting a subset of antennas at the receiver for signal detection is submodular [28]. In the MMF case, the link rate is observed to be submodular with respect to the grid of detectors chosen, while keeping the laser configurations fixed.…”
Section: B Submodular Searchmentioning
confidence: 99%
See 1 more Smart Citation
“…Submodularity enables the use of a "greedy selection" algorithm that performs this optimization to within a constant factor of the global maximum, while requiring a significantly lower number of computations. In wireless MIMO systems, it is known that the problem of selecting a subset of antennas at the receiver for signal detection is submodular [28]. In the MMF case, the link rate is observed to be submodular with respect to the grid of detectors chosen, while keeping the laser configurations fixed.…”
Section: B Submodular Searchmentioning
confidence: 99%
“…The greedy search approach aggressively seeks to place detectors where the dominant modes' power is received. While the efficient greedy search technique is useful for developing static detector arrays, a small number of computations can also be used to enable dynamically reconfigurable detector arrays for reduced complexity signal processing [28].…”
Section: Introductionmentioning
confidence: 99%
“…This is because of the evaluation of the best combination of modes that provide the highest achievable rate would require checking each combination of L rows of H, thus requiring O(D L ) comparisons. To reduce this complexity, we adopt a greedy approach to select the modes, similar to the antenna selection paradigm described in [15]. Such an approach, while suboptimal, reduces the number of comparisons required to O(DL), which is much smaller.…”
Section: Sub-modularity and Mode Selection At The Receivermentioning
confidence: 99%
“…It was shown in [13] that C(L) is a monotone submodular in the columns of β, Theorem(1). The proof of Theorem (1) involves showing C(L) is equal to entropy of some random variable.…”
Section: Definition 2 (Monotone): a Set Functionmentioning
confidence: 99%