Ru-Han Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ru-Han Chen has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Jian Zhang
Information Engineering University, Zhengzhou, China
11 shared publications - Longguang Li
Shanghai Jiao Tong University
6 shared publications - Jing Zhou
Department of Computer Science and Engineering, Shaoxing University, Shaoxing, China
4 shared publications - Jia-Ning Guo
Information Engineering University, Zhengzhou, China
3 shared publications - Lin Li
National Digital Switching System Engineering and Technological Research Center, Zhengzhou, China
3 shared publications - Hongyi Yu
Information Engineering College, Information Engineering University, Henan, China
2 shared publications
Latest Publications
- 12 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (11) , 18220-18234
Geometrically Shaped Constellation in Short-Packet Visible Light Communications for IIoT Applications
Due to the high data rates, license-free operations and inherent security, visible light communication (VLC) is highly valued in industrial Internet of Things (IIoT) applications. Short packet communication, which offers ultra-low latency and efficient resource utilization, is suitable for the low-latency and massive connectivity demand of the IIoT system. It adopts finite blocklength codewords for data transmissions. In this paper, we present a general framework of designing geometrically shaped constellations in short-packet VLC with peak and average intensity constraints for IIoT applications. By leveraging tools from large deviation theory, we first characterize the second-order asymptotics of the optimal constellation shaping region under aforementioned intensity constraints, which serves as a good performance metric for the best geometric shaping in finite blocklength. To further incorporate a sufficiently large coding gain and a nearly maximum shaping gain, we construct multidimensional constellations by the nested structure of Construction B lattices, where the constellation shaping is implemented by controlling the boundary of the embedded sublattice, i.e., a strategy called coarsely shaping and finely coding. Fast algorithms for constellation mapping and demodulation are presented as well. As an illustrative example, we present an energy-efficient 24-dimensional constellation design based on the Leech lattice, whose superiority over existing constellation designs is verified by numerical results.
- 12 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (11) , 18220-18234
Geometrically Shaped Constellation in Short-Packet Visible Light Communications for IIoT Applications
Due to the high data rates, license-free operations and inherent security, visible light communication (VLC) is highly valued in industrial Internet of Things (IIoT) applications. Short packet communication, which offers ultra-low latency and efficient resource utilization, is suitable for the low-latency and massive connectivity demand of the IIoT system. It adopts finite blocklength codewords for data transmissions. In this paper, we present a general framework of designing geometrically shaped constellations in short-packet VLC with peak and average intensity constraints for IIoT applications. By leveraging tools from large deviation theory, we first characterize the second-order asymptotics of the optimal constellation shaping region under aforementioned intensity constraints, which serves as a good performance metric for the best geometric shaping in finite blocklength. To further incorporate a sufficiently large coding gain and a nearly maximum shaping gain, we construct multidimensional constellations by the nested structure of Construction B lattices, where the constellation shaping is implemented by controlling the boundary of the embedded sublattice, i.e., a strategy called coarsely shaping and finely coding. Fast algorithms for constellation mapping and demodulation are presented as well. As an illustrative example, we present an energy-efficient 24-dimensional constellation design based on the Leech lattice, whose superiority over existing constellation designs is verified by numerical results.
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (2) , 370-374
Geometric Constellation Shaping for MISO Optical Wireless Communication
Geometric constellation shaping for multiple-input single-output optical wireless communication is considered in this paper. We first characterize the optimal shaping region, whose shaping gain may serve as a performance baseline for multidimensional constellation designs. Then, to approach this maximum shaping gain, we propose a novel constellation design based on modified truncated cubic shaping and existing signaling algorithms. Numerical results show that the gap between the maximum shaping gain and the shaping gain of the modified truncated cubic shaping is small, and significant performance gains over the benchmark schemes can be obtained.
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (2) , 370-374
Geometric Constellation Shaping for MISO Optical Wireless Communication
Geometric constellation shaping for multiple-input single-output optical wireless communication is considered in this paper. We first characterize the optimal shaping region, whose shaping gain may serve as a performance baseline for multidimensional constellation designs. Then, to approach this maximum shaping gain, we propose a novel constellation design based on modified truncated cubic shaping and existing signaling algorithms. Numerical results show that the gap between the maximum shaping gain and the shaping gain of the modified truncated cubic shaping is small, and significant performance gains over the benchmark schemes can be obtained.
- 8 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (3) , 2918-2929
Robust Channel-Phase-Based Physical-Layer Authentication for Multicarriers Transmission
This article focuses on the serious threat to security of key-based physical-layer authentication (PLA) by an eavesdropper using an elaborate impersonation attack, which aims to pass the authentication process illegally. To prevent the eavesdropper from decreasing the authentication performance, we propose a robust channel-phase-based PLA scheme for multicarriers transmission, which contains a novel two-level decision. Specifically, the first level decision is used to protect legitimate users from high-receiver power caused by the elaborate attack of the eavesdropper, and the second one is used to further authenticate the user. The optimal threshold for accurately detecting the response signal with high-receiver power is derived. Moreover, we provide the theoretical performance analysis for the proposed scheme, and derive the closed-form expressions of the probability of detection and false alarm via the numerical statistic and the proper approximation. Simulation results show the robustness of our proposed scheme and verify the effectiveness of the theoretical analysis.
- 8 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (3) , 2918-2929
Robust Channel-Phase-Based Physical-Layer Authentication for Multicarriers Transmission
This article focuses on the serious threat to security of key-based physical-layer authentication (PLA) by an eavesdropper using an elaborate impersonation attack, which aims to pass the authentication process illegally. To prevent the eavesdropper from decreasing the authentication performance, we propose a robust channel-phase-based PLA scheme for multicarriers transmission, which contains a novel two-level decision. Specifically, the first level decision is used to protect legitimate users from high-receiver power caused by the elaborate attack of the eavesdropper, and the second one is used to further authenticate the user. The optimal threshold for accurately detecting the response signal with high-receiver power is derived. Moreover, we provide the theoretical performance analysis for the proposed scheme, and derive the closed-form expressions of the probability of detection and false alarm via the numerical statistic and the proper approximation. Simulation results show the robustness of our proposed scheme and verify the effectiveness of the theoretical analysis.
- Open Access
- 4 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (11) , 17157-17173
When to Simply Use Passive RIS as Beamformer: An Information-Theoretic Analysis and a Novel Single-RF MIMO Transceiver Architecture
In this paper, for a single-input multiple-output (SIMO) system aided by a passive reconfigurable intelligent surface (RIS), the joint transmission accomplished by the single transmit antenna and the RIS with multiple controllable reflective elements is considered. Relying on a general capacity upper bound derived by using a maximum-trace argument, we respectively characterize the capacity slope of low-signal-to-noise-ratio channels and the exact capacity of rank-one channels, in which the optimal configuration of the RIS is proved to be beamforming-only with carefully-chosen phase shifts. To exploit the potential of modulating extra information on the RIS, by leveraging a strategy named partially beamforming and partially information-carrying based on QR decomposition and successive interference cancellation, we propose a novel transceiver architecture with only a single RF front end at the transmitter, by which the considered channel can be regarded as a concatenation of a vector Gaussian channel and several phase-modulated channels. Especially, we investigate a class of vector Gaussian channels with a hypersphere input support constraint, and not only generalize the existing result to arbitrary-dimensional real spaces but also present its high-order capacity asymptotics, by which both capacities of hypersphere-constrained channels and achievable rates of the proposed transceiver with two different signaling schemes can be well-approximated. Information-theoretic analyses show that the transceiver architecture designed for the SIMO channel has a boosted multiplexing gain, rather than one for the conventionally-used optimized beamforming scheme. Numerical results verify our derived asymptotic results and show notable superiority of the proposed transceiver as compared with the beamforming and the receive spatial modulation schemes.
- 4 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (11) , 17157-17173
Open AccessWhen to Simply Use Passive RIS as Beamformer: An Information-Theoretic Analysis and a Novel Single-RF MIMO Transceiver Architecture
In this paper, for a single-input multiple-output (SIMO) system aided by a passive reconfigurable intelligent surface (RIS), the joint transmission accomplished by the single transmit antenna and the RIS with multiple controllable reflective elements is considered. Relying on a general capacity upper bound derived by using a maximum-trace argument, we respectively characterize the capacity slope of low-signal-to-noise-ratio channels and the exact capacity of rank-one channels, in which the optimal configuration of the RIS is proved to be beamforming-only with carefully-chosen phase shifts. To exploit the potential of modulating extra information on the RIS, by leveraging a strategy named partially beamforming and partially information-carrying based on QR decomposition and successive interference cancellation, we propose a novel transceiver architecture with only a single RF front end at the transmitter, by which the considered channel can be regarded as a concatenation of a vector Gaussian channel and several phase-modulated channels. Especially, we investigate a class of vector Gaussian channels with a hypersphere input support constraint, and not only generalize the existing result to arbitrary-dimensional real spaces but also present its high-order capacity asymptotics, by which both capacities of hypersphere-constrained channels and achievable rates of the proposed transceiver with two different signaling schemes can be well-approximated. Information-theoretic analyses show that the transceiver architecture designed for the SIMO channel has a boosted multiplexing gain, rather than one for the conventionally-used optimized beamforming scheme. Numerical results verify our derived asymptotic results and show notable superiority of the proposed transceiver as compared with the beamforming and the receive spatial modulation schemes.
- 24 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (4) , 2505-2521
Capacity Results for MIMO Optical Intensity Channels With Individual Intensity Constraints
In this paper, we investigate the capacity of a multiple-input multiple-output (MIMO) optical intensity channel (OIC) with peak- and average-intensity constraints individually imposed on each transmitter. We first consider the case where the average input intensities are required to be equal to preassigned constants due to the requirement of illumination quality and color temperature. For the MIMO OIC with a strongly connected channel graph, we prove that its strongest eigen-subchannel must have positive channel gains, which reveals the underlying relationship between the MIMO OIC and the multiple-input single-output OIC. In the general case, we derive various capacity bounds by standard information theoretic tools and investigate several transceivers with certain architectures. In the special case where the channel rank is one less than the number of transmitters, we derive an equivalent capacity expression from the perspective of convex geometry, and new capacity lower bounds are derived based on this equivalent expression. Finally, the developed results are extended to another type of channels, where the average input intensities are required to be no larger than preassigned constants. These derived bounds are numerically verified to approach the capacity in the low or high signal-to-noise ratio regime.
- 24 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (4) , 2505-2521
Capacity Results for MIMO Optical Intensity Channels With Individual Intensity Constraints
In this paper, we investigate the capacity of a multiple-input multiple-output (MIMO) optical intensity channel (OIC) with peak- and average-intensity constraints individually imposed on each transmitter. We first consider the case where the average input intensities are required to be equal to preassigned constants due to the requirement of illumination quality and color temperature. For the MIMO OIC with a strongly connected channel graph, we prove that its strongest eigen-subchannel must have positive channel gains, which reveals the underlying relationship between the MIMO OIC and the multiple-input single-output OIC. In the general case, we derive various capacity bounds by standard information theoretic tools and investigate several transceivers with certain architectures. In the special case where the channel rank is one less than the number of transmitters, we derive an equivalent capacity expression from the perspective of convex geometry, and new capacity lower bounds are derived based on this equivalent expression. Finally, the developed results are extended to another type of channels, where the average input intensities are required to be no larger than preassigned constants. These derived bounds are numerically verified to approach the capacity in the low or high signal-to-noise ratio regime.
- 24 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (9) , 5532-5549
Distribution Decomposition and Sum-Capacity Results of Two-User Optical Intensity Multiple Access Channels
This paper investigates the sum-capacity of two-user optical intensity multiple access channels with per-user peak- or/and average-intensity constraints. By leveraging tools from the decomposition of certain distributions, we derive several lower bounds on the sum-capacity. In the high signal-to-noise ratio (SNR) regime, some bounds asymptotically match or approach the sum-capacity, thus closing or reducing the existing gaps to the high-SNR asymptotic sum-capacity. At moderate SNR, some bounds are also fairly close to the sum-capacity.
- 24 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (9) , 5532-5549
Distribution Decomposition and Sum-Capacity Results of Two-User Optical Intensity Multiple Access Channels
This paper investigates the sum-capacity of two-user optical intensity multiple access channels with per-user peak- or/and average-intensity constraints. By leveraging tools from the decomposition of certain distributions, we derive several lower bounds on the sum-capacity. In the high signal-to-noise ratio (SNR) regime, some bounds asymptotically match or approach the sum-capacity, thus closing or reducing the existing gaps to the high-SNR asymptotic sum-capacity. At moderate SNR, some bounds are also fairly close to the sum-capacity.
- Open Access
Distribution Decomposition and Sum-Capacity Results of Two-User Optical Intensity Multiple Access Channels
This paper investigates the sum-capacity of two-user optical intensity multiple access channels with per-user peak- or/and average-intensity constraints. By leveraging tools from the decomposition of certain maxentropic distributions, we derive several lower bounds on the sum-capacity. In the high signal-to-noise ratio (SNR) regime, some bounds asymptotically match or approach the sum-capacity, thus closing or reducing the existing gaps to the high-SNR asymptotic sum-capacity. At moderate SNR, some bounds are also fairly close to the sum-capacity.
Open AccessDistribution Decomposition and Sum-Capacity Results of Two-User Optical Intensity Multiple Access Channels
This paper investigates the sum-capacity of two-user optical intensity multiple access channels with per-user peak- or/and average-intensity constraints. By leveraging tools from the decomposition of certain maxentropic distributions, we derive several lower bounds on the sum-capacity. In the high signal-to-noise ratio (SNR) regime, some bounds asymptotically match or approach the sum-capacity, thus closing or reducing the existing gaps to the high-SNR asymptotic sum-capacity. At moderate SNR, some bounds are also fairly close to the sum-capacity.
- 10 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (6) , 3920-3941
On the Capacity of MISO Optical Intensity Channels With Per-Antenna Intensity Constraints
This paper investigates the capacity of general multiple-input single-output (MISO) optical intensity channels (OICs) under per-antenna peak- and average-intensity constraints. We first consider the MISO equal-cost constrained OIC (EC-OIC), where, apart from the peak-intensity constraint, average intensities of inputs are equal to arbitrarily preassigned constants. The second model of our interest is the MISO bounded-cost constrained OIC (BC-OIC), where, as compared with the EC-OIC, average intensities of inputs are no larger than arbitrarily preassigned constants. By leveraging tools from quantile functions, stop-loss transform and convex ordering of nonnegative random variables, we prove two decomposition theorems for bounded and nonnegative random variables, based on which we equivalently transform both the EC-OIC and the BC-OIC into respective single-input single-output channels under a peak-intensity and several stop-loss mean constraints. Capacity lower and upper bounds for both channels are established, based on which the asymptotic capacity at high and low signal-to-noise-ratio are determined.
- 10 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (6) , 3920-3941
On the Capacity of MISO Optical Intensity Channels With Per-Antenna Intensity Constraints
This paper investigates the capacity of general multiple-input single-output (MISO) optical intensity channels (OICs) under per-antenna peak- and average-intensity constraints. We first consider the MISO equal-cost constrained OIC (EC-OIC), where, apart from the peak-intensity constraint, average intensities of inputs are equal to arbitrarily preassigned constants. The second model of our interest is the MISO bounded-cost constrained OIC (BC-OIC), where, as compared with the EC-OIC, average intensities of inputs are no larger than arbitrarily preassigned constants. By leveraging tools from quantile functions, stop-loss transform and convex ordering of nonnegative random variables, we prove two decomposition theorems for bounded and nonnegative random variables, based on which we equivalently transform both the EC-OIC and the BC-OIC into respective single-input single-output channels under a peak-intensity and several stop-loss mean constraints. Capacity lower and upper bounds for both channels are established, based on which the asymptotic capacity at high and low signal-to-noise-ratio are determined.
- Open Access
On the Capacity of MISO Optical Intensity Channels With Per-Antenna Intensity Constraints
This paper investigates the capacity of general multiple-input single-output (MISO) optical intensity channels (OICs) under per-antenna peak- and average-intensity constraints. We first consider the MISO equal-cost constrained OIC (EC-OIC), where, apart from the peak-intensity constraint, average intensities of inputs are equal to arbitrarily preassigned constants. The second model of our interest is the MISO bounded-cost constrained OIC (BC-OIC), where, as compared with the EC-OIC, average intensities of inputs are no larger than arbitrarily preassigned constants. By leveraging tools from quantile functions, stop-loss transform and convex ordering of nonnegative random variables, we prove two decomposition theorems for bounded and nonnegative random variables, based on which we equivalently transform both the EC-OIC and the BC-OIC into respective single-input single-output channels under a peak-intensity and several stop-loss mean constraints. Capacity lower and upper bounds for both channels are established, based on which the asymptotic capacity at high and low signal-to-noise-ratio are determined.
Open AccessOn the Capacity of MISO Optical Intensity Channels With Per-Antenna Intensity Constraints
This paper investigates the capacity of general multiple-input single-output (MISO) optical intensity channels (OICs) under per-antenna peak- and average-intensity constraints. We first consider the MISO equal-cost constrained OIC (EC-OIC), where, apart from the peak-intensity constraint, average intensities of inputs are equal to arbitrarily preassigned constants. The second model of our interest is the MISO bounded-cost constrained OIC (BC-OIC), where, as compared with the EC-OIC, average intensities of inputs are no larger than arbitrarily preassigned constants. By leveraging tools from quantile functions, stop-loss transform and convex ordering of nonnegative random variables, we prove two decomposition theorems for bounded and nonnegative random variables, based on which we equivalently transform both the EC-OIC and the BC-OIC into respective single-input single-output channels under a peak-intensity and several stop-loss mean constraints. Capacity lower and upper bounds for both channels are established, based on which the asymptotic capacity at high and low signal-to-noise-ratio are determined.
- 12 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (7) , 2329-2332
Space-Time Constellation for MU-MISO Dimmable Visible Light Communications
In this letter, we study a multiuser multi-input single-output (MU-MISO) visible light communication (VLC) broadcast system under the peak-power constraint and dimming control. The space-time modem is designed to maximize the worst-case minimum Euclidean distance of received signals for all users. We prove that the optimal space-time constellation for our considered scenario can be realized by sending identical signals, which is optimal in terms of the SISO intensity channel with peak- and average-power constraints, across all transmitters. Simulation results indicate that our proposed scheme has better bit-error ratio (BER) performance compared with the precoding design and joint detection (PDJD) method and minimum mean-squared error (MMSE) precoder design.
- 12 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (7) , 2329-2332
Space-Time Constellation for MU-MISO Dimmable Visible Light Communications
In this letter, we study a multiuser multi-input single-output (MU-MISO) visible light communication (VLC) broadcast system under the peak-power constraint and dimming control. The space-time modem is designed to maximize the worst-case minimum Euclidean distance of received signals for all users. We prove that the optimal space-time constellation for our considered scenario can be realized by sending identical signals, which is optimal in terms of the SISO intensity channel with peak- and average-power constraints, across all transmitters. Simulation results indicate that our proposed scheme has better bit-error ratio (BER) performance compared with the precoding design and joint detection (PDJD) method and minimum mean-squared error (MMSE) precoder design.