Dekui Wang

Dekui Wang

Auto-generated profile, based on publicly available information

Dekui Wang

School of Information Science and Technology, Northwest University, Xian, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
22 February 2019 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
DWDekui Wang
Dekui Wang
ZDZhenhua Duan
Zhenhua Duan
CTCong Tian
Cong Tian
BHBohu Huang
Bohu Huang
NZNan Zhang
Nan Zhang

3 November 2022 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
KLKe Liu
Ke Liu
DWDekui Wang
Dekui Wang
DWDongya Wu
Dongya Wu
YLYutao Liu
Yutao Liu
JFJun Feng
Jun Feng
Aiming to improve the performance of human speech emotion recognition (SER), the existing work has made great progress based on the popular mel-scale frequency cepstral coefficient (MFCC). However, the existing work rarely pays attention to the low-level emotion related features in MFCC, such as the underlying interactive relations. In this letter, we propose a novel multi-level attention network (MLAnet), which contains a multi-scale low-level feature (MLF) extractor and a multi-unit attention (MUA) module. Within the MLF extractor, we minimize the task-irrelevant information which harms the performance of SER by applying the attention mechanism. Since the features extracted by the MLF extractor contain rich domain-specific emotion information, we further present a MUA module to simultaneously weight the features in terms of time, frequency and channel dimensions. In this way, the discriminative emotion features in different dimensions can be extracted by corresponding weighting blocks. Experimental results on two benchmark datasets demonstrate that the proposed method outperforms other state-of-the-art approaches.

31 October 2017 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
DWDekui Wang
Dekui Wang
ZDZhenhua Duan
Zhenhua Duan
CTCong Tian
Cong Tian
BHBohu Huang
Bohu Huang
NZNan Zhang
Nan Zhang
In this paper, we present a new FPGA routing approach on the basis of the PathFinder routing algorithm. During each routing iteration, our approach applies a novel timing-based re-routing strategy to only re-route the illegal paths. At a lower level, each maze expansion is started from the relatively close part of current routing tree to search for the target sink on the routing resource graph. Experimental results demonstrate that on average the proposed approach reduces the routing runtime by 68.5% compared with the timing-driven router in VPR FPGA placement and routing framework, with reduction of 2.5% and 1.4% in critical path delay and wirelength respectively.

6 July 2022 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
DWDekui Wang
Dekui Wang
JFJun Feng
Jun Feng
WZWei Zhou
Wei Zhou
XHXingxing Hao
Xingxing Hao
XZXiaodan Zhang
Xiaodan Zhang
Routing is one of the most time-consuming stages in the field-programmable gate array (FPGA) design flow. Even if various attempts have been made to reduce route time, the existing work rarely focuses on improving the underlying A*-based FPGA connection router. In this article, we present a fast FPGA connection router called FCRoute based on a novel soft routing-space pruning algorithm. Within FCRoute, a routing resource priority mechanism is applied to classify the routing resource nodes into high-priority nodes and low-priority ones. On the whole, FCRoute is composed of fast maze search and backtracking process. During the fast maze search, we explore only the high-priority nodes in the routing space. In this way, a great deal of unnecessary work can be avoided. When the fast maze search fails to find the target sink, it allows the backtracking process to explore the low-priority nodes promising to be on the best path, after which a new fast maze search is called. By avoiding the exploration of the majority of low-priority nodes, FCRoute maintains runtime efficiency while ensuring global search ability. In addition, we further accelerate FCRoute with an engineering enhancement which simplifies the cost computations of nodes. Runtime and quality of results are compared with the state-of-the-art connection router in VPR 8. Experimental results show that on average FCRoute explores less than half the number of routing resource nodes, and therefore reduces runtime by 38% while enabling the quality of results. When combined with the enhancement, FCRoute achieves an average 45% reduction on runtime without sacrificing the quality of results.

24 February 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
WZWei Zhou
Wei Zhou
WJWeiwei Jin
Weiwei Jin
DWDekui Wang
Dekui Wang
XHXingxing Hao
Xingxing Hao
YYYongxiang Yu
Yongxiang Yu
CMCaiwen Ma
Caiwen Ma

10 May 2023 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
DWDekui Wang
Dekui Wang
JFJun Feng
Jun Feng
KLKe Liu
Ke Liu
WZWei Zhou
Wei Zhou
XHXingxing Hao
Xingxing Hao
LZLili Zhang
Lili Zhang
Routing is one of the most time-consuming steps in the FPGA design process. Even if unceasing efforts have been made to accelerate FPGA routing, the existing work seldom pays attention to the underlying FPGA connection router. In this paper, we present a fast FPGA connection router called PRoute which implements a novel pre-routing based parallel local routing algorithm. Basically, PRoute pre-computes the potential routing solutions for various connection patterns on FPGAs, which can be directly used in the later practical routing. On the whole, PRoute is composed of A-star maze expansion and parallel local search. In the first part, PRoute gradually expands the maze wavefront towards the lowest-cost node to search for the target sink. For a wire-type node, PRoute invokes a fast parallel local search instead taking advantage of the pre-routing results, and hence the time-expensive maze expansion can be reduced. Particularly, it allows PRoute to call one another between A-star maze expansion and parallel local search. This enables the runtime efficiency of PRoute while ensuring its global search ability. In addition, we put forward an engineering improvement to further speed up PRoute by avoiding the exploration of block output pins. To our best knowledge, this work is the first to apply the idea of pre-routing for FPGAs. Experimental results show that PRoute achieves speedups of 1.8×, 2.4×, 3.2×, 4.1× and 5.1× with 1, 4, 8, 16 and 32 threads relative to the baseline VPR’s connection router respectively, without degrading the quality of results.