Quantized feedback MIMO scheduling for heterogeneous broadcast networks

Pattanayak, Prabina; Kumar, Pawan

doi:10.1007/s11276-016-1232-0

Cited by 12 publications

(14 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, various simulation results are presented and discussed, which can prove the efficiency of the proposed binary SMO. The system sum‐rate/throughput achieved by various schemes like ESA, binary SMO, GA, binary FPA, random search method, and various suboptimal scheduling algorithms (suboptimal algorithm 1, suboptimal algorithm 2, suboptimal algorithm 3, and suboptimal algorithm 4) discussed in previous studies 20,36,53 are compared and analyzed. We considered four sets of values for

M, N, K, P o p ‐ s i z e, N_{g}

.…”

Section: Resultsmentioning

confidence: 99%

“…The DPC technique relies heavily on the encoding sequence of the user terminals. DPC is the new transmission technique to transmit information from BS to multiple users at the same time in an efficient manner 35,36 . After finishing the searching process over all possible combinations of users, the optimal value of the utility function can be computed.…”

Section: Introductionmentioning

confidence: 99%

“…Performance analysis of binary SMO is presented through various simulation results. Performance analysis of binary SMO is compared with DPC, random search method, suboptimal scheduling algorithms in previous works, 20,36,53 GA, and binary FPA. The suboptimal algorithm allocates independent data streams which are transmitted from M transmit antennas to M users having the most favorable channels (highest SINRs) 20 .…”

Section: Introductionmentioning

confidence: 99%

“…The suboptimal algorithm allocates independent data streams which are transmitted from M transmit antennas to M users having the most favorable channels (highest SINRs) 20 . To reduce the feedback overhead different suboptimal algorithms are discussed in the literature 20,36,53 . In this paper, four existing suboptimal scheduling schemes for the MU‐MIMO broadcast system have been identified for the comparison with the proposed binary SMO algorithm.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, four existing suboptimal scheduling schemes for the MU‐MIMO broadcast system have been identified for the comparison with the proposed binary SMO algorithm. These schemes are namely full feedback scheduling scheme, 20 1‐bit and 4‐bit quantization based scheduling schemes, 36 and 2‐bit quantization‐based scheduling scheme 53 . These schemes are described as suboptimal algorithm 1, suboptimal algorithm 2, suboptimal algorithm 3, and suboptimal algorithm 4, respectively, in this correspondence.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

MIMO broadcast scheduling using binary spider monkey optimization algorithm

Mohanty

Pattanayak

Nandi

et al. 2021

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary Multi‐user multiple‐input multiple‐output (MU‐MIMO) system has the capability of delivering optimal system capacity that provides the simultaneous service to a large number of users using dirty paper coding (DPC) scheme. However, the DPC scheme is quite difficult to be implemented in the real‐time scenario as the computational complexity is very high and the process cannot be accomplished within the duration of few coherence periods. In this paper, we have adopted a newly developed binary spider monkey optimization (binary SMO) algorithm for the joint user and antenna scheduling (JUAS) problem to maximize the achievable system sum‐rate performance. It has been shown that JUAS with binary SMO achieves nearly 99% of system throughput achieved by the extensive search algorithm (ESA) using DPC. Also it is compared with binary flower pollination algorithm (binary FPA) to check which of the two gives better result. It is observed that the binary SMO in JUAS achieves a globally optimal solution quite rapidly, to remain well within the modern‐day packet data communication interval. The proposed binary SMO shows low computational complexity and computation time as compared to ESA (i.e., DPC). Also when it is compared with binary FPA, it shows quite a significant improvement in system throughput. Moreover, the effectiveness of binary SMO in the MU‐MIMO broadcasting scenario is verified through extensive simulation results.

show abstract