Analysis of Coding-aware MAC Protocols based on Reverse Direction Protocol for IEEE based Wireless Networks using Network Coding*

Size: px
Start display at page:

Download "Analysis of Coding-aware MAC Protocols based on Reverse Direction Protocol for IEEE based Wireless Networks using Network Coding*"

Transcription

1 Anlysis of oding-wre MA Protocols sed on Reverse irection Protocol for IEEE 8.-sed Wireless Networks using Network oding* Rul Plcios, Htegereil Kssye Hile, Jesus Alonso-Zrte nd Frizio Grnelli {plciostrujillo, htegereil.hile, University of Trento, Itly entre Tecnològic de Telecomuniccions de tluny (TT), Brcelon, Spin Astrct The implementtion of Network oding (N) in IEEE 8.-sed wireless networks presents the importnt chllenge of providing dditionl trnsmission priority for the rely nodes responsile for coding. These nodes re le to convey more informtion in ech trnsmission thn those tht forwrd single pckets y comining severl received pckets in single coded pcket. To trnsmit dt, the nodes execute the IEEE 8. Medium Access ontrol (MA) protocol clled the istriuted oordintion Function (F). In doing so, they compete for ccess to the wireless chnnel nd get equl trnsmission opportunities under high congestion. As result, congested rely nodes will severely limit the performnce of the network. In this pper, we investigte ckwrds-comptile mechnism clled Reverse irection F (R-F) tht llows rely nodes to trnsmit dt upon successful reception of dt. We nlyse the performnce limits of the proposed protocol with nd without N in terms of throughput nd energy efficiency. The performnce evlution considers different trffic lods, pcket lengths, nd dt rtes. The results of this work show tht the proposed R-F+N protocol cn improve throughput nd energy efficiency up to % when compred to legcy F. I. INTROUTION Network oding (N) [] is promising technique tht cn e used to improve throughput nd energy efficiency in wireless networks. The sic principle of N is to llow the intermedite nodes of network to comine severl received pckets for trnsmission. Fig. shows the dvntges of N over trditionl store-nd-forwrd schemes in two well-known scenrios, nmely, the Alice-nd-Bo nd cross-topologies. One of the most importnt prcticl N protocols is OPE []. OPE is the first implementtion of prcticl N protocol in rel IEEE 8.-sed wireless network. OPE is sed on inter-session N where the received pckets from different flows re comined for trnsmission. One of the min contriutions of OPE ws to show the impct of the Medium Access ontrol (MA) protocol on the performnce of N. OPE uses the IEEE 8. istriuted oordintion Function (F) []. This MA protocol is vrition of rrier Sense Multiple Access (SMA) y which nodes sense the shred wireless chnnel nd get rndom ccess to it through competition. An importnt chrcteristic of F is the equl ccess priority for ll competing nodes. This mens tht ech node This work is funded y the GREENET project (PITN-GA--679). () A&B: Without N (c) ross: Without N. () A&B: With N. 6 6 (d) ross: With N. Fig.. Reference scenrios: Alice-nd-Bo nd cross topologies. ()-(c): Without N, R forwrds the pckets from A, B,, nd to their respective destintions. ()-(d) With N, R encodes pirs of pckets from A nd B nd nd, respectively, nd rodcsts single coded pckets. will get on verge similr shre of the wireless chnnel in situtions of high congestion nd similr chnnel conditions. This inherent firness of F cuses serious prolem to rely node tht needs to forwrd the pckets from severl source nodes s shown in Fig.. In Fig., the rely node needs to ccess the wireless chnnel twice more often thn Alice nd Bo to forwrd their pckets to their respective destintions. As result, the rely node ecomes ottleneck for Alice nd Bo since it will e unle to send out their pckets with the sme rte s they rrive. In [] the uthors showed tht N cn solve this prolem since the rely node is le to forwrd two pckets in single trnsmission, s cn e seen in Fig.. However, with the increse in the numer of source nodes under the rely s coverge N my not e the only solution required. The motivtion exmples re shown in Figs. c, d, where two idirectionl flows intersect t the rely node. Without coding, 8 trnsmissions re necessry for ech flow to send one pcket to its destintion. Using simple XOR coding, the rely node cn comine pirs of pckets from the source nodes nd forwrd them to their respective destintions. However, due to

2 the F firness, the rely node will only get trnsmission opportunity to send one coded pcket. Therefore, providing dditionl trnsmission priority for the rely node is essentil to fully exploit the dvntges of N. Previous works [] [7] focused on djusting the size of the contention window sed on the level of congestion, the stte of chnnel contention, nd coding informtion. In this wy, severl chnnel ccess priorities cn e ssigned to different nodes. These works ssume contention-sed opertion of nodes s defined in the legcy IEEE 8. F. Hence, rely node redy to trnsmit coded pcket will compete for the chnnel ccess ginst ll other nodes in its coverge re. In our previous works [8], [9], we presented nd evluted the performnce of new mechnism sed on F, coined Reverse irection F (R-F). R-F llows pir of nodes to exchnge dt in oth directions once one of them hs otined trnsmission opportunity. In [], we extended the opertion of R-F to fully exploit N y llowing the rely node to trnsmit coded pcket immeditely fter receiving dt pcket. We evluted the performnce of R-F with N in the Alice-nd-Bo scenrio nd showed round % nd % gins when compred to F with N nd stndrd F, respectively. The min contriutions of this pper re: ) We theoreticlly derive the mximum throughput nd energy efficiency of the two previously proposed protocols. ) We nlyse nd discuss the performnce limits of the two proposed protocols in the Alice-nd-Bo nd crosstopologies considering different trffic lods, dt pcket lengths, nd dt rtes. The structure of the pper is s follows. For completeness, the F, OPE or F with N, R-F, nd R-F with N protocols re riefly summrized in Section II. Section III decries the nlysis of throughput nd energy efficiency for the protocols under evlution. The performnce nlysis nd discussion of the protocols is then provided in Section IV. Finlly, Section V concludes the pper. II. PROTOOL ESRIPTION In this section we provide rief description of F, OPE or F with N (F+N), R-F, nd R-F with N (R-F+N) in the Alice-nd-Bo nd cross-topologies. A. F F [] is sed on rrier Sense Multiple Access with ollision Avoidnce (SMA/A) nd Binry Exponentil Bckoff (BEB) lgorithm. It my implement n optionl Request-To-Send/ler-To-Send (/) mechnism to reduce the impct of collisions of dt pckets nd to comt the prolem of hidden nodes. In Fig., A nd B exchnge pir of dt pckets through R using F with /. A senses the chnnel for F Inter Frme Spce (IFS) nd executes the ckoff procedure (BO) efore trnsmitting. After rndom ckoff time, A gets ccess to chnnel nd sends to R. After Short Inter Frme Spce (), R replies with. B overhers the nd reds the durtion field contined in the MA heder of the pcket to updte its Network Alloction Vector (NAV). Upon receiving the, A sends its dt pcket () fter. Then, R responds with n cknowledgment () pcket fter. R initites ckoff procedure fter IFS to send to B. However, B seizes the chnnel erlier nd performs / exchnge to send to R. After IFS, R performs two chnnel ccesses to forwrd nd to their respective destintions. In Fig., A nd B nd nd, respectively, exchnge dt through R. Ech of them sends dt pcket to R nd R forwrds it to the intended destintion. Thus, R needs to perform four chnnel ccesses to forwrd ll the dt pckets. In the figure, we only show the dt trnsmission from A to R since it repets for the other trnsmissions. We cn see tht nd re le to overher the exchnge of pckets etween A nd R. On the other hnd, B cn only overher the nd pckets from R to A. B. F+N OPE [] is sed on F nd uses N to increse the informtion content of ech dt trnsmission. OPE sets the nodes in promiscuous mode to llow them to store nd process overherd pckets for limited time. OPE llows intermedite nodes to opportunisticlly comine two received pckets from different flows for trnsmission y using the XOR opertion. OPE introduces n dditionl heder in the coded pcket to llow the receiving nodes to identify decoding opportunities. To provide reliility for coded pckets, OPE specifies tht coded pckets should e ddressed to one of the intended receivers in order to generte synchronous pckets. Upon successful decoding, the other receivers should schedule events tht will e sent together with dt pckets or periodic control pckets. As shown in Fig., R only needs to use one trnsmission slot to forwrd nd to their respective destintions, since it cn comine nd into. R chooses t rndom B s the intended receiver. Thus, B responds with n pcket fter. When B receives, it cn retrieve y using nd. A overhers nd cn lso decode it to get y using ecuse it is in promiscuous mode. In the cross topology (Fig. ), R sends coded pcket from A nd B to B. The nd coded pckets re overherd y A,, nd wheres the nd pckets re only overherd y nd. A similr opertion will follow when R encodes the pckets from nd nd trnsmits the coded pcket to one of them. By exploiting N, R only needs two trnsmission slots to forwrd four pckets from A, B,, nd to their respective destintions.. R-F R-F [8], [9] is imed t improving the performnce of F y enling dt exchnges etween node pirs in oth directions with single chnnel ccess invoction. The opertion rules of F only llow the trnsmission of dt from source node to destintion node once the source

