Minhua Ding
Minhua Ding has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Antti Tölli
Centre for Wireless Communications (CWC), University of Oulu, Oulu, Finland
2 shared publications - Italo Atzeni
University of Oulu
2 shared publications - Amila Ravinath
University of Oulu
1 shared publication - Arnold Lee Swindlehurst
Department of Electrical Engineering and Computer Science, University of California Irvine, Irvine, CA, USA
1 shared publication - Bikshapathi Gouda
Centre for Wireless Communications, University of Oulu, Oulu, Finland
1 shared publication Chathuranga Weeraddana
Department of Electronic and Telecommunications Engineering, University of Moratuwa, Moratuwa, Sri Lanka
1 shared publication
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74, 14354-14370
SEP Analysis of a Low-Resolution SIMO System With M -PSK Over Fading Channels
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74, 14354-14370
Open AccessSEP Analysis of a Low-Resolution SIMO System With M -PSK Over Fading Channels
- Open Access
- 21 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 617-632
On Optimal MMSE Channel Estimation for One-Bit Quantized MIMO Systems
This paper focuses on the minimum mean squared error (MMSE) channel estimator for multiple-input multiple-output (MIMO) systems with one-bit quantization at the receiver side. Despite its optimality and significance in estimation theory, the MMSE estimator has not been fully investigated in this context due to its general nonlinearity and computational complexity. Instead, the typically suboptimal Bussgang linear MMSE (BLMMSE) channel estimator has been widely adopted. In this work, we develop a new framework to compute the MMSE channel estimator that hinges on the computation of the orthant probability of a multivariate normal distribution. Based on this framework, we determine a necessary and sufficient condition for the BLMMSE channel estimator to be optimal and thus equivalent to the MMSE estimator. Under the assumption of specific channel correlation or pilot symbols, we further utilize the framework to derive analytical expressions for the MMSE estimator that are particularly convenient for the computation when certain system dimensions become large, thereby enabling a comparison between the BLMMSE and MMSE channel estimators in these cases.
- 21 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 617-632
Open AccessOn Optimal MMSE Channel Estimation for One-Bit Quantized MIMO Systems
This paper focuses on the minimum mean squared error (MMSE) channel estimator for multiple-input multiple-output (MIMO) systems with one-bit quantization at the receiver side. Despite its optimality and significance in estimation theory, the MMSE estimator has not been fully investigated in this context due to its general nonlinearity and computational complexity. Instead, the typically suboptimal Bussgang linear MMSE (BLMMSE) channel estimator has been widely adopted. In this work, we develop a new framework to compute the MMSE channel estimator that hinges on the computation of the orthant probability of a multivariate normal distribution. Based on this framework, we determine a necessary and sufficient condition for the BLMMSE channel estimator to be optimal and thus equivalent to the MMSE estimator. Under the assumption of specific channel correlation or pilot symbols, we further utilize the framework to derive analytical expressions for the MMSE estimator that are particularly convenient for the computation when certain system dimensions become large, thereby enabling a comparison between the BLMMSE and MMSE channel estimators in these cases.
- 27 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (3) , 955-959
Energy-Efficiency Fairness of Interference Multi-Relay Networks for Multi-User Communications
We investigate a single-antenna multi-user multi-relay interference network, where multiple source nodes simultaneously communicate with their respective destination nodes via half-duplex decode-and-forward relays. To ensure fairness among users, we consider a power allocation strategy to maximize the worst-case energy efficiency (EE) of all users for a fixed relay assignment. The resulting optimization problem turns out to be non-convex. Different from those in the literature, our method here is an iterative algorithm where two geometric programs (GPs) are solved in each iteration, one producing an upper-bound to the solution of the original problem and the other providing a feasible lower-bound. Moreover, the upper-bound GP approaches the original problem asymptotically. Our algorithm also works for the problem arising in the non-interfering (orthogonal) transmission, which was previously solved as a fractional program. Numerical results reveal that non-orthogonal transmission outperforms orthogonal transmission in terms of the worst-case EE at low and medium signal-to-noise ratios.
- 27 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (3) , 955-959
Energy-Efficiency Fairness of Interference Multi-Relay Networks for Multi-User Communications
We investigate a single-antenna multi-user multi-relay interference network, where multiple source nodes simultaneously communicate with their respective destination nodes via half-duplex decode-and-forward relays. To ensure fairness among users, we consider a power allocation strategy to maximize the worst-case energy efficiency (EE) of all users for a fixed relay assignment. The resulting optimization problem turns out to be non-convex. Different from those in the literature, our method here is an iterative algorithm where two geometric programs (GPs) are solved in each iteration, one producing an upper-bound to the solution of the original problem and the other providing a feasible lower-bound. Moreover, the upper-bound GP approaches the original problem asymptotically. Our algorithm also works for the problem arising in the non-interfering (orthogonal) transmission, which was previously solved as a fractional program. Numerical results reveal that non-orthogonal transmission outperforms orthogonal transmission in terms of the worst-case EE at low and medium signal-to-noise ratios.