On Sensor Fusion in the Presence of Packet-dropping Communication Channels
|
|
- Russell Daniel
- 5 years ago
- Views:
Transcription
1 On Sensor Fuson n the Presence of Packet-droppng Communcaton Channels Vjay Gupta, Babak Hassb, Rchard M Murray Abstract In ths paper we look at the problem of multsensor data fuson when data s beng communcated over channels that drop packets randomly. We are motvated by the use of wreless lnks for communcaton among nodes n upcomng sensor networks. We wsh to dentfy the nformaton that should be communcated by each node to others gven that some of the nformaton t had transmtted earler mght have been lost. We solve the problem exactly for the case of two sensors and study the performance of the algorthm when more sensors are present. For the two-sensor case, the performance of our algorthm s optmal n the sense that f a packet s receved from the other sensor, t s equvalent to recevng all prevous measurements, rrespectve of the packet drop pattern. I. INTRODUCTION In recent years, there has been a lot of nterest n sensor networks and sensor webs. Orgnally motvated by mltary survellance applcatons, they are now beng employed n a wde varety of applcatons e.g., see [], [23] and the references theren). Compared to usng one bg sensor, typcal advantages of usng sensor networks nclude relatvely lower costs, nherent robustness and greater moblty. Moreover greater accuracy s possble not only due to more observatons beng taken for the same source but also snce multple types of sensors can potentally be used that generate observatons related to dfferent facets of the source. However, the prce to be pad for these advantages s the need for communcaton and greater complexty n the estmaton algorthms. A basc problem n sensor networks s how to fuse the observaton data from many nodes. The classcal Kalman flter s a centralzed flter that assumes all observatons comng to a central computng faclty. Over the years technques have been proposed to decentralze the flter computatons and to mnmze the amount of nformaton that needs to be transmtted among the nodes. An early contrbuton was [24] where nformaton obtaned from the local sensors s combned to generate the global estmate. However t requred that data about the global estmate be sent from the fuson node to the local sensors. A smlar requrement was mposed n the successve orthogonalzaton of measurement subspaces algorthm proposed n [3]. Ths dffculty was frst overcome n [22], [7] n whch each local node sends ts own local estmate based on ts own data and communcates ths estmate and the error covarance Dvson of Engneerng and Appled Scence, Calforna Insttute of Technology, Pasadena, CA 925, USA {gupta,hassb,murray}@caltech.edu Work supported n part by the AFOSR grant F data to the fuson center. Smlar results for contnuous tme systems were presented n [25]. These results were further extended n [2] where both the measurement and tme update steps of the Kalman flter were decentralzed. An alternatve approach for data fuson from many nodes usng the Federated flter was proposed n [5]. A Bayesan method was used and some algorthms presented n [4], [4] whch are optmal when there s no process nose. A scatterng framework [7] and algorthms based on decomposton of the nformaton form of the Kalman flter [9], [3] have also been proposed for data fuson. A scheme based on the concept of dynamc consensus s proposed n [2], but t assumes multple communcaton rounds per tme step of the system evoluton. For some other approaches proposed n the lterature e.g. those based on tracklets [9]), see [8], [8]. However these approaches assume a fxed communcaton topology among the nodes wth a lnk, f present, beng perfect. Wth wreless channels beng used for communcaton between sensor nodes that are moble, ths assumpton needs to be questoned. In such a case, packets of nformaton from one node to another wll be dropped randomly by the communcaton channel present between them. Ths random loss of nformaton rentroduces the problem of correlaton between the estmaton errors of varous nodes [] and renders the approaches proposed n the lterature as suboptmal. We wsh to address ths problem of fndng the optmal global estmate for each node n the case when there are communcaton channels present between the nodes and packets of nformaton are beng randomly dropped. We dsallow approaches such as sendng all the measurements taken by each node across the entre network each tme communcaton s possble because they can potentally ental transmttng arbtrarly large amounts of data. An approach to solve ths problem was proposed n [2] n the context of track-to-track fuson through exchange of state estmates based on each sensor s own local measurements but the specfc scheme that was used was not proven to be optmal. Moreover, as was found n [20], the algorthm for fusng the local state estmates that was proposed s not optmal n the mean square sense. It was subsequently proved n [6], [8] that the technque was based on an assumpton that was not met n general. The man contrbuton of ths paper s to pose the problem of optmal codng for estmaton n the presence of packet droppng channels and to propose an alternatve algorthm whch s optmal n the mean square sense for the case of two sensors beng present. For more than two sensors, the algorthm no
2 longer remans optmal, but we present smulatons to study the performance. Ths paper s organzed as follows. We begn wth the problem formulaton where we also defne our notatons and assumptons. Then we solve the problem for the case of two sensors. In the next secton we present smulaton results to study the performance of the protocol as the number of sensors s ncreased. We fnsh wth conclusons and outlne some avenues for future work. II. PROBLEM FORMULATION Process Sensor Sensor 2 Channel Fg.. Problem block dagram. Only two sensors are shown, but n general there can be N sensors. The basc set-up of the problem s llustrated n Fgure. Consder the dscrete-tme process that evolves accordng to x k+ = F k x k + G k u k, ) where x k R n s the process state and u k R m s zero-mean whte nose process. The ntal condton x 0 s assumed to be a zero mean random varable wth covarance matrx Π 0. The process s beng observed by N sensors N = 2 n the fgure) of the form y k = H kx k + v k, =,, N, 2) wth vk beng zero-mean whte nose processes as Rp well. Further u k u j Q k 0 0 vḳ v j... = 0 Rk δ kj, vk N vj N 0 0 Rk N where the nner product x, y s defned n the usual way see, e.g., [5]) x, y = E [ xy T ]. The sensor models and the nose statstcs are known to all sensors. From now on, we use the words sensor, sensor-estmator and node nterchangeably. The sensors are allowed to communcate through communcaton channels. The communcaton channels are modeled as swtches wth an assocated drop probablty. In other words, for every transmsson, the channel ether transmts the nput to the output wth a certan probablty or does not produce any output. Such a channel model s a natural way to model stuatons where error detecton codng s done for each packet of nformaton. We assume that there s no ntertransmsson codng present. Further we assume that a suffcent number of bts are allotted for each transmsson so that quantzaton effects can be gnored. At every tme nstant, each sensor-estmator thus has a pool of knowledge avalable to t about ts own and other sensors measurements. On the bass of ths knowledge, t constructs an estmate of the process ). The estmate of sensor at tme step k s denoted by ˆx k. We assume that to generate the estmate of x k the measurements tll tme step k can be used. Thus we are nterested n causal estmators only. We further restrct our attenton to lnear estmators. The goal of each sensor-estmator s to mnmze the covarance matrx of the error defned by e k = x k ˆx k. In other words, we are nterested n the lnear least mean square llms) estmator of x k. If there are no communcaton channel related constrants present, each sensor can transmt the latest measurement t has observed to other sensors and at tme step k, every sensor wll thus have access to all the measurements [ {yj }k j=0, {y2 j }k j=0,, ] {yn j }k j=0 taken so far by the N sensors. It can then calculate the best estmate through a Kalman flter see, e.g., [6]). Further, to reduce computaton at every node, the Kalman flter can be decentralzed through any of the technques already mentoned. The key thng to note n these technques s that all nodes are alke n the sense that they have access to an dentcal set of nformaton from whch to construct estmates. Thus every node can functon as a central node whch processes the nformaton sent by other nodes. Further snce the latest nformaton s transmtted at every tme nstant, the estmaton process can be recursve. The ntroducton of communcaton channels, breaks ths symmetry and ntroduces several nterestng ssues nto the problem. ) It s no longer clear what nformaton the nodes should transmt to each other. Transmsson of measurements alone mght not be optmal. Consder two nodes and j joned by a communcaton channel that has just dropped a packet at tme step k. If the node s sendng ts latest measurement alone, at tme step k + the node j wll have no access to the measurement yk. Thus ts estmate wll not be optmal. On the other hand, the node does not know that a packet has been dropped at tme step k. Thus t cannot retransmt the nformaton. If t transmts all the measurements t has taken so far, the amount of nformaton needed to be transmtted wll grow wthout bound as tme k ncreases. 2) The conventonal sensor fuson algorthms are no longer applcable. Ths s so snce the fuson algorthms are usually recursve n ether the measurements or the local estmates. It s not clear what to do n the case when the nformaton s not delvered at a partcular tme step, but can potentally be delvered at some future tme when the communcaton channel allows nformaton to be transmtted. 3) It may be possble to use some routng algorthms to mprove performance. Consder three nodes, j and
3 k. If the communcaton channel between j and k drops a lot of packets, t mght be useful for j to rout nformaton to k through the node. We propose to look at these ssues. We begn wth the case of two sensors where we have tght results and then study the performance for the case of N sensors beng present. We assume a broadcast medum n whch each sensor can talk to every other sensor, except for packet drops. The packet droppng pattern s assumed to be ndependent from one tme step to the next, although as we shall see, for the case of 2 sensors, our algorthm s optmal rrespectve of the packet drop statstcs or model. III. TWO SENSORS PRESENT Let the measurements of the sensors at tme step k be gven by yk and y2 k. Let the estmates be denoted as ˆx k and ˆx 2 k respectvely. Moreover, let â k S denote the best possble estmate of random varable a gven the nformaton n the set S. Note that f there are two nformaton sets S and S 2 such that S S 2, then the error n the estmate â k S2 s less than or equal to the error n the estmate â k S n the mean square sense. Ths s so snce whle formng the estmate â k, we can smply not use the nformaton from S 2. Keepng ths fact n mnd, we frst wrte down the bggest set of nformaton whch can possbly be avalable to a sensor on whch t bases ts estmate. To understand the stuaton a lttle better, we vew t from the poston of sensor. For sensor, we are lookng to optmze the estmate ˆx k+ S, where S can be no bgger than the followng If a packet has been receved from sensor 2 at tme step k, then S = [ {y j }k j=0, {y2 j }k j=0]. If the last packet was receved from sensor 2 at tme step k t, then S = [ {y j }k j=0, {y2 j }k t j=0]. Smlar statements can be wrtten about sensor 2. The error covarances of these estmates wll be a lower bound on all schemes that transmt dfferent nformaton from one sensor to the other. As an example, for a scheme that only sends the latest measurements, the nformaton set would not contan those measurements that are dropped by the channel and would thus be a subset of S mentoned above. Thus ts error covarance wll be more than the one mpled by ths upper bound. In the followng, we propose an algorthm that acheves the upper bound. We wll adopt the vew-pont of sensor n the presentaton. Consder a hypothetcal centralzed estmator, that has access to all the measurements from both the sensors. For ths optmal centralzed flter defne the followng quanttes: ˆx k l : estmate of x k based on all the measurements of both the sensors up to tme step l. P k l : covarance matrx of the error correspondng to the estmate ˆx k l. Equvalently, we can say that the optmal centralzed flter s obtanng measurements from a flter of the form where y k = H k x k + v k, [ ] H H k = k H 2 k whle v k s whte Gaussan nose wth zero mean and covarance [ ] R R k = k 0 0 Rk 2. Thus we can wrte the followng equatons for the tme and measurement updates of the Kalman flter: = P k k + H T k R k H k ˆxk k = P k k ˆxk k + H T k R k y k P k k = F k P k k Fk T + G T k Q k G k ˆx k k = F k ˆx k k. Now we utlze the fact that R k s a block dagonal matrx. Thus Hk T R k H k = [ H ) T ) k R ] k H k Hk T R k y k = [ H ) T ) k R ] k y k. Thus we can rewrte the equatons for the optmal flter as = + [ ) ] ˆxk k = P k k ˆxk k + [ ] ) ˆx k k ˆx k k P k k = F k P k k F T k + G T k Q k G k ˆx k k = F k ˆx k k The frst two equatons form a measurement update step and the last two a tme update step. Note that the communcaton requrement at tme step k from sensor s as follows: For the covarance matrces, no communcaton s requred. They can be calculated by ether sensor, even off-lne. For the estmates, the contrbuton from -th sensor s P k k ˆx k k P k k ˆx k k. We can use ths observaton to obtan the nformaton that sensor should transmt to the other sensor that s used to calculate the optmal estmate. Denote Λ k = ) ˆx k k ) ˆx k k.
4 Thus Λ k s the contrbuton from sensor correspondng to measurement at tme step k. Thus, we can wrte ˆxk k = P k k ˆxk k + Λ k = P k k Aˆxk k + Λ k = Γ k [ Pk k 2 ˆxk k 2 + Λ k ] Global error covarance matrces P k k and P k k. Γ k = P k k Fk P k k. I k = Λ k + Γ ki k. It transmts Ik and wats for the correspondng nformaton from the other sensor. If t receves I j k from the other sensor, t obtans the global estmate as ˆxk k where + Λ k Γ k = P k k APk k. Contnung ths way, we obtan ˆxk k = Γ k Γ k Γ P 0 ˆx 0 + where I k = Λ k + Γ k Λ k + Γ k Γ k Λ k 2 + I k, + Γ k Γ k Γ ) Λ 0 Thus, the nformaton needed from sensor at tme step k s precsely Ik gven n the above equaton.note that the computaton requred for calculatng Ik does not grow wth tme snce Ik = Λ k + Γ k Ik. Ths nformaton vector washes away the effect of any prevous packet losses and leads to the calculaton of optmal estmate at tme step k as f all the measurements from both sensors were avalable, e, t calculates the estmate ˆx k S f the last communcaton from sensor j was possble at tme step k. No knowledge about packet drop probabltes s requred. Thus we have obtaned a way for sensor to obtan the lowest possble error achevable when communcaton from sensor j s possble at tme step k. If the last communcaton was possble at tme step k t, clearly, the best estmate wll be obtaned by fndng the estmate at tme step k t and then propagatng t wth sensor s measurements only. Thus we obtan the followng algorthm that acheves the estmate based on the set S outlned above. We summarze the algorthm n the followng proposton. Proposton : The algorthm outlned below acheves the optmal causal llms estmate based on all of the sensor s own measurements tll tme step k and the other sensor s measurements tll tme step k t where the last communcaton from the other sensor was possble at tme k t. Algorthm : At each tme step k, Each sensor takes ts own measurement and runs a local Kalman flter. At tme step k, t calculates ˆx k k and P from ts local Kalman flter. Λ k ) = ˆx k k P k k ˆx k k. = Γ k Γ k Γ P 0 ˆx 0 + I k + I j k. If t does not receve nformaton from the other sensor, t uses the last global estmate t has and propagates t wth ts own measurements. Note that we have made no assumptons about the statstcs of the packet droppng process or even the knowledge of such statstcs to the two sensors. Thus ths algorthm s optmal for any packet drop pattern. We have proposed a way to encode the nformaton to be sent for estmaton purpose that s optmal under any channel packet drop model. In ths sense, the scheme s smlar n sprt to the work n [0]. IV. MANY SENSORS PRESENT When more than 2 sensors are present, the scheme no longer remans optmal. The reason for ths s the followng. The problem s n calculaton of the global error covarance matrx P k k. The equaton to be used s ) = + H T ) k R k H k. The observaton terms Hk to be ncluded are those whose nformaton s beng fused. For the 2 sensor case, thus terms of both sensors are to be ncluded. For the n-sensor case nformaton from all n sensors mght not be fused at all tme steps, dependng on the partcular lnks whch drop packets at any tme. Thus the proposed method s only sub-optmal n ths case. However, f all nodes are communcatng wth each other farly regularly, the performance loss wll be lmted. Whle t wll be nce to characterze ths performance loss and/or come up wth other algorthms that are optmal for partcular packet drop patterns n say) an expected sense, we have not been able to do that so far. Smulaton results seem to suggest that the performance loss s not huge for the case of multple sensors. In the smulaton results shown below, n case a sensor fals to receve packets from all the sensors, t assumes that the contrbuton from that sensor s 0 and adds up the vectors I j from the sensors that t has been succesful n communcatng to. Ths s clearly a sub-optmal thng to do; a slghtly better scheme would be to try to project the vector I j k based on Ij k f communcaton wth sensor j was not possble at tme step k. However we do not look nto such schemes for the present.
5 V. NUMERICAL EXAMPLES We now consder some numercal examples to see the performance of the algorthm. The system that we consder s a smple scalar system, wth dynamcs gven by x k+ =.25x k + w k, where w k s zero mean whte Gaussan nose wth varance. Consder ntally that the system s observed by 2 sensors of the form y k = x k + v k, 3) where vk s zero mean whte and Gaussan wth varance. Further the noses vk and w k are all ndependent of each other. The sensors are tryng to obtan the best possble estmate of the state of the system x k, whle communcatng over a channel whch drops packets randomly wth a probablty p = 0.3. All the plots that we show below are from the vewpont of sensor. Fgure 2 shows the evoluton of the estmate error covarance as a functon of tme. The packets from sensor 2 to sensor are lost at tmes k = 3 and 8. The sold lne represents the covarance for a hypothetcal sensor that has access to all the measurements taken so far. The crcles correspond to the performance of our scheme whle the remanng curve shows the performance of sensor takng nto account ts own measurements alone. It can be seen that as packets are lost, the error covarance wth our scheme ncreases; however as soon as a sngle packet s receved, the performance s the same as that of the hypothetcal sensor whch has receved all the measurements so far. Estmate error covarance Our scheme Hypothetcal sensor Sensor s own data huge amount, though t does not approach the performance of the hypothetcal deal sensor anymore. Note that the plot shows the estmate error and not the covarance; hence the performance of our sensor can be momentarly better than the hypothetcal sensor. However n a mean squared sense, the hypothetcal sensor, of course, performs the best. Estmate error Hypothetcal sensor Our scheme Sensor s own data Tme step Fg. 3. Performance of estmators under three stuatons n presence of packet-droppng lnk: 4 sensor case To compare the performance of our scheme wth other schemes proposed n the lterature, we use two sensors wth nose varances equal to 0. We compared our scheme wth a scheme n whch only measurements are beng exchanged and another n whch local estmates are beng fused accordng to the scheme proposed n [2]. The results are shown n Fgure 4. The crcles correspond to the estmate gven by our scheme, the sold lne from the measurement exchange scheme whle the astersk curve from the estmate fuson scheme. The remanng curve s the estmate from the hypothetcal deal sensor as dscussed above. Agan our scheme performs better than other schemes proposed n the lterature Tme step Fg. 2. Performance of estmators under three stuatons n presence of a packet-droppng lnk: 2 sensor case We now consder the same system wth measurements beng taken by 4 sensors of the same form as 3). The measurement noses are stll ndependent wth each havng varance. Fgure 3 shows the estmates at sensor for three schemes when the probablty of packet drop n each channel s 0.2. The sold lne shows the estmate f the sensor reled on ts own measurements. The crcles correspond to our scheme whle the thrd curve s that of a hyptothetcal sensor that has access to all the measurements. It can be seen that our scheme mproves the estmates by a Error Covarance Our scheme Hypothetcal sensor Measurement fuson Estmate fuson Tme step Fg. 4. Performance of estmators usng dfferent schemes n the presence of packet-droppng lnk: 2 sensor case
6 VI. CONCLUSIONS AND FUTURE WORKS A. Conclusons In ths paper we looked at the problem of optmal sensor fuson n the presence of communcaton channels. We modeled the communcaton channel as a random swtch and posed the followng problem: Gven that the channel s droppng packets, what should the sensors communcate to each other so that the best estmate s obtaned. For the case of two sensors, we solved the problem and the soluton was ndependent of the packet drop pattern. The performance was much better than the schemes proposed n the lterature. However, the scheme can not be generalzed to an arbtrary number of sensors. B. Future Work Ths work can be extended n many ways. We have smply posed an nterestng and relevant problem and solved t for a specal case. The general soluton for n sensors s stll to be worked out. We can also look at more complcated channel models or codng schemes whch allow some part of the nformaton to pass through sometmes. Also we have assumed perfect knowledge about all the sensor models. It wll be nterestng to relax ths assumpton as well. Another perplexng avenue s to look at nformaton theoretc bounds on the qualty of estmate as a functon of rate of communcaton. VII. ACKNOWLEDGMENTS The authors would lke to thank Amr Farajdana, Hars Vkalo and Tmothy Chung for useful dscussons on the topc. REFERENCES [] Y. Bar-Shalom. On the track-to-track correlaton problem. IEEE Trans. Automat. Contr., AC-26:57 572, 98. [2] Y. Bar-Shalom and L. Campo. The effect of the common process nose on the two-sensor fused-track covarance. IEEE Transactons on Aerospace and Electronc Systems, AES-22: , 986. [3] T. M. Berg and H. F. Durrant-Whyte. Dstrbuted and decentralzed estmaton. In Proc. of the Sngapore Internatonal Conference on Intellgent Control and Instrumentaton, volume 2, pages 8 23, 992. [4] S. Mor C. Y. Chong and K. C. Chang. Informaton fuson n dstrbuted sensor networks. In Proc. of the Amercan Control Conference, pages , 985. [5] N. A. Carlson. Federated square root flter for decentralzed parallel processes. IEEE Transactons on Aerospace and Electronc Systems, AES-26:57 525, 990. [6] K. C. Chang, R. K. Saha, and Y. Bar-Shalom. On optmal trackto-track fuson. IEEE Transactons on Aerospace and Electronc Systems, AES-33:27 276, 997. [7] C. Y. Chong. Herarchcal estmaton. In Proc. 2nd MIT/ONR C 3 W orkshop, 979. [8] C. Y. Chong, S. Mor, W. H. Barker, and K. C. Chang. Archtectures and algorthms for track assocaton and fuson. IEEE Aerospace and Electronc Systems Magazne, 5:5 3, [9] O. E. Drummond. Tracklets and a hybrd fuson wth process nose. Proceedngs of the SPIE, Sgnal and Data Processng of Small Targets, 363, 997. [0] V. Gupta, D. Spanos, B. Hassb, and R. M. Murray. Optmal LQG control across a packet-droppng lnk. IEEE Transactons on Automatc Control, Submtted. [] D. L. Hall and J. Llnas. An ntroducton to multsensor data fuson. Proceedngs of the IEEE, 85):6 23, 997. [2] H. R. Hashempour, S. Roy, and A. J. Laub. Decentralzed structures for parallel Kalman flterng. IEEE Trans. Automat. Contr., AC- 33:88 94, 988. [3] M. F. Hassan, G. Salut, M. G. Sngh, and A. Ttl. A decentralzed computatonal algorthm for the global Kalman flter. IEEE Trans. Automat. Contr., AC-23: , 978. [4] M. E. Lggns II, C. Y. Chong, I. Kadar, M. G. Alford, V. Vanncola, and S. Thomopoulos. Dstrbuted fuson archtechtures and algorthms for target trackng. Proceedngs of the IEEE, 85:95 07, 997. [5] T. Kalath, A. H. Sayed, and B. Hassb. Lnear Estmaton. Prentce Hall, [6] H. Kwakernaak and R. Svan. Lnear Optmal Control Systems. John Wley and Sons, 972. [7] B. C. Levy, D. A. Castanon, G. C. Verghese, and A. S. Wllsky. A scatterng framework for decentralzed estmaton problem. Automatca, 9: , 983. [8] S. Mor, W. H. Barker, C. Y. Chong, and K. C. Chang. Track assocaton and track fuson wth nondetermnstc target dynamcs. IEEE Transactons on Aerospace and Electronc Systems, AES- 38: , [9] B. S. Rao and H. F. Durrant-Whyte. Fully decentralzed algorthm for mult-sensor Kalman flterng. IEE proceedngs, 38, 99. [20] J. A. Roecker and C. D. McGllem. Comparson of two-sensor trackng methods based on state vector fuson and measurement fuson. IEEE Transactons on Aerospace and Electronc Systems, AES-24: , 988. [2] D.P. Spanos, R. Olfat-Saber, and R.M. Murray. Dstrbuted sensor fuson usng dynamc consensus. In Proceedngs of the 2005 IFAC World Congress to be presented), [22] J. L. Speyer. Computaton and transmsson requrements for a decentralzed lnear-quadratc Gaussan control problem. IEEE Trans. Automat. Contr., AC-24: , 979. [23] R. Vswanathan and P. K. Varshney. Dstrbuted detecton wth multple sensors: Part I - fundamentals. Proceedngs of the IEEE, 85):54 63, 997. [24] D. Wllner, C. B. Chang, and K. P. Dunn. Kalman flter algorthms for a multsensor system. In Proc. of the 5th Conference on Decson and Control, pages , 976. [25] A. S. Wllsky, M. G. Bello, D. A. Castanon, B. C. Levy, and G. C. Verghese. Combnng and updatng of local estmates and regonal maps along sets of one-dmensonal tracks. IEEE Trans. Automat. Contr., AC-27:799 83, 982.
Adaptive Modulation for Multiple Antenna Channels
Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,
More informationMulti-sensor optimal information fusion Kalman filter with mobile agents in ring sensor networks
Mult-sensor optmal nformaton fuson Kalman flter wth moble agents n rng sensor networs Behrouz Safarneadan *, Kazem asanpoor ** *Shraz Unversty of echnology, safarnead@sutech.ac.r ** Shraz Unversty of echnology,.hasanpor@gmal.com
More informationPerformance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme
Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,
More informationSpace Time Equalization-space time codes System Model for STCM
Space Tme Eualzaton-space tme codes System Model for STCM The system under consderaton conssts of ST encoder, fadng channel model wth AWGN, two transmt antennas, one receve antenna, Vterb eualzer wth deal
More informationOptimal Decentralized Kalman Filter
17th Medterranean Conference on Control & Automaton Makedona Palace, Thessalonk, Greece June 24-26, 2009 Optmal Decentralzed Kalman Flter S Oruç, J Sjs, PPJ van den Bosch Abstract The Kalman flter s a
More informationUnderstanding the Spike Algorithm
Understandng the Spke Algorthm Vctor Ejkhout and Robert van de Gejn May, ntroducton The parallel soluton of lnear systems has a long hstory, spannng both drect and teratve methods Whle drect methods exst
More informationParameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation
1 Parameter Free Iteratve Decodng Metrcs for Non-Coherent Orthogonal Modulaton Albert Gullén Fàbregas and Alex Grant Abstract We study decoder metrcs suted for teratve decodng of non-coherently detected
More informationA study of turbo codes for multilevel modulations in Gaussian and mobile channels
A study of turbo codes for multlevel modulatons n Gaussan and moble channels Lamne Sylla and Paul Forter (sylla, forter)@gel.ulaval.ca Department of Electrcal and Computer Engneerng Laval Unversty, Ste-Foy,
More informationAnalysis of Time Delays in Synchronous and. Asynchronous Control Loops. Bj rn Wittenmark, Ben Bastian, and Johan Nilsson
37th CDC, Tampa, December 1998 Analyss of Delays n Synchronous and Asynchronous Control Loops Bj rn Wttenmark, Ben Bastan, and Johan Nlsson emal: bjorn@control.lth.se, ben@control.lth.se, and johan@control.lth.se
More informationEstimation Over Wireless Sensor Networks: Tradeoff between Communication, Computation and Estimation Qualities
Proceedngs of the 7th World Congress The Internatonal Federaton of Automatc Control Estmaton Over Wreless Sensor Networs: Tradeoff between Communcaton, Computaton and Estmaton Qualtes Lng Sh Karl Henr
More informationAn Alternation Diffusion LMS Estimation Strategy over Wireless Sensor Network
Progress In Electromagnetcs Research M, Vol. 70, 135 143, 2018 An Alternaton Dffuson LMS Estmaton Strategy over Wreless Sensor Network Ln L * and Donghu L Abstract Ths paper presents a dstrbuted estmaton
More informationThe Performance Improvement of BASK System for Giga-Bit MODEM Using the Fuzzy System
Int. J. Communcatons, Network and System Scences, 10, 3, 1-5 do:10.36/jcns.10.358 Publshed Onlne May 10 (http://www.scrp.org/journal/jcns/) The Performance Improvement of BASK System for Gga-Bt MODEM Usng
More informationDigital Transmission
Dgtal Transmsson Most modern communcaton systems are dgtal, meanng that the transmtted normaton sgnal carres bts and symbols rather than an analog sgnal. The eect o C/N rato ncrease or decrease on dgtal
More informationRejection of PSK Interference in DS-SS/PSK System Using Adaptive Transversal Filter with Conditional Response Recalculation
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol., No., November 23, 3-9 Rejecton of PSK Interference n DS-SS/PSK System Usng Adaptve Transversal Flter wth Condtonal Response Recalculaton Zorca Nkolć, Bojan
More informationDistributed Kalman Filtering for Sensor Networks
Proceedngs of the 46th IEEE Conference on Decson and Control New Orleans, LA, USA, Dec. 12-14, 2007 Dstrbuted Kalman Flterng for Sensor Networks R. Olfat-Saber Abstract In ths paper, we ntroduce three
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
More informationCalculation of the received voltage due to the radiation from multiple co-frequency sources
Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons
More informationTo: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel
To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,
More informationPriority based Dynamic Multiple Robot Path Planning
2nd Internatonal Conference on Autonomous obots and Agents Prorty based Dynamc Multple obot Path Plannng Abstract Taxong Zheng Department of Automaton Chongqng Unversty of Post and Telecommuncaton, Chna
More informationA Simple Satellite Exclusion Algorithm for Advanced RAIM
A Smple Satellte Excluson Algorthm for Advanced RAIM Juan Blanch, Todd Walter, Per Enge Stanford Unversty ABSTRACT Advanced Recever Autonomous Integrty Montorng s a concept that extends RAIM to mult-constellaton
More informationParticle Filters. Ioannis Rekleitis
Partcle Flters Ioanns Reklets Bayesan Flter Estmate state x from data Z What s the probablty of the robot beng at x? x could be robot locaton, map nformaton, locatons of targets, etc Z could be sensor
More informationSource Localization by TDOA with Random Sensor Position Errors - Part II: Mobile sensors
Source Localzaton by TDOA wth Random Sensor Poston Errors - Part II: Moble sensors Xaome Qu,, Lhua Xe EXOUISITUS, Center for E-Cty, School of Electrcal and Electronc Engneerng, Nanyang Technologcal Unversty,
More informationOptimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation
T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and
More informationGeneralized Incomplete Trojan-Type Designs with Unequal Cell Sizes
Internatonal Journal of Theoretcal & Appled Scences 6(1): 50-54(2014) ISSN No. (Prnt): 0975-1718 ISSN No. (Onlne): 2249-3247 Generalzed Incomplete Trojan-Type Desgns wth Unequal Cell Szes Cn Varghese,
More informationDynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University
Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout
More informationNOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION
NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona
More informationA Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of
More informationAn overview of non-centralized Kalman filters
An overvew of non-centralzed Kalman flters Sjs, J; Lazar, M; van den Bosch, PPJ; Papp, Z Publshed n: Control Applcatons, 2008 CCA 2008 IEEE Internatonal Conference, San Antono, Texas, USA, September 3-5,
More informationThroughput Maximization by Adaptive Threshold Adjustment for AMC Systems
APSIPA ASC 2011 X an Throughput Maxmzaton by Adaptve Threshold Adjustment for AMC Systems We-Shun Lao and Hsuan-Jung Su Graduate Insttute of Communcaton Engneerng Department of Electrcal Engneerng Natonal
More informationOptimizing a System of Threshold-based Sensors with Application to Biosurveillance
Optmzng a System of Threshold-based Sensors wth Applcaton to Bosurvellance Ronald D. Frcker, Jr. Thrd Annual Quanttatve Methods n Defense and Natonal Securty Conference May 28, 2008 What s Bosurvellance?
More informationComparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate
Comparatve Analyss of Reuse and 3 n ular Network Based On IR Dstrbuton and Rate Chandra Thapa M.Tech. II, DEC V College of Engneerng & Technology R.V.. Nagar, Chttoor-5727, A.P. Inda Emal: chandra2thapa@gmal.com
More informationReview: Our Approach 2. CSC310 Information Theory
CSC30 Informaton Theory Sam Rowes Lecture 3: Provng the Kraft-McMllan Inequaltes September 8, 6 Revew: Our Approach The study of both compresson and transmsson requres that we abstract data and messages
More informationErgodic Capacity of Block-Fading Gaussian Broadcast and Multi-access Channels for Single-User-Selection and Constant-Power
7th European Sgnal Processng Conference EUSIPCO 29 Glasgow, Scotland, August 24-28, 29 Ergodc Capacty of Block-Fadng Gaussan Broadcast and Mult-access Channels for Sngle-User-Selecton and Constant-Power
More informationThe Stability Region of the Two-User Broadcast Channel
The Stablty Regon of the Two-User Broadcast Channel Nkolaos appas *, Maros Kountours, * Department of Scence and Technology, Lnköpng Unversty, Campus Norrköpng, 60 74, Sweden Mathematcal and Algorthmc
More informationNATIONAL RADIO ASTRONOMY OBSERVATORY Green Bank, West Virginia SPECTRAL PROCESSOR MEMO NO. 25. MEMORANDUM February 13, 1985
NATONAL RADO ASTRONOMY OBSERVATORY Green Bank, West Vrgna SPECTRAL PROCESSOR MEMO NO. 25 MEMORANDUM February 13, 1985 To: Spectral Processor Group From: R. Fsher Subj: Some Experments wth an nteger FFT
More informationA COMPARATIVE STUDY OF DOA ESTIMATION ALGORITHMS WITH APPLICATION TO TRACKING USING KALMAN FILTER
A COMPARATIVE STUDY OF DOA ESTIMATION ALGORITHMS WITH APPLICATION TO TRACKING USING KALMAN FILTER ABSTRACT Venu Madhava M 1, Jagadeesha S N 1, and Yerrswamy T 2 1 Department of Computer Scence and Engneerng,
More informationHigh Speed, Low Power And Area Efficient Carry-Select Adder
Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR), Volume 5, Issue 3, March 2016 Hgh Speed, Low Power And Area Effcent Carry-Select Adder Nelant Harsh M.tech.VLSI Desgn Electroncs
More informationPrediction-based Interacting Multiple Model Estimation Algorithm for Target Tracking with Large Sampling Periods
44 Internatonal Jon Ha Journal Ryu, Du of Hee Control, Han, Automaton, Kyun Kyung and Lee, Systems, and Tae vol. Lyul 6, Song no., pp. 44-53, February 8 Predcton-based Interactng Multple Model Estmaton
More informationIEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES
IEE Electroncs Letters, vol 34, no 17, August 1998, pp. 1622-1624. ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES A. Chatzgeorgou, S. Nkolads 1 and I. Tsoukalas Computer Scence Department, 1 Department
More informationUNIT 11 TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT
UNIT TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT Structure. Introducton Obectves. Key Terms Used n Game Theory.3 The Maxmn-Mnmax Prncple.4 Summary.5 Solutons/Answers. INTRODUCTION In Game Theory, the word
More informationJoint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding
Communcatons and Network, 2013, 5, 312-318 http://dx.do.org/10.4236/cn.2013.53b2058 Publshed Onlne September 2013 (http://www.scrp.org/journal/cn) Jont Power Control and Schedulng for Two-Cell Energy Effcent
More informationFast Code Detection Using High Speed Time Delay Neural Networks
Fast Code Detecton Usng Hgh Speed Tme Delay Neural Networks Hazem M. El-Bakry 1 and Nkos Mastoraks 1 Faculty of Computer Scence & Informaton Systems, Mansoura Unversty, Egypt helbakry0@yahoo.com Department
More informationApplication of Intelligent Voltage Control System to Korean Power Systems
Applcaton of Intellgent Voltage Control System to Korean Power Systems WonKun Yu a,1 and HeungJae Lee b, *,2 a Department of Power System, Seol Unversty, South Korea. b Department of Power System, Kwangwoon
More informationAntenna Selection for Space-Time Communication with Covariance Feedback
Antenna Selecton for Space-Tme Communcaton wth Covarance Feedback G.Barrac and U. Madhow School of Electrcal and Computer Engneerng Unversty of Calforna, Santa Barbara Santa Barbara, CA 93106 Emal: barrac@engneerng.ucsb.edu
More informationAN IMPROVED BIT LOADING TECHNIQUE FOR ENHANCED ENERGY EFFICIENCY IN NEXT GENERATION VOICE/VIDEO APPLICATIONS
Journal of Engneerng Scence and Technology Vol., o. 4 (6) 476-495 School of Engneerng, Taylor s Unversty A IMPROVED BIT LOADIG TECHIQUE FOR EHACED EERGY EFFICIECY I EXT GEERATIO VOICE/VIDEO APPLICATIOS
More informationWideband Spectrum Sensing by Compressed Measurements
Wdeband Spectrum Sensng by Compressed Measurements Davood Mardan Najafabad Department of Electrcal Engneerng Yazd Unversty Emal: d.mardan@stu.yazdun.ac.r Al A. Tadaon Department of Electrcal Engneerng
More informationDistributed Uplink Scheduling in EV-DO Rev. A Networks
Dstrbuted Uplnk Schedulng n EV-DO ev. A Networks Ashwn Srdharan (Sprnt Nextel) amesh Subbaraman, och Guérn (ESE, Unversty of Pennsylvana) Overvew of Problem Most modern wreless systems Delver hgh performance
More informationA MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS
A MODIFIED DIFFERENTIAL EVOLUTION ALORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS Kaml Dmller Department of Electrcal-Electroncs Engneerng rne Amercan Unversty North Cyprus, Mersn TURKEY kdmller@gau.edu.tr
More informationInformation-Theoretic Comparison of Channel Capacity for FDMA and DS-CDMA in a Rayleigh Fading Environment
WSEAS TRANSATIONS on OMMUNIATIONS Informaton-Theoretc omparson of hannel apacty for FDMA and DS-DMA n a Raylegh Fadng Envronment PANAGIOTIS VARZAAS Department of Electroncs Technologcal Educatonal Insttute
More informationHigh Speed ADC Sampling Transients
Hgh Speed ADC Samplng Transents Doug Stuetzle Hgh speed analog to dgtal converters (ADCs) are, at the analog sgnal nterface, track and hold devces. As such, they nclude samplng capactors and samplng swtches.
More informationUplink User Selection Scheme for Multiuser MIMO Systems in a Multicell Environment
Uplnk User Selecton Scheme for Multuser MIMO Systems n a Multcell Envronment Byong Ok Lee School of Electrcal Engneerng and Computer Scence and INMC Seoul Natonal Unversty leebo@moble.snu.ac.kr Oh-Soon
More informationRESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING
RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING Vaslos A. Srs Insttute of Computer Scence (ICS), FORTH and Department of Computer Scence, Unversty of Crete P.O. Box 385, GR 7 Heraklon, Crete,
More informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More informationRevision of Lecture Twenty-One
Revson of Lecture Twenty-One FFT / IFFT most wdely found operatons n communcaton systems Important to know what are gong on nsde a FFT / IFFT algorthm Wth the ad of FFT / IFFT, ths lecture looks nto OFDM
More informationResource Control for Elastic Traffic in CDMA Networks
Resource Control for Elastc Traffc n CDMA Networks Vaslos A. Srs Insttute of Computer Scence, FORTH Crete, Greece vsrs@cs.forth.gr ACM MobCom 2002 Sep. 23-28, 2002, Atlanta, U.S.A. Funded n part by BTexact
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationAn Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
An Energy Effcent Herarchcal Clusterng Algorthm for Wreless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette, IN, USA {seema,
More informationPerformance Analysis of Power Line Communication Using DS-CDMA Technique with Adaptive Laguerre Filters
Internatonal Conference on Informaton and Electroncs Engneerng IPCSIT vol.6 ( ( IACSIT Press, Sngapore Performance Analyss of Power Lne Communcaton Usng DS-CDMA Technque wth Adaptve Laguerre Flters S.
More informationRelevance of Energy Efficiency Gain in Massive MIMO Wireless Network
Relevance of Energy Effcency Gan n Massve MIMO Wreless Network Ahmed Alzahran, Vjey Thayananthan, Muhammad Shuab Quresh Computer Scence Department, Faculty of Computng and Informaton Technology Kng Abdulazz
More informationOn the Feasibility of Receive Collaboration in Wireless Sensor Networks
On the Feasblty of Receve Collaboraton n Wreless Sensor Networs B. Bantaleb, S. Sgg and M. Begl Computer Scence Department Insttute of Operatng System and Computer Networs (IBR) Braunschweg, Germany {behnam,
More informationDistributed Resource Allocation and Scheduling in OFDMA Wireless Networks
Southern Illnos Unversty Carbondale OpenSIUC Conference Proceedngs Department of Electrcal and Computer Engneerng 11-2006 Dstrbuted Resource Allocaton and Schedulng n OFDMA Wreless Networks Xangpng Qn
More information1 GSW Multipath Channel Models
In the general case, the moble rado channel s pretty unpleasant: there are a lot of echoes dstortng the receved sgnal, and the mpulse response keeps changng. Fortunately, there are some smplfyng assumptons
More informationChaotic Filter Bank for Computer Cryptography
Chaotc Flter Bank for Computer Cryptography Bngo Wng-uen Lng Telephone: 44 () 784894 Fax: 44 () 784893 Emal: HTwng-kuen.lng@kcl.ac.ukTH Department of Electronc Engneerng, Dvson of Engneerng, ng s College
More informationOptimal State Prediction for Feedback-Based QoS Adaptations
Optmal State Predcton for Feedback-Based QoS Adaptatons Baochun L, Dongyan Xu, Klara Nahrstedt Department of Computer Scence Unversty of Illnos at Urbana-Champagn b-l, d-xu, klara @cs.uuc.edu Abstract
More informationA High-Sensitivity Oversampling Digital Signal Detection Technique for CMOS Image Sensors Using Non-destructive Intermediate High-Speed Readout Mode
A Hgh-Senstvty Oversamplng Dgtal Sgnal Detecton Technque for CMOS Image Sensors Usng Non-destructve Intermedate Hgh-Speed Readout Mode Shoj Kawahto*, Nobuhro Kawa** and Yoshak Tadokoro** *Research Insttute
More informationANNUAL OF NAVIGATION 11/2006
ANNUAL OF NAVIGATION 11/2006 TOMASZ PRACZYK Naval Unversty of Gdyna A FEEDFORWARD LINEAR NEURAL NETWORK WITH HEBBA SELFORGANIZATION IN RADAR IMAGE COMPRESSION ABSTRACT The artcle presents the applcaton
More informationLOCAL DECODING OF WALSH CODES TO REDUCE CDMA DESPREADING COMPUTATION
LOCAL DECODING OF WALSH CODES TO REDUCE CDMA DESPREADING COMPUTATION Albert M. Chan, Jon Feldman, and Raghu Madyastha (Vanu, Inc., Cambrdge, MA, USA, {chanal,jonfeld,raghu}@vanu.com); Potr Indyk and Davd
More informationMalicious User Detection in Spectrum Sensing for WRAN Using Different Outliers Detection Techniques
Malcous User Detecton n Spectrum Sensng for WRAN Usng Dfferent Outlers Detecton Technques Mansh B Dave #, Mtesh B Nakran #2 Assstant Professor, C. U. Shah College of Engg. & Tech., Wadhwan cty-363030,
More informationPerformance Study of OFDMA vs. OFDM/SDMA
Performance Study of OFDA vs. OFD/SDA Zhua Guo and Wenwu Zhu crosoft Research, Asa 3F, Beng Sgma Center, No. 49, Zhchun Road adan Dstrct, Beng 00080, P. R. Chna {zhguo, wwzhu}@mcrosoft.com Abstract: In
More informationDistributed Fault Detection of Wireless Sensor Networks
Dstrbuted Fault Detecton of Wreless Sensor Networs Jnran Chen, Shubha Kher, and Arun Soman Dependable Computng and Networng Lab Iowa State Unversty Ames, Iowa 50010 {jrchen, shubha, arun}@astate.edu ABSTRACT
More informationThe Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks
Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. The Impact of Spectrum Sensng Frequency and Pacet- Loadng
More informationResource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks
Resource Allocaton Optmzaton for Devce-to- Devce Communcaton Underlayng Cellular Networks Bn Wang, L Chen, Xaohang Chen, Xn Zhang, and Dacheng Yang Wreless Theores and Technologes (WT&T) Bejng Unversty
More informationComparison of Two Measurement Devices I. Fundamental Ideas.
Comparson of Two Measurement Devces I. Fundamental Ideas. ASQ-RS Qualty Conference March 16, 005 Joseph G. Voelkel, COE, RIT Bruce Sskowsk Rechert, Inc. Topcs The Problem, Eample, Mathematcal Model One
More informationUtility-based Routing
Utlty-based Routng Je Wu Dept. of Computer and Informaton Scences Temple Unversty Roadmap Introducton Why Another Routng Scheme Utlty-Based Routng Implementatons Extensons Some Fnal Thoughts 2 . Introducton
More informationApproximate Joint MAP Detection of Co-Channel Signals
Approxmate Jont MAP Detecton of Co-Channel Sgnals Danel J Jaubsn and R Mchael Buehrer Moble and Portable Rado Research Group (MPRG), Wreless@VT, Vrgna Tech, Blacsburg, Vrgna, USA E-mal: {djj,buehrer}@vtedu
More informationA new family of linear dispersion code for fast sphere decoding. Creative Commons: Attribution 3.0 Hong Kong License
tle A new famly of lnear dsperson code for fast sphere decodng Author(s) Da, XG; Cheung, SW; Yuk, I Ctaton he nd IEEE Canadan Conference on Electrcal and Computer Engneerng (CCECE 009), St. John's, L.,
More informationChannel aware scheduling for broadcast MIMO systems with orthogonal linear precoding and fairness constraints
Channel aware schedulng for broadcast MIMO systems wth orthogonal lnear precodng and farness constrants G Prmolevo, O Smeone and U Spagnoln Dp d Elettronca e Informazone, Poltecnco d Mlano Pzza L da Vnc,
More informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationGuidelines for CCPR and RMO Bilateral Key Comparisons CCPR Working Group on Key Comparison CCPR-G5 October 10 th, 2014
Gudelnes for CCPR and RMO Blateral Key Comparsons CCPR Workng Group on Key Comparson CCPR-G5 October 10 th, 2014 These gudelnes are prepared by CCPR WG-KC and RMO P&R representatves, and approved by CCPR,
More informationAn Improved Method for GPS-based Network Position Location in Forests 1
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the WCNC 008 proceedngs. An Improved Method for GPS-based Network Poston Locaton n
More informationDecomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications
Techncal Report Decomposton Prncples and Onlne Learnng n Cross-Layer Optmzaton for Delay-Senstve Applcatons Abstract In ths report, we propose a general cross-layer optmzaton framework n whch we explctly
More informationTh P5 13 Elastic Envelope Inversion SUMMARY. J.R. Luo* (Xi'an Jiaotong University), R.S. Wu (UC Santa Cruz) & J.H. Gao (Xi'an Jiaotong University)
-4 June 5 IFEMA Madrd h P5 3 Elastc Envelope Inverson J.R. Luo* (X'an Jaotong Unversty), R.S. Wu (UC Santa Cruz) & J.H. Gao (X'an Jaotong Unversty) SUMMARY We developed the elastc envelope nverson method.
More informationTest 2. ECON3161, Game Theory. Tuesday, November 6 th
Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)
More informationThe Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game
8 Y. B. LI, R. YAG, Y. LI, F. YE, THE SPECTRUM SHARIG I COGITIVE RADIO ETWORKS BASED O COMPETITIVE The Spectrum Sharng n Cogntve Rado etworks Based on Compettve Prce Game Y-bng LI, Ru YAG., Yun LI, Fang
More informationOn Interference Alignment for Multi-hop MIMO Networks
013 Proceedngs IEEE INFOCOM On Interference Algnment for Mult-hop MIMO Networks Huacheng Zeng Y Sh Y. Thomas Hou Wenng Lou Sastry Kompella Scott F. Mdkff Vrgna Polytechnc Insttute and State Unversty, USA
More informationThis is the published version of a paper presented at Control Conference (ECC), 2013 European.
http://www.dva-portal.org Ths s the publshed verson of a paper presented at Control Conference (ECC), 3 European. Ctaton for the orgnal publshed paper: Boem, F., Xu, Y., Fschone, C., Parsn, T. (3) Dstrbuted
More informationA NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems
0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 12, DECEMBER
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 2, DECEMBER 204 695 On Spatal Capacty of Wreless Ad Hoc Networks wth Threshold Based Schedulng Yue Lng Che, Student Member, IEEE, Ru Zhang, Member,
More informationControl Chart. Control Chart - history. Process in control. Developed in 1920 s. By Dr. Walter A. Shewhart
Control Chart - hstory Control Chart Developed n 920 s By Dr. Walter A. Shewhart 2 Process n control A phenomenon s sad to be controlled when, through the use of past experence, we can predct, at least
More informationMIMO-OFDM Systems. Team Telecommunication and Computer Networks, FSSM, University Cadi Ayyad, P.O. Box 2390, Marrakech, Morocco.
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 8, Issue 3, ay 2011 ISSN (Onlne: 1694-0814 A Low-complexty Power and Bt Allocaton Algorthm for ultuser IO-OFD Systems Ayad Habb 1, Khald El Baamran
More information08/20/99 1 T1E1.4/99-333R1. Title: Soft Cancellation via Iterative Decoding to Mitigate the effect of Home-LANs on VDSL (333R1)
08/0/99 TE.4/99-333R Project: TE.4: VDSL Ttle: Soft Cancellaton va Iteratve Decodng to Mtgate the effect of Home-LANs on VDSL (333R) Contact: Date: Dst'n: K. Cheong, J. Cho, J. Fan, R. Neg, N.Wu and J.
More informationA Novel GNSS Weak Signal Acquisition Using Wavelet Denoising Method
A Novel GNSS Weak Sgnal Acquston Usng Wavelet Denosng Method Jn Tan, Lu Yang, BeHang Unversty, P.R.Chna BIOGRAPHY Jn Tan s a post-doctor n School of Electronc and Informaton Engneerng, BeHang Unversty,
More informationDESIGN OF OPTIMIZED FIXED-POINT WCDMA RECEIVER
DESIGN OF OPTIMIZED FIXED-POINT WCDMA RECEIVER Ha-Nam Nguyen, Danel Menard, and Olver Senteys IRISA/INRIA, Unversty of Rennes, rue de Kerampont F-3 Lannon Emal: hanguyen@rsa.fr ABSTRACT To satsfy energy
More informationMIMO Precoding Using Rotating Codebooks
1 MIMO Precodng Usng Rotatng Codebooks C Jang, M Wang, C Yang Abstract Next generaton wreless communcatons rely on multple nput multple output (MIMO) technques to acheve hgh data rates. eedback of channel
More informationSparse multidimensional scaling for blind tracking in sensor networks
Sparse multdmensonal scalng for blnd trackng n sensor networks R. Rangarajan 1, R. Rach 2, and A. O. Hero III 3 1 Unversty of Mchgan rangaraj@eecs.umch.edu 2 Unversty of Mchgan ravvr@eecs.umch.edu 3 Unversty
More informationSENSOR FUSION. J.Z. Sasiadek Department of Mechanical & Aerospace Engineering, Carleton University
' Annual Revews n Control PERGAMON Annual Revews n Control 26 (2002) 203-228 www.elsever.com/locate/arcontrol SENSOR FUSON J.Z. Sasadek Department of Mechancal & Aerospace Engneerng, Carleton Unversty
More informationAN EFFICIENT ITERATIVE DFT-BASED CHANNEL ESTIMATION FOR MIMO-OFDM SYSTEMS ON MULTIPATH CHANNELS
AN FFICINT ITRATIV DFT-BASD CHANNL STIMATION FOR MIMO-OFDM SYSTMS ON MULTIPATH CHANNLS Jan Hafang Graduate Unversty of the Chnese Academy of Scences Insttute of Semconductors, CAS Beng, Chna hf@sem.ac.cn
More informationIndex Terms Adaptive modulation, Adaptive FEC, Packet Error Rate, Performance.
ANALYTICAL COMPARISON OF THE PERFORMANCE OF ADAPTIVE MODULATION AND CODING IN WIRELESS NETWORK UNDER RAYLEIGH FADING 723 Sab Y.M. BANDIRI, Rafael M.S. BRAGA and Danlo H. SPADOTI Federal Unversty of Itajubá
More informationCooperative localization method for multi-robot based on PF-EKF
Scence n Chna Seres F: Informaton Scences 008 SCIENCE IN CHINA PRESS Sprnger www.scchna.com nfo.scchna.com www.sprngerln.com Cooperatve localzaton method for mult-robot based on PF-EKF WANG Lng, WAN JanWe,
More informationA Current Differential Line Protection Using a Synchronous Reference Frame Approach
A Current Dfferental Lne rotecton Usng a Synchronous Reference Frame Approach L. Sousa Martns *, Carlos Fortunato *, and V.Fernão res * * Escola Sup. Tecnologa Setúbal / Inst. oltécnco Setúbal, Setúbal,
More information