Bingbing Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bingbing Li has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Jin Li
The State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China
3 shared publications - Changqing Zhang
The State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an, People’s Republic of China
2 shared publications - Mingqian Liu
State Key Laboratory of Integrated Service Networks, Xidian University, Xian, Shaanxi, China
2 shared publications - Da-Zheng Feng
National Key Laboratory of Radar Signal Processing, Xidian University, Xian, China
1 shared publication - Fengkui Gong
Xidian University
1 shared publication - Lina Sha
Yangling Vocational and Technical College, Yangling, Shaanxi, China
1 shared publication
Latest Publications
- 7 June 2023
- Published by Springer Nature in Wireless Networks
- Vol. 30 (6) , 5967-5975
Similarity measure-based spectrum sensing algorithm under impulsive noise
- 7 June 2023
- Published by Springer Nature in Wireless Networks
- Vol. 30 (6) , 5967-5975
Similarity measure-based spectrum sensing algorithm under impulsive noise
- Open Access
- 1 June 2023
- Published by MDPI AG in Electronics
- Vol. 12 (11) , 2499
Blind Matching Filtering Algorithm for Spectrum Sensing under Multi-Path Channel Environment
Matching filtering has been proven to be the optimal spectrum sensing algorithm under Gaussian white noise. However, the application of this algorithm is limited because of its dependence on prior information. In this paper, we propose a spectrum sensing algorithm based on blind matching filtering (BMF) by using the correlation between adjacent received signals under dispersive channels. Theoretical analysis shows that the proposed algorithm can achieve a performance comparable to that of the matching filtering algorithm without requiring the prior information of the primary user. Thus, this algorithm shows superior detection performance. Moreover, an improved BMF (IBMF) algorithm is proposed on the basis of the correlation between different time-delay signals. IBMF utilizes more comprehensive correlation information of the received signals and achieves better detection performance compared to BMF. Furthermore, the two proposed algorithms have lower computational complexity than the classical approaches based on the covariance matrix of the received signals. Numerical simulations confirm the superior performance of the proposed detectors and validate the theoretical analysis.
- 1 June 2023
- Published by MDPI AG in Electronics
- Vol. 12 (11) , 2499
Open AccessBlind Matching Filtering Algorithm for Spectrum Sensing under Multi-Path Channel Environment
Matching filtering has been proven to be the optimal spectrum sensing algorithm under Gaussian white noise. However, the application of this algorithm is limited because of its dependence on prior information. In this paper, we propose a spectrum sensing algorithm based on blind matching filtering (BMF) by using the correlation between adjacent received signals under dispersive channels. Theoretical analysis shows that the proposed algorithm can achieve a performance comparable to that of the matching filtering algorithm without requiring the prior information of the primary user. Thus, this algorithm shows superior detection performance. Moreover, an improved BMF (IBMF) algorithm is proposed on the basis of the correlation between different time-delay signals. IBMF utilizes more comprehensive correlation information of the received signals and achieves better detection performance compared to BMF. Furthermore, the two proposed algorithms have lower computational complexity than the classical approaches based on the covariance matrix of the received signals. Numerical simulations confirm the superior performance of the proposed detectors and validate the theoretical analysis.
- 19 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 11 (1) , 608-619
Low-Complexity and High-Coding-Efficiency Image Deletion for Compressed Image Sets in Cloud Servers
Image deletion refers to removing images from a compressed image set in cloud servers, which has always received much attention. However, in some cases images are not successfully deleted, and coding performance still remains to rise. In this paper, we propose a low-complexity and high-coding-efficiency image deletion algorithm. First, all the images are classified into to-be-deleted images, images unneeded to be processed, and images needed to be processed further divided into images needed to be only decoded and images needed to be re-encoded. Then, we also propose a depth- and subtree-constrained minimum spanning tree (DSCMST) heuristics to produce the DSCMST of images needed to be processed. Third, every image unneeded to be processed is added to the just obtained DSCMST as the child of the vertex that is still its parent in the compressed image set. Finally, after the encoding of images needed to be re-encoded, a new compressed image set is constructed, implying the completion of image deletion. Experimental results show that under various circumstances our proposed algorithm can effectively remove any images, including root vertex, internal vertices, and leaf vertices. Moreover, compared with state-of-the-art methods, the proposed algorithm achieves higher coding efficiency while having the minimum complexity.
- 19 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 11 (1) , 608-619
Low-Complexity and High-Coding-Efficiency Image Deletion for Compressed Image Sets in Cloud Servers
Image deletion refers to removing images from a compressed image set in cloud servers, which has always received much attention. However, in some cases images are not successfully deleted, and coding performance still remains to rise. In this paper, we propose a low-complexity and high-coding-efficiency image deletion algorithm. First, all the images are classified into to-be-deleted images, images unneeded to be processed, and images needed to be processed further divided into images needed to be only decoded and images needed to be re-encoded. Then, we also propose a depth- and subtree-constrained minimum spanning tree (DSCMST) heuristics to produce the DSCMST of images needed to be processed. Third, every image unneeded to be processed is added to the just obtained DSCMST as the child of the vertex that is still its parent in the compressed image set. Finally, after the encoding of images needed to be re-encoded, a new compressed image set is constructed, implying the completion of image deletion. Experimental results show that under various circumstances our proposed algorithm can effectively remove any images, including root vertex, internal vertices, and leaf vertices. Moreover, compared with state-of-the-art methods, the proposed algorithm achieves higher coding efficiency while having the minimum complexity.
- 8 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 20 (11) , 7460-7474
Interference Alignment Meets Multi-Cell Multi-User Massive FD-MIMO Systems in DoA-Based Precoding
In this paper, a downlink (DL) precoding scheme is introduced for time-division-duplex (TDD) multi-cell multi-user 3D massive MIMO/full-dimension MIMO (FD-MIMO) systems. A pre-beamformer based on uplink direction-of-arrival (DoA) is incorporated with interference alignment (IA) scheme to provide more degrees of freedom for each cell. We analyze the feasible conditions of applying IA schemes and provide the corresponding precoding schemes for different inter-cell interference scenarios. Simulation results show that the introduced IA-DoA-based multi-cell multi-user precoding and power allocation scheme significantly outperform the existing IA-based precoding strategies for FD-MIMO systems.
- 8 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 20 (11) , 7460-7474
Interference Alignment Meets Multi-Cell Multi-User Massive FD-MIMO Systems in DoA-Based Precoding
In this paper, a downlink (DL) precoding scheme is introduced for time-division-duplex (TDD) multi-cell multi-user 3D massive MIMO/full-dimension MIMO (FD-MIMO) systems. A pre-beamformer based on uplink direction-of-arrival (DoA) is incorporated with interference alignment (IA) scheme to provide more degrees of freedom for each cell. We analyze the feasible conditions of applying IA schemes and provide the corresponding precoding schemes for different inter-cell interference scenarios. Simulation results show that the introduced IA-DoA-based multi-cell multi-user precoding and power allocation scheme significantly outperform the existing IA-based precoding strategies for FD-MIMO systems.
- 8 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 67 (5) , 4136-4148
Space-Time Blind Equalization of Dispersive MIMO Systems Driven by QAM Signals
This paper investigates space-time blind equalization (BE) of dispersive multiple-input multiple-output communication systems driven by high throughput quadrature amplitude modulation signals. Multistage processing is adopted to overcome the severe local convergence problem in BE. First, a good initial value for the equalizer is obtained by forcing one of the system inputs with desired delay to be recovered. Then, the fast multimodulus algorithm (MMA) is used to roughly equalize the communication system. After that, an improved MMA (IMMA) is developed to effectively search for a fine equalizer for the system. Moreover, the novel modified Newton method (MNM) proposed in our previous work is employed to fast optimize the MMA and IMMA cost functions, which significantly reduces the computational load. Furthermore, the proposed algorithm has an additional benefit that once a signal is recovered, its corresponding single-input multiple-output channel impulse response is estimated by the classical least squares methods. Then, the influence of the recovered signal to the original received signals is removed to avoid extracting this recovered signal repeatedly. The quadratic rate of convergence of the MNM is theoretically analyzed, and the good equalization performance of the IMMA is explained. Finally, simulation results are provided to illustrate the effectiveness of the proposed algorithm.
- 8 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 67 (5) , 4136-4148
Space-Time Blind Equalization of Dispersive MIMO Systems Driven by QAM Signals
This paper investigates space-time blind equalization (BE) of dispersive multiple-input multiple-output communication systems driven by high throughput quadrature amplitude modulation signals. Multistage processing is adopted to overcome the severe local convergence problem in BE. First, a good initial value for the equalizer is obtained by forcing one of the system inputs with desired delay to be recovered. Then, the fast multimodulus algorithm (MMA) is used to roughly equalize the communication system. After that, an improved MMA (IMMA) is developed to effectively search for a fine equalizer for the system. Moreover, the novel modified Newton method (MNM) proposed in our previous work is employed to fast optimize the MMA and IMMA cost functions, which significantly reduces the computational load. Furthermore, the proposed algorithm has an additional benefit that once a signal is recovered, its corresponding single-input multiple-output channel impulse response is estimated by the classical least squares methods. Then, the influence of the recovered signal to the original received signals is removed to avoid extracting this recovered signal repeatedly. The quadratic rate of convergence of the MNM is theoretically analyzed, and the good equalization performance of the IMMA is explained. Finally, simulation results are provided to illustrate the effectiveness of the proposed algorithm.
- 14 May 2013
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 32 (6) , 2999-3012
Blind Joint Estimation for OFDM Time-Frequency Parameters
- 14 May 2013
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 32 (6) , 2999-3012
Blind Joint Estimation for OFDM Time-Frequency Parameters