Thesis - Department of Electronic & Computer Engineering

More documents

Recommendations

Info

Inside each dashed frame is the body of the corresponding loop. It models exactlythe non-arbitered communication scheme illustrated in Fig. 4.4.4.2.2 ArbiteredIgnoring the cycle time for handshaking, it is assumed that whenever a collidingpulse is detected, it is held in the queue. When the bus is not busy, the oldest pulse isfired and removed from the queue. As shown in Figure 4.6, in this scheme, first of all,collisions are allowed and no pulse is lost. Secondly, collided pulses are queuedaccording to age, the oldest pulse has the first priority. This describes the same arbitrationscheme as Boahen’s design in [14].Address code on the busDecoded signal at the receiverCollision betweenandFig. 4.6 The arbitered communication schemeAs shown in Fig. 4.7, the procedures for the arbitered communication scheme indigital simulations are similar to those of the non-arbitered scheme, except that aqueue is maintained and the ArbitrationFunction is different. All the potential spikesare queued by age, when the bus is busy, no new spike is fired, while the bus is notbusy, the first spike in the queue is fired and then removed from the queue, first in firstout. Thus it is equivalent to that the bus carries only valid address code.32
InitializationFor each timestep ε inTSFor each neuron in NInputFunction()UpdateFunction()OutputFunction()Queue all the spikesBusy or not?NFire no new spikeFire and remove the first spike in the queueFig. 4.7 Flow chart for the simulation of arbitered schemeInside each dashed frame is the body of the corresponding loop. It models the fullyarbitered communication scheme by Boahen [14].33
Page 3 and 4: the system level. Our results show
Page 5: activities. The basin of attraction
Page 9 and 10: It is interesting to note that whic
Page 11 and 12: Although there is no saturation in
Page 13 and 14: • Response time of the system;As
Page 15 and 16: e verified by computer simulation (
Page 17 and 18: inhibition. Due to the fact that ea
Page 19 and 20: tion. Thus the power consumption is
Page 21 and 22: Let∆be the minimum time necessary
Page 23 and 24: The sender initiates the sequence b
Page 25 and 26: Here in Table 1 is the comparison o
Page 27 and 28: source cell will be broadcast on th
Page 29 and 30: At this point, it seems appropriate
Page 31: detected, all the potential spikes
Page 35 and 36: global inhibition BusActivity to fr
Page 37 and 38: Spikes from the winnerATpTTT n T n+
Page 39 and 40: the network will either work at WTA
Page 41 and 42: The computer simulation results for
Page 43 and 44: 5.5 Steady State AnalysisAs demonst
Page 45 and 46: all the losers. To ensure that all
Page 47 and 48: 10090θ=θ mThe necessary condition
Page 49 and 50: 100Necessary conditions to exhibit
Page 51 and 52: The response time is estimated in t
Page 53 and 54: 5.6.2 Further study on the non-arbi
Page 55 and 56: 100Response time V.S. equivalent ga
Page 57 and 58: cell will never collide with each o
Page 59 and 60: ps ( i) = ( 1 - ϕ i)δ( s)for s =
Page 61 and 62: These results show that the collisi
Page 63 and 64: 5.7.4 SummaryCompared with the Pois
Page 65 and 66: 6. ConclusionsIn this thesis, a cla
Page 67 and 68: In this thesis, we consider only a
Page 69 and 70: v i() t≤I i----------- ( 1 - e1 -
Page 71 and 72: If a+ b - 1≥0, then τ---- d [ v
Page 73 and 74: If a+ b - 1 > 0, since v i() t > 0
Page 75 and 76: whereV ˙ i () t=max( v i ()0 t , )
Page 77 and 78: θ t s Nf f wp ct(%) p cl(%) p cw(%
Page 79 and 80: 10. “WTA networks with lateral ex

Thesis - Department of Electronic & Computer Engineering

Create successful ePaper yourself

Delete template?

Save as template?