BER Based Multiuser MIMO User Selection with Block Diagonalization

Ko, Kyeongjun; Kim, Kyungchul; Lee, Jung Woo

doi:10.1109/vetecs.2010.5493757

Cited by 3 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…respectively. From (12) and (13), it can be shown that for a largescale antenna network where N is much larger than both K and S, and K ≤ S, then the computation complexities † Although the proposed scheme requires additional flops for sorting user and antenna sets, they are ignored for simplicity because they are insignificant compared with SVD operations. of the proposed and optimal schemes grow in the order of O(N ) † † and O( (…”

Section: Computation Complexity Analysismentioning

confidence: 99%

See 1 more Smart Citation

User and Antenna Joint Selection in Multi-User Large-Scale MIMO Downlink Networks

Jeong

Ban

Jung

2017

IEICE Trans. Commun.

View full text Add to dashboard Cite

Moo-Woong JEONG †a) , Nonmember, Tae-Won BAN †b) , Member, and Bang Chul JUNG † †c) , Nonmember SUMMARY In this paper, we investigate a user and antenna joint selection problem in multiuser large-scale MIMO downlink networks, where a BS with N transmit antennas serves K users, and N is much larger than K. The BS activates only S(S ≤ N) antennas for data transmission to reduce hardware cost and computation complexity, and selects the set of users to which data is to be transmitted by maximizing the sum-rate. The optimal user and antenna joint selection scheme based on exhaustive search causes considerable computation complexity. Thus, we propose a new joint selection algorithm with low complexity and analyze the performance of the proposed scheme in terms of sum-rate and complexity. When S = 7, N = 10, K = 5, and SNR=10 dB, the sum-rate of the proposed scheme is 5.1% lower than that of the optimal scheme, while the computation complexity of the proposed scheme is reduced by 99.0% compared to that of the optimal scheme.

show abstract

Section: Computation Complexity Analysismentioning

confidence: 99%

“…The antenna mismatch problem can be mitigated by the multi-user MIMO (MU-MIMO) technique, where a BS transmits data to multiple users simultaneously. In the MU-MIMO technique, the BS can maximize the sum-rate by selecting the optimal set of users [12]- [14].…”

Section: Introductionmentioning

confidence: 99%

User and Antenna Joint Selection in Multi-User Large-Scale MIMO Downlink Networks

Jeong

Ban

Jung

2017

IEICE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…A study for adaptive modulation in practical systems was reported in [20], where the authors commented on the necessity of the BER as a performance measure in practical systems; they also proposed adaptive modulation schemes by considering uncoded BER and discrete modulation, but not capacity. Thus we also consider the uncoded BER (i.e., without channel coding) for MU-MIMO systems, as proposed in [21], [22]. The MU-MIMO system in [21] considered a case where only one stream was served for each scheduled user, whereas the present study proposes stream selection algorithms that enable serving multiple streams for each scheduled user.…”

Section: Introductionmentioning

confidence: 99%

Joint Power Allocation and Scheduling Techniques for BER Minimization in Multiuser MIMO Systems

Byun

Lee

et al. 2021

IEEE Access

Self Cite

View full text Add to dashboard Cite

In contrast to the 4G LTE, one of the key requirements of 5G and beyond networks is ultrahigh reliability. Towards this end, we investigate the problem of scheduling with joint power allocation for multi-user multiple-input multiple-output (MU-MIMO) systems by taking the reliability into account. In this study, two novel MU-MIMO scheduling methods are proposed based on the use of bit error rate (BER) as the scheduling metric; however, capacity has been typically considered as an user-selection metric in MU-MIMO systems to increase the sum-throughput. In particular, we also develop a new power allocation strategy that can minimize the BER for a given data transmission rate. The computational complexities of the two aforementioned BER-based scheduling algorithms, as well as the conventional capacity-based algorithm, are analyzed. Our simulation results show that the proposed BER-based scheduling algorithms with the joint power allocation have better performance in terms of BER compared to the conventional MIMO scheduling schemes such as a single-user MIMO (SU-MIMO) and the capacity-based scheduling algorithm. The proposed multi-user scheduling framework can be utilized in various emerging applications demanding higher reliability and availability such as mission-critical services.INDEX TERMS Multi-user multiple-input multiple-output (MU-MIMO), bit-error rate (BER), power allocation, scheduling, block diagonalization

show abstract

“…5 The complexity of the nonlinear operations prohibits it from applying. 13,14 In general, the performance is characterized by the sum rate of the MIMO BC system. The basic idea of precoding is zero-forcing beamforming.…”

Section: Introductionmentioning

confidence: 99%

“…8 The scheduling in communication including wireless routing networks and mobile communications can be divided into 2 categories according to the criteria, the sum rate, [9][10][11][12] and bit error rate. 13,14 In general, the performance is characterized by the sum rate of the MIMO BC system. The user selection can also be divided into 2 kinds by the meaning, user selection and user grouping.…”

Section: Introductionmentioning

confidence: 99%

User scheduling based on angles with block diagonalization in MU‐MIMO broadcast

Yuan

Cao

Zhang

2017

Int J Communication

View full text Add to dashboard Cite

This paper investigates user selection scheme in the multiuser multiple-input multiple-output (MU-MIMO) broadcast (BC) scene with block diagonalization precoding. Block diagonalization is a suboptimal but practical linear precoding method, which can eliminate the multiuser interference by turning the MU-MIMO BC channel into parallel MIMO channels. With this precoding method, we propose the best user from the user subset to maximize the total throughput in the MU-MIMO BC system. The angles between subspaces used in this paper are induced from n-inner product, an extension from norm space to the n-dimensional space, which characterizes the orthogonality between subspaces. One of the algorithms achieves good performance by comparing the capacity greedily, the other one attains high capacity by reducing the cardinality of the user subset to improve the orthogonality between the user channels, which could be seen as a complexity reduction algorithm with respect to the former one. Indeed, they are all based on the angles between subspaces. Analysis shows that both of the proposed algorithms have lower complexity and better performance than the classical algorithms. The numerical results also confirm our analysis. KEYWORDSangles between spaces, block diagonalization, MU-MIMO, n-inner product, user scheduling 1 Int J Commun Syst. 2017;30:e3300.wileyonlinelibrary.com/journal/dac

show abstract

BER Based Multiuser MIMO User Selection with Block Diagonalization

Cited by 3 publications

References 16 publications

User and Antenna Joint Selection in Multi-User Large-Scale MIMO Downlink Networks

User and Antenna Joint Selection in Multi-User Large-Scale MIMO Downlink Networks

Joint Power Allocation and Scheduling Techniques for BER Minimization in Multiuser MIMO Systems

User scheduling based on angles with block diagonalization in MU‐MIMO broadcast

Contact Info

Product

Resources

About