Hongbin Pan

Dr. Hongbin Pan


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
15 July 2020 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
HDHongxi Dong
Hongxi Dong
MWManzhen Wang
Manzhen Wang
YLYuanyong Luo
Yuanyong Luo
MZMuhan Zheng
Muhan Zheng
MAMengyu An
Mengyu An
HPHongbin Pan
Hongbin Pan
This article presents a piecewise linear approximation computation (PLAC) method for all nonlinear unary functions, which is an enhanced universal and error-flattened piecewise linear (PWL) approximation approach. Compared with the previous methods, PLAC features two main parts, an optimized segmenter to seek the minimum number of segments under the predefined software maximum absolute error (MAE), raising the segmentation performance to the highest theoretical level for logarithm, and a novel quantizer to completely simulate the hardware behavior and determine the required bit width and MAE c (MAE in circuits) for hardware implementation. In addition, the hardware architecture is also improved by simplifying the indexing logic, leading to nonredundant hardware overhead. The ASIC implementation results reveal that the proposed PLAC can improve all metrics without any compromise. Compared with the state-of-the-art methods, when computing logarithmic function, PLAC reduces 2.80% area, 3.77% power consumption, and 1.83% MAE c with the same delay; when approximating hyperbolic tangent function, PLAC reduces 6.25% area, 4.31% power consumption, and 18.86% MAE c with the same delay; when evaluating sigmoid function, PLAC reduces 16.50% area, 4.78% power consumption with the same delay, and MAEc; and when calculating softsign function, PLAC reduces 17.28% area, 11.34% power consumption, 12.50% delay, and 33.28% MAE c .

19 September 2019 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
HSHuaqing Sun
Huaqing Sun
YLYuanyong Luo
Yuanyong Luo
YHYajun Ha
Yajun Ha
YSYinghuan Shi
Yinghuan Shi
Yang GaoYang Gao
Yang Gao
HPHongbin Pan
Hongbin Pan
Transcendental functions are commonly used in many fields such as nonlinear functions of artificial neural networks (ANNs). Due to nonlinearity of these functions, hardware implementation of the functions faces many challenges. Some methods cannot control the approximation accuracy beforehand, or they cannot approximate target functions accurately and efficiently. Other methods can only approximate a particular function without generality. A universal piecewise linear (PWL) approximation method is proposed to solve the problems existing in the above methods. In this paper, a general piecewise linear (PWL) approximation method with controllable maximum absolute error for transcend-ental functions is proposed. The method has the self-adaptive capability to choose the smallest number of segments under the constraint of a controllable maximum absolute error. Therefore, it requires fewer segments and incurs less hardware overhead. Moreover, it can approximate any transcendental functions and does not rely on any properties of the target function. Comparing our work with other methods used in three transcendental functions, including the sigmoid, hyperbolic tangent, and logarithmic function, our method improves the approximation accuracy by 4.5 times, 2.1 times, and 1.3 times, respectively; in addition, our method is more efficient and it reduces the circuit area by 49.9%, 22.4%, and 28.5%, respectively.

