User selection method for block diagonalization in multiuser MIMO systems

Riichi Kudo, Yasushi Takatori, Kentaro Nishimori, Atsushi Ohta, Shuji Kubota

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

8 Citations (Scopus)

Abstract

Multiuser (MU) - multiple input multiple output (MIMO) techniques were proposed to increase the spectrum efficiency because only a few antenna branches are allowed at a simple mobile terminal (MT). Among the MU-MIMO techniques, the block diagonalization (BD) algorithm is well known as a practical linear precoding technique for a downlink. In this paper, we analyze an achievable bit rate in MU-MIMO using BD algorithm and derive the simplified expression using the signal spaces of users. Based on the derived expression, two kinds of user selection methods for the BD algorithm (USBD) in MUMIMO systems are proposed. The proposed methods estimate the improvement in the achievable bit rate compared to that in a single user (SU)-MIMO system using the signal spaces of the supported users. The first proposed method is USBD with a full search (USBD-FS) and it selects the combination of users to achieve the highest total throughput by considering all the combinations. The second proposed method is USBD with a tree structure search (USBD-TS), which drastically reduces the calculation complexity. Although all combinations of users are not considered in USBD-TS, a sufficient achievable bit rate is obtained while the calculation load is much less than that for the conventional method. Computer simulations confirm that USBD-FS and USBD-TS obtain the achievable bit rate of 100.0% and 91.1% compared to that for the best combination of users when the angle spread at the transmitter is 75°.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Pages3295-3300
Number of pages6
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007 - Washington, DC
Duration: 2007 Nov 262007 Nov 30

Other

Other50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
CityWashington, DC
Period07/11/2607/11/30

Fingerprint

Transmitters
Throughput
Antennas
Computer simulation

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kudo, R., Takatori, Y., Nishimori, K., Ohta, A., & Kubota, S. (2007). User selection method for block diagonalization in multiuser MIMO systems. In GLOBECOM - IEEE Global Telecommunications Conference (pp. 3295-3300). [4411535] https://doi.org/10.1109/GLOCOM.2007.625

User selection method for block diagonalization in multiuser MIMO systems. / Kudo, Riichi; Takatori, Yasushi; Nishimori, Kentaro; Ohta, Atsushi; Kubota, Shuji.

GLOBECOM - IEEE Global Telecommunications Conference. 2007. p. 3295-3300 4411535.

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