3 A R () F. Fig.. B A R () F+N. B A x x- x x- x R x- x x (c) R-F. x- x x B x x Exmples of opertion of the F, F+N, R-F, nd R-F+N in the Alice-nd-Bo topology. (d) R-F+N.. Alice to Rely. Bo to Rely. rol to Rely. ve to Rely. Alice to Rely. Bo to Rely. rol to Rely. ve to Rely XOR. Alice to Rely. Bo to Rely nd Rely to Alice nd Bo XOR. rol to Rely. ve to Rely nd Rely to rol nd ve A R B A XOR R XOR B XOR XOR. Rely to Bo 6. Rely to Alice 7. Rely to ve 8. Rely to rol. Rely to Alice nd Bo 6. Rely to rol nd ve XOR. Alice to Rely nd Rely to Alice. Bo to Rely nd Rely to Bo. rol to Rely nd Rely to rol. ve to Rely nd Rely to ve XOR () F. Fig.. () F+N (c) R-F. (d) R-F+N. Exmples of opertion of the F, F+N, R-F, nd R-F+N in the cross topology node hs otined trnsmission opportunity. The destintion node is restricted to send ck n pcket when the dt pcket is received without errors. Thus, R-F introduces simple modifiction into the opertion rules of F y which destintion node cn respond with dt pcket upon successful reception of dt pcket. Specificlly, the destintion node is le to trnsmit dt pcket together with the pcket whose destintion is the source node of the received dt pcket. In the Alice-nd-Bo topology (Fig. c), when R receives the from A, it identifies n opportunity to forwrd to A previously received pcket from B ( x ). Thus, R replies with whose durtion field includes the dditionl time required to trnsmit x. In this wy, B cn updte its NAV ccordingly when it overhers the destined to A. When A receives the, it sends x fter. R responds with x nd A cknowledges it y sending ck n pcket fter. Similrly, R cn forwrd x to B when it receives x. By enling reverse direction communictions, R is le to forwrd two pckets from A nd B to their respective destintions in two trnsmission slots. Fig. c shows n exmple of opertion of R-F in the cross topology where nd R exchnge two dt pckets. A nd B overher the communiction etween nd R wheres cn only overher the nd dt pckets. In this topology, R cn forwrd four pckets to their respective destintions in four chnnel ccesses initited y the source nodes.. R-F+N R-F+N [] uses N sed on OPE nd tkes dvntge of R-F to provide higher trnsmission priority for the rely nodes when they identify opportunities for coding. In prticulr, rely node cn trnsmit coded pcket upon successful reception of dt pcket. The trnsmitted coded pcket could hve lredy een encoded nd stored in the output queue or cn e the result of coding the newly received pcket with nother pcket in the queue. In Fig. d, A sends using stndrd F rules. After IFS, R invokes the ckoff procedure to send to B. However, B gets trnsmission opportunity erlier. When R receives the from B, it identifies coding opportunity with. Then, it freezes the ckoff procedure nd sends to B with the durtion field including the dditionl time to trnsmit the possile coded pcket. This informtion is computed sed on the vlue of the durtion field contined in the. When B receives the, it sends to R fter. R comines nd into nd trnsmits to B. A nd B cn retrieve the pcket of ech other s explined ove for F+N. In the cross topology (Fig. d), R cn send coded pcket when it receives dt pcket from. This must precede the trnsmission of dt pcket from to R using F, s similrly shown for A in Fig.. In this exmple, A nd B

4 overher the entire communiction while cn only overher the nd coded pckets. MA Heder Octets: 6 6 Frme urtion RA TA ontrol FS MA Heder Octets: 6 Frme ontrol urtion RA FS / III. ANALYSIS In this section we derive the expressions of mximum theoreticl throughput nd energy efficiency for the protocols under considertion, i.e., F, F+N, R-F, nd R- F+N. We first descrie the network model nd enumerte the ssumptions mde to crry out the nlysis. A. Network Model nd Assumptions We consider two network scenrios nmely the Alice-nd- Bo topology nd the cross topology shown in Fig.. Ech scenrio is composed of rely node nd N source nodes ll equipped with IEEE 8.g wireless interfces. Thus, full cpilities of IEEE 8.g cn e exploited. We ssume tht the rely node does not generte own trffic ut only forwrds the dt pckets from the source nodes to their respective destintions. All dt pckets hve constnt length. Since the im is to compute the upper ound of the throughput nd energy efficiency in idelistic conditions, we ssume tht: ) the proility of collision is negligile, ) there re no pcket losses due to chnnel errors. In ddition, no pcket losses exist due to uffer overflow. Frgmenttion is not used nd the propgtion dely is neglected. For the Nenled protocols, we lso ssume tht coding nd decoding using the XOR opertion consume negligile time nd energy. While in on stte, the IEEE 8.g wireless interfce of node cn e in one of the following opertionl sttes: trnsmitting, receiving or overhering (i.e., receiving pckets not destined to itself), nd idle. We do not consider powersve sttes. In the first two sttes, the rdio trnsceiver is ctively used to send nd receive informtion. In the idle stte, the wireless interfce is redy to receive ut not signl is received y the rdio trnsceiver. Ech of these opertionl sttes hs n ssocited power consumption tht will vry depending on the product hrdwre. Let P t, P r, nd P i, denote the power consumed while trnsmitting, receiving, nd idling, respectively. B. IEEE 8.g ERP-OFM Physicl Lyer The IEEE 8g mendment introduces n Extended Rte PHY (ERP) specifiction tht uses the OFM modultion nd provides 8 trnsmission modes with different modultion schemes nd coding rtes. Tle I summrizes the chrcteristics of ech mode, where the supported dt rtes nd the Numer of t Bits per OFM Symol (N BP S ) re shown. The structure of n ERP-OFM pcket is shown in Fig.. Ech MA dt pcket or MA Protocol t Unit (MPU) consists of MA heder, frme ody or MA Service t Unit (MSU), nd Frme heck Sequence (FS). The MA heder nd FS together re up to octets, the pcket is octets, nd the nd pckets re octets long. Note tht n XOR heder of octets [] will e dded fter the MA heder in order to crete coded pcket. MA Heder (mx. ) Octets: Frme urtion Address Address Address Sequence Address ontrol /I ontrol MSU FS RATE its PLP Heder Reserved LENGTH Prity it its it PLP Premle (6 μs) Fig.. oded/ofm (BPSK, r = /) SIGNAL ( μs) Til SERVIE 6 its 6 its PSU oded/ofm (RATE is indicted in SIGNAL) Til 6 its Pd Bits Signl Extension Vrile Numer of OFM Symols (6 μs) IEEE 8.g pcket formt (ERP-OFM PPU). TABLE II PARAMETERS OF PHY AN MA LAYERS FOR 8.G. Prmeter Vlue Prmeter Vlue T slot 9 µs L serv 6 T SIF S µs L til 6 T IF S 8 µs L RT S B W min L T S =L B W mx L MAhdr B T BO 67. µs L XORhdr B T pre 6 µs L F S B T sig µs P t.6 W T sym µs P r. W T sigex 6 µs P i. W MPU PPU When MPU is to e trnsmitted, it is pssed to the PHY Lyer onvergence Procedure (PLP) sulyer where it is clled PLP Service t Unit (PSU). In order to form PLP Protocol t Unit (PPU), PLP premle nd PLP heder re dded to PSU. The durtion of the PLP premle field (T pre ) is 6 µs. The PLP heder expect the SERVIE field constitutes the SIGNAL field whose durtion (T sig ) equls the durtion of single OFM symol (T sym ) with µs. The 6-it SERVIE field (L serv ) nd the MPU long with 6 til its (L til ) nd pd its, represented y, re trnsmitted t the dt rte specified in the RATE field. Finlly, period of no trnsmission with length of 6 µs clled the signl extension (T sigex ) follows fter the end of ERP-OFM trnsmission. All the ove prmeters nd their vlues re provided in Tle II. The BSS sic rte set determines the set of dt rtes tht should e supported y ll the STAs of BSS. The mndtory rtes re the rtes tht use / rte coding, i.e., 6,, nd Mps, s shown in Tle I. To llow the trnsmitting node to clculte the vlue of the durtion field, control response pckets like nd should e trnsmitted t the highest sic rte tht is less thn or equl to the rte of the received pcket. This mens tht nd pckets re trnsmitted t 6,, or Mps if the nd t pckets were received t 6 or 9, or 8, nd, 6, 8 or Mps, respectively. We cn thus otin the time to trnsmit ech pcket t the IEEE 8.g PHY lyer. The trnsmission times of dt

