Beamforming in Wireless Relay Networks

Size: px
Start display at page:

Download "Beamforming in Wireless Relay Networks"

Transcription

1 1 Beaforng n Wreess Reay Networks YINDI JING AND HAMID JAFARKHANI Departent of Coputer Scence and Eectrca Engneerng Unversty of Caforna Irvne Irvne CA 9697 Abstract Ths paper s on reay beaforng n wreess networks n whch the recever has perfect nforaton of a channes and each reay knows ts own channes Instead of the coony used tota power constrant on reays and the transtter we use a ore practca assupton that every node n the network has ts own power constrant A twostep apfy-and-forward protoco wth beaforng s used n whch the transtter and reays are aowed to adaptvey adust ther transt power and drectons accordng to avaabe channe nforaton The opta beaforng probe s soved anaytcay The copexty of fndng the exact souton s near n the nuber of reays Our resuts show that the transtter shoud aways use ts axa power and the opta power used at a reay s not a bnary functon It can take any vaue between zero and ts axu transt power Aso nterestngy ths vaue depends on the quaty of a other channes n addton to the reay s own ones Despte ths coupng fact dstrbutve strateges are proposed n whch wth the ad of a ow-rate broadcast fro the recever a reay needs ony ts own channe nforaton to peent the opta power contro Suated perforance shows that network beaforng acheves fu dversty and outperfors other exstng schees Index Ters Reay network beaforng cooperatve dversty I INTRODUCTION It s we-known that due to the fadng effect the transsson over wreess channes suffers fro severe attenuaton n sgna strength Perforance of wreess councaton s uch worse than that of wred councaton For the spest pont-to-pont councaton syste whch s coposed of one transtter and one recever ony the use of utpe antennas can prove the syste capacty and reabty Space-te codng and beaforng are aong the ost successfu technques deveoped for utpe-antenna systes durng the ast few decades [1] [] However n any stuatons due to the ted sze and processng power t s not practca for soe users especay sa wreess obe devces to have utpe antennas Thus recenty wreess network councaton s attractng ore and ore attenton A arge aount of effort has been gven to prove the councaton by havng dfferent users n a network cooperate Ths proveent s conventonay addressed as cooperatve dversty and the technques are addressed as cooperatve schees Many cooperatve schees have been proposed n the terature [3] [1] Soe assue channe nforaton at the recever but not the transtter and reays for exape the noncoherent apfy-and-forward protoco n [8] [9] and dstrbuted spacete codng n [10] Soe assue channe nforaton at the recevng sde of each transsson for exape the decodeand-forward protoco n [8] [1] and the coded-cooperaton n [13] Soe assue no channe nforaton at any node for exape the dfferenta transsson schees proposed ndependenty n [14] [16] The coherent apfy-and-forward schee n [9] [11] assues fu channe nforaton at both reays and the recever But ony channe phase nforaton s used at reays In a these cooperatve schees the reays aways cooperate on ther hghest powers None of the above poneer work aow reays to adust ther transt powers adaptvey accordng to channe agntude nforaton and ths s exacty the concern of ths paper There have been severa papers on reay networks wth adaptve power contro In [] [3] the outage capacty of networks wth a snge reay and perfect channe nforaton at a nodes was anayzed Both work assue a tota power constrant on the reay and the transtter A decode-andforward protoco s used at the reay whch resuts n a bnary power aocaton between the reay and the transtter In [4] perforance of networks wth utpe apfy-and-forward reays and an aggregate power constrant was anayzed A dstrbutve schee for the opta power aocaton s proposed n whch each reay ony needs to know ts own channes and a rea nuber that can be broadcasted by the recever Another reated work on networks wth one and two apfyand-forward reays can be found n [5] In [6] outage nzaton of snge-reay networks wth ted channenforaton feedback s perfored It s assued that there s a ong-ter power constrant on the tota power of the transtter and the reay In [38] we anaytcay sove the reay power contro probe for networks wth two reays and provde an teratve agorth for networks wth ore than two reays In ths paper we consder networks wth a genera nuber of apfy-and-forward reays and we assue a separate power constrant on each reay and the transtter The anaytca power contro souton for networks wth any nuber of reays s found Due to the dfference n the power assuptons copared to [4] anayss of ths new ode s ore dffcut and totay dfferent resuts are obtaned For utpe-antenna systes when there s no channe nforaton at the transtter space-te codng can acheve fu dversty [1] If the transtter has perfect or parta channe nforaton perforance can be further proved through beaforng snce t takes advantage of the channe nforaton both drecton and strength at the transtter sde to obtan hgher receve SNR [] Wth perfect channe nforaton or hgh quaty channe nforaton at the transtter one-densona beaforng s proved opta [] [7] [8] The ore practca utpe-antenna systes wth parta channe nforaton at the transtter channe statstcs or quantzed nstantaneous channe nforaton are

2 s Fg 1 transtter f f 1 f Wreess reay network R r reays r r R t t t 1 R g g 1 g R recever aso anayzed extensvey [9] [33] In any stuatons approprate cobnaton of beaforng and space-te codng outperfors ether one of the two schees aone [34] [37] In ths paper we w see sar perforance proveent n networks usng network beaforng over dstrbuted spacete codng and other exstng schees such as best-reay seecton and coherent apfy-and-forward We consder networks wth one par of transtter and recever but utpe reays The recever knows a channes and every reay knows ts own channes perfecty A twostep apfy-and-forward protoco s used where n the frst step the transtter sends nforaton and n the second step the reays transt Frst t s proved that the transtter shoud aways use ts fu power Then the opta reay beaforng vector s found anaytcay The exact souton can be obtaned wth a copexty that s near n the nuber of reays To perfor network beaforng we propose two dstrbutve strateges n whch a reay needs ony ts own channe nforaton and a ow-rate feedback fro the recever whch s coon to a reays Suaton shows that network beaforng outperfors other exstng schees We shoud carfy that ony apfy-and-forward s consdered here For decode-and-forward the resut ay be dfferent and t depends on the detas of the codng schees The paper s organzed as foows In the next secton the reay network ode and the dea of network beaforng are ntroduced In Secton III the network beaforng probe s soved anaytcay Then n Secton IV we propose two schees to peent the opta reay beaforng dstrbutvey n networks Suated perforance of network beaforng and ts coparson to other schees are shown n Secton V Secton VI contans the concuson and severa future drectons Notaton: For a atrx A A T and A denote the transpose and Hertan of A ndcates the nner product ndcates the -nor P ndcates the probabty a denotes the th coordnate of vector a and a 1 k denotes the k- densona vector [ a 1 a k ] T If ab are two R- densona vectors a b eans a b for a 1R 0 R s the R-densona vector wth a zero entres II NETWORK MODEL AND PROBLEM STATEMENT Consder a reay network wth one transt-and-receve par and R reays as depcted n Fg 1 Every reay has one snge antenna whch can be used for both transsson and recepton Denote the channe fro the transtter to the th x reay as f and the channe fro the th reay to the recever as g We assue that the th reay knows ts own channes f and g and the recever knows a channes f 1 f R and g 1 g R Our resuts are vad for any channe statstcs We assue that for each transsson the powers used at the transtter and the th reay are no arger than P 0 and P respectvey Note that n ths paper ony short-ter power constrant s consdered that s there s an upper bound on the average transt power of each node for each transsson A node cannot save ts power to favor transssons wth better or worse channe reazatons We use a two-step apfy-and-forward protoco Durng the frst step the transtter sends α 0 P0 s The nforaton sybo s s seected randoy fro the codebook S If we noraze t as E s 1 the average power used at the transtter s α 0P 0 The th reay receves r α 0 P0 f s v where v s the nose at the th reay We assue that t s CN01 Durng the second step the th reay sends P t α e θ r 0 f P 0 Note that n contrast wth the tradtona apfy-and-forward protoco n whch P t r 0 f P 0 the coeffcent α and the ange θ are used to adust the transt power and drecton of Reay The average transt power of the th reay can be cacuated to be α P The receved sgna at the recever can thus be cacuated to be xα 0 P0 R α e θ f g P 0 f P 0 s α e θ g P 0 f P 0 v w 1 where w s the nose at the recever It s aso assued to be CN0 1 The tota average power n transttng one sybo s thus no arger than R 0 P Equaton 1 can be rewrtten as where x α 0 P0 hxs v x [ α 1 e θ1 α R e θr ] T s the reay beaforng vector [ f h 1g 1 P1 1α 0 f 1 P 0 ] f Rg R PR 1α 0 f R P 0 s the equvaent channe vector and α g e θ P v v w 0 f P 0 s the equvaent nose Our network beaforng desgn s thus the desgn of α 0 and x or equvaenty θ 1 θ R and α 0 α 1 α R such

