{"id":29697,"date":"1999-01-02T16:38:03","date_gmt":"1999-01-02T16:38:03","guid":{"rendered":"https:\/\/silvaco.com\/uncategorized\/new-built-in-dichotomic-search-algorithm-in-smartspice\/"},"modified":"2021-07-08T18:47:00","modified_gmt":"2021-07-09T01:47:00","slug":"new-built-in-dichotomic-search-algorithm-in-smartspice","status":"publish","type":"post","link":"https:\/\/silvaco.com\/ja\/simulation-standard\/new-built-in-dichotomic-search-algorithm-in-smartspice\/","title":{"rendered":"New Built-in Dichotomic Search Algorithm in Smartspice"},"content":{"rendered":"
\n

New Built-in Dichotomic Search Algorithm in Smartspice<\/h1>\n

Introduction<\/p>\n

General purpose dichotomic search method is often requested by designers when they want to find a specific element (voltage, current, parameter value …) in an already sorted set. For example, a typical problem that makes extensive use of this kind of algorithm is the computation of setup and hold time for cell characterization. This problem was already discussed in two articles [1] and [2] and a solution was proposed with the use of the\u00a0SmartSpice<\/b><\/i>\u00a0Script Language and .MODIF statement.<\/span><\/p>\n

Continuing on the same kind of example, this article describes a new approach now available in Smartspice which offers significant improvement in terms of speed. The syntax used in the input deck is very close to the one of the optimizer. Therefore the complexity of the parser was absolutely not increased. Of course the powerful .MEASURE statement is also used in conjunction for the definition of the criterions that will lead the dichotomic search.<\/span><\/p>\n<\/div><\/section><\/div>

<\/div>