5 TABLE I ERP-OFM PHY MOES AN TRANSMISSION TIMES IN µs FOR ONTROL AN PETS IN IEEE 8.G. Mode Modultion ode rte t rte N BP S T RT S T T S T T AT A ( ytes) T XORAT A ( ytes) BPSK / 6 Mps 8 78 BPSK / 9 Mps 6 9 QPSK / Mps QPSK / 8 Mps QAM / Mps QAM / 6 Mps QAM / 8 Mps QAM / Mps 6 6 pcket nd coded pcket with L MSU octets of dt pylod, pcket, nd nd pckets re given in (), (), (), nd (), respectively. The ceiling function x returns the smllest integer vlue greter thn or equl to x. Tle I shows the trnsmission time of ech pcket for ech trnsmission rte. The trnsmission times of the dt nd coded pcket re given for octets of dt pylod. T AT A =T pre +T sig +T sigex T sym Lserv +(L MAhdr +L MSU +L F S )8+L til N BP S T XORAT A =T pre +T sig +T sigex +T sym Lserv +(L MAhdr +L XORhdr +L MSU +L F S )8+L til N BP S Lserv +L RT S 8+L til T RT S =T pre +T sig +T sym N BP S +T sigex () Lserv +L 8+L til T T S =T =T pre +T sig +T sym N BP S +T sigex (). Throughput Anlysis Throughput is defined s the mount of its contined in MSU divided y the time in microseconds required to trnsmit the dt pcket tht includes the MSU. This is expressed y (). MSU length Throughput [Mps]= ely per MSU ) F: The trnsmission cycle of F consists of IFS intervl, ckoff period, trnsmission, intervl, trnsmission, intervl, dt trnsmission, intervl nd n trnsmission. The durtion of IFS intervl (T IF S ) is clculted with (6), where T SIF S is the durtion of intervl nd T slot is the durtion of slot time. Since there re no collisions of dt pckets, the verge ckoff time (T BO ) is given y (7). The vlues ssocited with these periods re shown in Tle II. () () () T IF S =T SIF S +T slot (6) T BO = ( Wmin ) T slot (7) To compute the mximum throughput of F, the source nodes should send N dt pckets to the rely node, which should forwrd them to their respective destintions. In totl, N trnsmission slots re required to forwrd N dt pckets from end to end. We cn thus express the mximum throughput of F y (8) contined in Tle III. However, the sturtion throughput of F will e lower thn the mximum throughput. In sturtion conditions, F provides n equl shre of the chnnel for ll competing nodes. Therefore, the rely node will only get trnsmission opportunity once every N trnsmissions from the source nodes. The sturtion throughput of F is given y (9). ) F+N: The trnsmission cycle of F+N is similr to tht of F ut it includes the trnsmission of coded pcket from the rely node. To compute the mximum throughput of F+N, the rely node should forwrd N/ coded pckets for every N received dt pckets from the source nodes. As result, N dt trnsmissions nd N/ coded dt trnsmissions re required to forwrd N dt pckets from end to end. However, under sturtion, the rely node will only e le to send single coded pcket every N trnsmissions from the source nodes, due to the F firness. Thus, two dt pckets will e delivered from end to end. The mximum throughput nd the sturtion throughput of F+N re otined y (), (), respectively. ) R-F: The trnsmission cycle of R-F contins the sme s tht of F ut it includes n dditionl dt trnsmission nd intervl. To compute the mximum throughput of R-F, we ssume tht the rely node hs dt pcket redy to trnsmit when it receives dt pcket from source node. Therefore, the rely node cn forwrd N dt pckets from end to end every N trnsmissions from the source nodes. The mximum throughput of R-F is then given y (). ) R-F+N: The trnsmission cycle of R-F+N includes the sme s tht of R-F except tht there is coded dt trnsmission from the rely node. To compute the mximum throughput of R-F+N, the source nodes should perform N dt trnsmissions nd the rely node

6 TABLE III THROUGHPUT FORMULAS. F mximum throughput N N (T IF S+T BO +T RT S +T T S +T AT A +T +T SIF S ) F sturtion throughput (N+)(T IF S +T BO +T RT S +T T S +T AT A +T +T SIF S ) (8) (9) F+N mximum throughput [ ] () (N+ N N )(T IF S+T BO +T RT S +T T S +T +T SIF S )+NT AT A + N T XORAT A F+N sturtion throughput [(N+)(T IF S+T BO +T RT S +T T S +T +T SIF S )+NT AT A +T XORAT A ] R-F mximum nd sturtion throughput N N [(T IF S+T BO +T RT S +T T S +T AT A +T +T SIF S )] () () R-F+N mximum nd sturtion throughput [ ] () N (T N IF S +T BO +T RT S +T T S +T +T AT A ) + N (7T SIF S+T XORAT A ) should perform N/ coded dt trnsmissions using reverse direction communiction. As result, N trnsmission slots re required to exchnge N dt pckets from end to end.. Energy Efficiency Anlysis Energy efficiency is defined s the mount of its contined in MSU divided y the energy consumed in microjoules to trnsmit the dt pcket tht includes the MSU. This is represented y (). MSU length Energy Efficiency [M/J]= onsumed energy per MSU () ) F: uring the trnsmission cycle of F, the trnsmitting node, either source node or the rely node, consumes energy to trnsmit the nd dt pckets nd to receive the nd pckets from the receiving node. On the other hnd, the receiving node consumes energy to receive the nd dt pckets from the trnsmitting node nd to respond with the nd pckets. The N source nodes not involved in trnsmission consume energy to overher the exchnge of pckets except one tht cn only overher the pckets sent from the rely node. The N source nodes nd the rely node lso consume energy to listen to the chnnel for IFS intervl, ckoff period, nd ll intervls. In ddition, one source node is idle when one of the source nodes is trnsmitting. The mximum energy efficiency nd the sturtion energy efficiency of F re expressed y (), (6). For esy comprehension, we split the energy consumed y the nodes into the different opertionl sttes, nmely, trnsmitting (E t ), receiving (E r ) nd idling (E i ). ) F+N: In the trnsmission cycle of F+N, nodes consume similr mounts of energy to those shown for trnsmission cycle of F. However, the rely node will consume energy to trnsmit coded pcket nd the N source nodes will consume energy to receive it. The mximum energy efficiency nd the sturtion energy efficiency re given y (7), (8). ) R-F: The energy consumed in the trnsmission cycle of R-F equls the energy consumed in the trnsmission cycle of F with the following dditionl contriutions. The rely node consumes energy to trnsmit dt pcket nd the N source nodes consume energy to receive it. In ddition, the rely node nd the source nodes re idle for. ) R-F+N: The trnsmission cycle of R-F+N consumes the sme mounts of energy s tht of R-F. However, dditionl energy consumption is required for the rely sttion to trnsmit coded pcket in the reverse direction nd to receive it y the N source nodes. IV. NUMERIAL RESULTS In this section, we use the expressions derived in the previous section to discuss the upper ounds of the different protocols in the Alice-nd-Bo nd cross-topologies. The results hve een otined considering different vlues for the trffic lod, the MSU length nd the PHY dt rte.