3 3 that the error rate of the network s the saest Ths s equvaent to axze the receve SNR The syste equaton has the sae structure as the syste equaton of beaforng n a utpe-antenna syste wth R transt antennas and one receve antenna The ater has been soved anaytcay and the opta beaforng vector s x opt h / h However there are two an dfferences between reay networks and utpe-antenna systes Frst n networks the reays have ony nosy versons of the transt sgna Thus the nforaton s corrupted by noses fro both the recever and the reays Second transssons n reay networks usuay take ore than one hop whch resuts n totay dfferent SNR or capacty cacuatons We can see that both the equvaent channe vector h and the equvaent nose v n have ore copcated natures than those n utpe-antenna systes Aso the nose v depends on the beaforng vector x Thus the network beaforng probe s uch ore dffcut III ANALYTICAL BEAMFORMING RESULT In ths secton we present the anaytca network beaforng resut Snce v s are d CN01 the vaues of the anges θ have no effect on the nose power To axze the sgna power the R coponents of the frst ter n the rght hand sde of 1 shoud add coherenty Thus an opta choce of the anges s θ arg f arg g That s atch fters shoud be used at reays to cance the phases of ther channes and for a bea at the recever Wth ths choce we have xα 0 P0 R α f g P 0 f P 0 s α g P 0 f P 0 e arg f v w 3 What s eft of our probe s the opta power contro e the optzaton of α 0 α 1 α R Ths s aso the an contrbuton of our work Fro 3 the receve SNR can be cacuated to be α 0 P 0 R 1 R α f g P 1α 0 f P 0 α g P 1α 0 f P 0 It s an ncreasng functon of α 0 Therefore the transtter shoud aways use ts axa power e α 0 1 The receve SNR s thus: P 0 R α f g P 1 f P 0 1 R α g P 1 f P 0 To show the portance of adaptve reay power contro we gve a spe two-reay network exape found by coputer suaton Let P 0 P 1 P 10dB and the channe vaues are f f 1640 g and g 0797 In Tabe I the receve SNR vaues of dfferent schees are shown as we as ther vaues of α 1 α We can see that TABLE I A RELAY POWER CONTROL EXAMPLE FOR A -RELAY NETWORK α 1 α receve SNR opta power contro no power contro better reay seecton n ths exape the receve SNR of network beaforng s about 68% and 5% arger than those of no reay power contro both reays use fu power and the better reay seecton respectvey Now et us work on the SNR axzaton We frst ntroduce soe notaton to hep the presentaton Wth a sght abuse of notaton we defne our vector of unknown power coeffcents as Aso defne b a [ [ x [ α 1 α R ] T f 1g 1 P 1 1 f1 P 0 g 1 P 1 1 f1 P 0 f ] Rg R P R 1 fr P 0 g ] R P R 1 fr P 0 and A dag{a} where dag{a} s the dagona atrx whose th dagona entry s a Let Λ { v R R 0 R v a } and for 1R and 1 1 < < k R et Λ 1 k { v R k 0 k v a 1 k } Wth the transforaton y Ax or equvaenty x A 1 y we have where bx SNR P 0 1 Ax P cy 0 1 y c A T b [ f 1 f R ] T The receve SNR optzaton probe s thus equvaent to ax y cy 1 y st y Λ 4 The dffcuty of the probe es n the shape of the feasbe set If y s constraned on a hypersphere that s y r the souton s obvous at east geoetrcay Gven that y r cy 1 y r c 1 r cos ϕ where ϕ s the ange between c and y The opta souton shoud be the vector whch has the saest ange wth c Ths provdes us an dea to sove the probe For any gven r we frst fx the ength of y as r and fnd the opta drecton of y Then we can sove the probe by fndng the opta ength The feasbe nterva for the ength of y s [0 a ] Due to the shape of the regon we need to decopose ths nterva nto R saer ones Ths requres a reay orderng as foows

4 4 Snce Pa > 0 1 and Pc > 0 1 we assue that a > 0 and c > 0 Defne φ φf g P c f 1 f P 0 a g 5 P for 1 R and for the sake of presentaton defne φ R1 0 Order φ as φ τ1 φ τ φ τr φ τr1 6 τ 1 τ τ R τ R1 s thus an orderng of 1RR 1 and τ R1 R 1 Defne r 00 r 1φ 1 τ 1 c r r R 1 Õ Ú φ Ø φ Ú Õ φ τ 1 c τ τ R a τ 1 τ c τ τ R a τ 1 R τ R 1 c τr 1 τ R R 1 r R Ø φ τ R c τr a τ a Ú Ø φ τ c τ3 τ R a τ a τ Ú R 1 Ø φ τ R 1 c τr Snce φ τ 1 φ τ we have r 1 r for 1R Thus the nterva [0 a ] s decoposed nto the foowng R ntervas: [0 a ] [r 0 r 1 ] [r 1 r ] [r R 1 r R ] Let Γ [r r 1 ] The optzaton probe n 4 s equvaent to ax ax 1 R r Γ 1 r ax cy y r Γ y Λ It can be soved through the foowng three steps Step 1: For a gven ength r n Γ fnd the opta drecton of y Λ e sove the nner product axzaton probe: ax cy 7 y r Γ y Λ Step : Fnd the opta ength nsde Γ e sove the th subprobe: y 1 ax r Γ 1 r ax cy 8 y r Γ y Λ by sovng c ax r Γ 1 r Step 3: Search over the R soutons of the R subprobes and fnd the opta souton for the whoe probe The foowng eas and theore soves each step and thus the whoe probe Lea 1: a for τ 1 τ or equvaenty z τ r 1τ a τ1τ Proof: We prove ths ea by contradcton Assue < a for soe {τ 1 τ } We frst show that that a τ there exsts an { τ R } such that Assue that zr c have < zr c c c < c a c Ú Ø Ú Ø Ú τ R a τ R 1 c < zr c for a { τ R } We c φ 1 Thus 1 Ø φ c τ1 τ R Ú Ø φ τ c τ1 τ R r c τ φ z τ r a τ a τ because of 6 Ths contradcts r Γ Thus there exsts an { τ R } such that zr c < zr c Defne another vector z as z δz r where 0 < δ < n c δ and z 1 c c 1 c z z r δ z r c for a Snce we have assued that < a and have ust proved that c < zr c such δ s achevabe To contradct the assupton that s the opta t s enough to prove the foowng two tes: 1 z s a feasbe pont e z r and z Λ c < cz Fro the defnton of z we have z z z δ r z r δz δ Snce 0 < δ < a we have 0 < z < a Aso snce 0 < δ < r z we can easy prove that z r δz δ > 0 and z < zr a Thus z Λ The frst te has been proved For the 1 second te snce δ < c 1 c c zr c we c }

