JZJianping Zheng

Jianping Zheng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jianping Zheng has a total of 41 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Unsourced Random Access in Frequency-Hopping Communication Systems

    by Shuai Lu, Jianping Zheng

    In this letter, we study the unsourced random access in frequency-hopping (FH) communication systems, and propose an effective uncoupled coded compressed sensing scheme where the angle-of-arrival (AoA) invariance is utilized to stitch messages in different time slots. Note that the spreading codeword suffers from fast fading since the frequency changes rapidly in the FH system. The major challenge is the pairing of active codewords and AoAs in each time slot, since the fast channel variation makes the joint estimation of active codewords and the associated AoAs infeasible. To address this challenging problem, a properly designed codeword-AoA pairing method is given, after the active codewords and AoAs being estimated separately. Moreover, the proposed method can resolve the codeword-collision. Finally, simulation results verify the effectiveness of the proposed method.

  • Uncoupled Unsourced Random Access for Near-Field Spatial Non-Stationary XL-MIMO

    by Xiuyu Zhang, Jianping Zheng

    In this correspondence, we propose a uncoupled compressed sensing scheme in near-field spatial non-stationary extremely large-scale multiple-input multiple-output unsourced random access communications. Concretely, first, for multiple user detection in each slot, a codeword-collision-aware two-stage orthogonal matching pursuit algorithm is proposed, which can utilize the three-level sparsity of the equivalent channel coefficient, and is able to resolve codeword collision adaptively via estimation of multiple visibility regions (VRs) and the angles of arrivals (AoAs) for collided codeword. Then, the $K$-medoids-based clustering is employed to achieve efficient message stitching by utilizing the invariant characteristics of VR and AoA during one transmit frame consisting of multiple slots. Finally, numerical results verify the effectiveness of the proposed method.

  • Open Access

    Joint Power Allocation, User-Subarray Pairing, and Analog Beamforming for the Spatial Non-Stationary Extremely Large-Scale MIMO

    by Xiuyu Zhang, Jianping Zheng

    In this paper, we study the downlink precoding of spatial non-stationary (SnS) extremely large-scale multiple-input multiple-output (XL-MIMO) in the near-field channel with uniform spherical wave (USW) and mixed line-of-sight and non-line-of-sight environments. First, we present a novel precoding scheme by replacing the digital beamforming (BF) in the conventional hybrid BF with user-subarray pairing network. The presented scheme utilizes the SnS channel characteristic efficiently, and can facilitate the high-speed implementation and the deployment of low-resolution digital-to-analog converters. Next, we study the optimizations to maximize both the sum-rate and min-rate by designing the power allocation, user-subarray pairing network, and analog BF jointly. For the sum-rate maximization, we first reformulate the corresponding nonconvex problem by the quadratic transformation to facilitate the further processing. Then, the alternating optimization framework is utilized to optimize the variables alternately. Concretely, the Riemannian conjugate gradient method, projected gradient ascent method, and mathematical programming with equilibrium constraints alternating direction method are employed to optimize the analog BF, power allocation, and user-subarray pairing network, respectively. For the min-rate maximization, we extend the aforementioned solutions by proper modifications. Finally, the effectiveness of the proposed optimization algorithms is verified through computer simulations.


  • Spatially-Coupled Constant-Weight Code for Random Access in Fast Fading Channels

    by Shuai Lu, Jianping Zheng

    In this letter, we propose a novel signature code, spatially-coupled (SC) constant-weight (CW) code, for random access in fast fading channels. Concretely, first, the spatial coupling base matrix is constructed with coupling width ω and uniform coupling strength, and one CW mother code is partitioned into ω subcodes. Then, the SC-CW signature code matrix is obtained by replacing all the ω non-zero entries in each column of the base matrix with the ω subcodes. Taking the CW code constructed recently based on the on-off pattern of the binary subspace chirps as the mother code, the generated SC-CW code inherits the CW and low fading coherence properties of the mother code. Moreover, the recent SC generalized approximate message passing algorithm was utilized to identify the active users with tailored input and output denoising functions. Finally, simulation results show that the proposed SC-CW code can achieve better performance than the conventional CW code.


  • Message Passing Based Activity Detection in Distributed Massive MIMO With Pilot-Hopping and Activity Correlation

    by Weihan Xue, Jianping Zheng

    Orthogonal-pilot-hopping transmission is an efficient random access scheme since the orthogonal pilot can aid the activity detection (AD) and channel estimation. Moreover, in many scenarios, the activity of devices is correlated, e.g., devices are used to monitor the same physical phenomenon. In this correspondence, we study the AD in distributed massive multiple-input multiple-output with pilot-hopping and activity correlation. Specifically, the hybrid generalized approximate message passing based AD is proposed. In the proposed method, the position of event is first quantized, and thus the activity correlation can be presented by the probability related with the distance between the device and quantized event. Next, the message update rule for the check node presenting the activity correlation is derived. Finally, computer simulations are given to demonstrate the effectiveness of the proposed method.


  • Random Access in Fast Fading Channels: Signature Code Design and Active User Identification

    by Pinmo Li, Jianping Zheng

    In this letter, we study the signature code design and active user identification for the random access in fast fading channels. First, we propose a constant-weight signature code construction by utilizing the on-off pattern of the binary subspace chirps. The constructed code has low fading coherence and large size, and thus guarantee good performance with large number of access users. Second, a practical activity detection based on the generalized approximate message passing is proposed. Finally, the performance of the proposed signature code and activity detection is demonstrated by computer simulations.


  • Non-Stationary Near-Field Channel Estimation for XL-MIMO Systems With Hybrid Combining

    by Xiuyu Zhang, Jianping Zheng

    In this letter, we study the spatial non-stationary near-field channel estimation (CE) of the extremely large-scale multiple-input multiple-output system with hybrid combining. In the case of known partition of the antenna sub-arrays, the CE is first formulated as a structured compressed sensing problem, and then the two-level polar-domain orthogonal matching pursuit (OMP) algorithm is presented to determine the channel quantization index and the visibility region (VR). In the case of unknown partition, a list-type CE method is proposed. Specifically, the initial estimation of the VR is first acquired by employing the variational block sparse recovery algorithm with unknown partition. Then, the candidate set of the VR is obtained based on proper majority-logic decision and enumeration, and for each candidate, the channel quantization index is estimated by the OMP algorithm. Finally, the effectiveness of the proposed methods are demonstrated by computer simulations.


  • Open Access

    Index Modulation-Aided Unsourced Random Access in the Block-Fading Channel

    by Yaoxin Gao, Jianping Zheng

    In this article, we propose three index modulation (IM) aided unsourced random access schemes in the block-fading multiple-antenna channel. In all the proposed schemes, the signal frame is partitioned into multiple time slots, and only part of time slots are activated to transmit signal. The active time slots are determined by the active time slot pattern (ATP) information through utilizing the principle of IM. In the first two schemes, each time slot includes pilot sub-slot and data sub-slot. The multiple-stage orthogonal pilots (MSOPs) are employed for both channel estimation and user identification, and the pilot-hopping pattern (PHP) of MSOPs determines the pilots transmitted over the active pilot sub-slots. Moreover, in the first scheme, the polar-coded signal is transmitted repeatedly in the data sub-slots of active time slots. In the second scheme, the ATP and PHP information is first transmitted through the sparse-regression-code (SPARC) in the first time slot, and the polar-coded signal is divided into multiple parts which are transmitted in those active data sub-slots, respectively. At the receiver, the iterative orthogonal pilot-aided channel estimation and decoding with successive interference cancellation is presented. In the third scheme, the signal frame is also partitioned into multiple time slots where only two time slots are activated by each user. The first time slot is always activated to transmit the ATP and active channel-use pattern (ACP) information by the SPARC. The other ATP-guided active time slot transmits the remaining message by IM over the ACP-guided active channel uses. Different from the first two schemes, the third scheme has no pilot signal and thus the blind detection based on the bilinear generalized approximate message passing algorithm is employed to decode the message. Finally, computer simulations show that, compared with the state-of-the-art scheme, the first scheme has better performance for all the numbers of active users from 50 to 500, while the last two schemes much better only when less than about 200 active users exist.


  • IRS-Assisted Secure Radar Communication Systems With Malicious Target

    by Huiying Zhang, Jianping Zheng

    The paper studies the intelligent reflecting surfaces (IRS) assisted secure radar communication systems where dual-functional radar-communication base station (BS) communicates with multiple legitimate users and senses a malicious radar target. Concretely, three optimization problems, eavesdropper achievable rate minimization, minimum communication signal-to-interference-plus-noise ratio maximization, and communication sum-rate maximization, are considered, where the optimization variables include beamforming vector and artificial noise covariance at the BS and phase shift matrix at the IRS. Due to the coupling of these optimization variables, all the three optimization problems are non-convex. To address these non-convex problems, we first reformulate them by the fractional transformation and Lagrangian dual transformation, and then utilize the alternating optimization (AO) framework to optimize the variables alternately. Moreover, some advanced techniques are utilized to solve the resulted AO sub-problems, e.g., the penalty-based method to solve the rank-one constraint and the Riemannian conjugate gradient to design phase shift matrix. Finally, these proposed optimizations are verified by computer simulations.