mcaduser
Newbie level 5
Is there a way in Cadence Encounter to iteratively optimize for the smallest dimensions that would perform the Place-and-Route without congestion?
I want to determine the smallest feasible area for the core and one way to do this is to manually try a certain floorplan dimension and if it works (no violations), then reduce the floorplan dimension and try again. Is there an automated way to do this? If not, please confirm whether this is the standard methodology for finding minimum area with Cadence Encounter.
I am using Synopsys Design Compiler for the synthesis.
thanks!
I want to determine the smallest feasible area for the core and one way to do this is to manually try a certain floorplan dimension and if it works (no violations), then reduce the floorplan dimension and try again. Is there an automated way to do this? If not, please confirm whether this is the standard methodology for finding minimum area with Cadence Encounter.
I am using Synopsys Design Compiler for the synthesis.
thanks!
