{"paper":{"title":"A Note on Antenna Selection in Gaussian MIMO Channels: Capacity Guarantees and Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ayan Sengupta, Christina Fragouli, Yahya H. Ezzeldin","submitted_at":"2016-01-21T20:56:19Z","abstract_excerpt":"We consider the problem of selecting $k_t \\times k_r$ antennas from a Gaussian MIMO channel with $n_t \\times n_r$ antennas, where $k_t \\leq n_t$ and $k_r \\leq n_r$. We prove the following two results that hold universally, in the sense that they do not depend on the channel coefficients: (i) The capacity of the best $k_t \\times k_r$ subchannel is always lower bounded by a fraction $\\frac{k_t k_r}{n_t n_r}$ of the full capacity (with $n_t \\times n_r$ antennas). This bound is tight as the channel coefficients diminish in magnitude. (ii) There always exists a selection of $k_t \\times k_r$ antenna"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05784","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}