18 June 2019 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
YLYuanyong Luo
Yuanyong Luo
YWYuxuan Wang
Yuxuan Wang
YHYajun Ha
Yajun Ha
ZWZhongfeng Wang
Zhongfeng Wang
SCSiyuan Chen
Siyuan Chen
HPHongbin Pan
Hongbin Pan
This paper proposes a generalized hyperbolic COordinate Rotation Digital Computer (GH CORDIC) to directly compute logarithms and exponentials with an arbitrary fixed base. In a hardware implementation, it is more efficient than the state of the art which requires both a hyperbolic CORDIC and a constant multiplier. More specifically, we develop the theory of GH CORDIC by adding a new parameter called base to the conventional hyperbolic CORDIC. This new parameter can be used to specify the base with respect to the computation of logarithms and exponentials. As a result, the constant multiplier is no longer needed to convert base e (Euler's number) to other values because the base of GH CORDIC is adjustable. The proposed methodology is first validated using MATLAB with extensive vector matching. Then, example circuits with 16-bit fixed-point data are implemented under the TSMC 40-nm CMOS technology. Hardware experiment shows that at the highest frequency of the state of the art, the proposed methodology saves 27.98% area, 50.69% power consumption, and 6.67% latency when calculating logarithms; it saves 13.09% area, 40.05% power consumption, and 6.67% latency when computing exponentials. Both calculations do not compromise accuracy. Moreover, it can increase 13% maximum frequency and reduce up to 17.65% latency accordingly compared to the state of the art.

4 June 2018 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
YLYuanyong Luo
Yuanyong Luo
YWYuxuan Wang
Yuxuan Wang
HSHuaqing Sun
Huaqing Sun
YZYi Zha
Yi Zha
ZWZhongfeng Wang
Zhongfeng Wang
HPHongbin Pan
Hongbin Pan
This paper presents a COordinate Rotation Digital Computer (CORDIC)-based architecture for the computation of Nth root and proves its feasibility by hardware implementation. The proposed architecture performs the task of Nth root simply by shift-add operations and enables easy tradeoff between the speed (or precision) and the area. Technically, we divide the Nth root computation into three different subtasks, and map them onto three different classes of the CORDIC accordingly. To overcome the drawback of narrow convergence range of the CORDIC algorithm, we adopt several innovative methods to yield a much improved convergence range. Subsequently, in terms of convergence range and precision, a flexible architecture is developed. The architecture is validated using MATLAB with extensive vector matching. Finally, using a pipelined structure with fixed-point input data, we implement the example circuits of the proposed architecture with radicand ranging from zero to one million, and achieve an average mean of approximately 10⁷ for the relative error. The design is modeled using Verilog HDL and synthesized under the TSMC 40-nm CMOS technology. The report shows a maximum frequency of 2.083 GHz with 197421.00 μm² area. The area decreases to 169689.98 μm² when the frequency lowers to 1.00 GHz.

15 February 2012 in Sensors
Verified
Journal Article
Open access
PDF file
YXYue Xu
Yue Xu
HPHongbin Pan
Hongbin Pan
SHShu-Zhuan He
Shu-Zhuan He
LLLi Li
Li Li
Integrated CMOS Hall sensors have been widely used to measure magnetic fields. However, they are difficult to work with in a low magnetic field environment due to their low sensitivity and large offset. This paper describes a highly sensitive digital Hall sensor fabricated in 0.18 μm high voltage CMOS technology for low field applications. The sensor consists of a switched cross-shaped Hall plate and a novel signal conditioner. It effectively eliminates offset and low frequency 1/f noise by applying a dynamic quadrature offset cancellation technique. The measured results show the optimal Hall plate achieves a high current related sensitivity of about 310 V/AT. The whole sensor has a remarkable ability to measure a minimum ±2 mT magnetic field and output a digital Hall signal in a wide temperature range from −40 °C to 120 °C.

2 June 2020 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
ZQZidi Qin
Zidi Qin
YQYuou Qiu
Yuou Qiu
HSHuaqing Sun
Huaqing Sun
Zhonghai LuZhonghai Lu
Zhonghai Lu
ZWZhongfeng Wang
Zhongfeng Wang
HPHongbin Pan
Hongbin Pan
In this brief, a novel approximation method and its optimized hardware implementation are proposed for the sigmoid function used in Deep Neural Networks (DNNs). Based on piecewise approximation and truncated Taylor series expansion, the proposed method achieves very good approximation with low complexity while exploiting data representation with powers of two. In addition, by analyzing gradients of the sigmoid function, a small trick is introduced to improve the approximation precision. Furthermore, to reduce the hardware complexity and shorten the critical path, sampled values of the function are generated with simple logical-mapping. It is shown that the proposed approximation schemes can be implemented with purely combinational logic and the sigmoid function can be computed in one clock cycle. The experimental results demonstrate that the mean absolute errors are at the order of 1 × 10 -3 . Compared with prior arts, the new design can obtain significant improvement in critical path with comparable performance.