DATA ENCODING TECHNIQUE FOR REDUCING ENERGY CONSUMPTION – Noc
1K.Gurava Reddy
M.tech Student (VLSID), Department of ECE, SHREE Institute Of Technical Education, Tirupathi.
2T.Muni Reddy
Assistant Professor, Department of ECE, SHREE Institute Of Technical Education, Tirupathi.
Abstract— As technology shrinks, the power dissipated by the links of a network-on-chip (NoC) starts to compete with the power dissipated by the other elements of the communication subsystem, namely, the routers and the network interfaces (NIs). In this paper, we present a set of data encoding schemes aimed at reducing the power dissipated by the links of an NoC. The proposed schemes are general and transparent with respect to the underlying NoC fabric (i.e., their application does not require any modification of the routers and link architecture). Experiments carried out on both synthetic and real traffic scenarios show the effectiveness of the proposed schemes, which allow to save up to 51% of power dissipation and 14% of energy consumption without any significant performance degradation and with less than 15% area overhead in the NI.
Index Terms—Coupling switching activity, data encoding, interconnection on chip, low power, network-on-chip (NoC), power analysis.
I. INTRODUCTION
Moving From a silicon innovation hub to the following one outcome in quicker and more power proficient entryways yet slower and more power hungry wires [1]. Actually, more than half of the aggregate element force is scattered in interconnects in current processors, and this is required to ascend to 65%–80% throughout the following quite a while [2].
Worldwide interconnect length does not scale with littler transistors and nearby wires. Chip size remains moderately consistent in light of the fact that the chip capacity keeps on expanding and RC postponement increments exponentially. At 32/28 nm, for case, the RC delay in a 1-mm worldwide wire at the base pitch is 25× higher than the natural postponement of a two- data NAND fan-out of 5 [1].
On the off chance that the crude reckoning drive is by all accounts boundless, because of the capacity of instancing more centers in solitary silicon bite the dust, versatility issues, because of the need of
making effective and solid correspondence between the expanding numbers of centers, turn into the genuine issue [3]. The system on-chip (NoC) outline ideal model [4] is perceived as the most feasible approach to handle with versatility and variability issues that portray the ultra profound sub-micron meter period. These days, the on-chip correspondence issues are as important as, and now and again more applicable than, the computation related issues [4]. Truth be told, the correspondence subsystem progressively affects the conventional configuration targets, including expense (i.e., silicon territory), execution, power scattering, vitality utilization, unwavering quality, and so on. As innovation therapists, a constantly critical part of the aggregate force spending plan of a complex numerous center framework on-chip (SoC) is because of the correspondence subsystem. In this paper, we concentrate on strategies went for decreasing the force disseminated by the system joins.
Truth be told, the force scattered by the system connections is as pertinent as that dispersed by switches and system interfaces (NIs) and their commitment is relied upon to increment as innovation scales [5]. Specifically, we display an arrangement of information encoding plans working at dance level and on an end-to-end premise, which permits us to minimize both the exchanging movement and the coupling exchanging action on connections of the steering ways crossed by the bundles. The proposed encoding plans, which are straightforward as for the switch execution, are exhibited and talked about at both the algorithmic level and the building level, and evaluated by method for reenactment on manufactured and genuine movement situations. The examination considers a few angles and measurements of the outline, including silicon territory, power dispersal, and vitality utilization. The outcomes demonstrate that by utilizing the proposed encoding plans up to 51% of force and up to 14% of vitality can be spared with no huge corruption in execution and with 15% range the rest of this paper is organized as follows.
We briefly discuss related works in Section I, while Section II presents an overview of the Existing schemes. The proposed data encoding schemes along with possible hardware implementations and their analysis are described in Section III. In Section IV, the results for the hardware overhead, power and energy savings, and performance reduction of the proposed data encoding schemes are compared with those of other approaches. Finally, this paper is concluded in Section VI.
II. EXISTING SYSTEM
In the following quite a while, the accessibility of chips with 1000 centers is predicted [6]. In these chips, a huge portion of the aggregate framework force spending plan is disseminated by interconnection systems. Along these lines, the outline of force productive interconnection systems has been the center of numerous works distributed in the writing managing NoC architectures. These works focus on diverse parts of the interconnection systems, for example, switches, NIs, and connections.
Since the center of this paper is on diminishing the force disseminated by the connections, in this segment, we quickly survey a percentage of the works in the zone of connection force lessening.
These incorporate the systems that make utilization of protecting expanding line-to-line dividing and repeater insertion.
This classification of encoding is not suitable to be connected in the profound sub-micron meter innovation hubs where the coupling capacitance constitutes a noteworthy piece of the aggregate interconnect capacitance. This causes the force utilization because of the coupling changing action to turn into a vast part of the aggregate connection power utilization, making the previously stated methods, which overlook such commitments, wasteful [23]. The works in the second classification focus on lessening force scattering through the diminishment of the coupling exchanging. Among these plans], the exchanging movement is lessened utilizing numerous additional control lines. For instance, the information transport width develops from 32 to 55 in [24]. The strategies proposed in [29]
and [30] have a littler number of control lines however the multifaceted nature of their interpreting rationale is high. The strategy depicted in [29] is as per the following: in the first place, the information are both odd modified and even transformed, and afterward transmission is performed utilizing the sort of reversal which decreases more the exchanging movement. In [30], the coupling exchanging movement is diminished up to 39%. In this paper,
contrasted with [30], we utilize a less complex decoder while accomplishing a higher action diminishment. Give us a chance to now talk about in more detail the works with which we analyze our proposed plans. In [12], the quantity of moves from 0 to 1 for two back to back bounces (the dance that simply navigated and the particular case that speaks the truth to cross the connection) is checked. In the event that the number is bigger than a large portion of the connection width, the reversal will be performed to diminish the quantity of 0 to 1 moves when the dance is exchanged by means of the connection. This method is just worried about the self-exchanging without stressing the coupling exchanging. Note that the coupling capacitance in the state-of–the- craftsmanship silicon innovation is significantly bigger (e.g., four times) contrasted and the self- capacitance, and subsequently, ought to be considered in any plan proposed for the connection power d
III PROPOSED SYSTEM
The essential thought of the proposed methodology is encoding the flutters before they are infused into the system with the objective of minimizing the self- exchanging action and the coupling exchanging movement in the connections crossed by the bounces.
Actually, self-exchanging action and coupling exchanging movement are in charge of connection force dissemination. In this paper, we allude to the end-to-end plan.
This end-to-end encoding strategy exploits the pipeline way of the wormhole exchanging procedure. Note that since the same grouping of dances goes through every one of the connections of the steering way, the encoding choice taken at the NI may give the same force sparing to every one of the connections. For the proposed plan, an encoder and a decoder square are added to the NI. Aside from the header dance, the encoder encodes the active bounces of the bundle such that the force scattered by the between switch point-to-point connection is minimized.
A. Encoding Schemes
In this segment, we exhibit the proposed encoding plan whose objective is to decrease power dispersal by minimizing the coupling move exercises on the connections of the interconnection system.
Give us a chance to first portray the force demonstrate that contains diverse segments of force dissemination of a connection. The dynamic force disseminated by the interconnects and drivers is P = [T0→1 (Cs + Cl ) + TcCc] V2 ddFck ……..(1)
Where T0→1 is the quantity of 0 → 1 moves in the transport in two back to back transmissions, Tc is the quantity of related exchanging between physically neighboring lines, Cs is the line to substrate capacitance, Cl is the heap capacitance, Cc is the coupling capacitance, Vdd is the supply voltage, and Fck is the clock recurrence.
One can order four sorts of coupling moves as portrayed in [26]. A Type I move happens when one of the lines switches when alternate stays unaltered.
In a Type II move, one line changes from low to high while alternate makes move from high to low. A Type III move relates to the situation where both lines switch all the while. At last, in a Type IV move both lines don't change. The powerful changed capacitance fluctuates from sort to sort, and subsequently, the coupling move action, Tc, is a weighted aggregate of distinctive sorts of coupling move commitments.
Tc = K1T1 + K2T2 + K3T3 + K4T4 ………..(2)
where Ti is the normal number of Type i move and Ki is its relating weight. As indicated by [26], we utilize K1 = 1, K2 = 2, and K3 = K4 = 0.
The event likelihood of Types I and II for an irregular arrangement of information is 1/2 and 1/8, separately.
This prompts a higher worth for K1T 1 contrasted and K2T 2 proposing that minimizing the quantity of Type I move may prompt an extensive force diminishment. Utilizing (2), one may express (1) as
P = [T0→1 (Cs + Cl ) + (T1 + 2T2) Cc] V 2ddFck.
……(3)
According to [3], Cl can be neglected
P ∝ T0→1Cs + (T1 + 2T2)Cc……….. (4)
Here, we figure the event likelihood for distinctive sorts of moves. Consider that dance (t − 1) and dance (t) allude to the past dance which was exchanged by means of the connection and the dance which speaks the truth to go through the connection, separately. We consider just two contiguous bits of the physical channel.
Sixteen unique blends of these four bits could happen (Table I). Note that the first bit is the estimation of the nonexclusive ith line of the connection, while the second bit speaks to the estimation of its (i +1)th line.
The quantity of moves for Types I, II, III, and IV are 8, 2, 2, and 4, individually.
For an irregular arrangement of information, each of these sixteen moves has the same likelihood.
In this way, the event likelihood for Types I, II, III, and IV are 1/2, 1/8, 1/8, and 1/4, individually. In
whatever remains of this segment, we show three information encoding plans intended for decreasing the dynamic force dissemination of the system joins alongside a conceivable equipment execution of the decode
1. Scheme I
In plan I, we concentrate on decreasing the quantities of Type I moves (by changing over them to Types III and IV moves) and Type II moves (by changing over them to Type I move). The plan contrasts the present information and the past one to choose whether odd reversal or no reversal of the present information can prompt the connection power lessening.
i. Power Model
If the flit is odd inverted before being transmitted, the dynamic power on the link is
P‟ ∝ T „ 0→1 + (K1T „1 + K2T „2 + K3T „3 + K4T’
4)Cc………. (5)
where T '0→1, T'1, T' 2, T' 3, and T'4, are the self- move action, and the coupling move action of Types I, II, III, and IV, separately. Table I reports, for every move, the relationship between the coupling move exercises of the flutter when transmitted as is and when its bits are odd upset. Information is composed as takes after.
The main bit is the estimation of the non specific ith line of the connection, though the second bit speaks to the estimation of its (i + 1)th line. For every allotment, the first (second) line speaks to the qualities at time t − 1 (t). As Table I indicates, if the bounce is odd modified, Types II, III, and IV moves believer to Type I moves. On account of Type I moves, the reversal prompts one of Types II, III, or Type IV moves. Specifically, the moves demonstrate T ∗ 1 , T ∗∗ 1 , and T ∗∗∗
1 in the table convert to Types II, III, and IV transitions, respectively. Also, we have
T _ 0→1 = T0→0(odd) + T0→1(even) where odd/even refers to odd/even lines. Therefore,
(5) can be expressed as
P ∝ (T0→0(odd) + T0→1(even))Cs
+ [K1 (T2+T3+T4)+K2T ∗∗∗ 1 +K3T ∗ 1 +K4T ∗∗ 1 ]Cc………….(6)
Thus, if P > P_, it is convenient to odd invert the flit before transmission to reduce the link power dissipation. Using (4) and (6) and noting that Cc/Cs = 4 [26], we obtain the
Following odd invert condition
1/ 4 T0→1 + T1 + 2T2 > 1 4 _T0→0(odd) + T0→1(even)_ +T2 + T3 + T4 + 2T 1∗∗∗ .
Fig 1 Circuit diagram Encoder architecture scheme I.
Fig.2 Internal view of the encoder block (E).
Also, since T0→1 = T0→1(odd) + T0→1(even), one may write
1/4 T0→1(odd) + T1 + 2T2 > 1/ 4 T0→0(odd) + T2 + T3 +T4 + 2T1 ∗∗∗ ……… (7)
which is the precise condition to be utilized to choose whether the odd reverse must be performed. Since the terms T0→1(odd) and T0→0(odd) are weighted with an element of 1/4, for connection widths more prominent than 16 bits, the mis expectation of the transform condition won't surpass 1.2% by and large [23]. Subsequently, we can rough the definite condition
T1 + 2T2 > T2 + T3 + T4 + 2T ∗∗∗ 1 ………. (8)
Obviously, the utilization of the approximated odd alter condition decreases the adequacy of the encoding plan because of the mistake instigated by the rough guess yet it disentangles the equipment usage of encoder. Presently, characterizing
Tx = T3 + T4 + T ∗∗∗ 1 and
Ty = T2 + T1 − T ∗∗∗ 1……….. (9) one can rewrite (8) as
Ty > Tx ……… (10)
Assuming the link width of w bits, the total transition between adjacent lines is w − 1, and hence
Ty + Tx = w − 1………. (11)
Thus, we can write (10) as
Ty > (w − 1) 2………. (12)
This presents the condition used to determine whether the odd inversion has to be performed or not.
ii. Proposed Encoding Architecture
The proposed encoding structural engineering, which is taking into account the odd transform condition characterized by (12), is demonstrated in Fig. 1. We consider a connection width of w bits. In the event that no encoding is utilized, the body flutters are gathered in w bits by the NI and are transmitted by means of the connection. In our methodology, one bit of the connection is utilized for the reversal bit, which demonstrates if the dance crossing the connection has been rearranged or not. All the more particularly, the NI packs the body bounces in w − 1 bits [Fig. 1(a)].
The encoding rationale E, which is coordinated into the NI, is in charge of choosing if the reversal ought to happen and performing the reversal if necessary. The non specific square graph indicated in Fig.4.1 is the same for every one of the three encoding plans proposed in this paper and just the piece E is diverse for the plans. To settle on the choice, the already encoded flutter is contrasted and the present bounce being transmitted.
This recent, whose w bits are the linking of w − 1 payload bits and a "0" bit, speaks to the first information of the encoder, while the past encoded dance speaks to the second data of the encoder [Fig.
4.2]. The w − 1 bits of the approaching (past encoded) body bounce are demonstrated by Xi (Yi ), i = 0, 1, . . . ,w − 2. The wth bit of the already encoded body flutter is demonstrated by inv which indicates on the off chance that it was altered (inv = 1) or left as it seemed to be (inv = 0). In the encoding rationale, each Ty square takes the two neighboring bits of the information flutters (e.g., X1X2Y1Y2, X2X3Y2Y3, X3X4Y3Y4, and so forth.) and sets its yield to "1" if any of the move sorts of Ty is identified. This implies that the odd rearranging for this pair of bits prompts the diminishment of the connection power scattering (Table I).
The Ty piece may be actualized utilizing a straightforward circuit. The second phase of the encoder, which is a larger part voter piece, figures out whether the condition given in (12) is fulfilled (a higher number of 1s in the data of the square contrasted with 0s). On the off chance that this condition is fulfilled, in the last stage, the reversal is performed on odd bits. The decoder circuit essentially alters the got flutter when the reversal bit 2. Scheme II
In the proposed encoding plan II, we make utilization of both odd (as examined beforehand) and full reversal. The full reversal operation believers Type II moves to Type IV moves. The plan contrasts the present information and the past one to choose whether the odd, full, or no reversal of the present information can offer ascent to the connection power decrease.
i. Power Model
Give us a chance to demonstrate with P, P', and P" the force scattered by the connection when the flutter is transmitted with no reversal, odd reversal, and full reversal, separately.
The odd reversal prompts power diminishment when P' < P" and P'< P. The force P" is given by
P” ∝ T1 + 2T ∗∗ 4 ………. (13)
Neglecting the self-switching activity, we obtain the condition
P‟< P” as [see (7) and (13)]
T2 + T3 + T4 + 2T ∗∗∗
1 < T1 + 2T ∗∗ 4 ……….. (14) Therefore, using (9) and (11), we can write 2/ (T2 − T ∗∗ 4 ) < 2Ty − w + 1……….. (15)
Based on (12) and (15), the odd inversion condition is obtained as
2 (T2 − T 4)∗∗ < 2Ty − w + 1 Ty > (w − 1) 2 … (16)
Similarly, the condition for the full inversion is obtained from
P” < P and P” < P‟. The inequality P”< P is satisfied
When T2 > T4 ∗∗ ………. (17)
Therefore, using (15) and (17), the full inversion condition is obtained as
2 (T2 – T4) ∗∗ > 2Ty − w + 1 T2 > T4 ∗∗ ……. (18)
When none of (16) or (18) is satisfied, no inversion will be performed.
ii. Proposed Encoding Architecture
The working standards of this encoder are like those of the encoder executing Scheme I. The proposed encoding construction modeling, which is in light of the odd upset state of (16) and the full transform state of (18), is demonstrated in Fig. 4.3.
Here once more, the wth bit of the already and the full upset state of (18) is demonstrated in Fig. 4.3.
Here once more, the wth bit of the beforehand encoded body bounce is shown with inv which characterizes in the event that it was odd or full rearranged (inv = 1) or left as it might have been (inv
= 0). In this encoder, notwithstanding the Ty hinder in the Scheme I encoder, we have the T2 and T4 ∗∗
squares which figure out whether the reversal taking into account the move sorts T2 and T4 ∗∗ ought to be occurred for the connection power decrease.
The second stage is framed by a situated of 1s squares which include the quantity of 1s their inputs.
The yield of these pieces has the width of log2 w.
The yield of the top 1s square decides the quantity of moves that odd upsetting of pair bits prompts the connection power lessening. The center 1s square distinguishes the quantity of moves whose full altering of pair bits prompts the connection power diminishment. At last, the base 1s piece indicates the quantity of moves whose full transforming of pair bits prompts the expanded connection power. Taking into account the quantity of 1s for every move sort, Module A chooses if an odd modify or full upset activity ought to be performed for the forced.
Fig.3 Encoder architecture Scheme II.
Fig 4 Decoder architecture Scheme II.
Fig.5 Internal view of the decoder blocks (D).
For this module, if (16) or (18) is fulfilled, the relating yield sign will turn into "1." in the event that no rearrange activity ought to - be occurred, none of the yield is situated to "1." Module A can be executed utilizing full-viper and comparator pieces.
The circuit outline of the decoder is indicated in Fig.
3. The w bits of the approaching (past) body bounce are shown by Zi (Ri ), i = 0, 1, . . . ,w − 1. The wth bit of the body bounce is demonstrated by inv which indicates in the event that it was upset (inv = 1) or left as it might have been (inv = 0).
For the decoder, we just need to have the Ty piece to figure out which move has been made spot in the encoder. In view of the yields of these hinders, the dominant part voter piece checks the legitimacy of the imbalance given by (12). In the event that the yield is "0" ("1") and the inv = 1, it implies that half (full) reversal of the bits has been performed.
Utilizing this yield and the sensible entryways, the reversal activity is resolved. On the off chance that two reversal bits were utilized, the overhead of the decoder equipment could be considerably lessened 3. Scheme III
In the proposed encoding Scheme III, we add even reversal to Scheme II. The reason is that odd reversal changes over some of Type I (T1 ∗∗∗ ) moves to Type II moves. As can be seen from Table
II, if the bounce is even reversed, the moves demonstrated as
T ∗∗ 1/T1 ∗∗∗
In the table are changed over to Type IV/Type III moves. In this way, the even reversal may lessen the connection power dissemination too.
The plan contrasts the present information and the past one to choose whether odd, even, full, or no reversal of the present information can offer ascent to the connection power.
i. Power Model
Give us a chance to demonstrate with P', P", and P "' the force scattered by the connection when the dance is transmitted with no reversal, odd reversal, full reversal, and even reversal, separately.
Like the investigation given for Scheme I, we can estimated the condition
P”’ < P as
T1 + 2T2 > T2 + T3 + T4 + 2T1 ∗ ………….. (19) Defining
Te = T2 + T1 – T1 ∗ ……… (20)
we obtain the condition P”’ < P as
Te (w − 1)/ 2 ………….. (21)
Similar to the analysis given for scheme II, we can approximate the condition
P”’ < P‟ as
T2 + T3 + T4 + 2T1 ∗ < T2 + T3 + T4 + 2T1 ∗∗... (22) Using (9) and (20), we can rewrite (22) as
Te > Ty……….. (23) Also, we obtain the condition P “’< P__ as [see (13) and (19)]
T2 + T3 + T4 + 2T1 ∗ < T1 + 2T4 ∗∗ ………. (24) Now, define
Tr = T3 + T4 + T1 ∗ and
Te = T2 + T1 – T1 ∗………. (25)
Assuming the link width of w bits, the total transition between adjacent lines is w − 1, and hence
Te + Tr = w − 1………. (26)
Using (26), we can rewrite (24) as
2 (T2 – T4) ∗∗ < 2Te − w + 1………. (27) The even inversion leads to power reduction when
P”’< P, P”’< P‟, and
P”’< P’’ Based on (21), (23), and (27), we obtain
Te> (w − 1)/ 2 , Te>Ty, 2(T2 – T4) ∗∗ < 2Te − w+1………(28)
The full inversion leads to power reduction when P” < P, P”‟< P’, and P” < P”’
Therefore, using (18) and (27), the full inversion condition is obtained as
2 (T2 – T4) ∗∗ > 2Ty − w + 1, _T2 > T4 ∗∗2 (T2 – T4) ∗∗ > 2Te − w + 1………….. (29)
Similarly, the condition for the odd inversion is obtained from
P‟ < P, P‟ < P”, and P‟ < P”’
Based on (16) and (23), the odd inversion condition is satisfied when
2 (T2 – T4 ∗∗< 2Ty − w + 1, Ty >(w − 1)/2 Te < Ty
……… (30)
When none of (28), (29), or (30) is satisfied, no inversion will be performed.
TABLE II
EFFECT OF EVEN INVERSION ON CHANGE OF TRANSITION TYPES
ii. Proposed Encoding Architecture
The working standards of this encoder are like those of the encoders actualizing Schemes I and II. The proposed encoding structural planning, which is taking into account the even modify state of (28), the full upset state of (29), and the odd alter state of (30), is indicated in Fig. 4. The wth bit of the beforehand encoded body dance is shown by inv which demonstrates in the event that it was even, odd, or full reversed (inv = 1) or left as it might have been (inv = 0). The principal phase of the encoder decides the move sorts while the second stage is shaped by a situated of 1s pieces which include the
quantity of ones their inputs. In the first stage, we have included the Te squares which figure out whether any of the move sorts of T2, T 1∗∗ , and T1
∗∗∗ is identified for every pair bits of their inputs. For these move sorts, the even transform activity yields connection power decrease.
Once more, we have four Ones squares to focus the quantity of distinguished moves for each Ty, Te, T2, T4 ∗∗, pieces. The yield of the Ones squares are inputs for Module C. This module figures out whether odd, even, full, or no rearrange activity comparing to the yields "10," "01," "11," or "00,"
separately, ought to be performed. The yields "01,"
"11," and "10" demonstrate that whether (28), (29), and (30), individually, are fulfilled. In this paper, Module C was outlined in view of the conditions given in (28), (29), and (30). Like the system used to outline the decoder for plan II, the decoder for plan III ma
Fig.6 Encoder architecture Scheme III.
IV SIMULATION RESULTS
V CONCLUSION
In this paper, we have displayed an arrangement of new information encoding plans went for lessening the force dispersed by the connections of a NoC. Truth be told, connections are in charge of a critical portion of the general force disseminated by the correspondence framework. What's more, their commitment is required to increment in future innovation hubs. When contrasted with the past encoding plans proposed in the writing, the reason behind the proposed plans is to minimize the exchanging action, as well as (and specifically) the coupling exchanging movement which is fundamentally in charge of connection force dissemination in the profound sub micron meter innovation administration.
The proposed encoding plans are skeptic as for the basic NoC construction modeling as in their application does not require any adjustment neither in the switches nor in the connections. A broad assessment has been done to evaluate the effect of the encoder and decoder rationale in the NI. The encoders actualizing the proposed plans have been evaluated as far as force dissemination and silicon zone. The effects on the execution, force, and vitality measurements have been mulled over utilizing a cycle-and bit precise NoC test system under both manufactured and genuine activity situations.
Generally speaking, the utilization of the proposed encoding plans permits reserve funds up to 51% of force scattering and 14% of vitality utilization with no critical execution corruption and with under 15%
range overhead in the NI.
REFERENCESS
[1] International Technology Roadmap for Semiconductors. (2011) [Online]. Available:
http://www.itrs.net
[2] M. S. Rahaman and M. H. Chowdhury,
“Crosstalk avoidance and errorcorrection coding for coupled RLC interconnects,” in Proc. IEEE Int.
Symp. Circuits Syst., May 2009, pp. 141–144.
[3] W. Wolf, A. A. Jerraya, and G. Martin,
“Multiprocessor system-on-chip MPSoC technology,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 27, no. 10, pp. 1701–1713, Oct. 2008.
[4] L. Benini and G. De Micheli, “Networks on chips: A new SoC paradigm,” Computer, vol. 35, no.
1, pp. 70–78, Jan. 2002.
[5] S. E. Lee and N. Bagherzadeh, “A variable frequency link for a poweraware network-on-chip (NoC),” Integr. VLSI J., vol. 42, no. 4, pp. 479–485, Sep. 2009.
Authors
Mr. K Gurava Reddy, M.Tech Student Department of ECE, Shree Institute Of Technical education, Tirupati, India.
Mr. T. Muni Reddy, Assistant Professor, Department of ECE, Shree Institute of Technical Education Tirupati, India. He has completed M.Tech in Embedded Systems from SRM University. His research areas are Digital System Design, VLSI Signal Processing, and Embedded Systems
