Tang Hu

Tang Hu

Auto-generated profile, based on publicly available information

Tang Hu

Ocean College, Zhejiang University, Zhoushan, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
28 September 2020 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
QZQiangwen Zheng
Qiangwen Zheng
LYLijie Yang
Lijie Yang
YXYaping Xie
Yaping Xie
JLJunjie Li
Junjie Li
THTang Hu
Tang Hu
Zhiwei XuZhiwei Xu
Zhiwei Xu
In conventional fast-ramp based target detection schemes for the frequency modulated continuous wave (FMCW) radar systems, all chirp sequences are performed fully on two-dimensional fast Fourier transforms (FFTs) to estimate range and velocity of a target, and all range-Doppler cells are scanned by the two-dimensional (2D) cell-averaging constant false alarm rate (CA-CFAR) detector to extract valid targets against background noise. This results in an extremely high computational complexity. To decrease the complexity while maintaining a desired performance, this paper proposes a target detection scheme based on distributed one-dimensional (1D) CA-CFAR and region of interest (ROI) pre-processing, which performs Doppler-FFT only for range ROI cells and scans only Doppler ROI cells to extract pre-targets. Simulation results indicate that the proposed scheme significantly decreases complexity and simultaneously improves detection performance in terms of detection probability, figure of merit (FoM) and CFAR loss, as compared to the conventional schemes. The advantages of the proposed scheme over the conventional ones are further verified by field tests under multi-target scenario, using our recently developed FMCW radar with high angular resolution.

23 August 2022 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
THTang Hu
Tang Hu
XLXiangdi Li
Xiangdi Li
XYXiao Yu
Xiao Yu
SRSongnan Ren
Songnan Ren
LYLi Yan
Li Yan
SZShiqiang Zhu
Shiqiang Zhu
Efficient FPGA-based floating-point singular value decomposition (SVD) is challenging for its enormous complexity with the rapid growth of the matrix dimension. Numerous hardware architectures have been proposed to improve the performance of SVD by increasing capacity of computation units, reusing data, and enhancing bandwidth. These designs, however, are not optimum due to their low parallelism, poor data access efficiency, and inferior iterations scheduling. In this express, we propose a block column vector Hestenes-Jacobi (BCV Jacobi) algorithm that decomposes an arbitrary large matrix into several blocks, enhances the access efficiency by customizing the distinctive data structure, and improves the system-level parallelism by simplifying the iteration scheduling. The proposed BCV Jacobi algorithm also achieves better scalability and efficiency. Experimental results show that the performance of the proposed FPGA based SVD processor is superior to other SVD implementations in terms of parallelism, data access efficiency, matrix size, and execution time. When compared with state of the art SVD accelerator engine, the proposed algorithm speeds up the runtime over 2× on average.

11 April 2025 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
THTang Hu
Tang Hu
CHChunling Hao
Chunling Hao
XWXier Wang
Xier Wang
ZLZhiwei Liu
Zhiwei Liu
SRSongnan Ren
Songnan Ren
SZShiqiang Zhu
Shiqiang Zhu
FPGA implementation of a multi-channel pipelined large FFT architecture is challenging due to its complex inter-channel data scheduling, high-throughput requirement, and resource-constrained hardware. By transforming to 2D-FFT implementation, investigating different binary tree schemes, and exploring various radices, butterflies, as well as data path structures, many hardware architectures have been designed to enhance single-channel large FFT or multi-channel medium-small size FFT performance. These designs fall short in addressing the demands of multi-channel pipelined and large FFT applications. In this article, a self-attention multipath delay feedback (SA-MDF) algorithm is proposed to analyze and identify the most critical bottleneck, then automatically pay attention to improve it, and finally generate the optimal FFT framework by exhaustively exploring the design space. The proposed algorithm alleviates the design difficulties and speeds up the FPGA implementation. Furthermore, an approximate roofline model and a novel binary tree scheme are introduced to further minimize the utilization of on-chip memory. A comprehensive comparison in terms of principles, implementation methods, and optimization effects is conducted when compared with other multi-channel FFT architectures. Experimental results show that the proposed FFT architectures are superior to other FFT implementations in terms of channel count, FFT length, high-throughput data arrangement, and adaptability to diverse hardware platforms.