Demo Data from EDBT 2026 / reviewers in the wild / expert
Teng Lu
dblp:128/6978
· DBLP profile ↗
4ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Coding theory · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Integrated circuit design · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › LDPC codes › LDPC decoding
layered decoding |
0.7 | 1 | 2023 | Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes · IEEE Trans. Commun. 2023 |
Coding theory › error-correcting codes
LDPC codes |
0.7 | 1 | 2023 | Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes · IEEE Trans. Commun. 2023 |
Coding theory › error-correcting codes › code construction › LDPC code design
parity-check matrix construction |
0.7 | 1 | 2023 | Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes · IEEE Trans. Commun. 2023 |
Coding theory › error-correcting codes › LDPC codes
quasi-cyclic LDPC codes |
0.7 | 1 | 2023 | Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes · IEEE Trans. Commun. 2023 |
Integrated circuit design › digital circuit design › combinational logic
decoder architecture |
0.2 | 1 | 2023 | Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes · IEEE Trans. Commun. 2023 |
Methods — techniques the papers use, named apart from their topics
optimization · 1.3greedy algorithm · 1.3progressive edge-growth · 0.7progressive edge growth · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Dynamic Scheduling for AI Accelerators via TISA
Guanghui Song, Xiaoqiang Dan, Chengke Wang, Wenyuan Lv, Zhongzhou Jiang, Jianjian Guan, Teng Lu, Weixing Pan, Zirong Shen, Jie Zhao 0002 |
ISCA | 8 |
| 2025 | SEE-Net: Spectral Environment Encoder for Graph Out-of-Distribution Representations Learning
Bohan Zhao, Teng Lu, Jiaqing Zhu |
PRCV (3) | 3 |
| 2023 | Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC CodesabstractIn this paper, we consider how to partition the parity-check matrices (PCMs) to reduce the hardware complexity and increase decoding throughput for the row layered decoding of quasi-cyclic low-density parity-check (QC-LDPC) codes. First, we formulate the PCM partitioning as an optimization problem, which targets to minimize the maximum column weight of each layer while maintaining a block cyclic shift property among different layers. As a result, we derive all the feasible solutions for the problem and propose a tight lower bound ωLBon the minimum possible maximum column weight to evaluate a solution. Second, we define a metric called layer distance to measure the data dependency between consecutive layers and further illustrate how to identify the solutions with desired layer distance from those achieving the minimum value of ωLB= 1, which is preferred to reduce computation delay. Next, we demonstrate that up-to-now, finding an optimal solution for the optimization problem with polynomial time complexity is unachievable. Therefore, both enumerative and greedy partition algorithms are proposed instead. After that, we modify the quasi-cyclic progressive edge-growth (QC-PEG) algorithm to directly construct PCMs that have a straightforward partition scheme to achieve ωLBor the desired layer distance. Simulation results showed that the constructed codes have better error correction performance and achieve less average number of iterations than the underlying 5G LDPC codes. Teng Lu, Peng Kang 0001, Jiongyue Xing, Xiaohu Tang 0004 |
IEEE Trans. Commun. | 1 |
| 2014 | Dual-Level DVFS-Enabled Millimeter-Wave Wireless NoC ArchitecturesabstractWireless Network-on-Chip (WiNoC) has emerged as an enabling technology to design low power and high bandwidth massive multicore chips. WiNoCs based on small-world network architecture and designed with incorporating millimeter (mm)-wave on-chip wireless links offer significantly lower power and higher bandwidth compared to traditional mesh-based counterparts. In this mm-wave small-world WiNoC (mSWNoC), long distance communication predominately takes place through the wireless shortcuts whereas the short-range data exchange still occurs through the conventional metal wires. This results in performance advantages mainly stemming from using the wireless links as long-range shortcuts between far apart cores. This performance gain can be enhanced further if the wireline links and the processing cores of the WiNoC are optimized according to the traffic patterns and application workloads. In this work, we demonstrate that by incorporating both processor- and network-level dynamic voltage and frequency scaling (DVFS) in an mSWNoC, the power and thermal profiles can be improved without a significant impact on the overall execution time. We also show that depending on the applications, temperature hotspots can be formed either in the processing cores or in the network infrastructure. The proposed dual-level DVFS is capable of addressing both types of hotspots. In this work we will demonstrate how novel interconnect architectures enabled by the on-chip wireless links coupled with power management strategies can improve the energy and thermal characteristics of a NoC significantly. Jacob Murray, Teng Lu, Paul Wettin, Partha Pratim Pande, Behrooz A. Shirazi |
ACM J. Emerg. Technol. Comput. Syst. | 2 |