Print  |  Send  |   

A Novel Approach to Catch Boundary Optimization Using Logic Equivalence Checking

February 23, 2011 // A. Srivastava ,S. Belwal, Freescale India // 0 comments

A Novel Approach to Catch Boundary Optimization Using Logic Equivalence Checking Download White Paper 157Ko

Boundary optimization is a technique used while logic synthesis for proper area, timing and power optimization. Boundary optimization may result in about 5-10% of standard cell area reduction and 2-5% of timing improvement. While synthesizing a design, a synthesis engineer has to decide the list modules which should be boundary optimized and which should not. Wrong boundary optimization may require setup changes for already up tool environment or sometimes re-synthesis with proper boundary optimization constraints. The proposed flow netlist corruption can be caught much before in design flow and SoC design cycle time can be reduced by ensuring of proper netlist quality.


All White Papers


Submit a white paper

Follow us

Fast, Accurate & Relevant for Design Engineers only!

Technical papers     

Linear video channel

READER OFFER

Read more

This month Ambiq Micro is giving away five of its 'Apollo EVB' evaluation boards, worth 9 each for EETimes Europe’s readers to assess the capabilities of their cutting-edge Apollo sub-threshold microcontroller.

The new suite of Apollo MCUs is based on the 32-bit ARM Cortex-M4 floating point microcontroller and redefines 'low power' with energy consumption that is typically five to ten times lower than that of MCUs of comparable performance (thanks to Ambiq’s patented Subthreshold Power Optimized Technology platform).


MORE INFO AND LAST MONTH' WINNERS...

Design centers     

Automotive
Infotainment Making HDTV in the car reliable and secure

December 15, 2011 | Texas instruments | 222901974

Unique Ser/Des technology supports encrypted video and audio content with full duplex bi-directional control channel over a single wire interface.

 

You must be logged in to view this page

Login here :