Huan Zhang

Dr. Huan Zhang

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
15 May 2018 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
Huan ZhangHuan Zhang
Huan Zhang
BZBei Zhao
Bei Zhao
WLWeijun Li
Weijun Li
ZMZhenguo Ma
Zhenguo Ma
FYFeng Yu
Feng Yu
The offloading and acceleration of database operations on field programmable gate arrays (FPGAs) have been extensively studied for a long time. Architectures of join, a key database operation, have been proposed and optimized on FPGAs. However, these join architectures are either resource-intensive or have low-throughput. In this paper, we focus on the equi-join and propose a resource-efficient join architecture based on a tree model. The architecture needs two phases: the build phase, in which a binary tree is built by using the first database table, and the probe phase, in which the architecture searches the tree to find matching solutions through a second database table. In addition, we propose a parallel implementation for this architecture to improve its performance. The proposed design was implemented on a Xilinx FPGA, and the results were compared with the most recent works on hardware join. The experimental results demonstrate that for a range of parallelism and dataset sizes, our design achieves a data throughput of 8–100 million tuples per second, which is compatible with the bus rate, and performs well in balancing resource utilization and data throughput.

20 November 2025 in Applied Soft Computing
Verified
Journal Article
Closed access
XGXiulin Geng
Xiulin Geng
ZYZhiyuan Yang
Zhiyuan Yang
MHMiao Hu
Miao Hu
Jie LuoJie Luo
Jie Luo
MSMingkun Su
Mingkun Su
XHXiaoyu He
Xiaoyu He

9 December 2024 in IEEE Access
Verified
Journal Article
Open access
JCJietao Chen
Jietao Chen
CQChen Qianhao
Chen Qianhao
Huan ZhangHuan Zhang
Huan Zhang
WCWeijie Chen
Weijie Chen
WLWei William Luo
Wei William Luo
FYFeng Yu
Feng Yu
Recently, learning-based lossless compression methods for volumetric medical images have attracted much attention. They can achieve higher compression ratios than traditional methods, albeit at the cost of slower compression speed. Although using field programmable gate arrays (FPGAs) is feasible to mitigate this disadvantage, existing FPGA-based compression frameworks still need CPU for co-processing. In this work, we propose a hardware end-to-end neural conditional entropy encoder (HENCE), for losslessly compressing 3D medical images with the balanced compression ratio and speed. To achieve this, we first introduce a context-based entropy model to reduce data redundancy within inter-slice and intra-slice features, using an efficient combination of auto-regressive and recurrent neural networks. Then, we design a hardware-friendly arithmetic coding module to collaborate with our learning-based entropy model. To obtain the cumulative distribution function of the discrete logistic distribution, we further introduce a high-precision Sigmoid approximation algorithm, using the Newton-Raphson method. Finally, we design a dataflow mechanism for the entropy model and the coding module, achieving a fully pipelined compression system. Extensive experimental results show that our method outperforms traditional image/video codecs like FLIF, JPEX-XL, and HEVC on several volumetric medical image datasets. And our method obtains faster encoding speed than existing learning-based medical image compression frameworks.

1 January 2026 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
Huan ZhangHuan Zhang
Huan Zhang
XMXiaomeng Miao
Xiaomeng Miao
JCJietao Chen
Jietao Chen
CLChenpu Li
Chenpu Li
BZBei Zhao
Bei Zhao

26 July 2025 in Electronics
Verified
Journal Article
Open access
PDF file
Huan ZhangHuan Zhang
Huan Zhang
CLChenpu Li
Chenpu Li
MXMeiting Xue
Meiting Xue
BZBei Zhao
Bei Zhao
JBJianrong Bao
Jianrong Bao
The extensive utilization of the Snappy compression algorithm in digital devices such as smartphones, IoT, and digital cameras has played a crucial role in alleviating demands on network bandwidth and storage space. This paper presents an improved Snappy compression algorithm optimized for implementation on field programmable gate arrays (FPGAs). The proposed algorithm enhances the compression ratio by refining the encoding format of Snappy and introduces an innovative approach utilizing fingerprints within the dictionary to minimize storage space requirements. Additionally, the algorithm incorporates a pipeline structure to optimize performance. Experimental results demonstrate that the proposed algorithm achieves a throughput of 1.6 GB/s for eight hardware kernels. The average compression ratio is 2.27, representing a 6.1% improvement over the state-of-the-art Snappy FPGA implementation. Notably, the proposed algorithm architecture consumes fewer on-chip storage resources compared to other advanced algorithms, striking a balance between logic and storage resource utilization. This optimization leads to higher FPGA resource utilization efficiency. Our design addresses the growing demand for efficient lossless data compression solutions in consumer electronics, ultimately contributing to advancements in modern digital ecosystems.