Kudo, R, Takatori, Y, Nishimori, K, Ohta, A & Kubota, S 2007, User selection method for block diagonalization in multiuser MIMO systems. in GLOBECOM - IEEE Global Telecommunications Conference., 4411535, pp. 3295-3300, 50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007, Washington, DC, 07/11/26. https://doi.org/10.1109/GLOCOM.2007.625
Kudo R, Takatori Y, Nishimori K, Ohta A, Kubota S. User selection method for block diagonalization in multiuser MIMO systems. In GLOBECOM - IEEE Global Telecommunications Conference. 2007. p. 3295-3300. 4411535 https://doi.org/10.1109/GLOCOM.2007.625
Kudo, Riichi ; Takatori, Yasushi ; Nishimori, Kentaro ; Ohta, Atsushi ; Kubota, Shuji. / User selection method for block diagonalization in multiuser MIMO systems. GLOBECOM - IEEE Global Telecommunications Conference. 2007. pp. 3295-3300
@inproceedings{f875d2e958124150b9278eae1ecfc90d,
title = "User selection method for block diagonalization in multiuser MIMO systems",
abstract = "Multiuser (MU) - multiple input multiple output (MIMO) techniques were proposed to increase the spectrum efficiency because only a few antenna branches are allowed at a simple mobile terminal (MT). Among the MU-MIMO techniques, the block diagonalization (BD) algorithm is well known as a practical linear precoding technique for a downlink. In this paper, we analyze an achievable bit rate in MU-MIMO using BD algorithm and derive the simplified expression using the signal spaces of users. Based on the derived expression, two kinds of user selection methods for the BD algorithm (USBD) in MUMIMO systems are proposed. The proposed methods estimate the improvement in the achievable bit rate compared to that in a single user (SU)-MIMO system using the signal spaces of the supported users. The first proposed method is USBD with a full search (USBD-FS) and it selects the combination of users to achieve the highest total throughput by considering all the combinations. The second proposed method is USBD with a tree structure search (USBD-TS), which drastically reduces the calculation complexity. Although all combinations of users are not considered in USBD-TS, a sufficient achievable bit rate is obtained while the calculation load is much less than that for the conventional method. Computer simulations confirm that USBD-FS and USBD-TS obtain the achievable bit rate of 100.0{\%} and 91.1{\%} compared to that for the best combination of users when the angle spread at the transmitter is 75°.",
author = "Riichi Kudo and Yasushi Takatori and Kentaro Nishimori and Atsushi Ohta and Shuji Kubota",
year = "2007",
doi = "10.1109/GLOCOM.2007.625",
language = "English",
isbn = "1424410436",
pages = "3295--3300",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - User selection method for block diagonalization in multiuser MIMO systems

AU - Kudo, Riichi

AU - Takatori, Yasushi

AU - Nishimori, Kentaro

AU - Ohta, Atsushi

AU - Kubota, Shuji

PY - 2007

Y1 - 2007

N2 - Multiuser (MU) - multiple input multiple output (MIMO) techniques were proposed to increase the spectrum efficiency because only a few antenna branches are allowed at a simple mobile terminal (MT). Among the MU-MIMO techniques, the block diagonalization (BD) algorithm is well known as a practical linear precoding technique for a downlink. In this paper, we analyze an achievable bit rate in MU-MIMO using BD algorithm and derive the simplified expression using the signal spaces of users. Based on the derived expression, two kinds of user selection methods for the BD algorithm (USBD) in MUMIMO systems are proposed. The proposed methods estimate the improvement in the achievable bit rate compared to that in a single user (SU)-MIMO system using the signal spaces of the supported users. The first proposed method is USBD with a full search (USBD-FS) and it selects the combination of users to achieve the highest total throughput by considering all the combinations. The second proposed method is USBD with a tree structure search (USBD-TS), which drastically reduces the calculation complexity. Although all combinations of users are not considered in USBD-TS, a sufficient achievable bit rate is obtained while the calculation load is much less than that for the conventional method. Computer simulations confirm that USBD-FS and USBD-TS obtain the achievable bit rate of 100.0% and 91.1% compared to that for the best combination of users when the angle spread at the transmitter is 75°.

AB - Multiuser (MU) - multiple input multiple output (MIMO) techniques were proposed to increase the spectrum efficiency because only a few antenna branches are allowed at a simple mobile terminal (MT). Among the MU-MIMO techniques, the block diagonalization (BD) algorithm is well known as a practical linear precoding technique for a downlink. In this paper, we analyze an achievable bit rate in MU-MIMO using BD algorithm and derive the simplified expression using the signal spaces of users. Based on the derived expression, two kinds of user selection methods for the BD algorithm (USBD) in MUMIMO systems are proposed. The proposed methods estimate the improvement in the achievable bit rate compared to that in a single user (SU)-MIMO system using the signal spaces of the supported users. The first proposed method is USBD with a full search (USBD-FS) and it selects the combination of users to achieve the highest total throughput by considering all the combinations. The second proposed method is USBD with a tree structure search (USBD-TS), which drastically reduces the calculation complexity. Although all combinations of users are not considered in USBD-TS, a sufficient achievable bit rate is obtained while the calculation load is much less than that for the conventional method. Computer simulations confirm that USBD-FS and USBD-TS obtain the achievable bit rate of 100.0% and 91.1% compared to that for the best combination of users when the angle spread at the transmitter is 75°.

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

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

U2 - 10.1109/GLOCOM.2007.625

DO - 10.1109/GLOCOM.2007.625

M3 - Conference contribution

SN - 1424410436

SN - 9781424410439

SP - 3295

EP - 3300

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -