Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 404))

  • 774 Accesses

Abstract

Intellectual properties (IPs) in design form are integrated for incremental design of system-on-chip (SoC). In order to realize proper functionality of an SoC, some global signal nets are often needed to be connected between the design IPs. If the component IPs are in-house, the global nets may be routed through the routing region of the design IPs and this routing may be formulated as an adaptive incremental routing problem where all the routing issues need to be tackled directly in the detailed routing phase only. In this work, we propose a technique for adaptive incremental routing of global nets with the objectives of minimal increase in wire length, congestion, and number of vias. The first objective maintains the desired frequency, the second and the third ones reduce the power overhead, and specifically the third one is effective in keeping the layout manufacture-friendly. The proposed technique is applied on some ISCAS’85 benchmarks and finally on a crypto SoC design which integrates several component designs for crypto-cores. The results on CPU time for routing and the overhead of routing are encouraging.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kahng, A.B., Robins, G.: A new class of Steiner tree heuristics with good performance: the iterated 1-Steiner approach. In: Proceedings of the International Conference on Computer-Aided Design (1990)

    Google Scholar 

  2. Bozorgzadeh, E., Kastner, R., Sarrafzadeh, M.: Creating and exploiting flexibility in rectilinear Steiner trees. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(5), 605–615 (2003)

    Article  Google Scholar 

  3. Chu, C., Wong, Y.-C.: FLUTE: fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(1), 70–83 (2008)

    Article  Google Scholar 

  4. Dourado, M.C., De Oliveira, R.A., Protti, F.: Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals. Electron. Notes Discret. Math. 35, 323–328 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Samanta, T., Ghosal, P., Rahaman, H., Dasgupta, P.S.: A method for the multi-net multi-pin routing problem with layer assignment. In: Proceedings of the International Conference on VLSI Design, pp. 387–392 (2009)

    Google Scholar 

  6. Ghosal, P., Rahaman, H., Das, S., Das, A., Dasgupta, P.S.: Obstacle aware routing in 3D integrated circuits. In: Proceedings of the Advanced Computing, Networking and Security, LNCS, vol. 7135, pp. 451–460 (2012)

    Google Scholar 

  7. Roy, J.A., Markov, I.L.: High performance routing at the nanometer scale. In: Proceedings of the International Conference on Computer-Aided Design, pp. 496–502 (2007)

    Google Scholar 

  8. Lee, T.-H., Wang, T.-C.: Congestion-constrained layer assignment for via minimization in global routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(9), 1643–1656 (2008)

    Article  Google Scholar 

  9. Xu, J., Hong, X., Jing, T., Yang, Y.: Obstacle-avoiding rectilinear minimum-delay Steiner tree construction toward IP-block-based SOC design. IEEE Trans. Circuits Syst. II: Express Briefs 53(4), 309–313 (2006)

    Article  Google Scholar 

  10. Edwards, K., Griffiths, S., Kennedy, W.S.: Partial Interval Set Cover—Trade-Offs Between Scalability and Optimality, Approximation, Randomization and Combinatorial Optimization Algorithms and Techniques, LNCS, vol. 8096, pp. 110–125 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Debasri Saha .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Saha, D. (2016). Adaptive Multilayer Routing for Incremental Design of an SoC. In: Das, S., Pal, T., Kar, S., Satapathy, S., Mandal, J. (eds) Proceedings of the 4th International Conference on Frontiers in Intelligent Computing: Theory and Applications (FICTA) 2015. Advances in Intelligent Systems and Computing, vol 404. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2695-6_56

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2695-6_56

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2693-2

  • Online ISBN: 978-81-322-2695-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics