Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Tsung-Yi Wu

dblp:57/6905 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
2since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 6 · 4 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Electronic design automation · 84% Hardware reliability and fault tolerance · 16%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › high-level synthesis
register minimization
0.021996
Register minimization beyond sharing among variables · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Register Minimization beyond Sharing among Variables · DAC 1995
Electronic design automation
high-level synthesis
0.021996
Register minimization beyond sharing among variables · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Register Minimization beyond Sharing among Variables · DAC 1995
Hardware reliability and fault tolerance › reliability analysis
lifetime analysis
0.011996
Register minimization beyond sharing among variables · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Electronic design automation › high-level synthesis › resource binding
register allocation
0.011996
Register minimization beyond sharing among variables · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Electronic design automation
logic synthesis
0.011995
Register Minimization beyond Sharing among Variables · DAC 1995
Electronic design automation › high-level synthesis › behavioral transformation
behavioral synthesis
0.011995
Register Minimization beyond Sharing among Variables · DAC 1995

Methods — techniques the papers use, named apart from their topics

variable substitution · 0.0unclocked sequential network · 0.0state register holding · 0.0state register sharing · 0.0lifetime analysis · 0.0
YearPublicationVenuePosition
2023 Live Demonstration: A Low-Power Dual-Core Motion Estimation Chip Design and Validation for a Wireless Panoramic Endoscopy
abstract
A low-power motion estimation chip is designed for a wireless panoramic endoscope system. This chip consists of two motion estimation cores and is implemented by a dual-Vdd low-power technique. The proposed technique is efficient in decreasing power consumption without reducing the operation frequency of the chip. From the full-function chip measurements, this dual-Vdd chip can reduce power consumption by 20%~40% than the operation in single-Vdd for different clock frequencies.
Jian-Lin Zeng, Tsung-Yi Wu, Don-Gey Liu, Ching-Hwa Cheng
ISCAS2
2023 A Low-Power Dual-Core Motion Estimation Chip Design and Validation for a Wireless Panoramic Endoscopy
abstract
A low-power motion estimation chip is designed for a wireless panoramic endoscope system. This chip consists of two motion estimation cores and is implemented by a dual-Vdd low-power technique. The proposed technique is efficient in decreasing power consumption without reducing the operation frequency of the chip. From the full-function chip measurements, this dual-Vdd chip can reduce power consumption by 20%∼40% than the operation in single-Vdd at different clock frequencies.
Jian-Lin Zeng, Tsung-Yi Wu, Don-Gey Liu, Ching-Hwa Cheng
ISCAS2
2010 Combined use of rising and falling edge triggered clocks for peak current reduction in IP-based SoC designs
abstract
In a typical synchronous SoC design, a huge peak current often occurs near the time of an active clock edge because of aggregate switching of a large number of transistors. The number of aggregate switching transistors can be lessened if the SoC design can use a clock scheme of mixed rising and falling triggering edges rather than one of pure rising (falling) triggering edges. In this paper, we propose a clock-triggering-edge assignment technique and algorithms that can assign either a rising triggering edge or a falling triggering edge to each clock of each IP core or block of a given IP-based SoC design. The goal of the algorithms is to reduce the peak current of the design. Experimental results show that our algorithms can reduce peak currents up to 56.3%.
Tsung-Yi Wu, Tzi-Wei Kao, Shi-Yi Huang, Tai-Lun Li, How-Rern Lin
ASP-DAC1
2007 A Fast Probability-Based Algorithm for Leakage Current Reduction Considering Controller Cost
abstract
Because the leakage current of a digital circuit depends on the states of its logic gates, assigning a minimum leakage vector (MLV) to the primary inputs and the flip-flops' output pins of the circuit that operates in the sleep mode is a feasible technique for leakage current reduction. In this paper, we propose a novel probability-based algorithm and technique that can rapidly find an MLV. Unlike most traditional techniques that ignore the leakage current overhead of the newborn MLV controller, our technique can take this overhead into account. Ignoring this overhead during solution exploration may bring a side effect that is misrecognizing a non-optimum solution as an optimum one. Experimental results show that our algorithm can reduce the leakage current up to 48% and can find the optimum solutions on 22 out of 26 small MCNC benchmark circuits.
Tsung-Yi Wu, Jr-Luen Tzeng, Kuang-Yao Chen
ASP-DAC1
1996 Register minimization beyond sharing among variables
abstract
Traditionally, it is assumed that every variable in the input HDL (hardware description language) behavioral description needs to be held in a register; a register can be shared by multiple variables if they have mutually disjointed lifetime intervals. This approach has been shown effective for signal-flow-like computations such as various DSP algorithms. However, the same is not true for the synthesis of control-dominated circuits, which usually have variables of different bit-width as well as very long lifetime. To go beyond register minimization by lifetime-analysis-based sharing, we propose holding some variables in the state registers, some signal nets, some unclocked sequential networks or a combination of above. We identify the conditions in which the substitution is feasible. We have implemented the proposed method in a software program called VReg. Experimental results have demonstrated that VReg minimizes the number of registers more effectively than the lifetime-analysis-based approach does. Better register area minimization also generally leads to faster designs.
Tsung-Yi Wu, Youn-Long Lin
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1995 Register Minimization beyond Sharing among Variables
abstract
Traditionally, it is assumed that every variable in the input HDL (Hardware Description Language) behavioral description needs to be held in a register; A register can be shared by m ultiple variables if they have m utually disjoint lifetime intervals.This approach is eective for signal-ow-like computations such a s v arious DSP algorithms.However, it is not the best for the synthesis of control-dominated circuits, which usually have v ariables/signals of dierent bit-width as well as very long lifetime.To g o b ey ond register minimization by lifetime-analysis-based sharing, we propose holding some variables in the state registers, some signal nets, or some unclocked sequential networks.We h a v e implemented the proposed method in a software program called VReg.Experimental results have demonstrated that VReg minimizes the number of registers more eectively than the lifetime-analysis-based approach does.Better register minimization also leads to both smaller area and faster designs.
Tsung-Yi Wu, Youn-Long Lin
DAC1