Chung-Kuan Cheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chung-Kuan Cheng has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Haikun Zhu
CSE Dept., Univ. of California San Diego, 9500 Gilman Drive, La Jolla, CA 92093-0404. Tel: 1-858-534-8174, Fax: 1-858-534-7029
5 shared publications Alina Deutsch
IBM T.J. Watson Research Center, Yorktown Heights, NY 10598
2 shared publicationsGeorge Katopis
IBM Enterprise System Group, Poughkeepsie, NY 12601
2 shared publications- Rui Shi
CSE Dept., UCSD, La Jolla, CA 92093-0404, USA
2 shared publications - Yi Zhu
Department of Computer Science and Engineering, University of California, San Diego, CA 92093-0404, USA
2 shared publications - David Money Harris
Department of Engineering, Harvey Mudd College, Claremont, CA 91711, USA
1 shared publication
Latest Publications
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 155-158
Predicting and Optimizing Jitter and Eye-Opening Based on Bitonic Step Response
As electronic system design evolves to the era of chip-packaging co-design, signal quality prediction and optimization are becoming important for system level interconnects. In this paper, an analytical method for predicting the worst-case jitter and eye-opening based on an arbitrary bitonic step response is proposed. Experimental results show that the proposed technique is able to achieve as small as less than 5% error compared to Hspice simulation. The analytical method is then utilized for fast optimization of a novel distributive passive compensation scheme.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 155-158
Predicting and Optimizing Jitter and Eye-Opening Based on Bitonic Step Response
As electronic system design evolves to the era of chip-packaging co-design, signal quality prediction and optimization are becoming important for system level interconnects. In this paper, an analytical method for predicting the worst-case jitter and eye-opening based on an arbitrary bitonic step response is proposed. Experimental results show that the proposed technique is able to achieve as small as less than 5% error compared to Hspice simulation. The analytical method is then utilized for fast optimization of a novel distributive passive compensation scheme.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02714302,p. 2706-2709
Fast Transient Simulation of Lossy Transmission Lines
In this paper, an efficient approach is proposed for the problem of transient simulation of lossy transmission lines. The complexity of the conventional convolution approach for lossy transmission lines is reduced from O(N 2 ) to O(Nlog 2 N) by utilizing a multilevel FFT convolution method, where N is the total number of time points. Numerical convolution formula that exploits both the analytical forms of the lossy transmission line impulse responses and adaptive time steps are developed for the multilevel FFT convolution method. A new breakpoint control scheme is also proposed to adaptively control simulation time step. Experimental results show that the proposed approach is over 100 times faster than Berkeley SPICE3 (Quarles, et al, 1993) while remains the same accuracy.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02714302,p. 2706-2709
Fast Transient Simulation of Lossy Transmission Lines
In this paper, an efficient approach is proposed for the problem of transient simulation of lossy transmission lines. The complexity of the conventional convolution approach for lossy transmission lines is reduced from O(N 2 ) to O(Nlog 2 N) by utilizing a multilevel FFT convolution method, where N is the total number of time points. Numerical convolution formula that exploits both the analytical forms of the lossy transmission line impulse responses and adaptive time steps are developed for the multilevel FFT convolution method. A new breakpoint control scheme is also proposed to adaptively control simulation time step. Experimental results show that the proposed approach is over 100 times faster than Berkeley SPICE3 (Quarles, et al, 1993) while remains the same accuracy.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21536961,p. 616-621
An Interconnect-Centric Approach to Cyclic Shifter Design Using Fanout Splitting and Cell Order Optimization
We propose two orthogonal approaches to logarithmic cyclic shifter design. The first method, called fanout splitting, replaces multiplexers in a conventional design with demultiplexers which have two fanouts driving the shifting and non-shifting paths separately. The use of demultiplexers has a two-fold effect; it cuts the accumulated wire load on the critical path from O(Nlog2(N)) to O(N), and reduces the switching probabilities on the inter-stage long wires from 1/4 to 3/16. We then perform cell order optimization to further improve the delay, and formulate it as an integer linear programming problem. For the 64-bit case, the two approaches together reduce the total delay by 67.1% and dynamic power consumption by 17.6%, respectively.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21536961,p. 616-621
An Interconnect-Centric Approach to Cyclic Shifter Design Using Fanout Splitting and Cell Order Optimization
We propose two orthogonal approaches to logarithmic cyclic shifter design. The first method, called fanout splitting, replaces multiplexers in a conventional design with demultiplexers which have two fanouts driving the shifting and non-shifting paths separately. The use of demultiplexers has a two-fold effect; it cuts the accumulated wire load on the critical path from O(Nlog2(N)) to O(N), and reduces the switching probabilities on the inter-stage long wires from 1/4 to 3/16. We then perform cell order optimization to further improve the delay, and formulate it as an integer linear programming problem. For the 64-bit case, the two approaches together reduce the total delay by 67.1% and dynamic power consumption by 17.6%, respectively.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4863 (21536961) , 609-615
Optimum Prefix Adders in a Comprehensive Area, Timing and Power Design Space
Parallel prefix adder is the most flexible and widely-used binary adder for ASIC designs. Many high-level synthesis techniques have been developed to find optimal prefix structures for specific applications. However, the gap between these techniques and back-end designs is increasingly large. In this paper, we propose an integer linear programming method to build minimal-power prefix adders within given timing and area constraints. It counts both gate and wire capacitances in the timing and power models, considers static and dynamic power consumptions, and can handle gate sizing and buffer insertion to improve the performance further. The proposed method is also adaptive for non-uniform arrival time and required time on each bit position. Therefore our method produces the optimum prefix adder for realistic constraints.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4863 (21536961) , 609-615
Optimum Prefix Adders in a Comprehensive Area, Timing and Power Design Space
Parallel prefix adder is the most flexible and widely-used binary adder for ASIC designs. Many high-level synthesis techniques have been developed to find optimal prefix structures for specific applications. However, the gap between these techniques and back-end designs is increasingly large. In this paper, we propose an integer linear programming method to build minimal-power prefix adders within given timing and area constraints. It counts both gate and wire capacitances in the timing and power models, considers static and dynamic power consumptions, and can handle gate sizing and buffer insertion to improve the performance further. The proposed method is also adaptive for non-uniform arrival time and required time on each bit position. Therefore our method produces the optimum prefix adder for realistic constraints.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 684-689
Approaching Speed-of-light Distortionless Communication for On-chip Interconnect
We extend the surfliner on-chip distortionless transmission line scheme and provide more details for the implementation issues. Surfliner seeks to approach distortionless transmission by intentionally adding shunt resistors between the signal line and the ground. In theory if we distributively make the shunt conductance G=RC/L, there is no distortion at the receiver end and the signal propagates at the speed of light. We show the feasibility and advantages of this shunt resistor scheme by a real design case of single-ended microstrip line in 0.10mum technology. The simulation results indicate we can achieve near perfect signaling of 10 Gbps data over a 10 mm serial link, yet no pre-emphasis/equalization or other special techniques are needed. Guidelines for determining the optimal value and spacing of the shunt resistors are also provided.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 684-689
Approaching Speed-of-light Distortionless Communication for On-chip Interconnect
We extend the surfliner on-chip distortionless transmission line scheme and provide more details for the implementation issues. Surfliner seeks to approach distortionless transmission by intentionally adding shunt resistors between the signal line and the ground. In theory if we distributively make the shunt conductance G=RC/L, there is no distortion at the receiver end and the signal propagates at the speed of light. We show the feasibility and advantages of this shunt resistor scheme by a real design case of single-ended microstrip line in 0.10mum technology. The simulation results indicate we can achieve near perfect signaling of 10 Gbps data over a 10 mm serial link, yet no pre-emphasis/equalization or other special techniques are needed. Guidelines for determining the optimal value and spacing of the shunt resistors are also provided.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21654107,p. 175-178
Distortion Minimization for Packaging Level Interconnects
We propose a novel high-speed serial signaling scheme that minimizes the distortion for multichip module (MCM) packaging level communication by intentionally adding leakage resistors between the signal trace and the ground. The new scheme is inspired by the theory of distortionless transmission line which states that if R/G = L/C, there will be no distortion at the receiver end and the signal propagates at the speed of light. The simulation results indicate that, using the shunt resistor scheme, 10+ Gbps bit rate is achievable over a 10 cm single-ended stripline without pre-emphasis or equalization
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21654107,p. 175-178
Distortion Minimization for Packaging Level Interconnects
We propose a novel high-speed serial signaling scheme that minimizes the distortion for multichip module (MCM) packaging level communication by intentionally adding leakage resistors between the signal trace and the ground. The new scheme is inspired by the theory of distortionless transmission line which states that if R/G = L/C, there will be no distortion at the receiver end and the signal propagates at the speed of light. The simulation results indicate that, using the shunt resistor scheme, 10+ Gbps bit rate is achievable over a 10 cm single-ended stripline without pre-emphasis or equalization
- Open Access
- 20 November 1998
- Published by Wiley in VLSI Design
- Vol. 10 (1) , 71-86
Empirical Study of Block Placement by Cluster Refinement
In this paper we propose an efficient cluster refinement approach for macro‐cell placement. The algorithm selects a cluster of blocks dynamically, and finds an optimal solution for all the blocks in the cluster simultaneously. This is different from previous zone refinement approach which optimizes the allocation of one single block in each operation. Experimental results on the MCNC benchmark circuits show that the approach achieves excellent area utilization while minimizing the wire length at the same time.
- 20 November 1998
- Published by Wiley in VLSI Design
- Vol. 10 (1) , 71-86
Open AccessEmpirical Study of Block Placement by Cluster Refinement
In this paper we propose an efficient cluster refinement approach for macro‐cell placement. The algorithm selects a cluster of blocks dynamically, and finds an optimal solution for all the blocks in the cluster simultaneously. This is different from previous zone refinement approach which optimizes the allocation of one single block in each operation. Experimental results on the MCNC benchmark circuits show that the approach achieves excellent area utilization while minimizing the wire length at the same time.