7 TABLE IV ENERGY EFFIIENY FORMULAS. F mximum energy efficiency N N [(T RT S+T T S +T AT A +T )(P t+(n )P r+p i )+(T IF S +T BO +T SIF S )(N+)P i ] () F sturtion energy efficiency E t=(t RT S +T T S +T AT A +T )(N+)P t E r=((t RT S +T AT A )(N(N )+N)+(T T S +T )(N E t+e r+e i +N ))P r (6) E i =((T IF S +T BO +T SIF S )(N+) +(T RT S +T AT A )N+T T S +T )P i F+N mximum energy efficiency E t=((t RT S +T T S +T )(N+ N )+T N AT AN+T XORAT A )Pt N (Et+Er+E E r=(t RT S (N(N )+ i) N )+T N AT AN(N )+T XORAT A +(T T S+T )(N + N (N )))Pr (7) E i =((T IF S +T BO +T SIF S )(N+)(N+ N )+(T RT S+T AT A )N+T T S +T )P i F+N sturtion energy efficiency E t=((t RT S +T T S +T )(N+)+T AT A N+T XORAT A )P t (Et+Er+E E r=(t RT S (N(N )+N)+T AT A N(N )+T XORAT A N+(T T S +T )(N i) +N ))P r (8) E i =((T IF S +T BO +T SIF S )(N+) +(T RT S +T AT A )N+T T S +T )P i R-F mximum nd sturtion energy efficiency E t=((t RT S +T T S +T +T AT A )NP t N (Et+Er+E E r=((t RT S +T )(N )+T T S N+T AT A (N+N ))NP r (9) i) E i =((T IF S +T BO +T SIF S )(N+)+T RT S +T AT A +T )NP i R-F+N mximum nd sturtion energy efficiency E t=((t RT S +T T S +T +T AT A )N+ N T XORAT A)P t N N (Et+Er+E E r=((t RT S +T AT A )N(N )+(T T S N+T XORAT A i) )N+T ( N + N (N )))Pr () N E i =(((T IF S +T BO )N+7T SIF S )(N+)+(T RT S+T AT A )N+ N T )P i A. System Lyout In the Alice-nd-Bo topology, there re rely node nd source nodes. On the contrry, in the cross topology, there re rely node nd source nodes. All the nodes re operting in the ERP-OFM-only mode. Thus, we cn tke dvntge of the dditionl fetures provided y pure IEEE 8.g. The system prmeters nd their vlues re provided in Tle II. The optionl slot time of 9 µs is used. The intervl is µs, which mkes the IFS intervl 8 µs y (6). The minimum W size is nd so the verge ckoff time is 67. µs ccording to (7). The vlues of the power consumed for trnsmitting, receiving, nd idle re tken from [], which re.6,.,. W, respectively. B. iscussion The throughput versus the trffic lod in the Alice-nd-Bo topology is plotted in Fig.. Likewise, the energy efficiency is shown in Fig.. We consider MSU of ytes nd dt rte of Mps. In generl, the performnce of the protocols under evlution increses linerly s the trffic lod from Alice nd Bo increses since the rely node needs to forwrd more pckets. However, we oserve tht the performnce of F reches mximum vlue nd then decreses until stle vlue under sturtion. The mximum vlue corresponds to / of the trffic lod from Alice (/) nd Bo (/). Since the rely node needs to forwrd twice s mny pckets s Alice nd Bo, it will ccess the chnnel hlf of the time. Otherwise, the sturtion vlue corresponds to / of the trffic lod from Alice (/) nd Bo (/). ue to the F firness, when Alice nd Bo ttempt to trnsmit t higher rte, the rely node is unle to increse its cpcity nd cn only get / of the chnnel. When N is enled, F+N llows the rely node to send twice s fst s Alice nd Bo, lthough it will still get / of the chnnel. The rely node is le to send two pckets in single trnsmission nd will e le to increse its cpcity s Alice nd Bo do. The mximum throughput of F+N will e round / of the lod due to the dditionl overhed required for coding. The proposed R-F protocol cn chieve similr performnce to F+N ecuse the rely node is le to send pcket when it receives pcket from either Alice or Bo. However, the rely node will hve to trnsmit twice s mny pckets s Alice nd Bo nd so the nodes will consume higher mounts of energy. In contrst, the proposed

8 Theoreticl throughput gin Theoreticl throughput gin Theoreticl throughput gin Theoreticl energy efficiency gin Theoreticl throughput (Mps) Theoreticl energy efficiency (M/J) Theoreticl throughput (M/J) Theoreticl energy efficiency (M/J) F F+N R-F 9% R-F+N % Totl offered trffic lod (Mps), F 6% F+N, R-F R-F+N %,,, Totl offered trffic lod (Mps) () A&B: Throughput vs. Lod. () A&B: Energy efficiency vs. Lod (c) ross: Throughput vs. Lod. (d) ross: Energy efficiency vs. Lod., F F F+N F+N R-F, R-F R-F+N R-F+N 9% 9% 9% 86%,, Totl offered trffic lod (Mps) Totl offered trffic lod (Mps),,, R-F+N vs F R-F+N vs F+N R-F+N vs R-F,,, R-F+N vs F R-F+N vs F+N R-F+N vs R-F,,, R-F+N vs F R-F+N vs F+N R-F+N vs R-F,, R-F+N vs F R-F+N vs F+N R-F+N vs R-F,,,, 7 7 MA Service t Unit (MSU) length (ytes) (e) ross: Throughput vs. MSU. 7 7 MA Service t Unit (MSU) length (ytes) (f) ross: Energy efficiency vs. MSU t rte (Mps) (g) ross: Throughput vs. t rte t rte (Mps) (h) ross: Energy efficiency vs. t rte. Fig.. Theoreticl throughput nd energy efficiency of the F, F+N, R-F, nd R-F+N s function of the trffic lod, MSU length ( ytes), nd dt rte ( Mps) in the Alice-nd-Bo nd cross topologies. R-F+N protocol chieves the highest performnce s it llows the rely node to send coded pcket s soon s it receives dt pcket from either Alice or Bo. In Figs. c, d, we show the throughput nd energy efficiency of the protocols versus the trffic lod in the cross topology. We oserve tht the proposed protocols cn chieve significntly higher gins when compred to the F nd F+N protocols. The sturtion throughput of F is significntly lower thn tht shown in the Alice-nd-Bo topology. The rely node needs to compete for the chnnel ccess with source nodes. Thus, it cn only get / of the chnnel wheres the source nodes get / of the chnnel. When N is used, the mximum performnce is shown t / of the lod where ech source node gets /6 of the chnnel nd the rely node gets /. However, the performnce will e reduced to / of the chnnel cpcity t / of the lod since the rely node will only get / of the chnnel to trnsmit coded pckets. Figs. e-h summrize the mximum throughput nd energy efficiency gins s function of the MSU length nd the dt rte in the cross topology. The gin of R-F+N versus F decreses s the pcket length increses wheres it decreses s the dt rte increses. The gin compred with F+N shows similr ehviour wheres when compred with R- F the gin shows n opposite ehviour. The min reson for this is tht the time of dt trnsmission hs certin influence on the overll performnce of the protocols. In the R-sed protocols, two dt pckets re trnsmitted within the sme / exchnge. When the pcket length is short or the dt rte is high, the impct of dt trnsmission on the overll trnsmission time is smll. As the pcket length increses or the dt rte decreses, its contriution to the overll trnsmission time ecomes more significnt. V. ONLUSIONS In this pper, we hve nlyzed the upper-ounds of the throughput nd energy efficiency of two R-sed MA protocols with nd without N, nmely, R-F nd R- F+N. Unlike F, R-F llows n intermedite node receiving dt pcket to respond with dt pcket together with the pcket. Unlike F+N, R-F+N llows the receiving intermedite node to trnsmit coded pcket. We hve studied two network topologies, nmely, the Alice-nd- Bo topology nd the cross topology. We hve derived closed expressions for the mximum nd sturtion throughput nd energy efficiency for the proposed protocols nd hve shown numericl results s function of the trffic lod, dt pylod length, nd dt rte. A comprison with the performnce of F nd F+N hs lso een provided. The mximum gins vry from % to 9% s the pcket length increses nd from 7% to 89% s the dt rte increses. Furthermore, we hve shown tht the proposed protocols cn chieve higher gins s the numer of source nodes under the rely s coverge increses. Ongoing work is imed t modeling the throughput nd energy efficiency of the proposed protocols considering the ckoff periods nd contention, s well s non-sturted trffic conditions. REFERENES [] R. Ahlswede, N. i, S.-Y. Li, nd R. Yeung, Network informtion flow, IEEE Trnsctions on Informtion Theory, vol. 6, no., pp. 6,. [] S. Ktti, H. Rhul, W. Hu,. Kti, M. Médrd, nd J. rowcroft, XORs in the Air: Prcticl Wireless Network oding, in AM SIG- OMM, 6, pp.. [] IEEE, Prt : Wireless LAN Medium Access ontrol (MA) nd Physicl Lyer (PHY) Specifictions, IEEE 8. Std.,. [] F. Xie, L. u, Y. Bi, nd L. hen, Populrity Awre Scheduling for Network oding sed ontent istriution in Ad Hoc Networks, in IEEE PIMR, 7, pp..

9 []. Umehr,. Hung, S. enno, M. Morikur, nd T. Sugiym, Enhncement of IEEE 8. nd Network oding for Single-Rely Multi-User Wireless Networks, in IEEE ISPS,, pp. 9. [6] N. e oppi, J. Ning, G. Ppgeorgiou, M. Zorzi, S. Krishnmurthy, nd T. L Port, Network oding Awre Queue Mngement in Multi-Rte Wireless Networks, in IEEE IN,, pp. 7. [7] A. Prmnthn, P. Phlevni,. E. Lucni, nd F. H. P. Fitzek, On the Need of Novel Medium Access ontrol Schemes for Network oding enled Wireless Mesh Networks, in IEEE I,, pp. 6. [8] R. Plcios, F. Grnelli,. Gjic, nd A. Foglr, An Energy-Efficient MA Protocol for Infrstructure WLAN Bsed on Modified PF/F Access Schemes Using Bidirectionl t Pcket Exchnge, in IEEE AMA,, pp. 6. [9] R. Plcios, F. Grnelli,. Klizovich, J. Alonso, nd J. Alonso- Zrte, Energy Efficiency of n Enhnced F Access Method Using Bidirectionl ommunictions for Infrstructure-sed IEEE 8. WLANs, in IEEE AMA,, pp. 8. [] R. Plcios, F. Grnelli, A. Prmnthn, J. Heide, nd F. H. P. Fitzek, oding-wre MA: Providing hnnel Access Priority for Network oding with Reverse irection F for IEEE 8.-sed Wireless Networks, in IEEE I,, ccepted for puliction. [] E.-S. Jung nd N. H. Vidy, An Energy Efficient MA Protocol for Wireless LANs, in IEEE INFOOM, vol.,, pp

Solutions to exercise 1 in ETS052 Computer Communication

Solutions to exercise 1 in ETS052 Computer Communication Solutions to exercise in TS52 Computer Communiction 23 Septemer, 23 If it occupies millisecond = 3 seconds, then second is occupied y 3 = 3 its = kps. kps If it occupies 2 microseconds = 2 6 seconds, then

More information

Multi-beam antennas in a broadband wireless access system

Multi-beam antennas in a broadband wireless access system Multi-em ntenns in rodnd wireless ccess system Ulrik Engström, Mrtin Johnsson, nders Derneryd nd jörn Johnnisson ntenn Reserch Center Ericsson Reserch Ericsson SE-4 84 Mölndl Sweden E-mil: ulrik.engstrom@ericsson.com,

More information

To provide data transmission in indoor

To provide data transmission in indoor Hittite Journl of Science nd Engineering, 2018, 5 (1) 25-29 ISSN NUMBER: 2148-4171 DOI: 10.17350/HJSE19030000074 A New Demodultor For Inverse Pulse Position Modultion Technique Mehmet Sönmez Osmniye Korkut

More information

ABB STOTZ-KONTAKT. ABB i-bus EIB Current Module SM/S Intelligent Installation Systems. User Manual SM/S In = 16 A AC Un = 230 V AC

ABB STOTZ-KONTAKT. ABB i-bus EIB Current Module SM/S Intelligent Installation Systems. User Manual SM/S In = 16 A AC Un = 230 V AC User Mnul ntelligent nstlltion Systems A B 1 2 3 4 5 6 7 8 30 ma 30 ma n = AC Un = 230 V AC 30 ma 9 10 11 12 C ABB STOTZ-KONTAKT Appliction Softwre Current Vlue Threshold/1 Contents Pge 1 Device Chrcteristics...

More information

METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN. Inventor: Brian L. Baskin

METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN. Inventor: Brian L. Baskin METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN Inventor: Brin L. Bskin 1 ABSTRACT The present invention encompsses method of loction comprising: using plurlity of signl trnsceivers to receive one or

More information

MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES

MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES Romn V. Tyshchuk Informtion Systems Deprtment, AMI corportion, Donetsk, Ukrine E-mil: rt_science@hotmil.com 1 INTRODUCTION During the considertion

More information

A Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Radio Networks

A Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Radio Networks Globecom 04 - Wireless Networking Symposium A Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Rdio Networks Xingy Liu nd Jing Xie Deprtment of Electricl nd Computer Engineering

More information

Sequential Logic (2) Synchronous vs Asynchronous Sequential Circuit. Clock Signal. Synchronous Sequential Circuits. FSM Overview 9/10/12

Sequential Logic (2) Synchronous vs Asynchronous Sequential Circuit. Clock Signal. Synchronous Sequential Circuits. FSM Overview 9/10/12 9//2 Sequentil (2) ENGG5 st Semester, 22 Dr. Hden So Deprtment of Electricl nd Electronic Engineering http://www.eee.hku.hk/~engg5 Snchronous vs Asnchronous Sequentil Circuit This Course snchronous Sequentil

More information

A New Algorithm to Compute Alternate Paths in Reliable OSPF (ROSPF)

A New Algorithm to Compute Alternate Paths in Reliable OSPF (ROSPF) A New Algorithm to Compute Alternte Pths in Relile OSPF (ROSPF) Jin Pu *, Eric Mnning, Gholmli C. Shoj, Annd Srinivsn ** PANDA Group, Computer Science Deprtment University of Victori Victori, BC, Cnd Astrct

More information

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad Hll Ticket No Question Pper Code: AEC009 INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigl, Hyderd - 500 043 MODEL QUESTION PAPER Four Yer B.Tech V Semester End Exmintions, Novemer - 2018 Regultions:

More information

CHAPTER 3 AMPLIFIER DESIGN TECHNIQUES

CHAPTER 3 AMPLIFIER DESIGN TECHNIQUES CHAPTER 3 AMPLIFIER DEIGN TECHNIQUE 3.0 Introduction olid-stte microwve mplifiers ply n importnt role in communiction where it hs different pplictions, including low noise, high gin, nd high power mplifiers.

More information

Mixed CMOS PTL Adders

Mixed CMOS PTL Adders Anis do XXVI Congresso d SBC WCOMPA l I Workshop de Computção e Aplicções 14 20 de julho de 2006 Cmpo Grnde, MS Mixed CMOS PTL Adders Déor Mott, Reginldo d N. Tvres Engenhri em Sistems Digitis Universidde

More information

Network-coded Cooperation for Multi-unicast with Non-Ideal Source-Relay Channels

Network-coded Cooperation for Multi-unicast with Non-Ideal Source-Relay Channels This full text pper ws peer reviewed t the direction of IEEE Communictions Society suject mtter experts for puliction in the IEEE ICC 2010 proceedings Network-coded Coopertion for Multi-unicst with Non-Idel

More information

Algorithms for Memory Hierarchies Lecture 14

Algorithms for Memory Hierarchies Lecture 14 Algorithms for emory Hierrchies Lecture 4 Lecturer: Nodri Sitchinv Scribe: ichel Hmnn Prllelism nd Cche Obliviousness The combintion of prllelism nd cche obliviousness is n ongoing topic of reserch, in

More information

The Discussion of this exercise covers the following points:

The Discussion of this exercise covers the following points: Exercise 4 Bttery Chrging Methods EXERCISE OBJECTIVE When you hve completed this exercise, you will be fmilir with the different chrging methods nd chrge-control techniques commonly used when chrging Ni-MI

More information

RT-Link: A Time-Synchronized Link Protocol for Energy Constrained Multi-hop Wireless Networks

RT-Link: A Time-Synchronized Link Protocol for Energy Constrained Multi-hop Wireless Networks RT-Link: A Time-Synchronized Link Protocol for Energy Constrined Multi-hop Wireless Networks Anthony Rowe, Rhul Mnghrm, Rj Rjkumr Electricl nd Computer Engineering Deprtment, Crnegie Mellon University,

More information

Math Circles Finite Automata Question Sheet 3 (Solutions)

Math Circles Finite Automata Question Sheet 3 (Solutions) Mth Circles Finite Automt Question Sheet 3 (Solutions) Nickols Rollick nrollick@uwterloo.c Novemer 2, 28 Note: These solutions my give you the nswers to ll the prolems, ut they usully won t tell you how

More information

Interference Cancellation Method without Feedback Amount for Three Users Interference Channel

Interference Cancellation Method without Feedback Amount for Three Users Interference Channel Open Access Librry Journl 07, Volume, e57 ISSN Online: -97 ISSN Print: -9705 Interference Cncelltion Method without Feedbc Amount for Three Users Interference Chnnel Xini Tin, otin Zhng, Wenie Ji School

More information

A Cluster-based TDMA System for Inter-Vehicle Communications *

A Cluster-based TDMA System for Inter-Vehicle Communications * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 30, 213-231 (2014) A Cluster-bsed TDMA System for Inter-Vehicle Communictions * Deprtment of Electricl Engineering Ntionl Sun Yt-Sen University Kohsiung,

More information

(1) Non-linear system

(1) Non-linear system Liner vs. non-liner systems in impednce mesurements I INTRODUCTION Electrochemicl Impednce Spectroscopy (EIS) is n interesting tool devoted to the study of liner systems. However, electrochemicl systems

More information

Exercise 1-1. The Sine Wave EXERCISE OBJECTIVE DISCUSSION OUTLINE. Relationship between a rotating phasor and a sine wave DISCUSSION

Exercise 1-1. The Sine Wave EXERCISE OBJECTIVE DISCUSSION OUTLINE. Relationship between a rotating phasor and a sine wave DISCUSSION Exercise 1-1 The Sine Wve EXERCISE OBJECTIVE When you hve completed this exercise, you will be fmilir with the notion of sine wve nd how it cn be expressed s phsor rotting round the center of circle. You

More information

Adaptive Network Coding for Wireless Access Networks

Adaptive Network Coding for Wireless Access Networks Adptive Network Coding for Wireless Access Networks Tun Trn School of Electricl Engineering nd Computer Science Oregon Stte University, Corvllis, Oregon 9733 Emil: trntu@eecs.orst.edu Thinh Nguyen School

More information

Genetic Representations for Evolutionary Minimization of Network Coding Resources

Genetic Representations for Evolutionary Minimization of Network Coding Resources Genetic Representtions for Evolutionry Minimiztion of Network Coding Resources Minkyu Kim 1, Vrun Aggrwl 2, Un-My O Reilly 2, Muriel Médrd 1, nd Wonsik Kim 1 1 Lortory for Informtion nd Decision Systems

More information

High-speed Simulation of the GPRS Link Layer

High-speed Simulation of the GPRS Link Layer 989 High-speed Simultion of the GPRS Link Lyer J Gozlvez nd J Dunlop Deprtment of Electronic nd Electricl Engineering, University of Strthclyde 204 George St, Glsgow G-lXW, Scotlnd Tel: +44 4 548 206,

More information

CHAPTER 2 LITERATURE STUDY

CHAPTER 2 LITERATURE STUDY CHAPTER LITERATURE STUDY. Introduction Multipliction involves two bsic opertions: the genertion of the prtil products nd their ccumultion. Therefore, there re two possible wys to speed up the multipliction:

More information

Dataflow Language Model. DataFlow Models. Applications of Dataflow. Dataflow Languages. Kahn process networks. A Kahn Process (1)

Dataflow Language Model. DataFlow Models. Applications of Dataflow. Dataflow Languages. Kahn process networks. A Kahn Process (1) The slides contin revisited mterils from: Peter Mrwedel, TU Dortmund Lothr Thiele, ETH Zurich Frnk Vhid, University of liforni, Riverside Dtflow Lnguge Model Drsticlly different wy of looking t computtion:

More information

On the Description of Communications Between Software Components with UML

On the Description of Communications Between Software Components with UML On the Description of Communictions Between Softwre Components with UML Zhiwei An Dennis Peters Fculty of Engineering nd Applied Science Memoril University of Newfoundlnd St. John s NL A1B 3X5 zhiwei@engr.mun.c

More information

Efficient and Resilient Key Discovery based on Pseudo-Random Key Pre-Deployment

Efficient and Resilient Key Discovery based on Pseudo-Random Key Pre-Deployment Efficient nd Resilient Key Discovery sed on Pseudo-Rndom Key Pre-Deployment p. 1 Efficient nd Resilient Key Discovery sed on Pseudo-Rndom Key Pre-Deployment Roerto Di Pietro, Luigi V. Mncini, nd Alessndro

More information

Localization of Latent Image in Heterophase AgBr(I) Tabular Microcrystals

Localization of Latent Image in Heterophase AgBr(I) Tabular Microcrystals Interntionl ymposium on ilver Hlide Technology Locliztion of Ltent Imge in Heterophse AgBr(I) Tulr Microcrystls Elen V. Prosvirkin, Aigul B. Aishev, Timothy A. Lrichev, Boris A. echkrev Kemerovo tte University,

More information

Y9.ET1.3 Implementation of Secure Energy Management against Cyber/physical Attacks for FREEDM System

Y9.ET1.3 Implementation of Secure Energy Management against Cyber/physical Attacks for FREEDM System Y9.ET1.3 Implementtion of Secure Energy ngement ginst Cyber/physicl Attcks for FREED System Project Leder: Fculty: Students: Dr. Bruce cillin Dr. o-yuen Chow Jie Dun 1. Project Gols Develop resilient cyber-physicl

More information

Kirchhoff s Rules. Kirchhoff s Laws. Kirchhoff s Rules. Kirchhoff s Laws. Practice. Understanding SPH4UW. Kirchhoff s Voltage Rule (KVR):

Kirchhoff s Rules. Kirchhoff s Laws. Kirchhoff s Rules. Kirchhoff s Laws. Practice. Understanding SPH4UW. Kirchhoff s Voltage Rule (KVR): SPH4UW Kirchhoff s ules Kirchhoff s oltge ule (K): Sum of voltge drops round loop is zero. Kirchhoff s Lws Kirchhoff s Current ule (KC): Current going in equls current coming out. Kirchhoff s ules etween

More information

Throughput of Wireless Relay Networks with Interference Processing

Throughput of Wireless Relay Networks with Interference Processing NCC 2009, Jnury 16-18, IIT Guwhti 170 Throughput of Wireless Rely Networks with Interference Processing M. Bm, rikrishn Bhshym nd Andrew Thngrj, eprtment of Electricl Engineering, Indin Institute of Technology,

More information

Experiment 3: Non-Ideal Operational Amplifiers

Experiment 3: Non-Ideal Operational Amplifiers Experiment 3: Non-Idel Opertionl Amplifiers Fll 2009 Equivlent Circuits The bsic ssumptions for n idel opertionl mplifier re n infinite differentil gin ( d ), n infinite input resistnce (R i ), zero output

More information

CSI-SF: Estimating Wireless Channel State Using CSI Sampling & Fusion

CSI-SF: Estimating Wireless Channel State Using CSI Sampling & Fusion CSI-SF: Estimting Wireless Chnnel Stte Using CSI Smpling & Fusion Riccrdo Crepldi, Jeongkeun Lee, Rul Etkin, Sung-Ju Lee, Robin Krvets University of Illinois t Urbn-Chmpign Hewlett-Pckrd Lbortories Emil:{rcrepl,rhk}@illinoisedu,

More information

Experiment 3: Non-Ideal Operational Amplifiers

Experiment 3: Non-Ideal Operational Amplifiers Experiment 3: Non-Idel Opertionl Amplifiers 9/11/06 Equivlent Circuits The bsic ssumptions for n idel opertionl mplifier re n infinite differentil gin ( d ), n infinite input resistnce (R i ), zero output

More information

Open Access A Novel Parallel Current-sharing Control Method of Switch Power Supply

Open Access A Novel Parallel Current-sharing Control Method of Switch Power Supply Send Orders for Reprints to reprints@enthmscience.e 170 The Open Electricl & Electronic Engineering Journl, 2014, 8, 170-177 Open Access A Novel Prllel Current-shring Control Method of Switch Power Supply

More information

Travel Prediction-based Data Forwarding for Sparse Vehicular Networks. Technical Report

Travel Prediction-based Data Forwarding for Sparse Vehicular Networks. Technical Report Trvel Prediction-sed Dt Forwrding for Sprse Vehiculr Networks Technicl Report Deprtment of Computer Science nd Engineering University of Minnesot 4-192 Keller Hll 200 Union Street SE Minnepolis, MN 55455-0159

More information

& Y Connected resistors, Light emitting diode.

& Y Connected resistors, Light emitting diode. & Y Connected resistors, Light emitting diode. Experiment # 02 Ojectives: To get some hndson experience with the physicl instruments. To investigte the equivlent resistors, nd Y connected resistors, nd

More information

LATEST CALIBRATION OF GLONASS P-CODE TIME RECEIVERS

LATEST CALIBRATION OF GLONASS P-CODE TIME RECEIVERS LATEST CALIBRATION OF GLONASS P-CODE TIME RECEIVERS A. Fos 1, J. Nwroci 2, nd W. Lewndowsi 3 1 Spce Reserch Centre of Polish Acdemy of Sciences, ul. Brtyc 18A, 00-716 Wrsw, Polnd; E-mil: fos@c.ww.pl; Tel.:

More information

Discontinued AN6262N, AN6263N. (planed maintenance type, maintenance type, planed discontinued typed, discontinued type)

Discontinued AN6262N, AN6263N. (planed maintenance type, maintenance type, planed discontinued typed, discontinued type) ICs for Cssette, Cssette Deck ANN, ANN Puse Detection s of Rdio Cssette, Cssette Deck Overview The ANN nd the ANN re the puse detection integrted circuits which select the progrm on the cssette tpe. In

More information

Geometric quantities for polar curves

Geometric quantities for polar curves Roerto s Notes on Integrl Clculus Chpter 5: Bsic pplictions of integrtion Section 10 Geometric quntities for polr curves Wht you need to know lredy: How to use integrls to compute res nd lengths of regions

More information

Area-Time Efficient Digit-Serial-Serial Two s Complement Multiplier

Area-Time Efficient Digit-Serial-Serial Two s Complement Multiplier Are-Time Efficient Digit-Seril-Seril Two s Complement Multiplier Essm Elsyed nd Htem M. El-Boghddi Computer Engineering Deprtment, Ciro University, Egypt Astrct - Multipliction is n importnt primitive

More information

Network Sharing and its Energy Benefits: a Study of European Mobile Network Operators

Network Sharing and its Energy Benefits: a Study of European Mobile Network Operators Network Shring nd its Energy Benefits: Study of Europen Mobile Network Opertors Mrco Ajmone Mrsn Electronics nd Telecommunictions Dept Politecnico di Torino, nd Institute IMDEA Networks, mrco.jmone@polito.it

More information

ISSCC 2006 / SESSION 21 / ADVANCED CLOCKING, LOGIC AND SIGNALING TECHNIQUES / 21.5

ISSCC 2006 / SESSION 21 / ADVANCED CLOCKING, LOGIC AND SIGNALING TECHNIQUES / 21.5 21.5 A 1.1GHz Chrge-Recovery Logic Visvesh Sthe, Jung-Ying Chueh, Mrios Ppefthymiou University of Michign, Ann Aror, MI Boost Logic is chrge-recovery circuit fmily cple of operting t GHz-clss frequencies

More information

CS 135: Computer Architecture I. Boolean Algebra. Basic Logic Gates

CS 135: Computer Architecture I. Boolean Algebra. Basic Logic Gates Bsic Logic Gtes : Computer Architecture I Boolen Algebr Instructor: Prof. Bhgi Nrhri Dept. of Computer Science Course URL: www.ses.gwu.edu/~bhgiweb/cs35/ Digitl Logic Circuits We sw how we cn build the

More information

Synchronous Machine Parameter Measurement

Synchronous Machine Parameter Measurement Synchronous Mchine Prmeter Mesurement 1 Synchronous Mchine Prmeter Mesurement Introduction Wound field synchronous mchines re mostly used for power genertion but lso re well suited for motor pplictions

More information

Chapter 2 Literature Review

Chapter 2 Literature Review Chpter 2 Literture Review 2.1 ADDER TOPOLOGIES Mny different dder rchitectures hve een proposed for inry ddition since 1950 s to improve vrious spects of speed, re nd power. Ripple Crry Adder hve the simplest

More information

Simulation of Transformer Based Z-Source Inverter to Obtain High Voltage Boost Ability

Simulation of Transformer Based Z-Source Inverter to Obtain High Voltage Boost Ability Interntionl Journl of cience, Engineering nd Technology Reserch (IJETR), olume 4, Issue 1, October 15 imultion of Trnsformer Bsed Z-ource Inverter to Obtin High oltge Boost Ability A.hnmugpriy 1, M.Ishwry

More information

Synchronous Machine Parameter Measurement

Synchronous Machine Parameter Measurement Synchronous Mchine Prmeter Mesurement 1 Synchronous Mchine Prmeter Mesurement Introduction Wound field synchronous mchines re mostly used for power genertion but lso re well suited for motor pplictions

More information

Jamming-Resistant Collaborative Broadcast In Wireless Networks, Part II: Multihop Networks

Jamming-Resistant Collaborative Broadcast In Wireless Networks, Part II: Multihop Networks Jmming-Resistnt ollbortive Brodcst In Wireless Networks, Prt II: Multihop Networks Ling Xio Ximen University, hin 361005 Emil: lxio@xmu.edu.cn Huiyu Di N Stte University, Rleigh, N 27695 Emil: huiyu di@ncsu.edu

More information

DIGITAL multipliers [1], [2] are the core components of

DIGITAL multipliers [1], [2] are the core components of World Acdemy of Science, Engineering nd Technology 9 8 A Reduced-Bit Multipliction Algorithm for Digitl Arithmetic Hrpreet Singh Dhillon nd Ahijit Mitr Astrct A reduced-it multipliction lgorithm sed on

More information

Electronic Circuits I - Tutorial 03 Diode Applications I

Electronic Circuits I - Tutorial 03 Diode Applications I Electronic Circuits I - Tutoril 03 Diode Applictions I -1 / 9 - T & F # Question 1 A diode cn conduct current in two directions with equl ese. F 2 When reverse-bised, diode idelly ppers s short. F 3 A

More information

University of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): /iet-com.2017.

