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.

Haluk Konuk

dblp:85/3321 · DBLP profile ↗
← Back
17ranked-venue papers
13as first author
0since 2021 · last 2015
—ORCID · none

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

Systems, architecture and hardware · 17 · 13 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
6 papers
Electronic design automation · 98% Integrated circuit design · 2%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
hardware verification and test
0.352015
Design for low test pattern counts · DAC 2015
Voltage- and current-based fault simulation for interconnect open defects · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1999
Oscillation and sequential behavior caused by opens in the routing in digital CMOS circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1998
Electronic design automation › hardware verification and test
test compaction
0.212015
Design for low test pattern counts · DAC 2015
Electronic design automation › hardware verification and test
fault simulation
0.141999
Voltage- and current-based fault simulation for interconnect open defects · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1999
Oscillation and sequential behavior caused by opens in the routing in digital CMOS circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1998
Charge-based fault simulation for CMOS network breaks · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Electronic design automation › hardware verification and test
design for testability
0.112015
Design for low test pattern counts · DAC 2015
Electronic design automation › hardware verification and test
fault modeling
0.011998
Oscillation and sequential behavior caused by opens in the routing in digital CMOS circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1998
Integrated circuit design › digital circuit design › CMOS circuit design
digital CMOS circuits
0.021998
Oscillation and sequential behavior caused by opens in the routing in digital CMOS circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1998
Charge-based fault simulation for CMOS network breaks · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Electronic design automation › hardware verification and test
test generation
0.011999
Voltage- and current-based fault simulation for interconnect open defects · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1999
Electronic design automation
high-level synthesis
0.011990
A Linear Program Driven Scheduling and Allocation Method Followed by an Interconnect Optimization Algorithm · DAC 1990
Electronic design automation › physical design
interconnect optimization
0.011990
A Linear Program Driven Scheduling and Allocation Method Followed by an Interconnect Optimization Algorithm · DAC 1990
Electronic design automation › high-level synthesis
scheduling and allocation
0.011990
A Linear Program Driven Scheduling and Allocation Method Followed by an Interconnect Optimization Algorithm · DAC 1990
Integrated circuit design › digital circuit design
CMOS circuit design
0.011995
Accurate and Efficient Fault Simulation of Realistic CMOS Network Breaks · DAC 1995

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

