Jianhua Yuan

Dr. Jianhua Yuan


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 November 2024 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
YNYangyang Niu
Yangyang Niu
ZWZhiqing Wei
Zhiqing Wei
DMDingyou Ma
Dingyou Ma
XYXiaoyu Yang
Xiaoyu Yang
HWHuici Wu
Huici Wu
JYJianhua Yuan
Jianhua Yuan
The integrated sensing and communication (ISAC) system under multi-input multi-output (MIMO) architecture achieves dual functionalities of sensing and communication on the same platform by utilizing spatial gain, which provides a feasible paradigm facing spectrum congestion. However, the dual functionalities of sensing and communication operating simultaneously in the same platform bring severe interference in the ISAC systems. Facing this challenge, we propose a joint optimization framework for transmit beamforming and receive filter design for ISAC systems with MIMO architecture. We aim to maximize the signal-to-clutter-plus-noise ratio (SCNR) at the receiver while considering various constraints such as waveform similarity, power budget, and communication performance requirements to ensure the integration of the dual functionalities. In particular, the overall transmit beamforming is refined into sensing beamforming and communication beamforming, and a quadratic transformation (QT) is introduced to relax and convert the complex non-convex optimization objective. An efficient algorithm based on covariance matrix tapers (CMT) is proposed to restructure the clutter covariance matrix considering the mismatched steering vector, thereby improving the robustness of the ISAC transceiver design. Numerical simulations are provided to demonstrate the effectiveness of the proposed algorithm.

19 December 2012 in Journal of the Optical Society of America B
Verified
Journal Article
Closed access
PDF file
JYJianhua Yuan
Jianhua Yuan
JYJian Yang
Jian Yang
A computational study on the efficient second-harmonic generation (SHG) in one-dimensional nonlinear photonic crystals (PhCs) is presented. The design requirements are specified in terms of the corresponding fundamental wavelength of the incident wave, at which the maximum conversion efficiency of SHG occurs. The computational approach has developed a Newton-type local optimization method to optimize the fill factor and the period of a PhC. An optimal structure can be determined by controlling the band structure such that the frequencies of the fundamental and second-harmonic waves are precisely located at the lower edges of photonic bandgaps. The results of our numerical experiments show the optimal design problem can be solved efficiently based on crucial initial data given by some useful engineering intuitions. The SHG with high conversion efficiency is achieved by choosing the geometrical parameters of the elementary cell optimally and controlling the band structure of the PhC precisely.

17 December 2019 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Open access
CKCaixia Kou
Caixia Kou
DHDedong Hu
Dedong Hu
JYJianhua Yuan
Jianhua Yuan
WAWenbao Ai
Wenbao Ai
We propose two new algorithms called BiLAD and ExactBiLAD for the well-known Single-Constrained Shortest Path (SCSP) problem. It is a fundamental problem in quality-of-service (QoS) routing, where one seeks a source-destination path with the least cost satisfying a delay QoS constraint in a network. As pointed out by Jüttner et al., there is no widely accepted algorithm with polynomial time to the SCSP problem because the SCSP problem is NP-hard. The remarkable feature of BiLAD is that it ensures that the length of iteratively updated angle interval is shrunk at least at a constant ratio. With the help of this feature, we prove its polynomial time complexity. To the best of our knowledge, this is the first time that the polynomial time complexity is proved in details. The numerical results show that, in most QoS routing test instances, the performance of BiLAD is close to their primal optimal solutions. The proposed modified Dijkstra procedure, whose complexity is the same as that of the Dijkstra algorithm, also accelerates BiLAD. In the second part of the paper, based on the information obtained by BiLAD, we design an exact algorithm-ExactBiLAD, in which an optimal solution to the SCSP problem is finally obtained by scanning the steadily reduced optimal-path-candidate triangle area. The simulation results indicate that ExactBiLAD needs only a dozen times of executing the modified Dijkstra algorithm regardless of the network size or the average node degree. Distinguished from many other exact algorithms, ExactBiLAD has a satisfactory performance in the practical computation.


26 January 2024 in Operations Research Letters
Verified
Journal Article
Closed access
HZHoushan Zhang
Houshan Zhang
JYJianhua Yuan
Jianhua Yuan