University of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): /iet-com.2017. Ameen, A. S., Berrki, D., Doufexi, A., & Nix, A. R. (2018). LTE-Advnced network inter-cell interference nlysis nd mitigtion using 3D nlogue emforming. IET Communictions, 12(13), 1563-1572. DOI: 10.1049/ietcom.2017.0765

More information

D I G I TA L C A M E R A S PA RT 4

D I G I TA L C A M E R A S PA RT 4 Digitl Cmer Technologies for Scientific Bio-Imging. Prt 4: Signl-to-Noise Rtio nd Imge Comprison of Cmers Yshvinder Shrwl, Solexis Advisors LLC, Austin, TX, USA B I O G R A P H Y Yshvinder Shrwl hs BS

More information

Asynchronous Data-Driven Circuit Synthesis

Asynchronous Data-Driven Circuit Synthesis Asynchronous Dt-Driven Circuit Synthesis Sm Tylor, Doug Edwrds, Luis A Pln, Senior Memer, IEEE nd Luis A. Trzon D., Student Memer, IEEE Astrct A method is descried for synthesising synchronous circuits

More information

Student Book SERIES. Patterns and Algebra. Name

Student Book SERIES. Patterns and Algebra. Name E Student Book 3 + 7 5 + 5 Nme Contents Series E Topic Ptterns nd functions (pp. ) identifying nd creting ptterns skip counting completing nd descriing ptterns predicting repeting ptterns predicting growing

