Interference alignment with asymmetric complex signaling and multiuser diversity

Hun Young Shin, Seok Hwan Park, Haewook Park, Inkyu Lee

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

5 Citations (Scopus)

Abstract

In this paper, we consider a downlink transmission technique for multi-cell and multi-user interfering broadcast channels (IFBCs). In this IFBC model, the simplest way to manage inter-cell interference is an orthogonal access method, such as time-division multiple-access (TDMA). Recently, a novel idea of an interference management scheme named interference alignment (IA) has been introduced by Cadambe and Jafar, which requires symbol extension to guarantee a degree-of-freedom (DOF) gain. In this paper, we propose a new IA scheme without symbol extension which outperforms the TDMA and the conventional IA by exploiting multi-user diversity and asymmetric complex signaling. We first introduce an exhaustive scheduling algorithm which shows the optimum performance. Then we propose a simplified suboptimum method to reduce the computational complexity and the search size.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
DOIs
Publication statusPublished - 2010 Dec 1
Event53rd IEEE Global Communications Conference, GLOBECOM 2010 - Miami, FL, United States
Duration: 2010 Dec 62010 Dec 10

Other

Other53rd IEEE Global Communications Conference, GLOBECOM 2010
CountryUnited States
CityMiami, FL
Period10/12/610/12/10

Fingerprint

Time division multiple access
Scheduling algorithms
Computational complexity

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Shin, H. Y., Park, S. H., Park, H., & Lee, I. (2010). Interference alignment with asymmetric complex signaling and multiuser diversity. In GLOBECOM - IEEE Global Telecommunications Conference [5684150] https://doi.org/10.1109/GLOCOM.2010.5684150

Interference alignment with asymmetric complex signaling and multiuser diversity. / Shin, Hun Young; Park, Seok Hwan; Park, Haewook; Lee, Inkyu.

GLOBECOM - IEEE Global Telecommunications Conference. 2010. 5684150.

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

Shin, HY, Park, SH, Park, H & Lee, I 2010, Interference alignment with asymmetric complex signaling and multiuser diversity. in GLOBECOM - IEEE Global Telecommunications Conference., 5684150, 53rd IEEE Global Communications Conference, GLOBECOM 2010, Miami, FL, United States, 10/12/6. https://doi.org/10.1109/GLOCOM.2010.5684150
Shin HY, Park SH, Park H, Lee I. Interference alignment with asymmetric complex signaling and multiuser diversity. In GLOBECOM - IEEE Global Telecommunications Conference. 2010. 5684150 https://doi.org/10.1109/GLOCOM.2010.5684150
Shin, Hun Young ; Park, Seok Hwan ; Park, Haewook ; Lee, Inkyu. / Interference alignment with asymmetric complex signaling and multiuser diversity. GLOBECOM - IEEE Global Telecommunications Conference. 2010.
@inproceedings{966ff2a0d3384a7e903fecd24c0c5727,
title = "Interference alignment with asymmetric complex signaling and multiuser diversity",
abstract = "In this paper, we consider a downlink transmission technique for multi-cell and multi-user interfering broadcast channels (IFBCs). In this IFBC model, the simplest way to manage inter-cell interference is an orthogonal access method, such as time-division multiple-access (TDMA). Recently, a novel idea of an interference management scheme named interference alignment (IA) has been introduced by Cadambe and Jafar, which requires symbol extension to guarantee a degree-of-freedom (DOF) gain. In this paper, we propose a new IA scheme without symbol extension which outperforms the TDMA and the conventional IA by exploiting multi-user diversity and asymmetric complex signaling. We first introduce an exhaustive scheduling algorithm which shows the optimum performance. Then we propose a simplified suboptimum method to reduce the computational complexity and the search size.",
author = "Shin, {Hun Young} and Park, {Seok Hwan} and Haewook Park and Inkyu Lee",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/GLOCOM.2010.5684150",
language = "English",
isbn = "9781424456383",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Interference alignment with asymmetric complex signaling and multiuser diversity

AU - Shin, Hun Young

AU - Park, Seok Hwan

AU - Park, Haewook

AU - Lee, Inkyu

PY - 2010/12/1

Y1 - 2010/12/1

N2 - In this paper, we consider a downlink transmission technique for multi-cell and multi-user interfering broadcast channels (IFBCs). In this IFBC model, the simplest way to manage inter-cell interference is an orthogonal access method, such as time-division multiple-access (TDMA). Recently, a novel idea of an interference management scheme named interference alignment (IA) has been introduced by Cadambe and Jafar, which requires symbol extension to guarantee a degree-of-freedom (DOF) gain. In this paper, we propose a new IA scheme without symbol extension which outperforms the TDMA and the conventional IA by exploiting multi-user diversity and asymmetric complex signaling. We first introduce an exhaustive scheduling algorithm which shows the optimum performance. Then we propose a simplified suboptimum method to reduce the computational complexity and the search size.

AB - In this paper, we consider a downlink transmission technique for multi-cell and multi-user interfering broadcast channels (IFBCs). In this IFBC model, the simplest way to manage inter-cell interference is an orthogonal access method, such as time-division multiple-access (TDMA). Recently, a novel idea of an interference management scheme named interference alignment (IA) has been introduced by Cadambe and Jafar, which requires symbol extension to guarantee a degree-of-freedom (DOF) gain. In this paper, we propose a new IA scheme without symbol extension which outperforms the TDMA and the conventional IA by exploiting multi-user diversity and asymmetric complex signaling. We first introduce an exhaustive scheduling algorithm which shows the optimum performance. Then we propose a simplified suboptimum method to reduce the computational complexity and the search size.

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

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

U2 - 10.1109/GLOCOM.2010.5684150

DO - 10.1109/GLOCOM.2010.5684150

M3 - Conference contribution

AN - SCOPUS:79551623795

SN - 9781424456383

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -