Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Interference Alignment: A one-sided approach
Information Networking Institute, Carnegie Mellon University.ORCID iD: 0000-0002-9442-671X
Broadband Wireless & Network Sensors Lab, Athens Information Technology.
2011 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Interference Alignment (IA) is the process of designing signals in such a way that they cast overlapping shadows at their unintended receivers, while remaining distinguishable at the intended ones [1]. Our goal in this paper is to come up with an algorithm for IA that runs at the transmitters only (and is transparent to the receivers), that doesn’t require channel reciprocity, and thus alleviates the need to alternate between the forward and reverse network as is the case in [2], thereby saving significant overhead in certain environments where the channel changes frequently. Most importantly, our effort is focused on ensuring that this one-sided approach does not degrade the performance of the system w.r.t. [2]. As a first step, we mathematically express the interference in each receiver’s desired signal as a function of the transmitters’ beamforming vectors. We then propose a simple steepest descent (SD) algorithm and use it to minimize the interference in each receiver’s desired signal space. We mathematically establish equivalences between our approach and the Distributed IA algorithm presented in [2] and show that our algorithm also converges to an alignment solution (when the solution is feasible).

Place, publisher, year, edition, pages
IEEE conference proceedings, 2011. 1-5 p.
Keyword [en]
Interference Alignment, Interference Channel, Matrix Differentials/Derivatives, Optimization, Steepest Descent
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-104842DOI: 10.1109/GLOCOM.2011.6134100Scopus ID: 2-s2.0-84857229471ISBN: 978-1-4244-9267-1 (print)OAI: oai:DiVA.org:kth-104842DiVA: diva2:567718
Conference
Global Telecommunications Conference (GLOBECOM 2011), Austin, TX, 5-9 Dec. 2011
Note

Qc 20121119

Available from: 2012-11-19 Created: 2012-11-14 Last updated: 2014-01-20Bibliographically approved

Open Access in DiVA

fulltext(513 kB)80 downloads
File information
File name FULLTEXT01.pdfFile size 513 kBChecksum SHA-512
4686f1f840ed007b49481eb44a7162adc572d3f269b4298aa3e8e6d61c4a795be222c28f03fdb16759980d0590666c99ab452a83a35d3777b1add3ea1148fb35
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusIEEEXplore

Search in DiVA

By author/editor
Ghauch, Hadi
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 80 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

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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