Liping Liang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Liping Liang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Wu Guan
School of Integrated Circuits, Beijing University of Posts and Telecommunications (BUPT), Beijing, China
5 shared publications - Hanqing Luo
School of Integrated Circuits, Beijing University of Posts and Telecommunications, Beijing, China
2 shared publications - Meiyu Liu
School of Integrated Circuits, Beijing University of Posts and Telecommunications, Beijing, China
2 shared publications - Peihao Fan
School of Integrated Circuits, Beijing University of Posts and Telecommunications (BUPT), Beijing, China
2 shared publications - Ziqin Yan
School of Integrated Circuits, Beijing University of Posts and Telecommunications (BUPT), Beijing, China
2 shared publications Chongbo Cao
Beijing University of Posts and Telecommunications, BUPT
1 shared publication
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (11) , 26896-26911
PAQS: A Prediction-Augmented QoS-Aware Scheduling Framework for Vehicular mmWave Systems
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (11) , 26896-26911
PAQS: A Prediction-Augmented QoS-Aware Scheduling Framework for Vehicular mmWave Systems
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (7) , 3526-3539
A Markov-Chain-Based PUF Using Chain-Block-Obfuscation Mechanism Resisting Machine Learning Attacks With High Uniformity Robustness
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (7) , 3526-3539
A Markov-Chain-Based PUF Using Chain-Block-Obfuscation Mechanism Resisting Machine Learning Attacks With High Uniformity Robustness
- 12 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (8) , 9120-9127
IAOM: An Intention-Aware Optimization Model With GNN-Based Policy Learning for Dynamic Multi-Robot Cooperative Task Allocation
This paper studies dynamic multi-robot cooperative task allocation in multi-stage scout-rescue missions with unknown and evolving task demands. We propose IAOM, an Intention-Aware Optimization Model that encodes each robot's decision state–target task, role, and planner-derived ETA–as an intention vector and organizes robots and tasks into an execution-aware intention graph capturing residual demand and active commitments. A GAT-PPO policy is learned on this graph and coupled to a hybrid A* based motion layer, so that allocation, coalition formation, and congestion handling are optimized within a single framework. We evaluate IAOM on grid based urban rescue benchmarks with multiple map sizes and resource density regimes against optimization-, heuristic-, and learning-based baselines. Under abundant and normal resources, IAOM consistently reduces mission makespan and average completion time relative to the best baseline, achieving up to about $20\%$ shorter makespan and about $50\%$ lower completion time with comparable load balance. Under tight resources where robots barely meet total demand, gains are smaller and all methods are largely bounded by resource scarcity, but IAOM remains competitive.
- 12 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (8) , 9120-9127
IAOM: An Intention-Aware Optimization Model With GNN-Based Policy Learning for Dynamic Multi-Robot Cooperative Task Allocation
This paper studies dynamic multi-robot cooperative task allocation in multi-stage scout-rescue missions with unknown and evolving task demands. We propose IAOM, an Intention-Aware Optimization Model that encodes each robot's decision state–target task, role, and planner-derived ETA–as an intention vector and organizes robots and tasks into an execution-aware intention graph capturing residual demand and active commitments. A GAT-PPO policy is learned on this graph and coupled to a hybrid A* based motion layer, so that allocation, coalition formation, and congestion handling are optimized within a single framework. We evaluate IAOM on grid based urban rescue benchmarks with multiple map sizes and resource density regimes against optimization-, heuristic-, and learning-based baselines. Under abundant and normal resources, IAOM consistently reduces mission makespan and average completion time relative to the best baseline, achieving up to about $20\%$ shorter makespan and about $50\%$ lower completion time with comparable load balance. Under tight resources where robots barely meet total demand, gains are smaller and all methods are largely bounded by resource scarcity, but IAOM remains competitive.
- 31 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 34 (6) , 1786-1799
A High-Performance ML-KEM Architecture With Task-Level Parallelism
As the standardization of postquantum cryptography progresses, module-lattice-based key-encapsulation mechanism (ML-KEM), the standardized successor to CRYSTALS-Kyber, has become a primary target for hardware deployment. Owing to the tight interactions among ML-KEM compute tasks, achieving end-to-end high performance remains challenging. To address this problem, the proposed task-level parallelism (TLP)-centric system scheduler organizes a highly parallel task flow for ML-KEM, enabling conflict-free overlap among major tasks and substantially reducing the overall cycle count. Furthermore, by codesigning a MUX-steered dual-RAM 2-in/2-out access mechanism and a parallel polynomial compute unit, the memory system and compute fabric jointly sustain this high-parallelism task flow, resulting in a high-performance ML-KEM hardware architecture. Implemented on a Xilinx Artix-7 FPGA at 210 MHz, the proposed architecture supports all three ML-KEM security levels, uses 13.8 K LUTs, 9.6 K FFs, and 3.66 K slices, and completes in 18.9/28.7/ $41.8~\mu $ s for ML-KEM-512/768/1024, respectively. Compared with the latest designs, the proposed architecture achieves 46%–47% shorter runtime, while simultaneously maintaining balanced resource usage and improving area-time product by 21%–23%.
- 31 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 34 (6) , 1786-1799
A High-Performance ML-KEM Architecture With Task-Level Parallelism
As the standardization of postquantum cryptography progresses, module-lattice-based key-encapsulation mechanism (ML-KEM), the standardized successor to CRYSTALS-Kyber, has become a primary target for hardware deployment. Owing to the tight interactions among ML-KEM compute tasks, achieving end-to-end high performance remains challenging. To address this problem, the proposed task-level parallelism (TLP)-centric system scheduler organizes a highly parallel task flow for ML-KEM, enabling conflict-free overlap among major tasks and substantially reducing the overall cycle count. Furthermore, by codesigning a MUX-steered dual-RAM 2-in/2-out access mechanism and a parallel polynomial compute unit, the memory system and compute fabric jointly sustain this high-parallelism task flow, resulting in a high-performance ML-KEM hardware architecture. Implemented on a Xilinx Artix-7 FPGA at 210 MHz, the proposed architecture supports all three ML-KEM security levels, uses 13.8 K LUTs, 9.6 K FFs, and 3.66 K slices, and completes in 18.9/28.7/ $41.8~\mu $ s for ML-KEM-512/768/1024, respectively. Compared with the latest designs, the proposed architecture achieves 46%–47% shorter runtime, while simultaneously maintaining balanced resource usage and improving area-time product by 21%–23%.
- 18 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. PP (15498328) , 1-14
Mutual Constrained Min-Sum Check-Belief Propagation for 5G LDPC Codes: Algorithm and Implementation
State-of-the-art (SOA) designs for 5G New Radio (NR) low-density parity-check (LDPC) face a dilemma: enduring the high complexity of cumulative calculations or accepting performance degradation from unreliable messages for degree-1 variable nodes (VNs). This paper introduces the mutual constrained min-sum check-belief propagation (MCMS-CBP) decoding algorithm to resolve this dilemma. By establishing the mutual constrained cycle in well-designed message updating, while incorporating the constraint compensation strategy, the non-cumulative MCMS-CBP substantially improves the reliability of check-belief to variable-node messages for degree-1 VNs. Numerical results show that fixed-point MCMS-CBP maintains a gap of less than 0.1 dB compared to floating-point flooding belief propagation decoding algorithm across various 5G NR LDPC codes and offers inherently low complexity for hardware implementation. In addition, this paper presents an area-throughput efficient 5G NR LDPC decoder which is based on fixed-point MCMS-CBP and supports all 5G NR LDPC codes. Key techniques for optimizing the area and latency of decoder include: the sign-bit storage, reducing memory overhead by 87.5%; the intra-layer first block schedule, eliminating pipeline stalls;the partially aligned element arrangement, halving the cyclic shifter cost while eliminating memory pre-writeback rotation. Implementation result on SMIC 28nm technology demonstrates that the proposed decoder has a cell area of 1.610 mm $\boldsymbol {^{2}}$ and a peak throughput of 58.63 Gbps, yielding a 36.42 Gbps/mm $\boldsymbol {^{2}}$ maximum area efficiency that is $\boldsymbol {2.72\times }$ higher than SOA LDPC decoders.
- 18 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. PP (15498328) , 1-14
Mutual Constrained Min-Sum Check-Belief Propagation for 5G LDPC Codes: Algorithm and Implementation
State-of-the-art (SOA) designs for 5G New Radio (NR) low-density parity-check (LDPC) face a dilemma: enduring the high complexity of cumulative calculations or accepting performance degradation from unreliable messages for degree-1 variable nodes (VNs). This paper introduces the mutual constrained min-sum check-belief propagation (MCMS-CBP) decoding algorithm to resolve this dilemma. By establishing the mutual constrained cycle in well-designed message updating, while incorporating the constraint compensation strategy, the non-cumulative MCMS-CBP substantially improves the reliability of check-belief to variable-node messages for degree-1 VNs. Numerical results show that fixed-point MCMS-CBP maintains a gap of less than 0.1 dB compared to floating-point flooding belief propagation decoding algorithm across various 5G NR LDPC codes and offers inherently low complexity for hardware implementation. In addition, this paper presents an area-throughput efficient 5G NR LDPC decoder which is based on fixed-point MCMS-CBP and supports all 5G NR LDPC codes. Key techniques for optimizing the area and latency of decoder include: the sign-bit storage, reducing memory overhead by 87.5%; the intra-layer first block schedule, eliminating pipeline stalls;the partially aligned element arrangement, halving the cyclic shifter cost while eliminating memory pre-writeback rotation. Implementation result on SMIC 28nm technology demonstrates that the proposed decoder has a cell area of 1.610 mm $\boldsymbol {^{2}}$ and a peak throughput of 58.63 Gbps, yielding a 36.42 Gbps/mm $\boldsymbol {^{2}}$ maximum area efficiency that is $\boldsymbol {2.72\times }$ higher than SOA LDPC decoders.
- 1 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (12) , 3882-3886
SA-TBP: A Speed-Adaptive Temporal Beam Prediction Framework With AI for mmWave Communications
This paper presents a speed-adaptive temporal beam prediction (SA-TBP) framework based on artificial intelligence (AI) for millimeter-wave (mmWave) communication systems. The framework dynamically adjusts the historical and prediction windows according to the speed of the user equipment (UE). The model is built on an encoder-decoder LSTM architecture, with an attention mechanism integrated into the decoder. The speed-adaptive module allows flexible adjustment of both the historical measurement and future prediction windows based on the UE speed. Experimental results show that the proposed model achieves a Top-1 prediction accuracy of 92.48%, effectively reducing power consumption and resource overhead caused by frequent beam measurements, while enhancing beam selection efficiency.
- 1 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (12) , 3882-3886
SA-TBP: A Speed-Adaptive Temporal Beam Prediction Framework With AI for mmWave Communications
This paper presents a speed-adaptive temporal beam prediction (SA-TBP) framework based on artificial intelligence (AI) for millimeter-wave (mmWave) communication systems. The framework dynamically adjusts the historical and prediction windows according to the speed of the user equipment (UE). The model is built on an encoder-decoder LSTM architecture, with an attention mechanism integrated into the decoder. The speed-adaptive module allows flexible adjustment of both the historical measurement and future prediction windows based on the UE speed. Experimental results show that the proposed model achieves a Top-1 prediction accuracy of 92.48%, effectively reducing power consumption and resource overhead caused by frequent beam measurements, while enhancing beam selection efficiency.
- Open Access
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-3
SpeedLLM: An FPGA Co-design of Large Language Model Inference Accelerator
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-3
Open AccessSpeedLLM: An FPGA Co-design of Large Language Model Inference Accelerator