Home Optimal oversampling ratio in two-step simulation
Article
Licensed
Unlicensed Requires Authentication

Optimal oversampling ratio in two-step simulation

  • Srinath R. Naidu EMAIL logo and Gopalakrishnan Venkiteswaran
Published/Copyright: August 3, 2024

Abstract

This paper analyses a novel two-step Monte Carlo simulation algorithm to estimate the weighted volume of a polytope of the form A z T . The essential idea is to partition the columns of A into two categories – a lightweight category and a heavyweight category. Simulation is done in a two-step manner where, for every sample of the lightweight category variables we use multiple samples of the heavyweight category variables. Thus, the heavyweight category variables are oversampled with respect to the lightweight category variables and increasing samples of the heavyweight variables at the expense of the lightweight variables will lead to a more efficient Monte Carlo method. In this paper we present a fast heuristic approximate for estimating the optimal oversampling ratio and substantiate with experimental results which confirm the effectiveness of the method.

MSC 2020: 65C05; 65C50; 65C60

References

[1] J. Cohen, Two algorithms for determining volumes of convex polyhedra, J. Assoc. Comput. Mach. 26 (1979), 401–414. 10.1145/322139.322141Search in Google Scholar

[2] M. Dyer, A. Frieze and R. Kannan, A random polynomial-time algorithm for approximate the volume of convex bodies, J. ACM 38 (1991), 1–17. 10.1145/102782.102783Search in Google Scholar

[3] J. M. Hammersley and D. C. Handscomb, General principles of Monte-Carlo method, Monte-Carlo Methods, Monogr. Appl. Probab. Statist., Springer, Dordrecht (1964), 50–75. 10.1007/978-94-009-5819-7_5Search in Google Scholar

[4] J. A. G. Jess, K. Kalafala, S. R. Naidu, R. H. J. M. Otten and C. Visweswariah, Statistical timing for parametric yield prediction of digital integrated circuits, IEEE Trans. Comput.-Aided Des. Integrated Circuits 25 (2006), 2376–2392. 10.1109/TCAD.2006.881332Search in Google Scholar

[5] L. Khachiyan, The problem of computing the volume of polytopes is NP-hard, Upsekhi Mat. Nauk 44 (1989), 199–200. 10.1070/RM1989v044n03ABEH002136Search in Google Scholar

[6] L. Khachiyan, Complexity of polytope volume computation, New Trends in Discrete and Computational Geometry, Springer, Berlin (1993), 91–101. 10.1007/978-3-642-58043-7_5Search in Google Scholar

[7] S. R. Naidu, Speeding up Monte-Carlo simulation for statistical timing analysis for digital integrated circuits, 20th International Conference on VLSI Design held Jointly with 6th International Conference on Embedded Systems, IEEE Press, Piscataway (2007), 265–270. 10.1109/VLSID.2007.147Search in Google Scholar

[8] K. Sita and S. R. Naidu, Variation-aware parameter based analog yield optimization methods, Analog Integrated Circuits Signal Process. 99 (2019), 123–132. 10.1007/s10470-018-1319-xSearch in Google Scholar

Received: 2023-12-12
Revised: 2024-04-18
Accepted: 2024-07-16
Published Online: 2024-08-03
Published in Print: 2024-09-01

© 2024 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 11.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/mcma-2024-2011/html
Scroll to top button