Wei-Ting Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Wei-Ting Chen has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Pei-Yin Chen
Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan
6 shared publications - Shao-Pin Wang
Department of Chemistry, National Cheng Kung University, Tainan. Taiwan
2 shared publications - You-Rong Chen
Department of Computer Science and Information Engineering, Digital Integrated Circuit Design Laboratory, National Cheng Kung University, Tainan, Taiwan
2 shared publications - Bo-Chen Lin
National Cheng Kung University
1 shared publication Chao-Chien Hu
Department of Ophthalmology, Shin Kong Wu Ho-Su Memorial Hospital, Taipei 111, Taiwan
1 shared publication- Cheng-Hsien Li
Department of Computer Science and Information Engineering, National Cheng Kung University, 70101, Tainan, Taiwan
1 shared publication
Latest Publications
- 28 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (2) , 717-730
A Low-Cost Pipelined Architecture Based on a Hybrid Sorting Algorithm
In this paper, a low-cost pipelined architecture based on a hybrid sorting algorithm is proposed. The proposed architecture is constructed with a bitonic sorter and several cascaded bidirectional insertion sorting units. The bidirectional insertion sorting unit uses the segmented sorted subsequence generated by the bitonic sorter as input, and records the maximum and minimum values of the subsequence. After all segmented subsequences are processed through the cascaded bidirectional insertion sorting units, a sorted sequence is obtained. The proposed architecture is implemented using the Verilog hardware description language (HDL) and synthesized using the Synopsys Design Compiler with a TSMC 90-nm cell library. The experimental results indicate that the proposed architecture can not only shorten sorting cycles but also reduce hardware area costs. Moreover, sorting cycles can be further shortened by increasing the parallelism of the proposed architecture. Under the configuration that 2048 32-bit data to be sorted and 16 data have to be processed simultaneously, the proposed architecture can improve the throughput-to-gate-count ratio by 16%, and throughput-to-power-consumption-ratio by 25% compared to the existing sorting design. The proposed architecture makes the most efficient use of hardware resources.
- 28 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (2) , 717-730
A Low-Cost Pipelined Architecture Based on a Hybrid Sorting Algorithm
In this paper, a low-cost pipelined architecture based on a hybrid sorting algorithm is proposed. The proposed architecture is constructed with a bitonic sorter and several cascaded bidirectional insertion sorting units. The bidirectional insertion sorting unit uses the segmented sorted subsequence generated by the bitonic sorter as input, and records the maximum and minimum values of the subsequence. After all segmented subsequences are processed through the cascaded bidirectional insertion sorting units, a sorted sequence is obtained. The proposed architecture is implemented using the Verilog hardware description language (HDL) and synthesized using the Synopsys Design Compiler with a TSMC 90-nm cell library. The experimental results indicate that the proposed architecture can not only shorten sorting cycles but also reduce hardware area costs. Moreover, sorting cycles can be further shortened by increasing the parallelism of the proposed architecture. Under the configuration that 2048 32-bit data to be sorted and 16 data have to be processed simultaneously, the proposed architecture can improve the throughput-to-gate-count ratio by 16%, and throughput-to-power-consumption-ratio by 25% compared to the existing sorting design. The proposed architecture makes the most efficient use of hardware resources.
- Open Access
- 7 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 72850-72865
A High-Speed Low-Cost Hardware Implementation for Depth Estimation Using Disparity Fusion Method
Depth estimation using stereo images can be achieved by calculating the disparity values between the left and the right images captured by two parallel cameras. Reconstructing depth information from 2D images is crucial in many applications, such as self-driving vehicles and robot navigation. Furthermore, most of these applications are employed with resource-constrained devices and have real-time requirements. In this paper, a high-speed, low-cost hardware implementation for disparity estimation is proposed. We adopted the novel disparity fusion method in our architecture, which can significantly reduce the number of calculations in the overall process. A refinement method is also designed to reduce the error rate of the resulting depth map and improve the tolerance to light noise. The proposed algorithm was implemented with the Kintex-7 field-programmable gate array. Its performance was tested by using the Middlebury-Version 2 and -Version 3 datasets. The proposed algorithm provides an operating speed of 118 fps with an error rate of only 6.36%. Compared with other state-of-the-art designs used for similar applications, the proposed method can achieve a 34.6% reduction in the error rate while providing the highest speed with competitive hardware cost.
- 7 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 72850-72865
Open AccessA High-Speed Low-Cost Hardware Implementation for Depth Estimation Using Disparity Fusion Method
Depth estimation using stereo images can be achieved by calculating the disparity values between the left and the right images captured by two parallel cameras. Reconstructing depth information from 2D images is crucial in many applications, such as self-driving vehicles and robot navigation. Furthermore, most of these applications are employed with resource-constrained devices and have real-time requirements. In this paper, a high-speed, low-cost hardware implementation for disparity estimation is proposed. We adopted the novel disparity fusion method in our architecture, which can significantly reduce the number of calculations in the overall process. A refinement method is also designed to reduce the error rate of the resulting depth map and improve the tolerance to light noise. The proposed algorithm was implemented with the Kintex-7 field-programmable gate array. Its performance was tested by using the Middlebury-Version 2 and -Version 3 datasets. The proposed algorithm provides an operating speed of 118 fps with an error rate of only 6.36%. Compared with other state-of-the-art designs used for similar applications, the proposed method can achieve a 34.6% reduction in the error rate while providing the highest speed with competitive hardware cost.
- Open Access
- 3 March 2021
- Published by Springer Nature in npj Quantum Information
- Vol. 7 (1) , 1-12
Practical verification protocols for analog quantum simulators
Analog quantum simulation is expected to be a significant application of near-term quantum devices. Verification of these devices without comparison to known simulation results will be an important task as the system size grows beyond the regime that can be simulated classically. We introduce a set of experimentally-motivated verification protocols for analog quantum simulators, discussing their sensitivity to a variety of error sources and their scalability to larger system sizes. We demonstrate these protocols experimentally using a two-qubit trapped-ion analog quantum simulator and numerically using models of up to five qubits.
- 3 March 2021
- Published by Springer Nature in npj Quantum Information
- Vol. 7 (1) , 1-12
Open AccessPractical verification protocols for analog quantum simulators
Analog quantum simulation is expected to be a significant application of near-term quantum devices. Verification of these devices without comparison to known simulation results will be an important task as the system size grows beyond the regime that can be simulated classically. We introduce a set of experimentally-motivated verification protocols for analog quantum simulators, discussing their sensitivity to a variety of error sources and their scalability to larger system sizes. We demonstrate these protocols experimentally using a two-qubit trapped-ion analog quantum simulator and numerically using models of up to five qubits.
- 14 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 68 (4) , 1493-1506
A High-Performance Bidirectional Architecture for the Quasi-Comparison-Free Sorting Algorithm
This paper proposes a high-performance bidirectional architecture for the quasi-comparison-free sorting algorithm. Our architecture improves the performance of the conventional unidirectional architecture by reducing the total number of sorting cycles via bidirectional sorting along with two auxiliary methods. Bidirectional sorting allows the sorting tasks to be conducted concurrently in the high- and low-index parts of our architecture. The first auxiliary method is boundary finding, which shortens the range for index searching by finding the boundaries of the range. The second auxiliary method is queue storing, which stores each useful index in a queue in advance to reduce the number of miss cycles during index searching. The performance of our architecture highly depends on the distribution of input data. For each set of input data to be sorted, five Gaussian distributions of the input data and four standard derivations for each distribution were adopted in our experiments. The results show that at the expense of some additional area cost, the number of sorting cycles and the energy consumption are significantly reduced by our method.
- 14 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 68 (4) , 1493-1506
A High-Performance Bidirectional Architecture for the Quasi-Comparison-Free Sorting Algorithm
This paper proposes a high-performance bidirectional architecture for the quasi-comparison-free sorting algorithm. Our architecture improves the performance of the conventional unidirectional architecture by reducing the total number of sorting cycles via bidirectional sorting along with two auxiliary methods. Bidirectional sorting allows the sorting tasks to be conducted concurrently in the high- and low-index parts of our architecture. The first auxiliary method is boundary finding, which shortens the range for index searching by finding the boundaries of the range. The second auxiliary method is queue storing, which stores each useful index in a queue in advance to reduce the number of miss cycles during index searching. The performance of our architecture highly depends on the distribution of input data. For each set of input data to be sorted, five Gaussian distributions of the input data and four standard derivations for each distribution were adopted in our experiments. The results show that at the expense of some additional area cost, the number of sorting cycles and the energy consumption are significantly reduced by our method.
- 25 September 2020
- Published by Wiley in Journal of the Chinese Chemical Society
- Vol. 67 (11) , 2149-2152
Comments on some chemical properties of diphenyl disulfide and its derivatives: II.Correlating the studies of reductive cleavage of disulfide bonds with the studies of anti‐human immunodeficiency virus activity with lowest unoccupied molecular orbital properties
- 25 September 2020
- Published by Wiley in Journal of the Chinese Chemical Society
- Vol. 67 (11) , 2149-2152
Comments on some chemical properties of diphenyl disulfide and its derivatives: II.Correlating the studies of reductive cleavage of disulfide bonds with the studies of anti‐human immunodeficiency virus activity with lowest unoccupied molecular orbital properties
- Open Access
- 18 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 173977-173988
VLSI Implementation for an Adaptive Haze Removal Method
In the real-time outdoor application of computer vision-based systems, haze removal, a pre-processing technique that can recover clear images from foggy ones, is necessary for object detection. There-fore, in this paper, an efficient haze removal method suitable for hardware design is proposed to obtain high quality fog-free images. Based on the atmosphere scattering model and the dark channel prior method, the atmospheric light of the whole image and the transmission map could be extracted. These are important and necessary parameters of the recovery model. Instead of using single global atmospheric light to restore foggy image, a local atmospheric light estimation method is applied in the proposed design to achieve optimal results. To ensure that the overall image is consistent without block artifacts, dynamic adjustment of local atmospheric light is made based on global atmospheric light. Additionally, to obtain a transmission map, a refined estimation method is performed to ease the halo effect. In terms of both quantitative and qualitative evaluations, the simulation results indicate that the proposed design exhibits superior performance without color oversaturation and distortion. To meet the requirements of real-time applications, a six-stage very-large-scale integration (VLSI) architecture for the proposed algorithm is implemented by using TSMC 0.13-um technology. The synthesis results show that the design yields a processing rate of approximately 200 Mpix-els/s, which is rapid enough to facilitate Full HD resolution at 30 fps in real time.
- 18 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 173977-173988
Open AccessVLSI Implementation for an Adaptive Haze Removal Method
In the real-time outdoor application of computer vision-based systems, haze removal, a pre-processing technique that can recover clear images from foggy ones, is necessary for object detection. There-fore, in this paper, an efficient haze removal method suitable for hardware design is proposed to obtain high quality fog-free images. Based on the atmosphere scattering model and the dark channel prior method, the atmospheric light of the whole image and the transmission map could be extracted. These are important and necessary parameters of the recovery model. Instead of using single global atmospheric light to restore foggy image, a local atmospheric light estimation method is applied in the proposed design to achieve optimal results. To ensure that the overall image is consistent without block artifacts, dynamic adjustment of local atmospheric light is made based on global atmospheric light. Additionally, to obtain a transmission map, a refined estimation method is performed to ease the halo effect. In terms of both quantitative and qualitative evaluations, the simulation results indicate that the proposed design exhibits superior performance without color oversaturation and distortion. To meet the requirements of real-time applications, a six-stage very-large-scale integration (VLSI) architecture for the proposed algorithm is implemented by using TSMC 0.13-um technology. The synthesis results show that the design yields a processing rate of approximately 200 Mpix-els/s, which is rapid enough to facilitate Full HD resolution at 30 fps in real time.
- Open Access
- 17 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 150623-150629
A Low-Cost Design of 2D Median Filter
- 17 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 150623-150629
Open AccessA Low-Cost Design of 2D Median Filter
- 20 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 67 (7) , 1329-1333
A Novel Comparison-Free 1-D Median Filter
This brief presents a novel high-speed low-cost comparison-free, 1D bit-level median filter. The filter can be customized by cascading different median units. The most prominent point is that a pre-set value is used during the process, and the partial median can be easily identified by observing the MSB. Therefore, the median can be obtained without any comparators. With this feature, the area cost drops significantly while the operating speed remains the same. The results show that when synthesized using TSMC 90nm CMOS process technology, our design can achieve 2000MHz, and the area cost is reduced by 15.72% as compared to a state-of-the-art design [13].
- 20 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 67 (7) , 1329-1333
A Novel Comparison-Free 1-D Median Filter
This brief presents a novel high-speed low-cost comparison-free, 1D bit-level median filter. The filter can be customized by cascading different median units. The most prominent point is that a pre-set value is used during the process, and the partial median can be easily identified by observing the MSB. Therefore, the median can be obtained without any comparators. With this feature, the area cost drops significantly while the operating speed remains the same. The results show that when synthesized using TSMC 90nm CMOS process technology, our design can achieve 2000MHz, and the area cost is reduced by 15.72% as compared to a state-of-the-art design [13].
- 11 July 2019
- Published by Springer Nature
- p. 95-105
Deep Residual Neural Network Design for Super-Resolution Imaging
- 11 July 2019
- Published by Springer Nature
- p. 95-105
Deep Residual Neural Network Design for Super-Resolution Imaging
- 7 December 2010
- Published by American Chemical Society (ACS) in Inorganic Chemistry
- Vol. 50 (1) , 365-377
Ditopic Complexation of Selenite Anions or Calcium Cations by Pirenoxine: An Implication for Anti-Cataractogenesis
This study investigated whether and how pirenoxine (PRX) interacts with selenite or calcium ions, as these two ions have been proven respectively a factor leading to the formation of lens cataract. UV, NMR, and isothermal titration calorimetry (ITC) analysis indicated that PRX could bind maximum up to six selenite anions and the binding site preference was concentration dependent with the peripheral binding first followed by the π−π interactions with the aromatic moiety; while for calcium cation interaction the 3-carboxylate and β-ketoimine functional groups were responsible for chelating calcium ions. The results obtained by MP2/6-31+G(d) molecular orbital calculations provided theoretical evidence in support of the π−π interactions between selenite and the PRX aromatic framework, and further analysis of the binding energies with the aromatic moiety indicates that these interactions take place most likely at the benzoquinone (ring I) π-system. The calcium binding preferences with PRX were also determined based on the stabilization energy obtained by B3LYP/6-31+G(d) calculations, showing the binding preferences were site 2 > site 1 > site 3 > ring II, consistent with the experimental data. The in vitro study of the reduction of selenite or calcium ions-induced lens turbidity by PRX with ditopic recognition properties was thus demonstrated. These results may provide a rationale for using PRX as an anti-cataract agent and warrant further biological studies.
- 7 December 2010
- Published by American Chemical Society (ACS) in Inorganic Chemistry
- Vol. 50 (1) , 365-377
Ditopic Complexation of Selenite Anions or Calcium Cations by Pirenoxine: An Implication for Anti-Cataractogenesis
This study investigated whether and how pirenoxine (PRX) interacts with selenite or calcium ions, as these two ions have been proven respectively a factor leading to the formation of lens cataract. UV, NMR, and isothermal titration calorimetry (ITC) analysis indicated that PRX could bind maximum up to six selenite anions and the binding site preference was concentration dependent with the peripheral binding first followed by the π−π interactions with the aromatic moiety; while for calcium cation interaction the 3-carboxylate and β-ketoimine functional groups were responsible for chelating calcium ions. The results obtained by MP2/6-31+G(d) molecular orbital calculations provided theoretical evidence in support of the π−π interactions between selenite and the PRX aromatic framework, and further analysis of the binding energies with the aromatic moiety indicates that these interactions take place most likely at the benzoquinone (ring I) π-system. The calcium binding preferences with PRX were also determined based on the stabilization energy obtained by B3LYP/6-31+G(d) calculations, showing the binding preferences were site 2 > site 1 > site 3 > ring II, consistent with the experimental data. The in vitro study of the reduction of selenite or calcium ions-induced lens turbidity by PRX with ditopic recognition properties was thus demonstrated. These results may provide a rationale for using PRX as an anti-cataract agent and warrant further biological studies.