The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 보다 단순화된 ZF-BD와 MU-MIMO 채널의 총 전송률을 더욱 증가시키는 새로운 ZF-BD(Zero-Forcing Block Diagonization) 방식을 제안합니다. 제안된 방식은 등가 SU-MIMO 채널에 대한 BER 성능 향상을 제공합니다. 제안된 체계는 두 가지 구성 요소로 구성됩니다. 먼저, ZF-BD에 대한 프리코딩 행렬을 얻기 위해, 하향링크 MIMO 채널 행렬의 맨 아래로 대상 사용자와 관련된 부분 행렬을 이동시켜 주는 PCM(Permuted Channel Matrix)을 새로 정의한다. 주어진 PCM에 대해 QR 분해만 실행하면 대상 사용자에게 널 공간이 제공됩니다. 둘째, 대상 사용자에게만 MSQRD를 적용하여 사용자에게 비트레이트 및 BER 성능 향상을 제공하는 부분 MSQRD(PMSQRD) 알고리즘을 제안한다. 일부 수치 시뮬레이션이 수행되었으며 결과는 전체 시스템의 총 속도 성능이 향상되었음을 보여줍니다. 또한 적절한 비트 할당은 각 등가 SU-MIMO 채널의 비트 오류율(BER) 성능을 향상시킵니다. 사용자 단말의 BER 성능을 더욱 향상시키기 위해 연속적인 간섭 제거가 적용됩니다.
Shigenori KINJO
the Japan Coast Guard Academy
Takayuki GAMOH
the Japan Coast Guard
Masaaki YAMANAKA
the Japan Coast Guard Academy
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
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
부
@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},}
부
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 -