A QR Decomposition Algorithm with Partial Greedy Permutation for Zero-Forcing Block Diagonalization

Shigenori KINJO; Takayuki GAMOH; Masaaki YAMANAKA

doi:10.1587/transfun.2022EAP1065

A QR Decomposition Algorithm with Partial Greedy Permutation for Zero-Forcing Block Diagonalization

Shigenori KINJO, Takayuki GAMOH, Masaaki YAMANAKA

Full Text Views

32

Cite this

Summary :

A new zero-forcing block diagonalization (ZF-BD) scheme that enables both a more simplified ZF-BD and further increase in sum rate of MU-MIMO channels is proposed in this paper. The proposed scheme provides the improvement in BER performance for equivalent SU-MIMO channels. The proposed scheme consists of two components. First, a permuted channel matrix (PCM), which is given by moving the submatrix related to a target user to the bottom of a downlink MIMO channel matrix, is newly defined to obtain a precoding matrix for ZF-BD. Executing QR decomposition alone for a given PCM provides null space for the target user. Second, a partial MSQRD (PMSQRD) algorithm, which adopts MSQRD only for a target user to provide improvement in bit rate and BER performance for the user, is proposed. Some numerical simulations are performed, and the results show improvement in sum rate performance of the total system. In addition, appropriate bit allocation improves the bit error rate (BER) performance in each equivalent SU-MIMO channel. A successive interference cancellation is applied to achieve further improvement in BER performance of user terminals.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E106-A No.4 pp.665-673

Publication Date: 2023/04/01

Publicized: 2022/10/18

Online ISSN: 1745-1337

DOI: 10.1587/transfun.2022EAP1065

Type of Manuscript: PAPER

Category: Communication Theory and Signals

Authors

Shigenori KINJO
  the Japan Coast Guard Academy
Takayuki GAMOH
  the Japan Coast Guard
Masaaki YAMANAKA
  the Japan Coast Guard Academy

Keyword

muti-user MIMO, block diagonalization, QR decomposition, greedy permutation

Cite this

Copy

Shigenori KINJO, Takayuki GAMOH, Masaaki YAMANAKA, "A QR Decomposition Algorithm with Partial Greedy Permutation for Zero-Forcing Block Diagonalization" in IEICE TRANSACTIONS on Fundamentals, vol. E106-A, no. 4, pp. 665-673, April 2023, doi: 10.1587/transfun.2022EAP1065.
Abstract: A new zero-forcing block diagonalization (ZF-BD) scheme that enables both a more simplified ZF-BD and further increase in sum rate of MU-MIMO channels is proposed in this paper. The proposed scheme provides the improvement in BER performance for equivalent SU-MIMO channels. The proposed scheme consists of two components. First, a permuted channel matrix (PCM), which is given by moving the submatrix related to a target user to the bottom of a downlink MIMO channel matrix, is newly defined to obtain a precoding matrix for ZF-BD. Executing QR decomposition alone for a given PCM provides null space for the target user. Second, a partial MSQRD (PMSQRD) algorithm, which adopts MSQRD only for a target user to provide improvement in bit rate and BER performance for the user, is proposed. Some numerical simulations are performed, and the results show improvement in sum rate performance of the total system. In addition, appropriate bit allocation improves the bit error rate (BER) performance in each equivalent SU-MIMO channel. A successive interference cancellation is applied to achieve further improvement in BER performance of user terminals.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2022EAP1065/_p

Copy

@ARTICLE{e106-a_4_665,
author={Shigenori KINJO, Takayuki GAMOH, Masaaki YAMANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A QR Decomposition Algorithm with Partial Greedy Permutation for Zero-Forcing Block Diagonalization},
year={2023},
volume={E106-A},
number={4},
pages={665-673},
abstract={A new zero-forcing block diagonalization (ZF-BD) scheme that enables both a more simplified ZF-BD and further increase in sum rate of MU-MIMO channels is proposed in this paper. The proposed scheme provides the improvement in BER performance for equivalent SU-MIMO channels. The proposed scheme consists of two components. First, a permuted channel matrix (PCM), which is given by moving the submatrix related to a target user to the bottom of a downlink MIMO channel matrix, is newly defined to obtain a precoding matrix for ZF-BD. Executing QR decomposition alone for a given PCM provides null space for the target user. Second, a partial MSQRD (PMSQRD) algorithm, which adopts MSQRD only for a target user to provide improvement in bit rate and BER performance for the user, is proposed. Some numerical simulations are performed, and the results show improvement in sum rate performance of the total system. In addition, appropriate bit allocation improves the bit error rate (BER) performance in each equivalent SU-MIMO channel. A successive interference cancellation is applied to achieve further improvement in BER performance of user terminals.},
keywords={},
doi={10.1587/transfun.2022EAP1065},
ISSN={1745-1337},
month={April},}

Copy

TY - JOUR
TI - A QR Decomposition Algorithm with Partial Greedy Permutation for Zero-Forcing Block Diagonalization
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 665
EP - 673
AU - Shigenori KINJO
AU - Takayuki GAMOH
AU - Masaaki YAMANAKA
PY - 2023
DO - 10.1587/transfun.2022EAP1065
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E106-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2023
AB - A new zero-forcing block diagonalization (ZF-BD) scheme that enables both a more simplified ZF-BD and further increase in sum rate of MU-MIMO channels is proposed in this paper. The proposed scheme provides the improvement in BER performance for equivalent SU-MIMO channels. The proposed scheme consists of two components. First, a permuted channel matrix (PCM), which is given by moving the submatrix related to a target user to the bottom of a downlink MIMO channel matrix, is newly defined to obtain a precoding matrix for ZF-BD. Executing QR decomposition alone for a given PCM provides null space for the target user. Second, a partial MSQRD (PMSQRD) algorithm, which adopts MSQRD only for a target user to provide improvement in bit rate and BER performance for the user, is proposed. Some numerical simulations are performed, and the results show improvement in sum rate performance of the total system. In addition, appropriate bit allocation improves the bit error rate (BER) performance in each equivalent SU-MIMO channel. A successive interference cancellation is applied to achieve further improvement in BER performance of user terminals.
ER -