liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Efficient Computation of the Pareto Boundary for the MISO Interference Channel with Perfect CSI
Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-7599-4367
2010 (English)In: Proceedings of the International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2010, 573-577 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider the two-user multiple-input single-output (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, interior-point) 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.

Place, publisher, year, edition, pages
2010. 573-577 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-55026ISBN: 978-1-4244-7523-0 (print)OAI: oai:DiVA.org:liu-55026DiVA: diva2:314369
Conference
The 6th International Workshop on Wireless Networks: Communication, Cooperation, and Competition
Note
Original Publication: Eleftherios Karipidis and Erik G. Larsson, Efficient Computation of the Pareto Boundary for the MISO Interference Channel with Perfect CSI, 2010, Proceedings of the International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 573-577. Available from: 2010-04-27 Created: 2010-04-27 Last updated: 2016-08-31

Open Access in DiVA

fulltext(216 kB)284 downloads
File information
File name FULLTEXT01.pdfFile size 216 kBChecksum SHA-512
02100e9b578bbc492b58288163851c6fb4d5fffd768fa855458c68f851afe6684fa0e7592fa4ead1ed3783cdcf27e2324a5c0109e7ecb8ca1175b7c5d35f7236
Type fulltextMimetype application/pdf

Other links

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

Authority records BETA

Karipidis, EleftheriosLarsson, Erik G.

Search in DiVA

By author/editor
Karipidis, EleftheriosLarsson, Erik G.
By organisation
Communication SystemsThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 284 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 1457 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf