Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00499405
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Friday, July 9, 2010 - 2:20:36 PM
Last modification on : Friday, July 9, 2010 - 5:25:19 PM
Long-term archiving on: : Monday, October 11, 2010 - 9:59:45 AM

File

p413-karipidis.pdf
Files produced by the author(s)

Identifiers

  • 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. ⟨inria-00499405⟩

Share

Metrics

Record views

24

Files downloads

92