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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chun-Yeh Liu

dblp:57/872 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none

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

Systems, architecture and hardware · 3 · 2 first-author

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 · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › high-level synthesis › folding
bipartite folding
0.011993
An efficient algorithm for bipartite PLA folding · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation
logic synthesis
0.011993
An efficient algorithm for bipartite PLA folding · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation
physical design
0.011993
An efficient algorithm for bipartite PLA folding · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation › logic synthesis › logic optimization
PLA folding
0.011993
An efficient algorithm for bipartite PLA folding · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation › logic synthesis
programmable logic array
0.021993
BIST-PLA: A Built-in Self-Test Design of Large Programmable Logic Arrays · DAC 1987
An efficient algorithm for bipartite PLA folding · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation › hardware verification and test › design for testability
built-in self-test
0.011987
BIST-PLA: A Built-in Self-Test Design of Large Programmable Logic Arrays · DAC 1987
Electronic design automation
hardware test
0.011987
BIST-PLA: A Built-in Self-Test Design of Large Programmable Logic Arrays · DAC 1987

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

matrix representation · 0.0heuristic search · 0.0
YearPublicationVenuePosition
1995 An optimized testable architecture for finite state machines
abstract
This paper presents a testable architecture for FSM synthesis. The transfer, synchronizing and distinguishing sequences are obtained simultaneously by adding extra edges, if necessary, and their associated inputs and outputs to the original FSM. The algorithm that achieves this minimizes the number of extra edges that make a machine testable. The testable machine has the following properties: (1) transfer sequences of length at most [log/sub 2/n] where n is the number of the states in the machine, to carry the machine from state S/sub i/ to state S/sub j/ for all i and j, (2) a synchronizing sequence of length at most [log/sub 2/n] which sets the machine to a specific state S1, and (3) a distinguishing sequence of length at most [log/sub 2/n]. The states can be observed at the output. Several synthesis benchmark circuits were investigated for area by using the architecture.
Ting-Yu Kuo, Chun-Yeh Liu, Kewal K. Saluja
VTS2
1993 An efficient algorithm for bipartite PLA folding
abstract
Programmable logic arrays (PLAs) provide a flexible and efficient way of synthesizing arbitrary combinational functions as well as sequential logic circuits. They are used in both LSI and VLSI technologies. The disadvantage of using PLAs is that most PLAs are very sparse. The high sparsity of the PLA results in a significant waste of silicon area. PLA folding is a technique which reclaims unused area in the original PLA. This paper proposes a column bipartite folding algorithm based on matrix representation. Heuristics are used to reduce the search space and to speed up the search processes. The algorithm has been implemented in C programming language on a SUN-4 workstation. The program was used to study several large PLAs of varying sizes. The experimental results show that in most cases the proposed algorithm finds optimal solution in a reasonable CPU time.>
Chun-Yeh Liu, Kewal K. Saluja
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1987 BIST-PLA: A Built-in Self-Test Design of Large Programmable Logic Arrays
abstract
A new method for designing a Built-In Self-Test Programmable Logic Array (BIST-PLA) is presented. In the proposed design, the Test Pattern Generator and the Response Evaluator circuits are very simple. The design requires a re-arrangement of the AND (OR) planes on the basis of number of crosspoints in the product (output) lines in the PLA.
Chun-Yeh Liu, Kewal K. Saluja, Shambhu J. Upadhyaya
DAC1