More information

Module 9. DC Machines. Version 2 EE IIT, Kharagpur

Module 9. DC Machines. Version 2 EE IIT, Kharagpur Module 9 DC Mchines Version EE IIT, Khrgpur esson 40 osses, Efficiency nd Testing of D.C. Mchines Version EE IIT, Khrgpur Contents 40 osses, efficiency nd testing of D.C. mchines (esson-40) 4 40.1 Gols

More information

Design and implementation of a high-speed bit-serial SFQ adder based on the binary decision diagram

Design and implementation of a high-speed bit-serial SFQ adder based on the binary decision diagram INSTITUTE OFPHYSICS PUBLISHING Supercond. Sci. Technol. 16 (23) 1497 152 SUPERCONDUCTORSCIENCE AND TECHNOLOGY PII: S953-248(3)67111-3 Design nd implementtion of high-speed it-seril SFQ dder sed on the

More information

Compared to generators DC MOTORS. Back e.m.f. Back e.m.f. Example. Example. The construction of a d.c. motor is the same as a d.c. generator.

Compared to generators DC MOTORS. Back e.m.f. Back e.m.f. Example. Example. The construction of a d.c. motor is the same as a d.c. generator. Compred to genertors DC MOTORS Prepred by Engr. JP Timol Reference: Electricl nd Electronic Principles nd Technology The construction of d.c. motor is the sme s d.c. genertor. the generted e.m.f. is less

