Thesis - Department of Electronic & Computer Engineering

More documents

Recommendations

Info

stage. similarly, we do not wait for it to withdraw its acknowledge before we withdrawours.The data-buffer pipeline-stage performs FIFO (first-in, first-out), which means theevents to be acknowledged are queued by age.In this arbitered scheme, arbitration preserves the integrity of the addresses that aretransmitted, but the statistics and the temporal structure of events may be distorted bythe queuing.3.1.3 SummaryThe selection of a communication scheme depends on the task that must be solvedby the neuromorphic system. A simple non-arbitered design, which discards spikesclobbered by collisions, offers higher throughput (bus utilization) if high spike lossrates are tolerable. In contrast, a complex arbitered design, which makes neurons waittheir turn, offers higher throughput when low spike loss rates are desired. Whereasarbitration lengthens the cycle time, reducing the channel capacity and queuing causestemporal dispersion, degrading timing information.3.2 Related Works on AERSince it was used to transmit visual signals out of a silicon retina at first, the AERrepresentation has been strengthened and formalized. Several variants of the originalscheme have emerged in the last few years. Boahen has interfaced two silicon retinasto three receiver chips to implement binocular disparity-selective elements [24].Venier and his colleagues have used an asynchronous interface to a silicon retina toimplement orientation-selective fields [15].24
Here in Table 1 is the comparison of the pulse coupled communication schemes bythe listed authors:TABLE 1. Comparison of reported pulse communication schemesMortara/Venier[12] Douglas[13] Boahen[14]Mahowald/Sivilotti/Lazzaro[13]Codingscheme PFM PFM PFM PFMCodingscheme Non-arbitered Non-arbitered Arbitered ArbiteredAERCollisionHandlerEncoderAddressencodeOR operation;Loss of allparticipatingeventsAddressencoder;(1+log 2 N)wiresHard-wiredversion andArbitered version[1][log 2( Y)]-bitdecoder &[log 2 (x)]-bitdecoderHandshake;Queue newPerformance T=20ms Not available 30ns 2us* Information not available.*4-cycle handshakeIntegrate-andfireIntegrate-andfireIntegrate-andfireIntegrate-andfire25
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: The sender initiates the sequence b
Page 27 and 28: source cell will be broadcast on th
Page 29 and 30: At this point, it seems appropriate
Page 31 and 32: detected, all the potential spikes
Page 33 and 34: InitializationFor each timestep ε
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
show all

Thesis - Department of Electronic & Computer Engineering

Create successful ePaper yourself

Delete template?

Save as template?