Efficient Computation of the Pareto Boundary for the MISO Interference Channel with Perfect CSI

Abstract : We consider the two-user multiple-input singleoutput (MISO) interference channel and the rate region which is achieved when the receivers treat the interference as additive Gaussian noise and the transmitters have perfect channel state information (CSI). We propose a computationally efficient method for calculating the Pareto boundary of the rate region. We show that the problem of finding an arbitrary Pareto-optimal rate pair, along with its enabling beamforming vector pair, can be cast as a sequence of second-order cone programming (SOCP) feasibility problems. The SOCP problems are convex and they are solved very efficiently using standard off-the-shelf (namely, interiorpoint) algorithms. The number of SOCP problems that must be solved, for the computation of a Pareto-optimal point, grows only logarithmically with the desired accuracy of the solution.
Type de document :
Communication dans un congrès
WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.413-417, 2010
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00499405
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : vendredi 9 juillet 2010 - 14:20:36
Dernière modification le : vendredi 9 juillet 2010 - 17:25:19
Document(s) archivé(s) le : lundi 11 octobre 2010 - 09:59:45

Fichier

p413-karipidis.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00499405, version 1

Collections

Citation

Eleftherios Karipidis, Erik G. Larsson. Efficient Computation of the Pareto Boundary for the MISO Interference Channel with Perfect CSI. WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.413-417, 2010. 〈inria-00499405〉

Partager

Métriques

Consultations de la notice

61

Téléchargements de fichiers

144