transistor charge equations · 0.0logic simulation · 0.0SPICE characterization · 0.0experimental chip measurement · 0.0transistor charge model · 0.0lookup table · 0.0charge-based simulation · 0.0tree search · 0.0linear programming · 0.0
YearPublicationVenuePosition
2015 Design for low test pattern counts
abstract
This paper presents a new method to design digital circuits for low pattern counts, one of the key factors shaping cost-effective VLSI test schemes. The method identifies the largest conflicts between internal signals that prevent efficient test compaction in ATPG. These locations are modified by inserting conflict-reducing test points (CRTP) to significantly reduce the ATPG-produced pattern counts. Experimental results obtained for large industrial designs with on-chip test compression demonstrate, on average, 3x -- 4x reduction in stuck-at and transition patterns and 3x shorter ATPG times.
Haluk Konuk, Elham K. Moghaddam, Nilanjan Mukherjee 0001, Janusz Rajski, Deepak Solanki, Jerzy Tyszer, Justyna Zawada
DAC1
2013 Innovative practices session 6C: Latest practices in test compression
abstract
Test compression has become a requirement for many designs to meet the required test quality levels in reasonable test times and with acceptable test cost. This session will cover some of the tradeoffs and options available from the broad spectrum of test compression solutions. The first talk will address the difficulty when testing large numbers of logic blocks and processor cores of maintaining high test quality without a requisite increase in test cost stemming from the need to allocate substantially more pins for digital test. Simply adding more chip-level pins for testing conflicts with packaging constraints and can potentially undermine other cost-saving techniques that rely on utilizing fewer pins such as multi-site testing. What is needed instead is a DFT strategy optimized for complex SOC designs that use multicore processors-a strategy in which the architecture and automation elements work in tandem to lower test cost without compromising test quality or significantly increasing automatic test pattern generation (ATPG) runtime. This presentation highlights an optimized DFT architecture, referred to as “shared I/O” of DFTMAX, a synthesis-based test solution that has been used successfully in multicore processor designs as well as complex SOC designs. Using this approach, they were able to reduce scan test pins significantly with similar or even less ATPG patterns, without compromising test coverage, and achieve over 2X reduction in wafer level scan test time. The second talk will present many DFT techniques to reduce test time and improve coverage in the context of core wrapping. Some of these methods include using external scan chains with separate compression logic inside each place-and-route block instead of having ‘chip-top’ scan compression logic for all external scan chains from different place-and-route. In addition, some tradeoffs of using dynamic launch-on-shift/launch-on-capture (LOS/LOC) instead of static will be covered. Some other methods will be covered for preventing decompressor logic from feeding X'es during launch-on-shift test patterns and the benefits of control test-points to reduce ATPG vector counts. The final presentation will cover various methodologies for reducing the test data volume on different chips. Some work to achieve a higher compression ratio in the future will also be discussed. As with any good engineering solution, there are some constraints and tradeoffs that also need to be considered with those choices.
Jonathon E. Colburn, Kun Young Chung, Haluk Konuk
VTS3
2009 Defect Detection Differences between Launch-Off-Shift and Launch-Off-Capture in Sense-Amplifier-Based Flip-Flop Testing
abstract
About half of the logic circuit transistors of a modern integrated circuit design reside inside the scan flip-flops. Even though prior work analyzed detection of defects in traditional master-slave flip-flop circuits, to the best of our knowledge, this work is the first one regarding detection of defects in a sense-amplifier-based flip-flop, which is a preferred design style in some high-speed low-power designs. In this work, we uncover a class of resistive open and resistive short defects in such a flip-flop design, which show a great difference in their detection response to launch-off-shift versus launch-off-capture due to their sensitivity to clock-gating and data input transitions.
Haluk Konuk
VTS1
2009 DFT and Test Problems from the Trenches
Haluk Konuk
VTS1
2003 DFFT : Design For Functional Testability
abstract
Creating functional tests that work on an ATE has always been a significant challenge [I]. This paper identifies the fundamental mechanisms for functional test failures of an SOC on an ATE. Taking these mechanisms into account during the design process of a chip can substantially reduce the efforts needed to make functional tests work. We call this process design for functional testability (DFFT).
Haluk Konuk, Leon Xiao
ITC1
2002 Validation and Test of Network Processors and ASICs
abstract
Rapid growth in the internet and enterprise network traffic, need by both subscribers and operators to provide for differentiated services, and the constant evolution of wireline and wireless networking functions, algorithms and standards, is leading to a high demand for ultra high speed, yet programmable, network processors and ASICs. This session will introduce the design of network processors, and highlight important validation and test challenges associated with network processors and ASICs. The first speaker in this session will review the architecture of a typical OC-192 network processor – a highly complex system-on-chip, consisting of multiple processors, specialized hardware blocks, multiple high-speed embedded memory units, and a highly concurrent and complex on-chip interconnect structure. The talk will analyze the validation and manufacturing test problems of hardware-software GHz network processor chips, which have to use aggressive architecture designs and nano-meter technologies to obtain the required multi-GHz speed, while relying on the presence of multiple processors to provide the necessary flexibility. The second talk will address testing of embedded GHz network processors. In particular, it will describe the challenges faced in testing a specific high-speed low-power network processor chip, which includes two custom-design 64-bit MIPS processors, 0.5MB of L2 cache, and multiple high speed communication blocks, such as gigabit-ethernet, hypertransport, and double-data-rate memory controllers. Some test solutions will be presented, and major test challenges that need to be addressed will be listed. The third talk in this session will address the problem of delay testing in communications chips. In communication devices such as network switches and routers, there usually are multiple unrelated clocks controlling various interfaces and logic. These multiple clock domains presents unique challenges in production testing since it becomes very difficult to predict when the expected output will show up at the pin boundary. The talk will show why delay defects need to be addressed, and how to deal with cycle uncertainty problem during production testing. It will present a novel compaction technique used to deal with the test data volume explosion resulting from including of delay defect screening tests. Proceedings of the 20 th IEEE VLSI Test Symposium (VTS’02) 1093-0167/02 $17.00 © 2002 IEEE
C.-H. Chia, Sujit Dey, Faraydon Karim, Haluk Konuk, Keesup Kim
VTS4
2000 On invalidation mechanisms for non-robust delay tests
abstract
In most of the delay fault testing literature there is a widespread belief that a non-robust test for a path delay fault can be invalidated only through the existence of another path delay fault. In this paper the author presents an analysis of conditions that can invalidate a non-robust test, and gives four different invalidation mechanisms. Three of these mechanisms, in addition to pulse dampening, do not require the existence of another path delay fault in a circuit. He also defines pseudo-VNR tests, and shows that this is the most common interpretation of validatable-non-robust tests in the literature. Uncovering the invalidation mechanisms for non-robust tests is quite important given the fact that a large number of paths in a circuit usually do not have any robust tests.
Haluk Konuk
ITC1
1999 Voltage- and current-based fault simulation for interconnect open defects
abstract
This paper describes a highly accurate and efficient fault simulator for interconnect opens in combinational or full-scan digital CMOS circuits. The analog behavior of the wires with interconnect opens is modeled very efficiently in the vicinity of the defect in order to predict what logic levels the fanout gates will interpret and whether a sufficient IDDQ current will be flowing inside the fanout gates. The fault simulation method is based on characterizing the standard cell library with SPICE, using transistor charge equations for the site of the open, using logic simulation for the rest of the circuit, taking four different factors that can affect the voltage of an open into account, and considering the potential oscillation and sequential behavior of interconnect opens. The tool can simulate test vectors for both voltage and current measurements. Simulation results of ISCAS85 layouts using stuck-at and IDDQ test sets are presented.
Haluk Konuk
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1998 Oscillation and sequential behavior caused by opens in the routing in digital CMOS circuits
abstract
Shorts and opens are the most common types of catastrophic defects in today's CMOS ICs. In this paper, we show that an open in the interconnect wiring of a digital CMOS circuit, which permanently disconnects inputs of logic gates from their driver, can cause oscillation or sequential behavior. We present supporting experimental data collected by creating an interconnect open in a manufactured chip. We also show that the conditions for oscillation and sequential behavior are likely to occur in many interconnect opens.
Haluk Konuk, F. Joel Ferguson
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1997 Fault simulation of interconnect opens in digital CMOS circuits
abstract
We describe a highly accurate but efficient fault simulator for interconnect opens, based on characterizing the standard cell library with SPICE; using transistor charge equations for the site of the open; using logic simulation for the rest of the circuit; taking four different factors, that can affect the voltage of an open, into account; and considering the oscillation and sequential behaviour potential of opens. A novel test technique based on controlling the die surface voltage is also described. We present simulation results of ISCAS85 layouts using stuck-at and IDDQ test sets.
Haluk Konuk
ICCAD1
1997 Oscillation and Sequential Behavior Caused by Interconnect Opens in Digital CMOS Circuits
abstract
Shorts and opens are the most common types of defects in today's CMOS ICs. In this paper we show for the first time that an open in the interconnect wiring of a digital CMOS circuit can cause oscillation or sequential behavior. We also analyze and compare the factors affecting the probabilities for an interconnect open and a feedback bridging fault to oscillate or display sequential behavior.
Haluk Konuk, F. Joel Ferguson
ITC1
1996 An unexpected factor in testing for CMOS opens: the die surface
abstract
We present the experimental evidence, for the first time, that the die surface can act as an RC interconnect, becoming an important factor in determining the voltage of a floating wire created by a CMOS open. We present a circuit model for this effect verified with HSPICE simulations. A detailed analysis of potential mechanisms behind this phenomenon is provided. We also present our measurement results for the trapped charge deposited on floating gates during fabrication.
Haluk Konuk, F. Joel Ferguson
VTS1
1996 Charge-based fault simulation for CMOS network breaks
abstract
We define a network break as a break fault in the p-network or in the n-network of a CMOS cell that breaks one or more transistor paths between the cell output and V/sub dd/ or GND. Previous work, mostly in the context of transistor stuck-open faults, studied test invalidation due to transient paths to V/sub dd/ or GND, and due to charge sharing. In this paper we show the importance of Miller feedthrough and feedback capacitances in network break test invalidation, which was ignored by previous work. We present a new fault simulation algorithm for network breaks, with the following novelties: First, the electrical charge coming from Miller and p-n junction capacitances is computed using a transistor charge model; this automatically handles the nonlinear nature of transistor capacitances accurately, as opposed to assuming constant capacitance values as was done in previous work. Next, we use only six voltage levels for charge computations, which allows us to create look-up tables that dramatically reduce the computation time. Finally, the maximum voltage an internal node in an n-network can acquire is about three-fourths of the V/sub dd/ voltage (instead of V/sub dd/ as assumed by previous work), and similarly, a p-network node cannot discharge all the way down to the GND voltage. Using our simulator to analyze test sets for the ISCAS'85 circuits, we found that the charge coming from Miller capacitances has a larger share in test invalidation than the charge from p-n junction capacitances. Our simulator spends less time for charge computations than it spends for transient path identification.
Haluk Konuk, F. Joel Ferguson, Tracy Larrabee
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1995 Accurate and Efficient Fault Simulation of Realistic CMOS Network Breaks
abstract
We present a new fault simulation algorithm for realistic break faults in the p-networks and n-networks of static CMOS cells. We show that Miller effects can invalidate a test just as charge sharing can, and we present a new charge-based approach that efficiently and accurately predicts the worst case effects of Miller capacitances and charge sharing together. Results on running our fault simulator on ISCAS85 benchmark circuits are provided. 1 INTRODUCTION Defects that occur during the IC manufacturing process can be categorized into three classes according to Hawkins et al. [7]. These classes are bridge, open circuit, and parametric defects. Open circuit defects cause breaks in the conducting materials in the layout, and contacts are particularly susceptible to such breaks. Breaks can be divided into two categories: those that physically disconnect one or more transistor gates from their drivers, and those that disconnect transistors from each other in the p-network or n-network of ...
Haluk Konuk, F. Joel Ferguson, Tracy Larrabee
DAC1
1994 Fastpath: A Path-Delay Test Generator for Standard Scan Designs
abstract
Fastpath generates non-robust, robust or single-path-sensitization hazard-free robust path-delay tests for standard scan designs including high-impedance elements and functionally-described blocks. Results show effective and memory-efficient operation.
Bill Underwood, Wai-On Law, Haluk Konuk
ITC4
1993 Explorations of sequential ATPG using Boolean satisfiability
abstract
Presents a sequential test generation method based on Boolean satisfiability. The method produces near-minimal test sizes. The authors discuss the flexibility provided by Boolean satisfiability to extend the fault model to realistic faults. Experimental results using ISCAS-89 benchmark circuits and comparisons with previously published results are presented.>
Haluk Konuk, Tracy Larrabee
VTS1
1990 A Linear Program Driven Scheduling and Allocation Method Followed by an Interconnect Optimization Algorithm
abstract
A new method for high level synthesis is reported whose basic feature is the tight interaction and coupling of the scheduling and allocation phases providing a global direction to synthesis. A linear program based allocation is proposed which uses multifunction ALU cost estimation, and iteratively drives a tree search for scheduling. A major contribution of this paper is a new interconnect optimization algorithm which is based on several interconnect transformations for multiplexer input collapsing and merging. Several other important synthesis aspects are included, e.g. register and interconnect bindings, operation chaining and operation multicycling. The method has been implemented in C on a Sun 3/60,
Christos A. Papachristou, Haluk Konuk
DAC2