Hao Li, Ph.D.
Assistant Professor
Department of Computer Science and Engineering
University of North Texas
P.O.Box 311366, Denton, TX 76203
Office: NTRP F278
Phone: (940) 565-4278
Fax: (940) 565-2799
Email: hli at unt dot edu
- VLSI CAD and Design
- Physical Design Automation
- Reconfigurable Computing
- High Level Synthesis
Publications
- Hao Li, Jian Huang, Philip Sweany, and Dijiang Huang, “FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing
over a Binary Field”, accepted by Journal of Systems Architecture (published by Elsevier), available online at here.
- Jian Huang, Jooheung Lee, and Hao Li, “ A Fast FPGA Implementation of Tate Pairing in Cryptography
over Binary Field”, to appear in International Conference on Security and Management, July 2008.
- Hao Li and Yue Zhuo, “Criticality History Guided FPGA Placement Algorithm for Timing Optimization”,
in Proceedings of GLSVLSI 2008, pp. 267-272, May 2008
- Jian Huang, Hao Li, and Philip Sweany
“An FPGA Implementation of Elliptic
Curve Cryptography for Future Secure Web Transaction”,
in International Conference on Parallel and Distributed
Computing Systems (PDCS 2007), pp. 296-301, September 2007.
- Jian Huang and Hao Li,
“A Parallel Architecture for Motion Estimation
and DCT Computation in MPEG-2 Encoder”,
in Lecture Notes in Computer Science (ICA3PP-07) , Vol.4494, pp. 210-221, Springer-Verlag, June 2007.
- Yue Zhuo, Hao Li, Qiang Zhou, Yici Cai, and Xianlong Hong,
“New Timing and Routability Driven Placement
Algorithms for FPGA Synthesis”,
in Proceedings of GLSVLSI 2007, pp. 570-575, March 2007.
- Yue Zhuo and Hao Li,
“A Novel Timing and Congestion Driven Algorithm for FPGA Placement”,
in Proceedings International Symposium on Field-Programmable Gate Arrays,
pp. 224, February 2007.
- Yue Zhuo, Hao Li, and Saraju Mohanty,
“A Congestion Driven Placement Algorithm for FPGA Synthesis”,
in Proceedings of International Conference on Field Programmable Logic and Applications, pp. 683-686, August 2006.
- Hao Li, Srinivas Katkoori, and Zhipeng Liu,
“Feedback Driven High Level Synthesis for Performance Optimization”,
in Proceedings of 6th International Conference on ASIC, pp. 882-885,
October 2005.
- Wai-Kei Mak, and Hao Li,
“Modern FPGA Placement”,
in Proceedings of Emerging Information Technology Conference, August 2005, Taiwan.
- S. Mohanty, R. Velagapudi, V. Mukherjee, and Hao Li,
“Reduction of Direct Tunneling Power Dissipation
during Behavioral Synthesis of Nanometer CMOS Circuits”,
in Proceedings of ISVLSI 2005, pp.248-249, May 2005.
- Hao Li, Wai-Kei Mak, and Srinivas Katkoori,
“Power Minimization Algorithms for LUT Based FPGA Technology Mapping”,
ACM Transactions on Design Automation of Electronic Systems (TODAES),
Vol.9, No.1, pp. 33-51, January 2004.
- Hao Li, Srinivas Katkoori, and Wai-Kei Mak,
“Force-directed Performance Driven Placement Algorithm for FPGAs”,
in Proceedings of ISVLSI 2004, pp.193-198, Feburary 2004.
- Hao Li, Wai-Kei Mak, and Srinivas Katkoori,
“An Efficient LUT-Based FPGA Technology Mapping Algorithm for Power Minimization&rdquo,
in Proceedings of ASP-DAC, pp.353-358, January 2003.
(Nominated for Best Paper Award)
- Hao Li, Wai-Kei Mak, and Srinivas Katkoori,
“LUT-based FPGA Technology Mapping for Power Minimization with Optimal Depth”,
in Proceedings IEEE WVLSI 2001 , pp.123-128, April 2001.
Students
Jian (Harry) Huang
   M.S. Thesis: FPGA
Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field
Yue Zhuo   M.S.    Thesis: Timing and Congestion Driven Algorithms for FPGA Placement
Currently working for Advanced Micro Devices, San Jose, USA.
Suresh Vijayakumar   M.S.    Thesis: Hardware/Software Co-deisgn, FPGA Physical Design and Synthesis
Teaching
CSCE 3730 -- Reconfigurable Logic (Fall 2008)
CSCE 6730 -- Advanced VLSI Systems (Fall 2008)
Courses taught in previous semesters
Affiliations
IEEE
ACM
Experiences
Links
Computer Systems Research Laboratory at UNT
Cadence University Program at UNT
Ph.D. Advisor
Dr. Srinivas
Katkoori at the University of South Florida.
Last updated 4/17/2008
Copyright © by Hao Li