Open Access Journal

ISSN : 2394 - 6849 (Online)

International Journal of Engineering Research in Electronics and Communication Engineering(IJERECE)

Monthly Journal for Electronics and Communication Engineering

Open Access Journal

International Journal of Engineering Research in Electronics and Communication Engineering(IJERECE)

Monthly Journal for Electronics and Communication Engineering

ISSN : 2394-6849 (Online)

Optimization of Clock Power in Full Chip Clock Distribution

Author : Akshata Mathad 1 Namita Palecha 2 Arpit a. Gandhi 3

Date of Publication :24th May 2018

Abstract: Major Component which decides the performance of the digital circuit is Clock, which is a multi-fanout signal. If the clock frequency is high, so the performance. In this paper techniques to reduce clock network length are discussed. Clock nets are first migrated from higher technology node to lower technology node and then modified to achieve less dynamic capacitance by reducing the length of clock net. Here, clock network of Full Chip is studied and identified the corner cases by using a Perimeter as an objective function where clock network could be optimized. Minimum Length Routing is done using Intel Custom Tools, which ultimately reduced the capacitance of the clock network. Clock network is optimized using two techniques; 1. Trunk router and 2. Netcell Estimation router. Experimental results show that 20.91% and 6.01% reduction in clock net length by using Trunk and Netcell Estimation routers respectively

Reference :

    1. E. G. Friedman, "Clock distribution networks in synchronous digital integrated circuits," in Proceedings of the IEEE, vol. 89, no. 5, pp. 665 692, May2001.
    2. Q. Zhu and W. W. M. Dai, "Perfect-balance planar clock routing with minimal path-length," 1992 IEEE/ACM International Conference on Computer-Aided Design, Santa Clara, CA, USA, 1992, pp. 473-476.
    3. A. Vittal and M. Marek-Sadowska, "Low-power buffered clock tree design," in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 16, no. 9, pp. 965-975, Sept. 1997.
    4. A routing algorithm of clock distribution circuit of high frequency," ASIC, 2003. Proceedings. 5th International Conference on, 2003, pp. 369-372 Vol.1.
    5. Ting-Hai Chao and Yu-Chin Hsu, "A clock net routing algorithm for high performance VLSI," [1992] Proceedings The European Conference on Design Automation, Brussels, 1992, pp. 343-347.
    6. J. de Vincente, J. Lanchares and R. Hermida, "RSR: a new rectilinear Steiner minimum tree approximation for FPGA placement and global routing," Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204), Vasteras, 1998, pp. 192-195 vol.1.
    7. Wulong Liu, G. Chen, Yu Wang and Huazhong Yang, "Modeling and optimization of low power resonant clock mesh," The 20th Asia and South Pacific Design Automation Conference, Chiba, 2015, pp. 478-483.
    8. C. Deng, Y. Cai and Q. Zhou, "A register clustering algorithm for low power clock tree synthesis," 2014 IEEE International Symposium on Circuits and Systems (ISCAS), Melbourne VIC, 2014, pp. 389-392.
    9. Y. Kim and T. Kim, "Algorithm for synthesis and exploration of clock spines," 2017 22nd Asia and South Pacific Design Automation Conference (ASP-DAC), Chiba, 2017, pp. 263-268.
    10. R. S. Shelar, "A Fast and Near-Optimal Clustering Algorithm for Low-Power Clock Tree Synthesis," in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 31, no. 11, pp. 1781-1786, Nov. 2012.

Recent Article