Shao-Lun HuangChi-An WuKai-Fu TangChang-Hong HsuCHUNG-YANG HUANG2018-09-102018-09-102011-01https://www.scopus.com/inward/record.uri?eid=2-s2.0-79952923016&doi=10.1109%2fASPDAC.2011.5722218&partnerID=40&md5=9e76e207f16389ac663d217cf5035232ECO re-mapping is a key step in functional ECO tools. It implements a given patch function on a layout database with a limited spare cell resource. Previous ECO re-mapping algorithms are based on existing technology mappers. However, these mappers are not designed to consider the resource limitation and thus the corresponding ECO results are generally not good enough, or even become much worse when the spare cells are sparse. In this paper, we proposed a new solution for ECO remapping. It includes a robust resource-constraint-aware technology mapper and a fast incremental router for wire-length optimization. Moreover, we adopt a Pseudo-Boolean solver to search feasible solutions when the spare cells are sparse. Our experimental results show that our ECO engine can outperform the previous tool in both runtime and routing costs. We also demonstrate the robustness of our tool by performing ECOs on various spare cell limitations. ©2011 IEEE.ECO; Spare cell; Technology mappingECO; Feasible solution; Incremental routers; New solutions; Pseudo-Boolean; Remapping; Resource limitations; Routing optimization; Runtimes; Spare cell; Technology mapping; Wire length; Computer aided design; Conformal mapping; Optimization; Technologyconference paper10.1109/ASPDAC.2011.57222182-s2.0-79952923016