• Journal of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.503-520
• /
• 2023

In this paper, using the theory of majorization, we discuss the Schur m power convexity for L-conjugate means of n variables and the Schur convexity for weighted L-conjugate means of n variables. As applications, we get several inequalities of general mean satisfying Schur convexity, and a few comparative inequalities about n variables Gini mean are established.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2992-3009
• /
• 2016

The performance of D-MIMO systems is not only affected by multipath fading but also from shadowing fading, as well as path loss. In this paper, we investigate the ergodic capacity of D-MIMO systems operating in non-correlated K fading (Rayleigh/Gamma) channels. With the aid of majorization and Minkowski theory, we derive analytical closed-form expressions of the upper and lower bounds on the ergodic capacity for D-MIMO systems over non-correlated K fading channels, which are quite general and applicable for arbitrary signal-to-noise ratio (SNR) and the number of transceiver antennas. To intuitively reveal the impacts of system and fading parameters on the ergodic capacity, we deduce asymptotic approximations in the high and low SNR regimes. Finally, we pursue the massive MIMO systems analysis for the lower bound and derive closed-form expressions when the number of antennas at BS grows large, and when the number of antennas at transceivers becomes large with a fixed and finite ratio. It is demonstrated that the proposed expressions on the ergodic capacity accurately match with the theoretical analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9B
• /
• pp.1082-1091
• /
• 2011

Power-reduction techniques based on DVFS(Dynamic Voltage and Frequency Scaling) are crucial for lengthening operating times of battery powered mobile systems. This paper proposes an optimal DVFS scheduling algorithm for decoders with memory size limitation on display buffer, which is realistic constraints not properly touched in the previous works. Furthermore, we mathematically prove that the proposed algorithm is optimal in the limited display buffer and limited clock frequency model, and also can be used for feasibility check. Simulation results show the proposed algorithm outperformed the previous heuristic algorithms by 7% in average, and the performance of all algorithms using display buffers saturates at about 10 frame size.