Minimal antenna-subset selection under capacity constraint for power-efficient MIMO systems: A relaxed ℓ1 minimization approach

Masahiro Yukawa, Isao Yamada

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

This paper addresses the minimal subset selection of antennas achieving designated channel capacity. This is one of the most natural approaches to alleviating the power consumption in MIMO systems, while it is a mathematically challenging nonlinearly-constrained sparse optimization (ℓ0-norm minimization) problem. We present an efficient algorithmic solution, to this highly combinatorial problem, using convex and differentiable relaxations of the ℓ0-norm. The proposed algorithm is based on the hybrid steepest descent method for the subgradient projection operator together with the soft-thresholding technique, minimizing the Moreau envelope of the ℓ1-norm subject to the capacity constraint. The simulation results show that the proposed algorithm realizes a near optimal solution to the original nonlinearly-constrained sparse optimization problem.

Original languageEnglish
Title of host publicationICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Pages3058-3061
Number of pages4
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Dallas, TX, United States
Duration: 2010 Mar 142010 Mar 19

Other

Other2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010
CountryUnited States
CityDallas, TX
Period10/3/1410/3/19

Fingerprint

MIMO systems
Antennas
Steepest descent method
Channel capacity
Set theory
Electric power utilization

Keywords

  • ℓ minimization
  • Antenna selection
  • Convex optimization
  • MIMO systems

ASJC Scopus subject areas

  • Signal Processing
  • Software
  • Electrical and Electronic Engineering

Cite this

Yukawa, M., & Yamada, I. (2010). Minimal antenna-subset selection under capacity constraint for power-efficient MIMO systems: A relaxed ℓ1 minimization approach. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings (pp. 3058-3061). [5496109] https://doi.org/10.1109/ICASSP.2010.5496109

Minimal antenna-subset selection under capacity constraint for power-efficient MIMO systems : A relaxed ℓ1 minimization approach. / Yukawa, Masahiro; Yamada, Isao.

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2010. p. 3058-3061 5496109.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yukawa, M & Yamada, I 2010, Minimal antenna-subset selection under capacity constraint for power-efficient MIMO systems: A relaxed ℓ1 minimization approach. in ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings., 5496109, pp. 3058-3061, 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010, Dallas, TX, United States, 10/3/14. https://doi.org/10.1109/ICASSP.2010.5496109
Yukawa M, Yamada I. Minimal antenna-subset selection under capacity constraint for power-efficient MIMO systems: A relaxed ℓ1 minimization approach. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2010. p. 3058-3061. 5496109 https://doi.org/10.1109/ICASSP.2010.5496109
Yukawa, Masahiro ; Yamada, Isao. / Minimal antenna-subset selection under capacity constraint for power-efficient MIMO systems : A relaxed ℓ1 minimization approach. ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2010. pp. 3058-3061
@inproceedings{c62a0d695c1643dabaa0bb8b99e48098,
title = "Minimal antenna-subset selection under capacity constraint for power-efficient MIMO systems: A relaxed ℓ1 minimization approach",
abstract = "This paper addresses the minimal subset selection of antennas achieving designated channel capacity. This is one of the most natural approaches to alleviating the power consumption in MIMO systems, while it is a mathematically challenging nonlinearly-constrained sparse optimization (ℓ0-norm minimization) problem. We present an efficient algorithmic solution, to this highly combinatorial problem, using convex and differentiable relaxations of the ℓ0-norm. The proposed algorithm is based on the hybrid steepest descent method for the subgradient projection operator together with the soft-thresholding technique, minimizing the Moreau envelope of the ℓ1-norm subject to the capacity constraint. The simulation results show that the proposed algorithm realizes a near optimal solution to the original nonlinearly-constrained sparse optimization problem.",
keywords = "ℓ minimization, Antenna selection, Convex optimization, MIMO systems",
author = "Masahiro Yukawa and Isao Yamada",
year = "2010",
doi = "10.1109/ICASSP.2010.5496109",
language = "English",
isbn = "9781424442966",
pages = "3058--3061",
booktitle = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

}

TY - GEN

T1 - Minimal antenna-subset selection under capacity constraint for power-efficient MIMO systems

T2 - A relaxed ℓ1 minimization approach

AU - Yukawa, Masahiro

AU - Yamada, Isao

PY - 2010

Y1 - 2010

N2 - This paper addresses the minimal subset selection of antennas achieving designated channel capacity. This is one of the most natural approaches to alleviating the power consumption in MIMO systems, while it is a mathematically challenging nonlinearly-constrained sparse optimization (ℓ0-norm minimization) problem. We present an efficient algorithmic solution, to this highly combinatorial problem, using convex and differentiable relaxations of the ℓ0-norm. The proposed algorithm is based on the hybrid steepest descent method for the subgradient projection operator together with the soft-thresholding technique, minimizing the Moreau envelope of the ℓ1-norm subject to the capacity constraint. The simulation results show that the proposed algorithm realizes a near optimal solution to the original nonlinearly-constrained sparse optimization problem.

AB - This paper addresses the minimal subset selection of antennas achieving designated channel capacity. This is one of the most natural approaches to alleviating the power consumption in MIMO systems, while it is a mathematically challenging nonlinearly-constrained sparse optimization (ℓ0-norm minimization) problem. We present an efficient algorithmic solution, to this highly combinatorial problem, using convex and differentiable relaxations of the ℓ0-norm. The proposed algorithm is based on the hybrid steepest descent method for the subgradient projection operator together with the soft-thresholding technique, minimizing the Moreau envelope of the ℓ1-norm subject to the capacity constraint. The simulation results show that the proposed algorithm realizes a near optimal solution to the original nonlinearly-constrained sparse optimization problem.

KW - ℓ minimization

KW - Antenna selection

KW - Convex optimization

KW - MIMO systems

UR - http://www.scopus.com/inward/record.url?scp=78049368134&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78049368134&partnerID=8YFLogxK

U2 - 10.1109/ICASSP.2010.5496109

DO - 10.1109/ICASSP.2010.5496109

M3 - Conference contribution

AN - SCOPUS:78049368134

SN - 9781424442966

SP - 3058

EP - 3061

BT - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

ER -