Scribd
Upload
68 views

Fibonacci Code For Cross Talk Avoidance

low power fibonacci code for crosstalk avoidance. by using fibonacci we prevent the crosstalk in system on chip(soc)design.

Uploaded by

Rajendra Prasad
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
68 views

Fibonacci Code For Cross Talk Avoidance

low power fibonacci code for crosstalk avoidance. by using fibonacci we prevent the crosstalk in system on chip(soc)design.

Uploaded by

Rajendra Prasad
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1
Aburact—Propagation delay across long on-chip buses is signifcant when adjacent wires are tansioning in opposte direction (he. crustal transitions) as compared fo transitioning inthe same direction. By ex- PloltingFibonaccl number syste, we proposes family of Fibonacdl coding techniques for erossalk avoidance, relate them to some of the existing crosstalk avoidance techniques, and show how the encoding logle of one {echnique can be modiied to generate codewords of theater technique. Index Terms—On-ehip bus, vost, Fibonacel coding. 1. Ixrropucrios Inthe deep submicrometer CMOS process technolog ect resistance, length, and inter-wire capacitance are increasing sig- nificantly, which contribute to large on-chip interconnect propagation delay [1] 2]. Data transmitted over interconnect determine the props- gation delay and the delay is very significant when adjacent wires are transitioning in oppesite directions (Le. erosstalk transitions) as com- pared to transitioning in the same direction, Several techniques have been proposed in literature to eliminate crosstalk transitions, A simple technigue to eliminate crosstalk tansi- tions is to inser a shield wire between every air of adjacent wires [3]. As there is no activity on shield wires, the shielding (SHD) technique completely eliminates crosstalk transitions. ‘Abstracted from the concept of shielding, forbidden transition coding (FTC) technique with/without memory is proposed in [4]. For 32-bit data, both memory-based and memory-less PTC techniques ‘require 40 and 46 wires, respectively, as compared to 63 wires required by the SHD technique. Note tht the memory-based FTC technique is very complex as compared to the memory-less PTC technique Forbidden pattern coding (FPC) technique [5] prohibits 010 and 101 patterns from codewords, which in um eliminates crosstalk: transitions i requires $2 wires fora 32-bit bus. No adjacent transition (NAT) coding is proposed in (6) (nbeA)-NAT codes, where 7 is the dataword width, 1 is the codeword width, and / is the maximum number of 1s allowed in codewords, are designed in such a way that no two adjacent Is are present in codewords. NAT codes are transmitted using the transition signaling technique (7]. For n-bit codewords, the maximum number of (nyt) (-¢Clurt 11.1), C1 § |n/2), (6) Whea ? — “(1/2 the cardinality of the (n.0,#)-NAT codeword set is fy. where fs the mth Fibonacei number. By relating Fibonaeci number system to erosstalk-fre codes, we proposed a crosstalk-ree bus encoding technique [8] and provided a Fecursve procedure to generate such codes. Crosstall-fre codes gen- crated in [8] are same as tht of the memory-less FTC technique 4 By combining the ideas of [4], [5]. (8, efficient codec desig for crosstalk avoidance are proposed in [9 [10], In forbidden transition free crosstalk avoidance eoding (PTF-CAC) [9], data are encoded using Fibonacci number system in such a way that O1 or 10 on two adjacent Manuscript rcsved June 13, 2010; revised November 19, 2010, May 30 2011; aceeped July 04, 2011. Date of publication August O4, 2011; dat of tuten ersion Jy 19, 2012, 'M. Muyam is wih tbe Department of Computer Science and Enginserng, Indian Tasuite of Techaology Madras, Chena 600036, Tadis (-m ‘mad @ eset... Digital Object eater 10.1109/TVLSL201 12162010,

You might also like