More information

MEASURE THE CHARACTERISTIC CURVES RELEVANT TO AN NPN TRANSISTOR

MEASURE THE CHARACTERISTIC CURVES RELEVANT TO AN NPN TRANSISTOR Electricity Electronics Bipolr Trnsistors MEASURE THE HARATERISTI URVES RELEVANT TO AN NPN TRANSISTOR Mesure the input chrcteristic, i.e. the bse current IB s function of the bse emitter voltge UBE. Mesure

More information

On the Prediction of EPON Traffic Using Polynomial Fitting in Optical Network Units

On the Prediction of EPON Traffic Using Polynomial Fitting in Optical Network Units On the Prediction of EP Trffic Using Polynomil Fitting in Opticl Networ Units I. Mmounis (1),(3), K. Yinnopoulos (2), G. Ppdimitriou (4), E. Vrvrigos (1),(3) (1) Computer Technology Institute nd Press

More information

Soft-decision Viterbi Decoding with Diversity Combining. T.Sakai, K.Kobayashi, S.Kubota, M.Morikura, S.Kato

Soft-decision Viterbi Decoding with Diversity Combining. T.Sakai, K.Kobayashi, S.Kubota, M.Morikura, S.Kato Softdecision Viterbi Decoding with Diversity Combining T.Ski, K.Kobyshi, S.Kubot, M.Morikur, S.Kto NTT Rdio Communiction Systems Lbortories 2356 Tke, Yokosukshi, Kngw, 2383 Jpn ABSTRACT Diversity combining

More information

Alternating-Current Circuits

Alternating-Current Circuits chpter 33 Alternting-Current Circuits 33.1 AC Sources 33.2 esistors in n AC Circuit 33.3 Inductors in n AC Circuit 33.4 Cpcitors in n AC Circuit 33.5 The LC Series Circuit 33.6 Power in n AC Circuit 33.7

More information

BP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks

BP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks BP-PP: Belief Propgtion-Bsed Trust nd Reputtion Mngement for PP Networs Ermn Aydy School of Electricl nd Comp. Eng. Georgi Institute of Technology Atlnt, GA 333, USA Emil: eydy@gtech.edu Frmrz Feri School

More information

FOMA M702iG Manual for Data Communication

FOMA M702iG Manual for Data Communication FOMA M702iG Mnul for Dt Communiction Dt Communictions... 1 Before Using... 2 Prepring for Dt Communiction... 3 Instlling the Communiction Configurtion Files (Drivers)... 4 Connecting the FOMA Hndset nd

More information

Information-Coupled Turbo Codes for LTE Systems

Information-Coupled Turbo Codes for LTE Systems Informtion-Coupled Turbo Codes for LTE Systems Lei Yng, Yixun Xie, Xiowei Wu, Jinhong Yun, Xingqing Cheng nd Lei Wn rxiv:709.06774v [cs.it] 20 Sep 207 Abstrct We propose new clss of informtion-coupled

More information

BP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks

BP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks 1 9th Annul IEEE Communictions Society Conference on Sensor, Mesh nd Ad Hoc Communictions nd Networs (SECON) BP-PP: Belief Propgtion-Bsed Trust nd Reputtion Mngement for PP Networs Ermn Aydy School of

More information

A Novel Back EMF Zero Crossing Detection of Brushless DC Motor Based on PWM

A Novel Back EMF Zero Crossing Detection of Brushless DC Motor Based on PWM A ovel Bck EMF Zero Crossing Detection of Brushless DC Motor Bsed on PWM Zhu Bo-peng Wei Hi-feng School of Electricl nd Informtion, Jingsu niversity of Science nd Technology, Zhenjing 1003 Chin) Abstrct:

More information

CDMA One. International summer students courses: "Plugged In: Modern Networks and Services in Telecommunication"

CDMA One. International summer students courses: Plugged In: Modern Networks and Services in Telecommunication INTRAROM S.A. ROMANIAN TELECOMMUNICATIONS AND ELECTRONICS INDUSTRY ROMANIA, Buchrest, 17 Fbric de Glucoz St., Sector 2 Cod 72322, Tel:(+40 1) 2040600 Fx:(+40 1) 2040611 http://www.intrrom.ro Interntionl

More information

THE STUDY OF INFLUENCE CORE MATERIALS ON TECHNOLOGICAL PROPERTIES OF UNIVERSAL BENTONITE MOULDING MATERIALS. Matej BEZNÁK, Vladimír HANZEN, Ján VRABEC

THE STUDY OF INFLUENCE CORE MATERIALS ON TECHNOLOGICAL PROPERTIES OF UNIVERSAL BENTONITE MOULDING MATERIALS. Matej BEZNÁK, Vladimír HANZEN, Ján VRABEC THE STUDY OF INFLUENCE CORE MATERIALS ON TECHNOLOGICAL PROPERTIES OF UNIVERSAL BENTONITE MOULDING MATERIALS Mtej BEZNÁK, Vldimír HANZEN, Ján VRABEC Authors: Mtej Beznák, Assoc. Prof. PhD., Vldimír Hnzen,

More information

Energy Harvesting Two-Way Channels With Decoding and Processing Costs

Energy Harvesting Two-Way Channels With Decoding and Processing Costs IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING, VOL., NO., MARCH 07 3 Energy Hrvesting Two-Wy Chnnels With Decoding nd Processing Costs Ahmed Arf, Student Member, IEEE, Abdulrhmn Bknin, Student

More information

Implementation of Different Architectures of Forward 4x4 Integer DCT For H.264/AVC Encoder

Implementation of Different Architectures of Forward 4x4 Integer DCT For H.264/AVC Encoder Implementtion of Different Architectures of Forwrd 4x4 Integer DCT For H.64/AVC Encoder Bunji Antoinette Ringnyu, Ali Tngel, Emre Krulut 3 Koceli University, Institute of Science nd Technology, Koceli,

More information

A COMPARISON OF CIRCUIT IMPLEMENTATIONS FROM A SECURITY PERSPECTIVE

A COMPARISON OF CIRCUIT IMPLEMENTATIONS FROM A SECURITY PERSPECTIVE A COMPARISON OF CIRCUIT IMPLEMENTATIONS FROM A SECURITY PERSPECTIVE Mster Thesis Division of Electronic Devices Deprtment of Electricl Engineering Linköping University y Timmy Sundström LITH-ISY-EX--05/3698--SE

More information

Study on SLT calibration method of 2-port waveguide DUT

Study on SLT calibration method of 2-port waveguide DUT Interntionl Conference on Advnced Electronic cience nd Technology (AET 206) tudy on LT clibrtion method of 2-port wveguide DUT Wenqing Luo, Anyong Hu, Ki Liu nd Xi Chen chool of Electronics nd Informtion

More information

Understanding Basic Analog Ideal Op Amps

Understanding Basic Analog Ideal Op Amps Appliction Report SLAA068A - April 2000 Understnding Bsic Anlog Idel Op Amps Ron Mncini Mixed Signl Products ABSTRACT This ppliction report develops the equtions for the idel opertionl mplifier (op mp).

More information

Synchronous Generator Line Synchronization

Synchronous Generator Line Synchronization Synchronous Genertor Line Synchroniztion 1 Synchronous Genertor Line Synchroniztion Introduction One issue in power genertion is synchronous genertor strting. Typiclly, synchronous genertor is connected

More information

Topic 20: Huffman Coding

