Wu Guan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wu Guan has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Liping Liang
School of Integrated Circuits, Beijing University of Posts and Telecommunications, Beijing, China
5 shared publications Liping Liang
School of Integrated Circuits, Beijing University of Posts and Telecommunications, Beijing, China
4 shared publications- Ziqin Yan
School of Integrated Circuits, Beijing University of Posts and Telecommunications (BUPT), Beijing, China
3 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 - Xin Qiu
Institute of Microelectronics of the Chinese Academy of Sciences, Beijing 100029, China
2 shared publications
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
- 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
- 25 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (5) , 984-988
List-Based Residual Belief-Propagation Decoding of LDPC Codes
This letter presents an enhanced list-based residual belief propagation (L-RBP) method for decoding low-density parity-check (LDPC) codes. L-RBP reduces computational complexity by scheduling a concise list of residuals. Moreover, the list is partially renewed to deter a small cluster of residuals from monopolizing renewal opportunities. Simultaneously, we also incorporate a decay mechanism to constrain the residuals retained within the list, further mitigating the greediness of the algorithm. The numerical results indicate that the L-RBP has an attractive convergence speed, error rate performance, and complexity of long-length and low-rate codes in the additive white Gaussian noise (AWGN) channel.
- 25 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (5) , 984-988
List-Based Residual Belief-Propagation Decoding of LDPC Codes
This letter presents an enhanced list-based residual belief propagation (L-RBP) method for decoding low-density parity-check (LDPC) codes. L-RBP reduces computational complexity by scheduling a concise list of residuals. Moreover, the list is partially renewed to deter a small cluster of residuals from monopolizing renewal opportunities. Simultaneously, we also incorporate a decay mechanism to constrain the residuals retained within the list, further mitigating the greediness of the algorithm. The numerical results indicate that the L-RBP has an attractive convergence speed, error rate performance, and complexity of long-length and low-rate codes in the additive white Gaussian noise (AWGN) channel.
- 15 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 43 (4) , 1312-1316
Adaptive Granularity Progressive LDPC Decoding for NAND Flash Memory
Progressive low-density parity check (LDPC) code decoding has been widely used to correct increasing raw bit errors in NAND Flash memory. Once the decoding of a single logical page fails, the read-retry operation will reprocess at an increased read level with more accurate initial log-likelihood ratio (LLR) messages. However, the traditional progressive LDPC decodings with inappropriate read-level-increase granularities of read-retry operations introduce unnecessary flash read latency. By taking advantage of globally coupled LDPC (GC-LDPC) codes, an improved adaptive granularity progressive LDPC decoding (IAGPD) is proposed. This method can estimate the number of uncorrectable bit errors before each read-retry operation by detecting the unsatisfied local parity checks and general syndrome in the decoding failure. Then, it adaptively selects the optimal read-level-increase granularities for read-retry operations in the progressive LDPC decoding. Compared with the existing decoding methods, only by an extra 0.098% of the decoder area and two clock cycles, our method can reduce the flash read latency by up to 43%. And the solid-state drive (SSD) read response time on MQsim can be reduced by up to 32%.
- 15 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 43 (4) , 1312-1316
Adaptive Granularity Progressive LDPC Decoding for NAND Flash Memory
Progressive low-density parity check (LDPC) code decoding has been widely used to correct increasing raw bit errors in NAND Flash memory. Once the decoding of a single logical page fails, the read-retry operation will reprocess at an increased read level with more accurate initial log-likelihood ratio (LLR) messages. However, the traditional progressive LDPC decodings with inappropriate read-level-increase granularities of read-retry operations introduce unnecessary flash read latency. By taking advantage of globally coupled LDPC (GC-LDPC) codes, an improved adaptive granularity progressive LDPC decoding (IAGPD) is proposed. This method can estimate the number of uncorrectable bit errors before each read-retry operation by detecting the unsatisfied local parity checks and general syndrome in the decoding failure. Then, it adaptively selects the optimal read-level-increase granularities for read-retry operations in the progressive LDPC decoding. Compared with the existing decoding methods, only by an extra 0.098% of the decoder area and two clock cycles, our method can reduce the flash read latency by up to 43%. And the solid-state drive (SSD) read response time on MQsim can be reduced by up to 32%.
- 24 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (12) , 6849-6858
Check-Belief Propagation Decoding of LDPC Codes
Variant belief propagation (BP) algorithms are applied to low-density parity-check (LDPC) codes. However, conventional decoders suffer from a large resource consumption due to gathering messages from all the neighbour variable-nodes and/or check-nodes through cumulative calculations. In this paper, a check-belief propagation (CBP) decoding algorithm is proposed. Check-belief is used as the probability that the corresponding parity-check is satisfied. All check-beliefs are iteratively enlarged in a sequential recursive order, and successful decoding will be achieved after the check-beliefs are all big enough. Compared to previous algorithms employing a large number of cumulative calculations to gather all the neighbor messages, CBP decoding can renew each check-belief by propagating it from one check-node to another through only one variable-node, resulting in a low complexity decoding with no cumulative calculations. The simulation results and analyses show that the CBP algorithm provides little error-rate performance loss in contrast with the previous BP algorithms, but consumes much fewer calculations and memories than them. It earns a big benefit in terms of complexity.
- 24 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (12) , 6849-6858
Check-Belief Propagation Decoding of LDPC Codes
Variant belief propagation (BP) algorithms are applied to low-density parity-check (LDPC) codes. However, conventional decoders suffer from a large resource consumption due to gathering messages from all the neighbour variable-nodes and/or check-nodes through cumulative calculations. In this paper, a check-belief propagation (CBP) decoding algorithm is proposed. Check-belief is used as the probability that the corresponding parity-check is satisfied. All check-beliefs are iteratively enlarged in a sequential recursive order, and successful decoding will be achieved after the check-beliefs are all big enough. Compared to previous algorithms employing a large number of cumulative calculations to gather all the neighbor messages, CBP decoding can renew each check-belief by propagating it from one check-node to another through only one variable-node, resulting in a low complexity decoding with no cumulative calculations. The simulation results and analyses show that the CBP algorithm provides little error-rate performance loss in contrast with the previous BP algorithms, but consumes much fewer calculations and memories than them. It earns a big benefit in terms of complexity.
- 9 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (2) , 438-441
Simplified Metric Sorting for Multi-Bit Successive Cancellation List Decoding of Polar Codes
This letter focuses on the metric sorting step for multi-bit successive cancellation list (SCL) decoders of polar codes, which is an important part of the whole decoder. We propose a primary-secondary exchange sorting (PSES) method. In the primary sorting, most of the survivals, L paths are selected from the first minor 2L candidates. In the secondary sorting, a small number of N paths are extracted from the other huge number of candidates to remedy the missing survivals. The N paths in the secondary stage are exchanged with the largest N elements in the first L paths. Due to the minor candidates in the primary stage and the few survivals in the secondary stage, this method reduces the complexity with negligible performance loss. Additionally, a sorting network based on compare-and-swap unit (CASU) PSES (CPSES) and a sorting network based on Radix-2L PSES (RPSES) are proposed to improve secondary sorting. The evaluation results show that compared with state-of-the-art metric sorting methods, the proposed CPSES architecture significantly reduces hardware resources, and the proposed RPSES architecture significantly reduces the latency.
- 9 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (2) , 438-441
Simplified Metric Sorting for Multi-Bit Successive Cancellation List Decoding of Polar Codes
This letter focuses on the metric sorting step for multi-bit successive cancellation list (SCL) decoders of polar codes, which is an important part of the whole decoder. We propose a primary-secondary exchange sorting (PSES) method. In the primary sorting, most of the survivals, L paths are selected from the first minor 2L candidates. In the secondary sorting, a small number of N paths are extracted from the other huge number of candidates to remedy the missing survivals. The N paths in the secondary stage are exchanged with the largest N elements in the first L paths. Due to the minor candidates in the primary stage and the few survivals in the secondary stage, this method reduces the complexity with negligible performance loss. Additionally, a sorting network based on compare-and-swap unit (CASU) PSES (CPSES) and a sorting network based on Radix-2L PSES (RPSES) are proposed to improve secondary sorting. The evaluation results show that compared with state-of-the-art metric sorting methods, the proposed CPSES architecture significantly reduces hardware resources, and the proposed RPSES architecture significantly reduces the latency.