5 5 have 1 c c c c δ < c c c c c δ < c z δ c c δ < zr δ c c c z c z < 0 c < cz z r c c δ δ z Lea : λ r c for τ R or equvaenty z τ r 1τ R λ r c τ1τ R where r λ r a τ c τ1τ R Proof: Fro Lea 1 a for τ 1 τ Thus 7 can be wrtten as ax y r Γ y Λ b τ It s obvous that a τ c τ c τ1 τ R y τ1 τ R ax È c τ1τr r a τ r Γ y τ R Λ τ R y τ R yτ1τr c τ1τ R y τ1τ R c τ1τ R λ r c τ1τ R for a y τ1τ R r a τ In other words to axze the nner product y τ1τ R shoud have the sae drecton as c τ1τ R Thus we ony need to show that ths drecton s feasbe for r Γ Ths s equvaent to show that λ r c τ1τ R Λ τ1τ R for any r Γ We can easy prove that r Γ λ r Ω [ ] where Ω φ 1 τ φ 1 for 0R 1 Thus for any r Γ and τ R we have 0 λ r c φ 1 c φ 1 c a Hence λ r c τ1τ R Λ τ1τ R Cobnng Lea 1 and Lea we have and thus { a τ 1 τ λ r c τ R 9 ax cy b τ λ r c τ1τ R 10 y r Γ y Λ We have soved the nner product axzaton probe of Step 1 The soutons of the R subprobes can thus be obtaned Lea 3: For 1R 1 defne λ 1 a τ b τ The souton of Subprobe 0 s y 0 φ 1 τ 1 c For 1R 1 the souton of Subprobe y s defned δ as { a y { } τ 1 τ n λ φ 1 11 c τ R Proof: Fro 10 Subprobe s equvaent to the foowng 1-densona optzaton probe: b τ c τ1τ R λ ax λ Ω 1 a τ c τ1τ R λ 1 c When 0 1 s equvaent to ax 4 λ λ Ω 1 c λ Snce c 4 λ 1 c λ s an ncreasng functon of λ ts axu s at λ φ 1 τ 1 For 1R 1 defne We have ξ λ ξ λ ξ b τ c τ1τ R λ 1 a τ c τ1τ R λ b τ c τ1τ R λ c τ1τ R 1 a τ c τ1τ R λ 1 a τ b τ λ Thus λ > 0 f λ < λ and ξ λ < 0 f λ > λ So f λ φ 1 the opta souton s reached at λ λ Otherwse the opta souton s reached at λ φ 1 Fro 9 Subprobe s soved at y as defned n 11 Now we are ready for souton of the reay power contro probe n 4 Theore 1: Defne x as { x 1 τ1 τ 13 λ φ τ R The souton of the SNR optzaton s x 0 where 0 s the saest such that λ < φ 1 Proof: Frst snce φ R1 0 we have λ R < φ 1 τ R1 φ 1 R1 Thus 0 exsts Aso snce λ 0 < φ 1 τ 0 1 and φ τ decreases wth we have x 0 1 for τ 01τ R Ths eans that x 0 s n the feasbe regon of the optzaton probe Denote ηy cy 1 y Note that y 0 r 1 Snce r 1 Γ 1 y 0 s aso a feasbe pont of Subprobe 1 Thus η y 0 η y 1 due to the optaty of y 1 n Subprobe 1 Ths eans that there s no need to consder Subprobe 0 For 1R f λ φ 1 y { a τ 1 τ φ 1 c τ R

6 6 and y φ cτ1τ R a τ r 1 1 Snce r 1 Γ 1 y s a feasbe pont of Subprobe 1 Thus η y η y 1 due to the optaty of y 1 n Subprobe 1 Ths eans that there s no need to consder Subprobe 1 Thus we ony need to check those y s wth λ < φ 1 and fnd the one that resuts n the argest receve SNR Fro the defnton n 13 ths s the sae as to check those x s wth λ < φ 1 Now we prove that λ 1 < φ 1 τ f λ < φ 1 Frst fro λ < φ 1 we have 1 a τ b τ < φ 1 Snce a b τ1 φ 1 we can prove easy that λ a τ 1 b τ 1 a τ a b τ b τ1 <φ 1 < φ 1 τ Thus we ony need to check those x s for 0 R and fnd the one causng the argest receve SNR Fro prevous dscusson 0 1 Defne SNR bx Now we prove that SNR 1 Ax > SNR 1 for 0 R Fro the proof of Lea 3 we have b τ c τ1τ R λ SNR 1 a τ c τ1τ R λ c τ 1 a τ 1 1 b τ c τ 1 a τ λ b τ SNR 1 b a 1 1 b τ SNR 1 >SNR 1 a τ 1 1 a τ 1 a τ a 1 φ1 λ 1 1 a 1 τ Thus the opta power contro vector that axzes the receve SNR s x 0 IV DISTRIBUTED SCHEMES FOR NETWORK BEAMFORMING It s natura to expect the power contro at reays to undergo an on-or-off scenaro: a reay uses ts fu power f ts channes are good enough and otherwse not to cooperate at a Our resut shows otherwse The opta power used at a reay can be any vaue between 0 and ts axa power In any stuatons a reay shoud use a fracton of ts power whose vaue s deterned not ony by ts own channes but a others as we Ths s because every reay has two effects on the transsson For one t heps the transsson by forwardng the nforaton whe for the other t hars the transsson by forwardng nose as we Its transt power has a nonnear effect on the powers of both the sgna and the nose whch akes the optzaton souton not an on-or-off one not a decouped one and n genera not even a dfferentabe functon of channe coeffcents As shown n Theore 1 the fracton of power used at reay satsfes α 1 for τ 1 τ 0 and α λ 0 φ for τ 01τ R Thus the 0 reays whose φ s are the argest use ther fu power Snce 0 1 there s at east one reay that uses ts fu power Ths tes us that the reay wth the argest φ aways uses ts fu power The reanng R 0 reays whose φ s are saer ony use parts of ther power For τ 01τ R the power used at the th reay s α P λ 0 φ P λ 0 f /g 1 f P 0 whch s proportona to f /g 1 f P 0 snce λ0 s a constant for each channe reazaton Athough P does not appear expcty n the forua t affects the decson of whether the th reay shoud use ts fu power Actuay n deternng whether a reay shoud use ts axa power not ony do the channe coeffcents and power constrant at ths reay account but aso a other channe coeffcents and power constrants The power constrant of the transtter P 0 pays a ro as we Due to these speca propertes of the opta power contro souton t can be peented dstrbutvey wth each reay knowng ony ts own channe nforaton In the foowng we propose two dstrbuted strateges One s for networks wth a sa nuber of reays and the other s ore econoca n networks wth a arge nuber of reays The recever whch knows a channes can sove the power contro probe When the nuber of reays R s sa the recever broadcasts R bts 1 R and the coeffcent λ 0 The bnary sybo s to ndcate whether Reay shoud use ts fu power If 1 Reay uses ts fu power to transt durng the second step Otherwse t uses power λ 0 f /g 1 f P 0 The nuber of requred feedback bts s RB 1 where B 1 s the aount of bts needed n broadcastng the rea nuber λ 0 Ths nuber ncreases neary n the network sze The other schee s to have the recever broadcast two rea nubers: λ 0 and a rea nuber d that satsfes φ τ0 > d > φ τ0 1 Reay cacuates ts own φ If φ > d Reay uses ts fu power Otherwse t uses power λ 0 f /g 1 f P 0 The nuber of bts needed for ths

7 7 feedback s B 1 Thus when R s arge ths strategy needs ess bts of feedback copared to the frst one Networks wth an aggregate power constrant P on reays were anayzed n [4] In that case wth the sae notaton n Secton III P P and R 1 α 1 The opta reay power aocaton souton s α f g 1 f P 0 f P 0 g P1 R f g 1 f P 0 f P 0 g P1 α s a functon of ts own channes f g ony and an extra R f coeffcent c g 1 f P 0 f P 0 g P1 whch s the sae for a reays Therefore ths power aocaton can be done dstrbutvey wth the extra knowedge of one snge coeffcent c whch can be broadcasted by the recever In our case every reay has a separate power constrant Ths s a ore practca assupton n sensor networks snce every sensor or wreess devce has ts own battery power t The power contro soutons of the two cases are totay dfferent If reay seecton s used and ony one reay s aowed to cooperate t can be proved easy that we shoud choose the reay wth the hghest h hf g P P f g 1 f P 0 g P We ca h the reay seecton functon snce a reay wth a arger h resuts n a hgher receve SNR Whe a reays are aowed to cooperate the concepts of the best reay and reay seecton functon are not cear Snce the power contro probe s a couped one t s hard to easure how uch contrbuton a reay has As dscussed before n network beaforng a reay wth a arger φ does not necessary use a arger power or has ore contrbuton But we can concude that f φ k > φ the fracton of power used at Reay k α k s no ess than the fracton of power used at Reay α It s worth to enton that n network beaforng reays wth arge enough φ s use ther fu power no atter what ther fu power s Actuay t s not hard to see that f at one te channes of a reays are good every reay shoud use ts fu power V SIMULATION RESULTS In ths secton we show suated perforance of network beaforng and copare t wth perforance of other exstng schees Fgures and 3 show perforance of networks wth Rayegh fadng channes and the sae power constrant on the transtter and reays In other words f g are CN01 and P 0 P 1 P R P The horzonta axs of the fgures ndcates P In Fg suated bock error rates of network beaforng wth opta power contro are copared to those of best-reay seecton Larsson s schee [4] wth tota reay power P Aaout dstrbuted space-te codng [10] [40] and apfy-and-forward wthout power contro every reay uses ts axa power n a -reay network The nforaton sybo s s oduated as BPSK We can see that network beaforng outperfors a other schees It s about 05dB and db better than Larsson s Bock error rate Aaout DSTC Network beaforng Larsson s schee Best reay seecton AF wthout power contro P db Fg -reay network wth fadng channes and P P 0 Bock error rate AF wthout power contro Larsson s schee Network beaforng Best reay seecton P db Fg 3 3-reay network wth fadng channes and P P 0 schee and best-reay seecton respectvey Wth perfect channe knowedge at reays t s 7dB better than Aaout dstrbuted space-te codng whch needs no channe nforaton at reays Apfy-and-forward wth no power contro ony acheves dversty 1 dstrbuted space-te codng acheves a dversty sghty ess than two whe best-reay seecton network beaforng and Larsson s schee acheve dversty Fg 3 shows suated perforance of a 3-reay network under dfferent schees Sar dversty resuts are obtaned But for the 3-reay case network beaforng s about 15dB and 35dB better than Larsson s schee and bestreay seecton respectvey In Fg 4 we show perforance of a -reay network n whch P 0 P 1 P and P P/ That s the transtter and the frst reay have the sae power constrant whe the second reay has ony haf the power of the frst reay The channes are assued to be Rayegh fadng channes In Fg 5 we show perforance of a -reay network whose channes have both fadng and path-oss effects We assue that the dstance between the frst reay and the transtter/recever s 1 whe the dstance between the second reay and the transtter/recever s The path-oss exponent [39] s assued to be We aso assue that the transtter and

8 8 Bock error rate Fg 4 Bock error rate P db -reay network wth dfferent reay power AF wthout power contro Network beaforng Best reay seecton AF wthout power contro Network beaforng Larsson s schee n Best reay seecton anaytcay The souton can be obtaned wth a copexty that s near n the nuber of reays The power used at a reay depends on not ony ts own channes nonneary but aso a other channes n the network In genera t s not even a dfferentabe functon of channe coeffcents Suaton wth Rayegh fadng and path-oss channes show that network beaforng acheves fu dversty whe apfyand-forward wthout power contro acheves dversty 1 ony Network beaforng aso outperfors other cooperatve strateges We have ust scratched the surface of a brand-new area There are a ot of ways to extend and generaze ths work Frst t s assued n ths work that reays know ther channes perfecty whch s not practca n any networks Network beaforng wth ted and deayed feedback fro the recever s an portant ssue Second the reay network probed n ths paper has ony one par of transtter and recever When there are utpe transtter-and-recever pars an nterestng probe s how reays shoud aocate ther powers to ad dfferent councaton tasks Fnay the twohop protoco can be generazed as we For a gven network topoogy one reevant queston s how any hops shoud be taken to optze the crteron at consderaton for exape error rate or capacty VII ACKNOWLEDGMENT Ths work was supported n part by ARO under the Mut- Unversty Research Intatve MURI grant #W911NF Fg P db -reay network wth path-oss pus fadng channes reays have the sae power constrant e P 0 P 1 P P In both cases dstrbuted space-te codng does not appy and Larsson s schee appes for the second case ony So we copare network beaforng to best-reay seecton and apfy-and-forward wth no power contro ony Perforance of Larsson s schee s shown n Fg 5 as we Both fgures show the superorty of network beaforng to other schees VI CONCLUSIONS AND FUTURE WORK In ths paper we propose the nove dea of beaforng n wreess reay networks to acheve both dversty and array gan The schee s based on a two-step apfy-and-forward protoco We assue that each reay knows ts own channes perfecty Unke prevous works n network dversty the schee deveoped here uses not ony the channes phase nforaton but aso ther agntudes Match fters are apped at the transtter and reays durng the second step to cance the channe phase effect and thus for a coherent bea at the recever n the ean whe opta power contro s perfored based on the channe agntudes to decde the power used at the transtter and reays The power contro probe for networks wth any nubers of reays s soved REFERENCES [1] H Jafarkhan Space-Te Codng: Theory and Practce Cabrdge Acadec Press 005 [] A Hottnen O Trkkonen and R Wchan Mut-Antenna Transcever Technques for 3G and Beyond John Wey 003 [3] Y Chang and Y Hua Appcaton of space-te near bock codes to parae wreess reays n obe ad hoc networks n Prof of the 36th Asoar Conference on Sgnas Systes and Coputers Nov 003 [4] Y Hua Y Me and Y Chang Wreess antennas - akng wreess councatons perfor ke wrene councatons n Prof of IEEE AP-S Topca Conference on Wreess Councaton Technoogy Oct 003 [5] Y Tang and M C Vaent Coded transt acrodversty: bock space-te codes over dstrbuted antennas n Prof of IEEE Vehcuar Technoogy Conference 001-Sprng vo pp May 001 [6] A Sendonars E Erkp and B Aazhang User cooperaton dverstypart I: Syste descrpton IEEE Transactons on Councatons vo 51 pp Nov 003 [7] A Sendonars E Erkp and B Aazhang User cooperaton dverstypart II: Ipeentaton aspects and perforance anayss IEEE Transactons on Councatons vo 51 pp Nov 003 [8] R U Nabar H Böcske and F W Kneubuher Fadng reay channes: Perforance ts and space-te sgna desgn IEEE Journa on Seected Areas n Councatons pp Aug 004 [9] H Böcske R U Nabar O Oyan and A J Paura Capacty scang aws n MIMO reay networks IEEE Transactons on Wreess Councatons pp June 006 [10] Y Jng and B Hassb Dstrbuted space-te codng n wreess reay networks IEEE Trans on Wreess Co vo 5 pp Dec 006 [11] A F Dana and B Hassb On the power-effcency of sensory and ad-hoc wreess networks IEEE Transactons on Inforaton Theory pp Juy 006 [1] J N Lanean and G W Worne Dstrbuted space-te-coded protocos for expotng cooperatve dversty n wreess network IEEE Transactons on Inforaton Theory vo 49 pp Oct 003

9 9 [13] M Janan A Hedayat T E Hunter and A Nosratna Coded cooperaton n wreess councatons: space-te transsson and teratve decodng IEEE Transactons on Sgna Processng pp Feb 006 [14] Y Jng and H Jafarkhan Dstrbuted dfferenta space-te codng n wreess reay networks To appear n IEEE Transactons on Councatons [15] T Kran and B S Raan Parta-coherent dstrbuted space-te codes wth dfferenta encoder and decoder n Proc of IEEE Interna Syposu on Inforaton Theory 006 [16] F Ogger and B Hassb A codng strategy for wreess networks wth no channe nforaton n Prof of Aerton Conference 006 [17] K Azaran H E Gaa and P Schnter On the achevabe dverstyutpexng tradeoff n haf-dupex cooperatve channes IEEE Transactons on Inforaton Theory vo 51 pp Dec 005 [18] J N Lanean D N C Tse and G W Worne Cooperatve dversty n wreess networks: Effcent protocos and outage behavor IEEE Transactons on Inforaton Theory pp Dec 004 [19] M Katz and S S Shaa Transttng to coocated users n wreess ad hoc and sensory networks IEEE Transactons on Inforaton Theory pp Oct 005 [0] T E Hunter S Sanaye and A Nosratna Outage anayss of coded cooperaton IEEE Transactons on Inforaton Theory pp Feb 006 [1] N Devroye P Mtran and V Tarokh Achevabe rates n cogntve rado channes IEEE Transactons on Inforaton Theory pp May 006 [] E G Larsson and Y Cao Coaboratve transt dversty wth adaptve resource and power aocaton IEEE Councaton Letters pp June 005 [3] Y Cao B Vocc and M Sourya User-cooperatve transsson wth channe feedback n sow fadng envronent n Proc of IEEE Vehcuar Technoogy Conference 004-Fa pp [4] P Larsson Large-scae cooperatve reayng network wth opta cobnng under aggregate reay power constrant n Proc of Future Teecouncatons Conference 003 [5] P A Anghe and M Kaveh On the perforance of dstrbuted spacete codng systes wth one and two non-regeneratve reays IEEE Transactons on Wreess Councatons pp Mar 006 [6] N Ahed M A Khoastepour A Sabharwa and B Aazhang Outage nzaton wth ted feedback for the fadng reay channe IEEE Transactons on Councatons pp Apr 006 [7] A Narua M L Lopez M D Trott and G Worne Effcent use of sde nforaton n utpe-antenna data transsson over fadng channes IEEE Journas on Seected Areas n Councatons pp Oct 1998 [8] S A Jafar and A J Godsth Transt optzaton and optaty of beaforng for utpe antenna systes wth perfect feedback IEEE Transactons on Wreess Councatons pp Juy 004 [9] K K Mukkav A Sabharwa E Erkp and B Aazhang On beaforng wth fnte rate feedback n utpe-antenna systes IEEE Transactons on Inforaton Theory pp Oct 003 [30] J C Roh and B D Rao Mutpe antenna channes wth parta channe state nforaton at the transtter IEEE Transactons on Wreess Councatons pp Mar 004 [31] J C Roh and B D Rao Desgn and anayss of MIMO spata utpexng systes wth quantzed feedback IEEE Transactons on Sgna Processng pp Aug 006 [3] S Zhou and G B Gannaks Opta transtter egen-beaforng and space-te bock codng based on channe ean feedback IEEE Transactons on Sgna Processng pp Oct 00 [33] S Zhou and G B Gannaks Opta transtter egen-beaforng and space-te bock codng based on channe correatons IEEE Transactons on Inforaton Theory pp Juy 003 [34] G Jongren M Skogund and B Ottersten Cobnng beaforng and orthogona space-te bock bodng IEEE Transactons on Inforaton Theory pp Mar 00 [35] L Lu and H Jafarkhan Appcaton of quas-orthogona space-te bock codes n beaforng IEEE Transactons on Sgna Processng pp Jan 005 [36] D J Love and R W Heath Lted feedback untary precodng for orthogona space-te bock codes IEEE Transactons on Sgna Processng pp Jan 005 [37] S Ekbatan and H Jafarkhan Cobnng beaforng and space-te codng for ut-antenna transtters usng nosy quantzed channe drecton feedback To Appear n IEEE Transactons on Councatons 007 [38] Y Jng and H Jafarkhan Network beaforng usng reays wth perfect channe nforaton n Proc of IEEE Int Conf of Acoustcs Speech and Sg Proc Apr 007 [39] T S Pappaport Wreess Councatons: Prncpes and Practce Prentce Ha nd ed 00 [40] Y Jng and H Jafarkhan Usng orthogona and quas-orthogona desgns n wreess reay networks IEEE Trans on Info Theory vo 53 pp Nov 007

Research on Complex Networks Control Based on Fuzzy Integral Sliding Theory

Research on Complex Networks Control Based on Fuzzy Integral Sliding Theory Advanced Scence and Technoogy Letters Vo.83 (ISA 205), pp.60-65 http://dx.do.org/0.4257/ast.205.83.2 Research on Compex etworks Contro Based on Fuzzy Integra Sdng Theory Dongsheng Yang, Bngqng L, 2, He

More information

Reliability Model of Tracking, Telemetry, Command and Communication System using Markov Approach

Reliability Model of Tracking, Telemetry, Command and Communication System using Markov Approach Internatona Journa of Perforabty Engneerng, Vo. 8, No., Juy,, pp. -6. RAMS Consutants Prnted n Inda Reabty Mode of Trackng, Teeetry, Coand and Councaton Syste usng Markov Approach HUA YAN and XIAO-YUE

More information

MARKOV CHAIN AND HIDDEN MARKOV MODEL

MARKOV CHAIN AND HIDDEN MARKOV MODEL MARKOV CHAIN AND HIDDEN MARKOV MODEL JIAN ZHANG JIANZHAN@STAT.PURDUE.EDU Markov chan and hdden Markov mode are probaby the smpest modes whch can be used to mode sequenta data,.e. data sampes whch are not

More information

System in Weibull Distribution

System in Weibull Distribution Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co

More information

Einstein Summation Convention

Einstein Summation Convention Ensten Suaton Conventon Ths s a ethod to wrte equaton nvovng severa suatons n a uncuttered for Exape:. δ where δ or 0 Suaton runs over to snce we are denson No ndces appear ore than two tes n the equaton

More information

Negative Birefraction of Acoustic Waves in a Sonic Crystal

Negative Birefraction of Acoustic Waves in a Sonic Crystal Negatve Brefracton of Acoustc Waves n a Sonc Crysta Mng-Hu Lu 1, Chao Zhang 1, Lang Feng 1, * Jun Zhao 1, Yan-Feng Chen 1, Y-We Mao 2, Jan Z 3, Yong-Yuan Zhu 1, Sh-Nng Zhu 1 and Na-Ben Mng 1 1 Natona Laboratory

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

Optimum Selection Combining for M-QAM on Fading Channels

Optimum Selection Combining for M-QAM on Fading Channels Optmum Seecton Combnng for M-QAM on Fadng Channes M. Surendra Raju, Ramesh Annavajjaa and A. Chockangam Insca Semconductors Inda Pvt. Ltd, Bangaore-56000, Inda Department of ECE, Unversty of Caforna, San

More information

Applied Mathematics Letters

Applied Mathematics Letters Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć

More information

Decision Making: system lexicon.

Decision Making: system lexicon. Decson Makng: syste con Z Abarashv,V Zhukovn, N Chkhkvadze Abstract : There s gven the progra reazaton syste "con" by the usng cographca procedure Key words: Decson akng, cographca procedure Introducton

More information

Boundary Value Problems. Lecture Objectives. Ch. 27

Boundary Value Problems. Lecture Objectives. Ch. 27 Boundar Vaue Probes Ch. 7 Lecture Obectves o understand the dfference between an nta vaue and boundar vaue ODE o be abe to understand when and how to app the shootng ethod and FD ethod. o understand what

More information

Chapter 12 Lyes KADEM [Thermodynamics II] 2007

Chapter 12 Lyes KADEM [Thermodynamics II] 2007 Chapter 2 Lyes KDEM [Therodynacs II] 2007 Gas Mxtures In ths chapter we wll develop ethods for deternng therodynac propertes of a xture n order to apply the frst law to systes nvolvng xtures. Ths wll be

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng

More information

Interference Alignment and Degrees of Freedom Region of Cellular Sigma Channel

Interference Alignment and Degrees of Freedom Region of Cellular Sigma Channel 2011 IEEE Internatona Symposum on Informaton Theory Proceedngs Interference Agnment and Degrees of Freedom Regon of Ceuar Sgma Channe Huaru Yn 1 Le Ke 2 Zhengdao Wang 2 1 WINLAB Dept of EEIS Unv. of Sc.

More information

Source-Channel-Sink Some questions

Source-Channel-Sink Some questions Source-Channel-Snk Soe questons Source Channel Snk Aount of Inforaton avalable Source Entro Generall nos and a be te varng Introduces error and lts the rate at whch data can be transferred ow uch nforaton

More information

COS 511: Theoretical Machine Learning

COS 511: Theoretical Machine Learning COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that

More information

Excess Error, Approximation Error, and Estimation Error

Excess Error, Approximation Error, and Estimation Error E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple

More information

Discrete Memoryless Channels

Discrete Memoryless Channels Dscrete Meorless Channels Source Channel Snk Aount of Inforaton avalable Source Entro Generall nos, dstorted and a be te varng ow uch nforaton s receved? ow uch s lost? Introduces error and lts the rate

More information

Downlink Power Allocation for CoMP-NOMA in Multi-Cell Networks

Downlink Power Allocation for CoMP-NOMA in Multi-Cell Networks Downn Power Aocaton for CoMP-NOMA n Mut-Ce Networs Md Shpon A, Eram Hossan, Arafat A-Dwe, and Dong In Km arxv:80.0498v [eess.sp] 6 Dec 207 Abstract Ths wor consders the probem of dynamc power aocaton n

More information

On Uplink-Downlink Sum-MSE Duality of Multi-hop MIMO Relay Channel

On Uplink-Downlink Sum-MSE Duality of Multi-hop MIMO Relay Channel On Upn-Downn Sum-MSE Duat of Mut-hop MIMO Rea Channe A Cagata Cr, Muhammad R. A. handaer, Yue Rong and Yngbo ua Department of Eectrca Engneerng, Unverst of Caforna Rversde, Rversde, CA, 95 Centre for Wreess

More information

k p theory for bulk semiconductors

k p theory for bulk semiconductors p theory for bu seconductors The attce perodc ndependent partce wave equaton s gven by p + V r + V p + δ H rψ ( r ) = εψ ( r ) (A) 4c In Eq. (A) V ( r ) s the effectve attce perodc potenta caused by the

More information

Delay tomography for large scale networks

Delay tomography for large scale networks Deay tomography for arge scae networks MENG-FU SHIH ALFRED O. HERO III Communcatons and Sgna Processng Laboratory Eectrca Engneerng and Computer Scence Department Unversty of Mchgan, 30 Bea. Ave., Ann

More information

XII.3 The EM (Expectation-Maximization) Algorithm

XII.3 The EM (Expectation-Maximization) Algorithm XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles

More information

Associative Memories

Associative Memories Assocatve Memores We consder now modes for unsupervsed earnng probems, caed auto-assocaton probems. Assocaton s the task of mappng patterns to patterns. In an assocatve memory the stmuus of an ncompete

More information

Remark: Positive work is done on an object when the point of application of the force moves in the direction of the force.

Remark: Positive work is done on an object when the point of application of the force moves in the direction of the force. Unt 5 Work and Energy 5. Work and knetc energy 5. Work - energy theore 5.3 Potenta energy 5.4 Tota energy 5.5 Energy dagra o a ass-sprng syste 5.6 A genera study o the potenta energy curve 5. Work and

More information

The Parity of the Number of Irreducible Factors for Some Pentanomials

The Parity of the Number of Irreducible Factors for Some Pentanomials The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,

More information

Synthetic Weighted Method of Failure Samples Allocation in Maintainability Test

Synthetic Weighted Method of Failure Samples Allocation in Maintainability Test 26 3 rd Internatona onference on Sart Materas and Nanotechnoogy n Engneerng (SMNE 26) ISBN: 978--6595-338- Synthetc Weghted Method of aure Sapes Aocaton n Mantanabty Test Jayu Mao, Xshan Zhang, Pengcheng

More information

Polite Water-filling for Weighted Sum-rate Maximization in MIMO B-MAC Networks under. Multiple Linear Constraints

Polite Water-filling for Weighted Sum-rate Maximization in MIMO B-MAC Networks under. Multiple Linear Constraints 2011 IEEE Internatona Symposum on Informaton Theory Proceedngs Pote Water-fng for Weghted Sum-rate Maxmzaton n MIMO B-MAC Networks under Mutpe near Constrants An u 1, Youjan u 2, Vncent K. N. au 3, Hage

More information

Revision: December 13, E Main Suite D Pullman, WA (509) Voice and Fax

Revision: December 13, E Main Suite D Pullman, WA (509) Voice and Fax .9.1: AC power analyss Reson: Deceber 13, 010 15 E Man Sute D Pullan, WA 99163 (509 334 6306 Voce and Fax Oerew n chapter.9.0, we ntroduced soe basc quanttes relate to delery of power usng snusodal sgnals.

More information

Chapter 6. Rotations and Tensors

Chapter 6. Rotations and Tensors Vector Spaces n Physcs 8/6/5 Chapter 6. Rotatons and ensors here s a speca knd of near transformaton whch s used to transforms coordnates from one set of axes to another set of axes (wth the same orgn).

More information

Calculation method of electrical conductivity, thermal conductivity and viscosity of a partially ionized gas. Ilona Lázniková

Calculation method of electrical conductivity, thermal conductivity and viscosity of a partially ionized gas. Ilona Lázniková www. energyspectru.net Cacuaton ethod of eectrca conductvty thera conductvty and vscosty of a partay onzed gas Iona Láznková Brno Unversty of echnoogy Facuty of Eectrca engneerng and Councaton Departent

More information

Xiangwen Li. March 8th and March 13th, 2001

Xiangwen Li. March 8th and March 13th, 2001 CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Fermi-Dirac statistics

Fermi-Dirac statistics UCC/Physcs/MK/EM/October 8, 205 Fer-Drac statstcs Fer-Drac dstrbuton Matter partcles that are eleentary ostly have a type of angular oentu called spn. hese partcles are known to have a agnetc oent whch

More information

we have E Y x t ( ( xl)) 1 ( xl), e a in I( Λ ) are as follows:

we have E Y x t ( ( xl)) 1 ( xl), e a in I( Λ ) are as follows: APPENDICES Aendx : the roof of Equaton (6 For j m n we have Smary from Equaton ( note that j '( ( ( j E Y x t ( ( x ( x a V ( ( x a ( ( x ( x b V ( ( x b V x e d ( abx ( ( x e a a bx ( x xe b a bx By usng

More information

A General Column Generation Algorithm Applied to System Reliability Optimization Problems

A General Column Generation Algorithm Applied to System Reliability Optimization Problems A Genera Coumn Generaton Agorthm Apped to System Reabty Optmzaton Probems Lea Za, Davd W. Cot, Department of Industra and Systems Engneerng, Rutgers Unversty, Pscataway, J 08854, USA Abstract A genera

More information

LECTURE 21 Mohr s Method for Calculation of General Displacements. 1 The Reciprocal Theorem

LECTURE 21 Mohr s Method for Calculation of General Displacements. 1 The Reciprocal Theorem V. DEMENKO MECHANICS OF MATERIALS 05 LECTURE Mohr s Method for Cacuaton of Genera Dspacements The Recproca Theorem The recproca theorem s one of the genera theorems of strength of materas. It foows drect

More information

Predicting Model of Traffic Volume Based on Grey-Markov

Predicting Model of Traffic Volume Based on Grey-Markov Vo. No. Modern Apped Scence Predctng Mode of Traffc Voume Based on Grey-Marov Ynpeng Zhang Zhengzhou Muncpa Engneerng Desgn & Research Insttute Zhengzhou 5005 Chna Abstract Grey-marov forecastng mode of

More information

1 Definition of Rademacher Complexity

1 Definition of Rademacher Complexity COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the

More information

Neural network-based athletics performance prediction optimization model applied research

Neural network-based athletics performance prediction optimization model applied research Avaabe onne www.jocpr.com Journa of Chemca and Pharmaceutca Research, 04, 6(6):8-5 Research Artce ISSN : 0975-784 CODEN(USA) : JCPRC5 Neura networ-based athetcs performance predcton optmzaton mode apped

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Optimizing Flow Control in Multi-interface Wireless Cognitive Radio Networks

Optimizing Flow Control in Multi-interface Wireless Cognitive Radio Networks Optzng Fow ontro n Mut-nterface Wreess ogntve Rado Networs Areza Loun IEEE Student Meber Departent of Eectrca and oputer Engneerng Stevens Insttute of Technoogy Hoboen, NJ, USA. Ea: aoun@stevens.edu K.

More information

What is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.

What is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner. (C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng

More information

Performance Analysis of V-BLAST with Optimum Power Allocation

Performance Analysis of V-BLAST with Optimum Power Allocation Perforance Analyss of V-BLAST wth Optu Power Allocaton Vctora Kostna, Sergey Loyka School of Inforaton Technology and Engneerng, Unversty of Ottawa, 6 Lous Pasteur, Ottawa, Canada, KN 6N5 E-al: sergey.loyka@eee.org

More information

Elastic Collisions. Definition: two point masses on which no external forces act collide without losing any energy.

Elastic Collisions. Definition: two point masses on which no external forces act collide without losing any energy. Elastc Collsons Defnton: to pont asses on hch no external forces act collde thout losng any energy v Prerequstes: θ θ collsons n one denson conservaton of oentu and energy occurs frequently n everyday

More information

Single-Source/Sink Network Error Correction Is as Hard as Multiple-Unicast

Single-Source/Sink Network Error Correction Is as Hard as Multiple-Unicast Snge-Source/Snk Network Error Correcton Is as Hard as Mutpe-Uncast Wentao Huang and Tracey Ho Department of Eectrca Engneerng Caforna Insttute of Technoogy Pasadena, CA {whuang,tho}@catech.edu Mchae Langberg

More information

COXREG. Estimation (1)

COXREG. Estimation (1) COXREG Cox (972) frst suggested the modes n whch factors reated to fetme have a mutpcatve effect on the hazard functon. These modes are caed proportona hazards (PH) modes. Under the proportona hazards

More information

Cyclic Codes BCH Codes

Cyclic Codes BCH Codes Cycc Codes BCH Codes Gaos Feds GF m A Gaos fed of m eements can be obtaned usng the symbos 0,, á, and the eements beng 0,, á, á, á 3 m,... so that fed F* s cosed under mutpcaton wth m eements. The operator

More information

STATISTICAL MODEL OF DOWNLINK POWER CONSUMPTION IN CELLULAR CDMA NETWORKS

STATISTICAL MODEL OF DOWNLINK POWER CONSUMPTION IN CELLULAR CDMA NETWORKS Internatona Journa of Wreess & Mobe Networs IJWMN Vo. No. August 0 STATISTICAL MODEL OF DOWNLINK POWER CONSUMPTION IN CELLULAR CDMA NETWORKS Styanos P. Savads and Noaos I. Mrdas Departent of Eectroncs

More information

Denote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form

Denote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form SET OF METHODS FO SOUTION THE AUHY POBEM FO STIFF SYSTEMS OF ODINAY DIFFEENTIA EUATIONS AF atypov and YuV Nulchev Insttute of Theoretcal and Appled Mechancs SB AS 639 Novosbrs ussa Introducton A constructon

More information

Performance Comparison of Turbo Code in WIMAX System with Various Detection Techniques

Performance Comparison of Turbo Code in WIMAX System with Various Detection Techniques Perforance Coparson of Turbo Code n WIMAX Syste wth Varous Detecton Technques Vas Tursena Departent of Eectroncs and Councaton Engneerng, IET-DAVV, Indore, (MP)- INDIA vas.t2@ga.co Abstract The dfferent

More information

Collaborative Filtering Recommendation Algorithm

Collaborative Filtering Recommendation Algorithm Vol.141 (GST 2016), pp.199-203 http://dx.do.org/10.14257/astl.2016.141.43 Collaboratve Flterng Recoendaton Algorth Dong Lang Qongta Teachers College, Haou 570100, Chna, 18689851015@163.co Abstract. Ths

More information

Finite Fields and Their Applications

Finite Fields and Their Applications Fnte Felds and Ther Applcatons 5 009 796 807 Contents lsts avalable at ScenceDrect Fnte Felds and Ther Applcatons www.elsever.co/locate/ffa Typcal prtve polynoals over nteger resdue rngs Tan Tan a, Wen-Feng

More information

An Optimal Bound for Sum of Square Roots of Special Type of Integers

An Optimal Bound for Sum of Square Roots of Special Type of Integers The Sxth Internatonal Syposu on Operatons Research and Its Applcatons ISORA 06 Xnang, Chna, August 8 12, 2006 Copyrght 2006 ORSC & APORC pp. 206 211 An Optal Bound for Su of Square Roots of Specal Type

More information

On the number of regions in an m-dimensional space cut by n hyperplanes

On the number of regions in an m-dimensional space cut by n hyperplanes 6 On the nuber of regons n an -densonal space cut by n hyperplanes Chungwu Ho and Seth Zeran Abstract In ths note we provde a unfor approach for the nuber of bounded regons cut by n hyperplanes n general

More information

Image Classification Using EM And JE algorithms

Image Classification Using EM And JE algorithms Machne earnng project report Fa, 2 Xaojn Sh, jennfer@soe Image Cassfcaton Usng EM And JE agorthms Xaojn Sh Department of Computer Engneerng, Unversty of Caforna, Santa Cruz, CA, 9564 jennfer@soe.ucsc.edu

More information

Drift Design Method for High-rise Buildings using Dynamic Resizing Algorithm

Drift Design Method for High-rise Buildings using Dynamic Resizing Algorithm ctbuh.org/papers Tte: Authors: Subject: Keywords: Drft Desgn Method for Hgh-rse Budngs usng Dynac Reszng Agorth Hyo Seon Park, Ph.D Canddate, Yonse Unversty Seo J Hyun, Assocate Professor, Yonse Unversty

More information

* Author to whom correspondence should be addressed; Tel.:

* Author to whom correspondence should be addressed;   Tel.: Sensors 2015, 15, 6270-6305; do:10.3390/s150306270 Artce OPEN ACCESS sensors ISSN 1424-8220 www.dp.co/journa/sensors The Optzaton Based Dynac and Cycc Workng Strateges for Rechargeabe Wreess Sensor Networks

More information

VQ widely used in coding speech, image, and video

VQ widely used in coding speech, image, and video at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng

More information

Computational and Statistical Learning theory Assignment 4

Computational and Statistical Learning theory Assignment 4 Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}

More information

Development of whole CORe Thermal Hydraulic analysis code CORTH Pan JunJie, Tang QiFen, Chai XiaoMing, Lu Wei, Liu Dong

Development of whole CORe Thermal Hydraulic analysis code CORTH Pan JunJie, Tang QiFen, Chai XiaoMing, Lu Wei, Liu Dong Deveopment of whoe CORe Therma Hydrauc anayss code CORTH Pan JunJe, Tang QFen, Cha XaoMng, Lu We, Lu Dong cence and technoogy on reactor system desgn technoogy, Nucear Power Insttute of Chna, Chengdu,

More information

Optimal Marketing Strategies for a Customer Data Intermediary. Technical Appendix

Optimal Marketing Strategies for a Customer Data Intermediary. Technical Appendix Optal Marketng Strateges for a Custoer Data Interedary Techncal Appendx oseph Pancras Unversty of Connectcut School of Busness Marketng Departent 00 Hllsde Road, Unt 04 Storrs, CT 0669-04 oseph.pancras@busness.uconn.edu

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not

More information

AN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU

AN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU AN ANALYI OF A FRACTAL KINETIC CURE OF AAGEAU by John Maloney and Jack Hedel Departent of Matheatcs Unversty of Nebraska at Oaha Oaha, Nebraska 688 Eal addresses: aloney@unoaha.edu, jhedel@unoaha.edu Runnng

More information

On the Construction of Polar Codes

On the Construction of Polar Codes On the Constructon of Polar Codes Ratn Pedarsan School of Coputer and Councaton Systes, Lausanne, Swtzerland. ratn.pedarsan@epfl.ch S. Haed Hassan School of Coputer and Councaton Systes, Lausanne, Swtzerland.

More information

A finite difference method for heat equation in the unbounded domain

A finite difference method for heat equation in the unbounded domain Internatona Conerence on Advanced ectronc Scence and Technoogy (AST 6) A nte derence method or heat equaton n the unbounded doman a Quan Zheng and Xn Zhao Coege o Scence North Chna nversty o Technoogy

More information

ON AUTOMATIC CONTINUITY OF DERIVATIONS FOR BANACH ALGEBRAS WITH INVOLUTION

ON AUTOMATIC CONTINUITY OF DERIVATIONS FOR BANACH ALGEBRAS WITH INVOLUTION European Journa of Mathematcs and Computer Scence Vo. No. 1, 2017 ON AUTOMATC CONTNUTY OF DERVATONS FOR BANACH ALGEBRAS WTH NVOLUTON Mohamed BELAM & Youssef T DL MATC Laboratory Hassan Unversty MORO CCO

More information

On the Power Function of the Likelihood Ratio Test for MANOVA

On the Power Function of the Likelihood Ratio Test for MANOVA Journa of Mutvarate Anayss 8, 416 41 (00) do:10.1006/jmva.001.036 On the Power Functon of the Lkehood Rato Test for MANOVA Dua Kumar Bhaumk Unversty of South Aabama and Unversty of Inos at Chcago and Sanat

More information

3. Stress-strain relationships of a composite layer

3. Stress-strain relationships of a composite layer OM PO I O U P U N I V I Y O F W N ompostes ourse 8-9 Unversty of wente ng. &ech... tress-stran reatonshps of a composte ayer - Laurent Warnet & emo Aerman.. tress-stran reatonshps of a composte ayer Introducton

More information

Pop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing

Pop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,

More information

On the Construction of Polar Codes

On the Construction of Polar Codes On the Constructon of Polar Codes Ratn Pedarsan School of Coputer and Councaton Systes, Lausanne, Swtzerland. ratn.pedarsan@epfl.ch S. Haed Hassan School of Coputer and Councaton Systes, Lausanne, Swtzerland.

More information

[WAVES] 1. Waves and wave forces. Definition of waves

[WAVES] 1. Waves and wave forces. Definition of waves 1. Waves and forces Defnton of s In the smuatons on ong-crested s are consdered. The drecton of these s (μ) s defned as sketched beow n the goba co-ordnate sstem: North West East South The eevaton can

More information

On Pfaff s solution of the Pfaff problem

On Pfaff s solution of the Pfaff problem Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

Designing Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate

Designing Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate The Frst Internatonal Senar on Scence and Technology, Islac Unversty of Indonesa, 4-5 January 009. Desgnng Fuzzy Te Seres odel Usng Generalzed Wang s ethod and Its applcaton to Forecastng Interest Rate

More information

Nested case-control and case-cohort studies

Nested case-control and case-cohort studies Outne: Nested case-contro and case-cohort studes Ørnuf Borgan Department of Mathematcs Unversty of Oso NORBIS course Unversty of Oso 4-8 December 217 1 Radaton and breast cancer data Nested case contro

More information

On Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes 1

On Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes 1 Ffteenth Internatonal Workshop on Algebrac and Cobnatoral Codng Theory June 18-24, 2016, Albena, Bulgara pp. 35 40 On Syndroe Decodng of Punctured Reed-Soloon and Gabduln Codes 1 Hannes Bartz hannes.bartz@tu.de

More information

Finite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003

Finite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003 Fnte Vector Space epresentatons oss Bannster Data Asslaton esearch Centre, eadng, UK ast updated: 2nd August 2003 Contents What s a lnear vector space?......... 1 About ths docuent............ 2 1. Orthogonal

More information

Preference and Demand Examples

Preference and Demand Examples Dvson of the Huantes and Socal Scences Preference and Deand Exaples KC Border October, 2002 Revsed Noveber 206 These notes show how to use the Lagrange Karush Kuhn Tucker ultpler theores to solve the proble

More information

Solutions for Homework #9

Solutions for Homework #9 Solutons for Hoewor #9 PROBEM. (P. 3 on page 379 n the note) Consder a sprng ounted rgd bar of total ass and length, to whch an addtonal ass s luped at the rghtost end. he syste has no dapng. Fnd the natural

More information

An Improved BP Neural Network Based on GA for 3D Laser Data Repairing

An Improved BP Neural Network Based on GA for 3D Laser Data Repairing An Iproved BP Neura Network Based on GA for 3D Laser Data Reparng Shouqan Yu Lxa Rong Weha Chen Xngng Wu Schoo of Autoaton and Eectrca Engneerng Bejng Unversty of Aeronautcs & Astronautcs Bejng, Chna xarong@6.co

More information

Performance of SDMA Systems Using Transmitter Preprocessing Based on Noisy Feedback of Vector-Quantized Channel Impulse Responses

Performance of SDMA Systems Using Transmitter Preprocessing Based on Noisy Feedback of Vector-Quantized Channel Impulse Responses Performance of SDMA Systems Usng Transmtter Preprocessng Based on Nosy Feedback of Vector-Quantzed Channe Impuse Responses Du Yang, Le-Lang Yang and Lajos Hanzo Schoo of ECS, Unversty of Southampton, SO7

More information

CHAPTER 7 CONSTRAINED OPTIMIZATION 1: THE KARUSH-KUHN-TUCKER CONDITIONS

CHAPTER 7 CONSTRAINED OPTIMIZATION 1: THE KARUSH-KUHN-TUCKER CONDITIONS CHAPER 7 CONSRAINED OPIMIZAION : HE KARUSH-KUHN-UCKER CONDIIONS 7. Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based unconstraned

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Pulse Coded Modulation

Pulse Coded Modulation Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal

More information

Multipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18

Multipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18 Multpont Analyss for Sblng ars Bostatstcs 666 Lecture 8 revously Lnkage analyss wth pars of ndvduals Non-paraetrc BS Methods Maxu Lkelhood BD Based Method ossble Trangle Constrant AS Methods Covered So

More information

Three Algorithms for Flexible Flow-shop Scheduling

Three Algorithms for Flexible Flow-shop Scheduling Aercan Journal of Appled Scences 4 (): 887-895 2007 ISSN 546-9239 2007 Scence Publcatons Three Algorths for Flexble Flow-shop Schedulng Tzung-Pe Hong, 2 Pe-Yng Huang, 3 Gwoboa Horng and 3 Chan-Lon Wang

More information

THE IMPLEMENTATION OF VARIANCE COMPONENT ESTIMATION (VCE) USING MINQE APPROACH INTO AN ADJUSTMENT OF HEIGHT NETWORKS

THE IMPLEMENTATION OF VARIANCE COMPONENT ESTIMATION (VCE) USING MINQE APPROACH INTO AN ADJUSTMENT OF HEIGHT NETWORKS Internatona Syposu & Exhbton on Geonforaton 2005, Penang, Maaysa, 27-29 Septeber 2005 HE IMPLEMENAION OF VARIANCE COMPONEN ESIMAION (VCE) USING MINQE APPROACH INO AN ADJUSMEN OF HEIGH NEWORKS Zana Abdn

More information

Economics 101. Lecture 4 - Equilibrium and Efficiency

Economics 101. Lecture 4 - Equilibrium and Efficiency Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of

More information

Problem Set #2 Solutions

Problem Set #2 Solutions 4.0 Sprng 003 Page Proble Set # Solutons Proble : a) A onopolst solves the followng proble: ( Q ) Q C ( )= 00Q Q 0Q ax P Q wth frst-order condton (FOC) b) Gven the results fro part a, Q 90 Q = 0 Q P =

More information

1 Review From Last Time

1 Review From Last Time COS 5: Foundatons of Machne Learnng Rob Schapre Lecture #8 Scrbe: Monrul I Sharf Aprl 0, 2003 Revew Fro Last Te Last te, we were talkng about how to odel dstrbutons, and we had ths setup: Gven - exaples

More information

PERFORMANCE ANALYSIS OF BPSK SYSTEM WITH HARD DECISION (63, 36) BCH CODE

PERFORMANCE ANALYSIS OF BPSK SYSTEM WITH HARD DECISION (63, 36) BCH CODE Journal of Theoretcal and Appled Inforaton Technology 005-00 JATIT. All rghts reserved. www.jatt.org PERFORMANCE ANALYSIS OF BPSK SYSTEM WITH HARD DECISION (6, 6 BCH CODE MAHMOUD A. SMADI Departent of

More information

1.3 Hence, calculate a formula for the force required to break the bond (i.e. the maximum value of F)

1.3 Hence, calculate a formula for the force required to break the bond (i.e. the maximum value of F) EN40: Dynacs and Vbratons Hoework 4: Work, Energy and Lnear Moentu Due Frday March 6 th School of Engneerng Brown Unversty 1. The Rydberg potental s a sple odel of atoc nteractons. It specfes the potental

More information

GENERATION OF GOLD-SEQUENCES WITH APPLICATIONS TO SPREAD SPECTRUM SYSTEMS

GENERATION OF GOLD-SEQUENCES WITH APPLICATIONS TO SPREAD SPECTRUM SYSTEMS GENERATION OF GOLD-SEQUENCES WITH APPLICATIONS TO SPREAD SPECTRUM SYSTEMS F. Rodríguez Henríquez (1), Member, IEEE, N. Cruz Cortés (1), Member, IEEE, J.M. Rocha-Pérez (2) Member, IEEE. F. Amaro Sánchez

More information

CHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS

CHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS Chapter 6: Constraned Optzaton CHAPER 6 CONSRAINED OPIMIZAION : K- CONDIIONS Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based

More information

REDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].

REDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1]. REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß

More information

Power Allocation for Distributed BLUE Estimation with Full and Limited Feedback of CSI

Power Allocation for Distributed BLUE Estimation with Full and Limited Feedback of CSI Power Allocaton for Dstrbuted BLUE Estmaton wth Full and Lmted Feedback of CSI Mohammad Fanae, Matthew C. Valent, and Natala A. Schmd Lane Department of Computer Scence and Electrcal Engneerng West Vrgna

More information

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,

More information

L-Edge Chromatic Number Of A Graph

L-Edge Chromatic Number Of A Graph IJISET - Internatona Journa of Innovatve Scence Engneerng & Technoogy Vo. 3 Issue 3 March 06. ISSN 348 7968 L-Edge Chromatc Number Of A Graph Dr.R.B.Gnana Joth Assocate Professor of Mathematcs V.V.Vannaperuma

More information