Topic 20: Huffman Coding Topic 0: Huffmn Coding The uthor should gze t Noh, nd... lern, s they did in the Ark, to crowd gret del of mtter into very smll compss. Sydney Smith, dinburgh Review Agend ncoding Compression Huffmn Coding

More information

Software for the automatic scaling of critical frequency f 0 F2 and MUF(3000)F2 from ionograms applied at the Ionospheric Observatory of Gibilmanna

Software for the automatic scaling of critical frequency f 0 F2 and MUF(3000)F2 from ionograms applied at the Ionospheric Observatory of Gibilmanna ANNALS OF GEOPHYSICS, VOL. 47, N. 6, Decemer 2004 Softwre for the utomtic scling of criticl frequency f 0 F2 nd MUF(3000)F2 from ionogrms pplied t the Ionospheric Oservtory of Giilmnn Michel Pezzopne nd

More information

An Analog Baseband Approach for Designing Full-Duplex Radios

An Analog Baseband Approach for Designing Full-Duplex Radios An Anlog Bsend Approch for Designing Full-Duplex Rdios Brett Kufmn, Jorm Lilleerg, nd Behnm Azhng Center for Multimedi Communiction, Rice University, Houston, Texs, USA Centre for Wireless Communictions,

More information

Experiment 3: The research of Thevenin theorem

Experiment 3: The research of Thevenin theorem Experiment 3: The reserch of Thevenin theorem 1. Purpose ) Vlidte Thevenin theorem; ) Mster the methods to mesure the equivlent prmeters of liner twoterminl ctive. c) Study the conditions of the mximum

More information

Postprint. This is the accepted version of a paper presented at IEEE PES General Meeting.

Postprint.   This is the accepted version of a paper presented at IEEE PES General Meeting. http://www.div-portl.org Postprint This is the ccepted version of pper presented t IEEE PES Generl Meeting. Cittion for the originl published pper: Mhmood, F., Hooshyr, H., Vnfretti, L. (217) Sensitivity

More information

Digital Design. Sequential Logic Design -- Controllers. Copyright 2007 Frank Vahid

Digital Design. Sequential Logic Design -- Controllers. Copyright 2007 Frank Vahid Digitl Design Sequentil Logic Design -- Controllers Slides to ccompny the tetook Digitl Design, First Edition, y, John Wiley nd Sons Pulishers, 27. http://www.ddvhid.com Copyright 27 Instructors of courses

More information

DP4T RF CMOS Switch: A Better Option to Replace the SPDT Switch and DPDT Switch

DP4T RF CMOS Switch: A Better Option to Replace the SPDT Switch and DPDT Switch Send Orders of Reprints t reprints@enthmscience.org 244 Recent Ptents on Electricl & Electronic Engineering 2012, 5, 244-248 DP4T RF CMOS Switch: A Better Option to Replce the SPDT Switch nd DPDT Switch

More information

DYE SOLUBILITY IN SUPERCRITICAL CARBON DIOXIDE FLUID

DYE SOLUBILITY IN SUPERCRITICAL CARBON DIOXIDE FLUID THERMAL SCIENCE, Yer 2015, Vol. 19, No. 4, pp. 1311-1315 1311 DYE SOLUBILITY IN SUPERCRITICAL CARBON DIOXIDE FLUID by Jun YAN, Li-Jiu ZHENG *, Bing DU, Yong-Fng QIAN, nd Fng YE Lioning Provincil Key Lbortory

More information

PRO LIGNO Vol. 11 N pp

PRO LIGNO Vol. 11 N pp THE INFLUENCE OF THE TOOL POINT ANGLE AND FEED RATE ON THE DELAMINATION AT DRILLING OF PRE-LAMINATED PARTICLEBOARD Mihi ISPAS Prof.dr.eng. Trnsilvni University of Brsov Fculty of Wood Engineering Address:

More information

Distributed two-hop proportional fair resource allocation in Long Term Evolution Advanced networks

Distributed two-hop proportional fair resource allocation in Long Term Evolution Advanced networks WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. 2016; 16:264 278 Published online 12 August 2014 in Wiley Online Librry (wileyonlinelibrry.com)..2517 RESEARCH ARTICLE Distributed

More information

Proceedings of Meetings on Acoustics

Proceedings of Meetings on Acoustics Proceedings of Meetings on Acoustics Volume 19, 2013 http://cousticlsociety.org/ ICA 2013 Montrel Montrel, Cnd 2-7 June 2013 Signl Processing in Acoustics Session 4SP: Sensor Arry Bemforming nd Its Applictions

More information

Quick convergecast in ZigBee beacon-enabled tree-based wireless sensor networks

Quick convergecast in ZigBee beacon-enabled tree-based wireless sensor networks Aville online t www.sciencedirect.com Computer Communictions (8) 999 www.elsevier.com/locte/comcom Quick convergecst in ZigBee econ-enled tree-sed wireless sensor networks Meng-Shiun Pn *, Yu-Chee Tseng

More information

Fair Coalitions for Power-Aware Routing in Wireless Networks

Fair Coalitions for Power-Aware Routing in Wireless Networks Fir Colitions for Power-Awre Routing in Wireless Networks Rtul K. Guh, Crl A. Gunter nd Sswti Srkr University of Pennsylvni {rguh@ses, gunter@.cis, swti@.ee }.upenn.edu Astrct Severl power wre routing

More information

Use of compiler optimization of software bypassing as a method to improve energy efficiency of exposed data path architectures

Use of compiler optimization of software bypassing as a method to improve energy efficiency of exposed data path architectures Guzm et l. EURASIP Journl on Emedded Systems 213, 213:9 RESEARCH Open Access Use of compiler optimiztion of softwre ypssing s method to improve energy efficiency of exposed dt pth rchitectures Vldimír

More information

Application Note. Differential Amplifier

Application Note. Differential Amplifier Appliction Note AN367 Differentil Amplifier Author: Dve n Ess Associted Project: Yes Associted Prt Fmily: CY8C9x66, CY8C7x43, CY8C4x3A PSoC Designer ersion: 4. SP3 Abstrct For mny sensing pplictions, desirble

More information

Distance dependent Call Blocking Probability, and Area Erlang Efficiency of Cellular Networks

Distance dependent Call Blocking Probability, and Area Erlang Efficiency of Cellular Networks Distnce dependent Cll Blocking Probbility, nd Are Erlng Efficiency of Cellulr Networks Subhendu Btbyl 1, Suvr Sekhr Ds 1,2 1 G.S.Snyl School of Telecommuniction, Indin Institute of Technology Khrgpur,

More information

VLSI Design of High-Throughput SISO-OFDM and MIMO-OFDM Baseband Transceivers for Wireless LAN Networks

VLSI Design of High-Throughput SISO-OFDM and MIMO-OFDM Baseband Transceivers for Wireless LAN Networks 74 ECTI TRANSACTIONS ON ELECTRICAL ENG., ELECTRONICS, AND COMMUNICATIONS VOL.5, NO.2 August 2007 VLSI Design of High-Throughput SISO-OFDM nd MIMO-OFDM Bsend Trnsceivers for Wireless LAN Networks Shingo

More information

Information Caching Strategy for Cyber Social Computing Based Wireless Networks

Information Caching Strategy for Cyber Social Computing Based Wireless Networks Received 4 December 26; revised 23 Februry 27; ccepted 2 April 27. Dte of publiction 28 April 27; dte of current version 6 September 27. Digitl Object Identifier.9/TETC.27.2699695 Informtion Cching Strtegy

More information

FPGA Based Five-Phase Sinusoidal PWM Generator

FPGA Based Five-Phase Sinusoidal PWM Generator 22 IEEE Interntionl Conference on Power nd Energy (PECon), 25 Decemer 22, Kot Kinlu Sh, Mlysi FPGA Bsed FivePhse Sinusoidl PWM Genertor Tole Sutikno Dept. of Electricl Engineering Universits Ahmd Dhln

More information

Experimental Application of H Output-Feedback Controller on Two Links of SCARA Robot

Experimental Application of H Output-Feedback Controller on Two Links of SCARA Robot INTERNATIONAL JOURNAL OF CONTROL, AUTOMATION AND SYSTEMS VOL.5 NO. Jnury 6 ISSN 65-877 (Print) ISSN 65-885 (Online) http://www.reserchpu.org/journl/jc/jc.html Experimentl Appliction of H Output-Feedck

More information

The Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center

The Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center Resource Overview Quntile Mesure: Skill or Concept: 300Q Model the concept of ddition for sums to 10. (QT N 36) Model the concept of sutrction using numers less thn or equl to 10. (QT N 37) Write ddition

More information

Redundancy Data Elimination Scheme Based on Stitching Technique in Image Senor Networks

Redundancy Data Elimination Scheme Based on Stitching Technique in Image Senor Networks Sensors & Trnsducers 204 by IFSA Publishing, S. L. http://www.sensorsportl.com Redundncy Dt Elimintion Scheme Bsed on Stitching Technique in Imge Senor Networks hunling Tng hongqing Technology nd Business

More information

Eliminating Non-Determinism During Test of High-Speed Source Synchronous Differential Buses

Eliminating Non-Determinism During Test of High-Speed Source Synchronous Differential Buses Eliminting Non-Determinism During of High-Speed Source Synchronous Differentil Buses Abstrct The t-speed functionl testing of deep sub-micron devices equipped with high-speed I/O ports nd the synchronous

More information

CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2005

CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2005 CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2005 EXPERIMENT 1 FUNDAMENTALS 1. GOALS : Lern how to develop cr lrm digitl circuit during which the following re introduced : CS2204 l fundmentls, nd

More information