Optimizing Large-Scale MIMO Cellular Downlink: Multiplexing, Diversity, or Interference Nulling?
|
|
- Lucas Simpson
- 6 years ago
- Views:
Transcription
1 Optimizing Large-Sale MIMO Cellular Downlink: Multiplexing, Diversity, or Interferene Nulling? Kianoush Hosseini, Wei Yu, and Raviraj S. Adve The Edward S. Rogers Sr. Department of Eletrial and Computer Engineering University of Toronto, Toronto, ON, M5S 3G4, Canada s: {kianoush, weiyu, Abstrat A base-station BS) equipped with multiple antennas an use its spatial dimensions in three ways: 1) serve multiple users to ahieve a multiplexing gain, 2) provide diversity to its users, and/or 3) null interferene at a hosen subset of out-of-ell users. The main ontribution of this paper is to answer the following question: what is the optimal balane between the three ompeting benefits of multiplexing, diversity and interferene nulling? We answer this question in the ontext of the downlink of a ellular network in whih eah user hooses its best serving BS, and requests nearby interfering BSs for interferene nulling. BSs are equipped with a large number of antennas, serve multiple single-antenna users using zero-foring beamforming and equal power assignment, and null interferene at a subset of out-of-ell users. The remaining spatial dimensions provide transmit diversity. We assume perfet hannel state information at the BSs and users. Utilizing tools from stohasti geometry, we show that, surprisingly, to maximize the per-bs ergodi sum rate, at the optimal alloation of spatial resoures, interferene nulling does not bring tangible benefit. A loseto-optimal strategy is to use none of the spatial resoures for interferene nulling, while reserving 60% of spatial resoures for ahieving multiplexing and the rest for providing diversity. I. INTRODUCTION The advent of the massive multiple-input multiple-output MIMO) onept has brought myriapportunities for optimizing transmissions in wireless ellular networks. Having a large number of base-station BS) antennas at our disposal allows us to ahieve multiple system objetives simultaneously: 1) serve multiple users in the same time-frequeny slot to ahieve a multiplexing gain, 2) provide diversity for the sheduled users, and 3) as often stated as a major advantage of massive MIMO systems, null interferene at out-of-ell users. In fat, in the limit as the number of antennas goes to infinity, interell interferene an be ompletely eliminated, leaving pilot ontamination as the only limiting fator [1]. This paper fouses on the design of large-sale MIMO LS-MIMO) downlink systems [2], where eah BS is equipped with a large but finite number of antennas. In this regime, it is ruial to understand the tradeoffs between multiplexing, diversity and interferene nulling. This paper attempts to answer the following key question in suh a design: between providing spatial multiplexing, diversity and mitigating interell interferene, whih takes priority? Equivalently, what is the optimal tradeoff among the three? Toward this end, we onsider an LS-MIMO system where BSs are distributed aording to an independent Poisson point proess PPP). Further, this paper advoates a user-entri lustering strategy. Eah user reeives the intended signal from the losest BS, while requesting interferene nulling from a luster of nearby BSs. We assume that perfet hannel state information CSI) is available without ost, at both the BSs and users. Eah BS serves multiple single-antenna users simultaneously using zero-foring ZF) beamforming with equal power alloation aross users. In addition, the remaining spatial dimensions at eah BS an potentially be used to provide diversity for the sheduled users and/or to null interferene at a subset of out-of-ell users. This paper arrives at the following surprising onlusion: For a single-tier wireless ellular network, devoting spatial dimensions to interferene nulling does not provide tangible benefit. In fat, it is fairly lose to optimum, in terms of maximizing the per-bs ergodi sum rate, to use about 60% of the spatial dimensions for spatial multiplexing i.e., with M antennas, serve K 0.6M users), leaving the remaining dimensions for spatial diversity, while devoting none of the spatial dimensions for interell interferene nulling. This is despite the fat that a) the BSs are densely deployed and the overall network is interferene limited and b) the analysis does not aount for the ost of hannel estimation. Thus, even with perfet CSI available for all diret and interferene hannels at all BSs without any ost, one may still wish to utilize spatial dimensions for providing spatial multiplexing and diversity for the intended users, rather than interferene nulling for the neighboring users. A. Related Work The tradeoff between multiplexing and diversity for the single-user MIMO hannel [3] and for the uplink single-ell multiuser system [4] are well known. However, the optimal alloation of spatial resoures between multiplexing and diversity in a multiell setting has not been studied rigorously. The multiell setting is of partiular interest beause of the possibility of mitigating interell interferene through oordinating transmission strategies aross multiple BSs, also known as interferene oordination [5]. For example, the problems of joint design of beamformers aross multiple BSs in order to minimize transmit power [6], [7] and to maximize SINR [8], [9] have been studied. The LS-MIMO system onsidered in this paper is the finite-dimensional version of non-ooperative massive MIMO
2 systems, wherein eah BS is equipped with an asymptotially large number of antennas and serves its sheduled users independently. In this asymptoti regime, the unorrelated interell interferene ompletely vanishes; interell oordination is therefore not required [1], [10]. However, with a finite number of antennas, it is not lear as to what extent this desirable feature of massive MIMO systems remains optimal. This paper deviates from the massive MIMO literature in that it expliitly aounts for interferene anellation using beamforming and aims to understand whether it is benefiial to use spatial dimensions for interferene anellation. This paper onsiders a user-entri lustering strategy for interferene nulling. The joint design of user-entri lusters and downlink beamformers for a fixed network topology has been studied in [11], [12]. To aount for the randomness in BS and user loations, we use available tools from stohasti geometry [13]. Stohasti models for the analysis of userentri lustering in wireless systems, where eah BS serves a single user, have been introdued in [14], [15]. This paper arries out a stohasti analysis of an LS-MIMO system under user-entri lustering, where eah BS serves multiple users, and aims at understanding the optimal alloation of spatial resoures to multiplexing, diversity and interferene nulling. B. Summary of Contributions The main ontributions of this paper are as follows: 1) Stohasti analysis of LS-MIMO systems with userentri lustering: We present a stohasti analysis of an LS-MIMO system under user-entri lustering. Using tools from stohasti geometry, we obtain a tratable expression for the per-bs ergodi sum rate as a funtion of average luster size. This expression enables us to effiiently explore the performane of LS-MIMO systems with user-entri lustering under different system parameters. 2) Optimizing alloation of spatial resoures for multiplexing, diversity and interferene nulling: The analysis above allows us to answer our entral question as to the optimal alloation of spatial dimensions. Our analysis shows that a lose-to-optimal strategy is to use 60% of spatial dimensions for multiplexing, the remaining dimensions for providing diversity, while reserving none of the spatial dimensions for interferene nulling. II. SYSTEM MODEL We onsider a time-division duplex TDD) LS-MIMO system, where BSs are distributed aording to a homogeneous PPP Φ with density λ over the entire R 2 plane. Eah BS is equipped with M antennas, and is onstrained to use a maximum power of P T. The single-antenna users are distributed aording to an independent point proess with density onsiderably larger than that of the BSs. Users form ells by assoiating with their losest BSs. Perfet CSI is assumed to be available at the BSs and the users. The wireless fading hannel is modeled as follows. Let g ij = β ij h ij C M 1 denote the hannel between BS j and user i, where h ij CN 0, I M ) indiates a small-sale ) α Rayleigh fading omponent, and β ij = 1 + rij is the path-loss omponent; here, r ij is the distane between user i and BS j, α > 2 denotes the path-loss exponent, and is the referene distane. In a given time-frequeny slot, BS b shedules a set of K users, denoted by S b, hosen from its assoiated users. The BS uses ZF beamforming with equal power alloated aross the K users. Further, BS b uses its available antennas to anel interferene at a subset of out-of-ell users denoted by O b. The normalized ZF beam assigned to user i assoiated with BS b, while nulling the interferene at the other K 1 + O b users, is given by ) I M G ib G ib ĝ ib w ib = ) I M G ib G 2, i S b ib ĝ ib where G ib = [ ĝ 1b,..., ĝ i 1)b, ĝ i+1)b,..., ĝ K+ Ob )b], denotes the ardinality of a set, and ĝ jb = g jb / g jb 2. A. User-Centri Clustering in LS-MIMO Systems The hoie of out-of-ell users for interferene anellation depends on the BS lustering strategy. This paper onsiders user-entri lustering, where eah user identifies the interfering BSs with strong average hannel magnitudes. These BSs form the luster from whih the user requests interferene nulling. Ideally, interferene from the BSs within the luster would all be anelled; only the interferene from outside this luster remains, and is treated as additional noise. However, in reality, beause eah BS has finite number of available spatial dimensions, it an only selet a subset of out-of-ell users for interferene nulling. In partiular, eah BS reserves suffiient antennas to serve its K sheduled users with diversity order ζ. Aounting for the orthogonal property of ZF beamforming, BS b must reserve ζ + K 1 dimensions for transmission to its own users, leaving a maximum of O max = M K ζ + 1 dimensions for interferene nulling at out-of-ell users. If the number of users requesting interferene nulling at BS b is larger than O max, then BS b selets the O max users with the strongest hannel magnitudes within the andidate set, i.e., some out-of-ell users requests would have to be ignored. On the other hand, if the number of requesting users for interferene anellation from BS b is smaller than O max, then the extra antennas are used to provide users with diversity order larger than ζ. In the system desribed above, let Φ Si Φ be the set of BSs loated in the luster of user i, and Φ Ii = Φ \ Φ Si be the set of interfering BSs loateutside the luster. Further, let Φ Si,Intf Φ Si indiate the BSs in Φ Si that do not have suffiient antennas to anel interferene at user i. The reeived signal at user i assoiated with BS b is the sum of the intended signal, residual intra-luster interferene, interluster interferene, and reeiver noise; the reeived signal is
3 given by PT y ib = K gh ibw ib s ib + K PT K gh ijw kj s kj }{{} j Φ Si,Intf k=1 intended signal }{{} + K m Φ Ii u=1 intra-luster interferene PT K gh imw um s um } {{ } inter-luster interferene + n ib }{{} noise where s ib denotes the omplex symbol intended for user i assoiated with BS b suh that E [ s ib 2] = 1, and n ib denotes the additive white Gaussian noise with variane σ 2. B. Analytial Model of User-Centri Clustering Strategy This paper aims to provide a stohasti performane analysis of a user-entri LS-MIMO system. For tratability, the following simplified model is proposed for theoretial analysis: A1 : All BSs from whih a user requests interferene nulling are within a irle of radius R entered at the user. A2 : The number of BSs in the irular luster is the same as the average number of BSs B = λπr 2. A3 : Eah BS has enough antennas not only to serve its K sheduled users with a fixed diversity order of ζ, but also to grant all interferene nulling requests. Together with A1, this means that eah BS must anel interferene at all users loated within distane R from itself. Note that to satisfy A3, eah BS should anel interferene at O max = O = M K ζ + 1 out-of-ell users, while serving its K sheduled users. To allow this, given A2, i.e., assuming eah luster inludes exatly B BSs, the luster radius must be R = B/λπ, where B = O + K) /K. Under these assumptions, the signal-to-interferene-plusnoise ratio SINR) of user i sheduled by BS b is given by ρβ ib h H ib γ ib = w ib 2 K m Φ Ii k=1 ρβ im h H im w km P T where ρ = Kσ indiates the per-user signal-to-noise ratio 2 SNR). The instantaneous rate of user i denoted by R ib is therefore given by R ib = log γ ib ) Γ, where Γ is the SNR gap to apaity. III. A STOCHASTIC GEOMETRY ANALYSIS OF LS-MIMO In this setion, we derive the per-bs ergodi sum rate expression for an LS-MIMO system with user-entri lustering. Theorem 1. Under Assumptions A1-A3, for an LS-MIMO system with user-entri lustering employing ZF beamforming, providing a fixed diversity ζ for eah sheduled user, and distributing power equally aross the downlink beams, 1) TABLE I SYSTEM DESIGN PARAMETERS BS density λ = 1/π500 2 m 2 Total bandwidth W = 20 MHz BS max. available power 43 dbm Bakground noise PSD N o = 174 dbm/hz Noise figure N f = 9 db SNR gap Γ = 3 db Path-loss exponent α = 3.76 Referene distane = m the per-bs ergodi sum rate in nats/se/hz is given by e zγ R ell = K exp 2πλ Ψ I zγ) Ψ II zγ))) 0 z ) ) α ζ df rmin zρ 1 + rdo dr dz 2) dr 0 where F rmin r) = 1 exp λπr 2) for r > 0 is the umulative distribution funtion CDF) of distane between a user and its losest BS [13], and Ψ I s) and Ψ II s) are given as Ψ I s) = d2 o 1 + R ) F 1 K, 2α ; 1 2α ; sρ 1 + R ) )) α 3) Ψ II s) = d 2 o 1 + R ) 1 2 F 1 K, 1α ; 1 1α ; sρ 1 + R ) )) α. 4) Proof: Sine eah BS serves K users, the per-bs ergodi sum rate is given by R ell = KE Φ,h R ib ). The proof of Theorem 1 involves expressing the rate funtion in an integral form using log 1 + x) = e t 0 t 1 e xt ) dt and substituting in the Laplae transforms of the interferene and signal powers. The proof uses the same approah as that used in [16], [17]. The details are omitted here. Remark 1. Theorem 1 ompletely haraterizes the per-bs ergodi sum rate of an LS-MIMO system with user-entri lustering as a funtion of important system parameters, suh as BS deployment density λ), number of users sheduled by eah BS K), diversity order per user ζ), and luster radius R ). Although the expression involves a double integral, using the transformation introdued in Remark 1 of [18], it an be omputed effiiently. IV. OPTIMIZATION OF LS-MIMO SYSTEMS In this setion, we use the per-bs ergodi sum rate expression obtained in the preeding setion to answer the following entral question of this paper: given a fixed number
4 of antennas M at eah BS, what is the optimal number of sheduled users K, the optimal diversity order provided to eah user ζ, and the optimal number of interferene nulling diretions O in terms of maximizing the per-bs ergodi sum rate? Note that K [1,, M], ζ [1,, M K + 1] and O = M K ζ +1, i.e., only two of the triple K, ζ, O) are free variables. The result provided by Theorem 1 allows us to obtain the optimal operating point in an effiient manner. The hosen system parameters are listed in Table I. Numerial results are averagever network topologies and small-sale hannel fading realizations. Figs. 1 and 2 plot the per-bs ergodi sum rate of an LS- MIMO system with M = 15 for various ombinations of K, ζ, O) obtained numerially via simulations and analytially using 2). As the results show, when a substantial number of dimensions are devoted to nulling interferene large O), the numerial and analyti results are in good agreement. However, at low values of O, the two results diverge. The main reason for the disrepany is that in the simulations, one O is speified, the exat number of BSs nulling interferene at eah user, i.e., its exat luster size, is known for any given network topology. However, in the analysis, the values of K and O speify the average number of BSs in a luster, i.e., B = K + O) /K, as explained in Setion II-B. Despite the disrepany, the analysis does apture the general behavior of the system. When both O and K are small, inreasing K improves the per-bs ergodi sum rate, while for large values of O and K, inreasing K degrades system performane. Most importantly, the analysis helps identify the region of O with the maximum sum-rate, leading to the main, and surprising, result of this paper. A remarkable impliation of these analytial and simulation results is that the per-bs ergodi sum rate is largely a dereasing funtion of the number of spatial dimensions assigned to null interferene. The analyti expression in 2) is, in fat, a stritly dereasing funtion of O, while the numerial urves are approximately so. It is nearly optimum for eah BS to operate independently of the other BSs and not to spend spatial resoures on nulling interferene. More speifially, the sum-rate optimal operating point obtained numerially is K, ζ, O ) = 8, 6, 2), and the optimal operating point obtained analytially is K, ζ, O ) = 10, 6, 0). The differene between the ahievable sum rates at these two operating points obtained numerially) is only about 4%. Thus, when K and ζ are properly hosen, an LS- MIMO system without interferene nulling, i.e., with eah BS operating independently, performs lose to optimum. Fig. 3 plots the CDF of downlink user rates evaluated at various hoies of K, ζ, O). As an be seen, the gap between the CDF of the downlink user rates obtained at 10, 6, 0) and 8, 6, 2) is negligible. Clearly, operating at either of these two points is signifiantly superior to operating at any of 1, 15, 0), 15, 1, 0) and 7, 3, 6), but there are other hoies e.g., 9, 5, 2), that also perform reasonably well. These results indiate that it is important to properly balane K and ζ, and to keep O small. Finally, Table II lists the optimal K, ζ, O ) obtained Per-BS ergodi sum rate bits/se/hz) K = 8 K = 7 Numerial Analytial K = Number of dimensions for interferene nulling Fig. 1. Per-BS ergodi sum rate of an LS-MIMO system with M = 15, K = 6, 7, 8, and various hoies of ζ and O obtained both numerially and analytially. Per-BS ergodi sum rate bits/se/hz) K = 10 K = 9 Numerial Analytial K = Number of dimensions for interferene nulling Fig. 2. Per-BS ergodi sum rate of an LS-MIMO system with M = 15, K = 8, 9, 10, and various hoies of ζ and O obtained both numerially and analytially. both numerially and analytially for various values of M. The table also lists the performane gap between these operating points evaluated numerially). In all the senarios, the analysis suggests that it is optimal to ignore interell interferene and retain all spatial dimensions for multiplexing and diversity. The simulation results, in good agreement with the analysis, suggest that only a very few of the spatial dimensions should be used for interferene anellation. Moreover, the simulation results indiate that the performane gap between these points for various values of M is negligible. An interesting observation from the table is that the optimal loading fator η = K + O) /M appears to be always lose to 0.6. This implies that, at a lose-to-optimum operating point, a MIMO BS should devote about 60% of its resoures to multiplexing K/M = 0.6) and the remaining to providing diversity to eah user ζ = M K + 1, O = 0).
5 Cumulative distribution funtion Fig , 15, 0) 15, 1, 0) 7, 3, 6) 10, 6, 0) 9, 5, 2) 8, 6, 2) Downlink user rate Mbits/se) CDF of the downlink user rates evaluated at different K, ζ, O). TABLE II OPTIMAL OPERATING POINTS FOR MAXIMIZING PER-BS ERGODIC SUM RATE OF LS-MIMO SYSTEMS M analytial numerial performane gap η 10 6, 5, 0) 5, 5, 1) 4% , 6, 0) 8, 6, 2) 4% , 16, 0) 24, 15, 2) 3% 0.62 It is worth noting that these results are obtained without aounting for the overhead needed for hannel training. To implement interferene nulling as suggested by the optimal solutions obtained numerially, CSI aquisition overhead would inrease. As an example, with M = 40, at the optimal operating point obtained numerially, in order to serve 24 sheduled users and null interferene at 2 out-ofell users, 26 hannels are needed to be estimated, whereas at the optimal point suggested by analysis, i.e., with no interferene nulling, 25 hannels should be estimated at eah BS. Furthermore, with user-entri lustering, lusters may overlap. Therefore, pilot alloation for CSI aquisition must be organized by some entral entity aross the entire network. This, in fat, represents another level of overhead. As a result, in pratial senarios, enabling interferene nulling may diminish the 3-4% apparent gain of operating under the optimal point obtained numerially. Consequently, it is highly likely that in ellular LS-MIMO systems, ignoring interferene nulling, while properly seleting K and ζ, is, in fat, the best operating ondition. V. CONCLUSION This paper onsiders an LS-MIMO system with userentri lustering operating under ZF beamforming and equal power assignment. For suh a system, we derive omputationally effiient expression for the per-bs ergodi sum rate as a funtion of average luster size using tools from stohasti geometry. We then optimize the per-bs ergodi sum rate of the system as a funtion of the number of users to shedule, the diversity order of eah user and the number of interferene diretions to anel. This paper shows that at the optimal operating point, only a very few of spatial dimensions should be reserved for interferene nulling. In fat, our analysis shows that it is near optimal to alloate none of the spatial resoures for interferene nulling, while using 60% of spatial dimensions for ahieving multiplexing and the rest for providing diversity. Reduing multiplexing and diversity dimensions in order to perform interferene nulling does not appear to bring muh benefit to the overall system sum rate. REFERENCES [1] T. L. Marzetta, Nonooperative ellular wireless with unlimited numbers of base station antennas, IEEE Trans. Wireless Commun., vol. 9, no. 11, pp , Nov [2] K. Hosseini, W. Yu, and R. S. Adve, Large-sale MIMO versus network MIMO for multiell interferene mitigation, IEEE J. Sel. Topis in Signal Proess., vol. 8, no. 5, pp , Ot [3] L. Zheng and D. N. C. Tse, Diversity and multiplexing: a fundamental tradeoff in multiple-antenna hannels, IEEE Trans. Inf. Theory, vol. 49, no. 5, pp , May [4] D. N. C. Tse, P. Viswanath, and L. Zheng, Diversity-multiplexing tradeoff in multiple-aess hannels, IEEE Trans. Inf. Theory, vol. 50, no. 9, pp , Sep [5] D. Lee, H. Seo, B. Clerkx, E. Hardouin, D. Mazzarese, S. Nagata, and K. Sayana, Coordinated multipoint transmission and reeption in LTE-advaned: deployment senarios anperational hallenges, IEEE Commun. Mag., vol. 50, no. 2, pp , Feb [6] R. Zakhour, Z. K. M. Ho, and D. Gesbert, Distributed beamforming oordination in multiell MIMO hannels, Pro. IEEE Veh. Teh. Conf. VTC), Apr [7] H. Dahrouj and W. Yu, Coordinated beamforming for the multiell multi-antenna wireless system, IEEE Trans. Wireless Commun., vol. 9, no. 5, pp , May [8] L. Venturino, N. Prasad, and X. Wang, Coordinated linear beamforming in downlink multi-ell wireless networks, IEEE Trans. Wireless Commun., vol. 9, no. 4, pp , Apr [9] C. Shi, A. Berry, and M. L. Honig, Adaptive beamforming in interferene networks via bi-diretional training, Pro. Conf. Inform. Si., Syst. CISS), May [10] F. Rusek, D. Persson, B. K. Lau, E. G. Larsson, T. L. Marzetta, O. Edfors, and F. Tufvesson, Saling up MIMO: Opportunities and hallenges with very large arrays, IEEE Signal Proess. Mag., vol. 30, no. 1, pp , Jan [11] B. Dai and W. Yu, sparse beamforming and user-entri lustering for downlink loud radio aess network, IEEE Aess, Speial Issue on Reent Advanes in Cloud Radio Aess Networks, vol. 2, pp , Ot [12] M. Hong, R. Sun, H. Baligh, and Z. Q. Luo, Joint base station lustering and beamformer design for partial oordinated transmission in heterogeneous networks, IEEE J. Sel. Areas Commun., vol. 31, no. 2, pp , Feb [13] M. Haenggi, Stohasti geometry for wireless networks. Cambridge University Press, [14] N. Lee, D. Morales-Jimenez, A. Lozano, and R. W. Heath, Spetral effiieny of dynami oordinated beamforming: a stohasti geometry approah, IEEE Trans. Commun., vol. 14, no. 1, pp , Jan [15] Y. Wu, Y. Cui, and B. Clerkx, User-entri interferene nulling in downlink multi-antenna heterogeneous networks, Apr [Online]. Available: [16] Y. Lin and W. Yu, Downlink spetral effiieny of distributed antenna systems under a stohasti model, IEEE Trans. Wireless Commun., vol. 13, no. 12, pp , De [17] K. Hosseini, W. Yu, and R. S. Adve, A stohasti analysis of network MIMO systems, submitted to IEEE Trans. Signal Proess., May [18] X. Zhang and M. Haenggi, A stohasti geometry analysis of inter-ell interferene oordination and intra-ell diversity, IEEE Trans. Wireless Commun., vol. 13, no. 12, pp , Ot
A Novel Validity Index for Determination of the Optimal Number of Clusters
IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers
More informationCross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer
Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based
More informationMulti-Channel Wireless Networks: Capacity and Protocols
Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:
More informationNONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman
NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of
More informationLearning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract
CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationIntroduction to Seismology Spring 2008
MIT OpenCourseWare http://ow.mit.edu 1.510 Introdution to Seismology Spring 008 For information about iting these materials or our Terms of Use, visit: http://ow.mit.edu/terms. 1.510 Leture Notes 3.3.007
More informationAccommodations of QoS DiffServ Over IP and MPLS Networks
Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering
More informationAbstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.
Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,
More informationSelf-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization
Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in
More informationUsing Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks
Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Ho Wireless Networks Giorgio Quer, Federio Librino, Lua Canzian, Leonardo Badia, Mihele Zorzi, University of California San Diego La
More informationPerformance Benchmarks for an Interactive Video-on-Demand System
Performane Benhmarks for an Interative Video-on-Demand System. Guo,P.G.Taylor,E.W.M.Wong,S.Chan,M.Zukerman andk.s.tang ARC Speial Researh Centre for Ultra-Broadband Information Networks (CUBIN) Department
More informationFlow Demands Oriented Node Placement in Multi-Hop Wireless Networks
Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless
More informationBackhaul-Aware Multicell Beamforming for Downlink Cloud Radio Access Network
Backhaul-Aware Multicell Beamforming for Downlink Cloud Radio Access Network Binbin Dai and Wei Yu Department of Electrical and Computer Engineering University of Toronto, Toronto, Ontario M5S 3G4, Canada
More informationHierarchical Multi-stage Interference Alignment for Downlink Heterogeneous Networks
Hierarchical Multi-stage Interference Alignment for Downlink Heterogeneous Networks Tomoki AKITAYA and Takahiko SABA Dept. of Computer Science, Chiba Institute of Technology, 2-17-1 Tsudanuma, Narashino,
More informationDistributed Resource Allocation Strategies for Achieving Quality of Service in Server Clusters
Proeedings of the 45th IEEE Conferene on Deision & Control Manhester Grand Hyatt Hotel an Diego, CA, UA, Deember 13-15, 2006 Distributed Resoure Alloation trategies for Ahieving Quality of ervie in erver
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More informationRAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments
21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,
More informationAlgorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking
Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient
More informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationUplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks
62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering
More informationSINR-based Network Selection for Optimization in Heterogeneous Wireless Networks (HWNs)
48 J. ICT Res. Appl., Vol. 9, No., 5, 48-6 SINR-based Network Seletion for Optimization in Heterogeneous Wireless Networks (HWNs) Abubakar M. Miyim, Mahamod Ismail & Rosdiadee Nordin Department of Eletrial,
More informationAcoustic Links. Maximizing Channel Utilization for Underwater
Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationA Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks
International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali
More informationAn Alternative Approach to the Fuzzifier in Fuzzy Clustering to Obtain Better Clustering Results
An Alternative Approah to the Fuzziier in Fuzzy Clustering to Obtain Better Clustering Results Frank Klawonn Department o Computer Siene University o Applied Sienes BS/WF Salzdahlumer Str. 46/48 D-38302
More informationRandomized User-Centric Clustering for Cloud Radio Access Network with PHY Caching
Randomized User-Centric Clustering for Cloud Radio Access Network with PHY Caching An Liu, Vincent LAU and Wei Han the Hong Kong University of Science and Technology Background 2 Cloud Radio Access Networks
More informationAn Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index
IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive
More informationarxiv: v1 [cs.db] 13 Sep 2017
An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution
More informationApproximate logic synthesis for error tolerant applications
Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu
More informationChemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment
hemial, Biologial and Radiologial Haard Assessment: A New Model of a Plume in a omplex Urban Environment Skvortsov, A.T., P.D. Dawson, M.D. Roberts and R.M. Gailis HPP Division, Defene Siene and Tehnology
More informationNew Channel Allocation Techniques for Power Efficient WiFi Networks
ew Channel Alloation Tehniques for Power Effiient WiFi etworks V. Miliotis, A. Apostolaras, T. Korakis, Z. Tao and L. Tassiulas Computer & Communiations Engineering Dept. University of Thessaly Centre
More informationCooperative Base Station Coloring Achieving dynamic clustering gain from static partitions
Cooperative Base Station Coloring Achieving dynamic clustering gain from static partitions Robert W. Heath Jr. Wireless Networking and Communications Group Department of Electrical and Computer Engineering
More informationThe Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines
The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer
More informationA Multi-Head Clustering Algorithm in Vehicular Ad Hoc Networks
International Journal of Computer Theory and Engineering, Vol. 5, No. 2, April 213 A Multi-Head Clustering Algorithm in Vehiular Ad Ho Networks Shou-Chih Lo, Yi-Jen Lin, and Jhih-Siao Gao Abstrat Clustering
More informationCluster-based Cooperative Communication with Network Coding in Wireless Networks
Cluster-based Cooperative Communiation with Network Coding in Wireless Networks Zygmunt J. Haas Shool of Eletrial and Computer Engineering Cornell University Ithaa, NY 4850, U.S.A. Email: haas@ee.ornell.edu
More informationRecommendation Subgraphs for Web Discovery
Reommation Subgraphs for Web Disovery Arda Antikaioglu Department of Mathematis Carnegie Mellon University aantika@andrew.mu.edu R. Ravi Tepper Shool of Business Carnegie Mellon University ravi@mu.edu
More informationWe don t need no generation - a practical approach to sliding window RLNC
We don t need no generation - a pratial approah to sliding window RLNC Simon Wunderlih, Frank Gabriel, Sreekrishna Pandi, Frank H.P. Fitzek Deutshe Telekom Chair of Communiation Networks, TU Dresden, Dresden,
More informationFacility Location: Distributed Approximation
Faility Loation: Distributed Approximation Thomas Mosibroda Roger Wattenhofer Distributed Computing Group PODC 2005 Where to plae ahes in the Internet? A distributed appliation that has to dynamially plae
More informationWe P9 16 Eigenray Tracing in 3D Heterogeneous Media
We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting
More informationImplementing Load-Balanced Switches With Fat-Tree Networks
Implementing Load-Balaned Swithes With Fat-Tree Networks Hung-Shih Chueh, Ching-Min Lien, Cheng-Shang Chang, Jay Cheng, and Duan-Shin Lee Department of Eletrial Engineering & Institute of Communiations
More informationDegrees of Freedom in Cached Interference Networks with Limited Backhaul
Degrees of Freedom in Cached Interference Networks with Limited Backhaul Vincent LAU, Department of ECE, Hong Kong University of Science and Technology (A) Motivation Interference Channels 3 No side information
More informationAutomatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)
Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University
More informationA radiometric analysis of projected sinusoidal illumination for opaque surfaces
University of Virginia tehnial report CS-21-7 aompanying A Coaxial Optial Sanner for Synhronous Aquisition of 3D Geometry and Surfae Refletane A radiometri analysis of projeted sinusoidal illumination
More informationCluster-Based Cumulative Ensembles
Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,
More informationAnalysis of input and output configurations for use in four-valued CCD programmable logic arrays
nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationParticle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating
Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur
More informationRANGE DOPPLER ALGORITHM FOR BISTATIC SAR PROCESSING BASED ON THE IMPROVED LOFFELD S BISTATIC FORMULA
Progress In Eletromagnetis Researh Letters, Vol. 27, 161 169, 2011 RANGE DOPPLER ALGORITHM FOR ISTATIC SAR PROCESSING ASED ON THE IMPROVED LOFFELD S ISTATIC FORMULA X. Wang 1, * and D. Y. Zhu 2 1 Nanjing
More informationPartial Character Decoding for Improved Regular Expression Matching in FPGAs
Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia
More informationAn Extended Wavenumber-Domain Algorithm Combined with Two-Step Motion Compensation for Bistatic Forward-Looking SAR
Progress In Eletromagnetis Researh Letters, Vol. 63, 85 92, 2016 An Extended Wavenumber-Domain Algorithm Combined with Two-Step Motion Compensation for Bistati Forward-Looking SAR Yuebo Zha 1, * and Wei
More informationSimultaneous image orientation in GRASS
Simultaneous image orientation in GRASS Alessandro BERGAMINI, Alfonso VITTI, Paolo ATELLI Dipartimento di Ingegneria Civile e Ambientale, Università degli Studi di Trento, via Mesiano 77, 38 Trento, tel.
More informationA Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks
A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,
More informationMultiple-Criteria Decision Analysis: A Novel Rank Aggregation Method
3537 Multiple-Criteria Deision Analysis: A Novel Rank Aggregation Method Derya Yiltas-Kaplan Department of Computer Engineering, Istanbul University, 34320, Avilar, Istanbul, Turkey Email: dyiltas@ istanbul.edu.tr
More informationRotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors
Eurographis Symposium on Geometry Proessing (003) L. Kobbelt, P. Shröder, H. Hoppe (Editors) Rotation Invariant Spherial Harmoni Representation of 3D Shape Desriptors Mihael Kazhdan, Thomas Funkhouser,
More informationImproved flooding of broadcast messages using extended multipoint relaying
Improved flooding of broadast messages using extended multipoint relaying Pere Montolio Aranda a, Joaquin Garia-Alfaro a,b, David Megías a a Universitat Oberta de Catalunya, Estudis d Informàtia, Mulimèdia
More informationVideo Data and Sonar Data: Real World Data Fusion Example
14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu
More informationSVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections
SVC-DASH-M: Salable Video Coding Dynami Adaptive Streaming Over HTTP Using Multiple Connetions Samar Ibrahim, Ahmed H. Zahran and Mahmoud H. Ismail Department of Eletronis and Eletrial Communiations, Faulty
More informationthe data. Structured Principal Component Analysis (SPCA)
Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving
More informationA Versatile Dependent Model for Heterogeneous Cellular Networks
1 A Versatile Dependent Model for Heterogeneous Cellular Networks Martin Haenggi University of Notre Dame July 7, 1 Abstract arxiv:135.97v [cs.ni] 7 May 13 We propose a new model for heterogeneous cellular
More informationUnderstanding the Impact of Interference on Collaborative Relays
IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. XX, NO. X, MONTH 200X 1 Understanding the Impact of Interference on Collaborative Relays Yan Zhu, Student Member, IEEE and Haitao Zheng, Member, IEEE Abstract
More informationDisplacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks
Displaement-based Route Update Strategies for Proative Routing Protools in Mobile Ad Ho Networks Mehran Abolhasan 1 and Tadeusz Wysoki 1 1 University of Wollongong, NSW 2522, Australia E-mail: mehran@titr.uow.edu.au,
More informationSemi-Supervised Affinity Propagation with Instance-Level Constraints
Semi-Supervised Affinity Propagation with Instane-Level Constraints Inmar E. Givoni, Brendan J. Frey Probabilisti and Statistial Inferene Group University of Toronto 10 King s College Road, Toronto, Ontario,
More informationCapacity Analysis for Flat and Clustered Wireless Sensor Networks
International Conferene on Wireless Algoritms, Systems and Appliations Capaity Analysis for Flat and Clustered Wireless Sensor etworks Min Song, Bei He Department of Eletrial and Computer Engineering Old
More informationMethods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems
Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Arne Hamann, Razvan Rau, Rolf Ernst Institute of Computer and Communiation Network Engineering Tehnial University of Braunshweig,
More informationSequential Incremental-Value Auctions
Sequential Inremental-Value Autions Xiaoming Zheng and Sven Koenig Department of Computer Siene University of Southern California Los Angeles, CA 90089-0781 {xiaominz,skoenig}@us.edu Abstrat We study the
More informationRelevance for Computer Vision
The Geometry of ROC Spae: Understanding Mahine Learning Metris through ROC Isometris, by Peter A. Flah International Conferene on Mahine Learning (ICML-23) http://www.s.bris.a.uk/publiations/papers/74.pdf
More informationUser-level Fairness Delivered: Network Resource Allocation for Adaptive Video Streaming
User-level Fairness Delivered: Network Resoure Alloation for Adaptive Video Streaming Mu Mu, Steven Simpson, Arsham Farshad, Qiang Ni, Niholas Rae Shool of Computing and Communiations, Lanaster University
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationMulti-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks
Multi-hop Fast Conflit Resolution Algorithm for Ad Ho Networks Shengwei Wang 1, Jun Liu 2,*, Wei Cai 2, Minghao Yin 2, Lingyun Zhou 2, and Hui Hao 3 1 Power Emergeny Center, Sihuan Eletri Power Corporation,
More informationBackpressure with Adaptive Redundancy (BWAR)
Bakpressure with Adaptive Redundany (BWAR) Majed Alresaini alresain AT us. edu Maheswaran Sathiamoorthy msathiam AT us. edu Bhaskar Krishnamahari bkrishna AT us. edu Mihael J. Neely mjneely AT us. edu
More informationGraph-Based vs Depth-Based Data Representation for Multiview Images
Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:
More informationSimulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects
Raabe, Roters, Wang Simulation of Crystallographi Texture and Anisotropie of Polyrystals during Metal Forming with Respet to Saling Aspets D. Raabe, F. Roters, Y. Wang Max-Plank-Institut für Eisenforshung,
More informationDrawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;
Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;
More informationSparse Certificates for 2-Connectivity in Directed Graphs
Sparse Certifiates for 2-Connetivity in Direted Graphs Loukas Georgiadis Giuseppe F. Italiano Aikaterini Karanasiou Charis Papadopoulos Nikos Parotsidis Abstrat Motivated by the emergene of large-sale
More informationWireless Map-Reduce Distributed Computing with Full-Duplex Radios and Imperfect CSI
1 Wireless Map-Reduce Distributed Computing with Full-Duplex Radios and Imperfect CSI Sukjong Ha 1, Jingjing Zhang 2, Osvaldo Simeone 2, and Joonhyuk Kang 1 1 KAIST, School of Electrical Engineering, South
More informationA Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks
A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr
More informationFast Distribution of Replicated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon
ACEEE Int. J. on Information Tehnology, Vol. 3, No. 2, June 2013 Fast Distribution of Repliated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon Email: mmalli@aou.edu.lb
More informationCA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1
Exam (CAT-600) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized
More informationCalculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem
Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion
More informationAnd, the (low-pass) Butterworth filter of order m is given in the frequency domain by
Problem Set no.3.a) The ideal low-pass filter is given in the frequeny domain by B ideal ( f ), f f; =, f > f. () And, the (low-pass) Butterworth filter of order m is given in the frequeny domain by B
More informationThe Implementation of RRTs for a Remote-Controlled Mobile Robot
ICCAS5 June -5, KINEX, Gyeonggi-Do, Korea he Implementation of RRs for a Remote-Controlled Mobile Robot Chi-Won Roh*, Woo-Sub Lee **, Sung-Chul Kang *** and Kwang-Won Lee **** * Intelligent Robotis Researh
More informationCOST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY
COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary
More informationWeak Dependence on Initialization in Mixture of Linear Regressions
Proeedings of the International MultiConferene of Engineers and Computer Sientists 8 Vol I IMECS 8, Marh -6, 8, Hong Kong Weak Dependene on Initialization in Mixture of Linear Regressions Ryohei Nakano
More informationDynamic Backlight Adaptation for Low Power Handheld Devices 1
Dynami Baklight Adaptation for ow Power Handheld Devies 1 Sudeep Pasriha, Manev uthra, Shivajit Mohapatra, Nikil Dutt and Nalini Venkatasubramanian 444, Computer Siene Building, Shool of Information &
More informationPARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING. Yesheng Gao, Kaizhi Wang, Xingzhao Liu
20th European Signal Proessing Conferene EUSIPCO 2012) Buharest, Romania, August 27-31, 2012 PARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING Yesheng Gao, Kaizhi Wang,
More informationRapid, accurate particle tracking by calculation of radial symmetry centers
Rapid, aurate partile traing by alulation of radial symmetry enters Raghuveer Parthasarathy Supplementary Text and Figures Supplementary Figures Supplementary Figure 1 Supplementary Figure Supplementary
More informationJoint Domain Localized Adaptive Processing with Zero Forcing for Multi-Cell CDMA Systems
Joint Domain Localized Adaptive Processing with Zero Forcing for Multi-Cell CDMA Systems Rebecca Y. M. Wong, Raviraj Adve Dept. of Electrical and Computer Engineering, University of Toronto 10 King s College
More informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
More informationUsing Augmented Measurements to Improve the Convergence of ICP
Using Augmented Measurements to Improve the onvergene of IP Jaopo Serafin, Giorgio Grisetti Dept. of omputer, ontrol and Management Engineering, Sapienza University of Rome, Via Ariosto 25, I-0085, Rome,
More informationIN RECENT years, multi-hop wireless networks have made
IEEE JOURNAL ON SELECED AREAS IN COMMUNUNICAIONS, VOL. 3, NO. 7, AUGUS 37 Revenue Maximization in ime-varying Multi-Hop Wireless Networks: A Dynami Priing Approah Yang Song, Chi Zhang, Member, IEEE, Yuguang
More informationPlot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar
Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation
More informationExploring the Commonality in Feature Modeling Notations
Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om
More informationInefficiency of Bargaining Solution in Multiuser Relay Network
International Conference on Electrical and Computer Engineering ICECE'2015 Dec. 15-16, 2015 Pattaya Thailand Inefficiency of Bargaining Solution in Multiuser Relay Network Supenporn.Somjit, Pattarawit
More informationAn Approach to Physics Based Surrogate Model Development for Application with IDPSA
An Approah to Physis Based Surrogate Model Development for Appliation with IDPSA Ignas Mikus a*, Kaspar Kööp a, Marti Jeltsov a, Yuri Vorobyev b, Walter Villanueva a, and Pavel Kudinov a a Royal Institute
More informationCA Single Sign-On 12.x Proven Implementation Professional Exam (CAT-140) Study Guide Version 1.5
Study Guide Version 1.5 PROPRIETARY AND CONFIDENTIAL INFORMATION 2018 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized use,
More informationFast Rigid Motion Segmentation via Incrementally-Complex Local Models
Fast Rigid Motion Segmentation via Inrementally-Complex Loal Models Fernando Flores-Mangas Allan D. Jepson Department of Computer Siene, University of Toronto {mangas,jepson}@s.toronto.edu Abstrat The
More informationChapter 2: Introduction to Maple V
Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard
More informationDATA ACQUISITION AND PROCESSING OF PARALLEL FREQUENCY SAR BASED ON COMPRESSIVE SENSING
Progress In Eletromagnetis Researh, Vol. 133, 199 215, 2013 DATA ACQUISITION AND PROCESSING OF PARALLEL FREQUENCY SAR BASED ON COMPRESSIVE SENSING Y. N. You, H. P. Xu *, C. S. Li, and L. Q. Zhang Shool
More informationExploiting Enriched Contextual Information for Mobile App Classification
Exploiting Enrihed Contextual Information for Mobile App Classifiation Hengshu Zhu 1 Huanhuan Cao 2 Enhong Chen 1 Hui Xiong 3 Jilei Tian 2 1 University of Siene and Tehnology of China 2 Nokia Researh Center
More information