Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

An algebraic expression to count the number of chips on a wafer

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ferris-Prabhu, A.V. ; IBM, Essex Junction, VT, USA

Most chip-counting algorithms use the Pythagorean theorem; in effect, a grid of chips is superimposed over the wafer, and the radial distance from the center of the water to the outermost vertex of each potential chip site is computed. Only those chips are counted for which this radial distance is less than the effective radius of the wafer. To minimize edge-related chip loss, chip fabrication is usually restricted to the area of the wafer that lies within a containment circle of a radius 1-2 mm than the actual wafer radius. A simple and reasonably accurate algebraic expression is presented that explicitly relates the number of chips per wafer to the wafer diameter and to the geometric parameters that characterize the chip, i.e. the edge-length, the kerf plus pad cage dimension and the aspect ratio. The expression is applied to determining the size of chip for which the product of chips per wafer and circuits per chip is maximized for a given wafer diameter.<>

Published in:

Circuits and Devices Magazine, IEEE  (Volume:5 ,  Issue: 1 )