Jian Gu

Jian Gu

Auto-generated profile, based on publicly available information

Jian Gu

National ASIC System Engineering Research Center, School of Integrated Circuits, Southeast University, Nanjing, China

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 March 2024 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
GHGu Hao
Gu Hao
JGJian Gu
Jian Gu
KPKeyu Peng
Keyu Peng
ZZZiran Zhu
Ziran Zhu
NXNing Xu
Ning Xu
LHLuchi Hua
Luchi Hua
Macro placement is a crucial and complex task in chip design. In recent years, reinforcement learning (RL) has emerged as a promising approach for autonomously generating effective macro placement on a grid-based chip canvas. However, existing RL-based macro placers encounter challenges when handling macros of varying sizes and preplaced blocks, due to using coarse-grained grids leads to wastage of placement space, while employing fine-grained grids results in an exponentially growing solution space and significant computational overhead. This brief proposes a legalization-aided RL-based macro placement (LAMPlace) for mixed-size designs with preplaced blocks. LAMPlace leverages RL to generate a global macro placement that allows possible overlap, followed by a macro legalization algorithm to ensure the legality of macro placement. LAMPlace can effectively address macros of various sizes and preplaced blocks because the action mask generation algorithm in RL is well coupled with the macro legalization algorithm. Compared with the state-of-the-art works, experimental results on publicly mixed-size placement benchmarks show that LAMPlace is effective.

1 October 2019
Verified
Conference Paper
Open access
BLBoren Li
Boren Li
BZBoyu Zhuang
Boyu Zhuang
MLMingyang Li
Mingyang Li
JGJian Gu
Jian Gu


1 November 2008
Verified
Conference Paper
Closed access
JGJ. Gu
J. Gu
Ramakrishnan MukundanRamakrishnan Mukundan
Ramakrishnan Mukundan
Mark BillinghurstMark Billinghurst
Mark Billinghurst
This paper describes research in the use of Java and J2ME to develop cross platform computer vision applications for mobile phones with integrated cameras. The particular area of research that we are interested in is mobile augmented reality (AR). Currently there are no existing computer vision libraries which can be used for augmented reality on the J2ME platform. This paper introduces the structure of our J2ME computer vision library and describes the implementation of algorithms in our library. We also present several sample AR applications on J2ME enabled mobile phones and report on experiments conducted to evaluate the compatibility, portability and efficiency of our library.

21 April 2025 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
GHGu Hao
Gu Hao
JGJian Gu
Jian Gu
KPKeyu Peng
Keyu Peng
JCJianli Chen
Jianli Chen
LHLuchi Hua
Luchi Hua
ZZZiran Zhu
Ziran Zhu
Field-programmable gate array (FPGA) macro placement holds a crucial role within the FPGA physical design flow since it substantially influences the subsequent stages of cell placement and routing. With the increasing number of macros and the complex cascade shape and region constraints imposed by modern FPGAs, the routability and macro placement have become much more challenging. In this article, we propose an effective and efficient routability-driven macro placement algorithm for modern FPGAs with cascade shape and region constraints. To reserve adequate space for cell placement and guarantee routability, we first develop a routability-driven mixed-size analytical global placement that evenly distributes both macros and cells while considering cascade shape and region constraints. Particularly, the proposed global placement engine integrates a well-trained congestion prediction model, targeting benchmarks with high routing congestion to enhance overall routability. Then, we propose an integer linear programming (ILP)-based cascade shape legalization followed by matching-based macro legalization to remove macro overlaps while satisfying the region constraints. Finally, a routability-driven detailed macro placement is proposed to refine the solution. Compared with the winners of the MLCAD 2023 FPGA macro placement contest and state-of-the-art works, experimental results show that our algorithm achieves the best overall score and routability.

23 June 2024
Verified
Conference Paper
Open access
GHGu Hao
Gu Hao
JGJian Gu
Jian Gu
KPKeyu Peng
Keyu Peng
LHLuchi Hua
Luchi Hua
ZZZiran Zhu
Ziran Zhu
Field-programmable gate array (FPGA) macro placement holds a crucial role within the FPGA physical design flow since it substantially influences the subsequent stages of cell placement and routing. In this paper, we propose an effective and efficient routability-driven macro placement algorithm for modern FPGAs with cascade shape and region constraints. To reserve adequate space for cell placement and guarantee routability, we first develop a routability-driven mixed-size analytical global placement (GP) that evenly distributes both macros and cells while considering cascade shape and region constraints. Then, we propose an integer linear programming (ILP)-based cascade shape legalization (LG) followed by matching-based macro legalization to remove macro overlaps while satisfying the region constraints. Finally, a routability-driven detailed macro placement is proposed to refine the solution. Compared with the top contestants of the MLCAD 2023 contest, experimental results show that our algorithm achieves the best overall score and routability.