Generation of Efficient Codes for Realizing Boolean Functions in Nanotechnologies

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 5 Figures

Scientific paper

We address the challenge of implementing reliable computation of Boolean functions in future nanocircuit fabrics. Such fabrics are projected to have very high defect rates. We overcome this limitation by using a combination of cheap but unreliable nanodevices and reliable but expensive CMOS devices. In our approach, defect tolerance is achieved through a novel coding of Boolean functions; specifically, we exploit the dont cares of Boolean functions encountered in multi-level Boolean logic networks for constructing better codes. We show that compared to direct application of existing coding techniques, the coding overhead in terms of extra bits can be reduced, on average by 23%, and savings can go up to 34%. We demonstrate that by incorporating efficient coding techniques more than a 40% average yield improvement is possible in case of 1% and 0.1% defect rates. With 0.1% defect density, the savings can be up to 90%.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Generation of Efficient Codes for Realizing Boolean Functions in Nanotechnologies does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generation of Efficient Codes for Realizing Boolean Functions in Nanotechnologies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generation of Efficient Codes for Realizing Boolean Functions in Nanotechnologies will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-168171

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.