Antenna Saturation Effects on MIMO Capacity

Size: px
Start display at page:

Download "Antenna Saturation Effects on MIMO Capacity"

Transcription

1 Antenna Saturation Effects on MIMO Capacity T S Pollock, T D Abhayapala, and R A Kennedy National ICT Australia Research School of Inforation Sciences and Engineering The Australian National University, ACT 2, Australia Eail: tonypollock@anueduau Abstract A theoretically derived antenna saturation point is shown to exist for MIMO systes, at which the syste suffers a capacity growth decrease fro linear to arithic with increasing antenna nubers We show this saturation point increases linearly with the radius of the region containing the receiver antennas and is independent of the nuber of antennas Using an alternative forulation of capacity for MIMO systes we derive a closed for capacity expression which uses the physics of signal propagation cobined with statistics of the scattering environent This expression gives the capacity of a MIMO syste in ters of antenna placeent and scattering environent and shows that the saturation effect is due to spatial correlation between receiver antennas I INTRODUCTION Multiple-Input Multiple-Output MIMO counication systes using ulti-antenna arrays siultaneously during transission and reception have generated significant interest in recent years Theoretical work of [1] and [2] showed the potential for significant capacity increases in wireless channels utilizing spatial diversity However, in reality the capacity is significantly reduced when the signals received by different antennas are correlated, corresponding to a reduction of the effective nuber of sub-channels between transit and receive antennas [2], [3] Previous studies have given insights and bounds into the effects of correlated channels [3] [5], however ost have been for a liited set of channel realizations In contrast, one contribution of this paper is an alternative for for capacity which overcoes current liitations, that is, with additional theory for odelling scattering environents which we refine here, we derive a odel which can be readily reconciled with a ultitude of scattering odels and allows us to derive a closed for capacity expression Using this new odel we show that there is a only a sall subset of the eigenvalues generated by a spatial correlation atrix between eleents of an array which effect capacity, regardless of the nuber of antennas in the array This result leads to the channel capacity suffering a saturation effect with increasing antenna nubers, after which additional antennas give liited capacity growth Although previous work has focused on eigenvalues as a eans to bound or siplify the tedious ergodic capacity coputation [1], [5] [7], the ephasis was on the eigenvalues of the rando channel atrix product giving little insight into environental effects on capacity In this paper we expose characteristics of the eigenvalues of an antenna spatial correlation atrix that leads to an antenna saturation effect, which has the detriental effect of reducing capacity growth fro linear to arithic with increasing antenna nubers II CAPACITY OF MULTIPLE ANTENNA SYSTEMS Consider a MIMO syste consisting of S transitting antennas with statistically independent equal power coponents each with Gaussian distributed signals, and Q receiving antennas Then for a fixed linear channel, represented by a S Q channel atrix H, with additive white Gaussian noise the channel capacity is given by [1], [2] C H = I Q + η S HH 1 where η is the average signal-to-noise ratio SNR at each receiver branch, is the deterinant operator, and the Heritian operator In the case of a rando channel odel the channel atrix is stochastic hence the capacity given by 1 is also rando In this situation the ean ergodic capacity is obtained by taking the expectation of capacity C H over all possible channel realizations, { C = E I Q + η } S HH 2 Equation 2 is often used in Monte Carlo siulations to provide capacity results for different channel atrix odels, however these siulations offer little insight and fail to provide a rigorous deonstration into factors deterining capacity Soe analytical lower and upper bounds on the ergodic capacity have been derived eg, see [2], [3], ore recently, [4] gave an upper bound on ergodic capacity based on the correlation between each channel atrix eleent In contrast, we use a capacity forula based on the spatial correlation of the antennas at the receiver and the statistics of the scattering environent, and thus reove any explicit dependencies on the rando channel atrix Due to subtle differences between our capacity result and that of the classical forulation we provide a detailed derivation To study the effects of correlation on capacity we restrict ourselves to receive correlation only and assue no transit correlation, a valid assuption given the less geoetrical size restrictions for base-station arrays A Alternative MIMO Capacity Derivation Let x = [x 1, x 2,, x S ] T be the vector of sybols sent by the S transitting antennas, n = [n 1, n 2,, n Q ] T be the zero ean additive white gaussian noise vector, and

2 y = [y 1, y 2,, y Q ] T be the vector of received sybols, where T denotes the vector transpose, then y = r + n 3 where r is the vector of Q noiseless sybols received after propagation of S sybols x through a flat fading channel The channel capacity of a MIMO channel with total transit power restricted to P is defined as [8] C = ax Ix; y 4 px:trv x P where px is the transitter statistical distribution, V x = E { xx } is the covariance atrix of the transitted sybols x, with E{ } the expectation operator, and Ix; y is the utual inforation of the transitted and received sybols Assuing the receiver noise is independent fro the transitted sybols, the utual inforation is given by Ix; y = Hy Hn 5 with H the differential entropy of a continuous rando variable, hence axiizing capacity is achieved by axiizing the entropy Hy The entropy of a coplex gaussian vector x has the following inequality [1] Hx πev x 6 with base 2 and entropy is expressed in bits Equality in 6 is achieved if and only if x is a circularly syetric coplex Gaussian It is easy to show if x is a circularly syetric coplex Gaussian then so is y, thus, assuing optial gaussian distribution for the transit vector x, the utual inforation becoes Ix; y = V y V n where V y = E{yy }, and V n = E{nn } are the received and noise covariance atrices, respectively Let V r = E{rr } be the covariance atrix of the noiseless received sybols, then, assuing the receiver noise is independent fro the transitted signals, the received covariance atrix V y becoes V y = V r + V n 7 then, assuing uncorrelated noise in each receiver branch, the noise covariance atrix V n becoes σ 2 I Q, with noise variance σ 2, and the utual inforation can be written as, Ix; y = I Q + 1 σ 2 V r 8 In the situation where the transitter has no knowledge about the channel, it is optial to uniforly distribute the power across all the transit antennas [1], thus fro 4 and 8 the MIMO channel capacity is given by C = I Q + 1 σ 2 V r 9 The capacity in 9 is the Shannon capacity for the noiseless received sybol correlation atrix V r which is defined by the statistical scattering environent, antenna nubers and placeent In this paper we use a receiver antenna spatial correlation approach which gives the capacity without the explicit need for the use of a rando channel atrix Here the scattering environent and antenna placeent is captured by the noiseless received sybols correlation atrix V r and is utilized to give an analytical capacity forula B Spatial Correlation Matrix Approach Define the noralized spatial correlation between the coplex envelopes of the received signal at two antennas p and q as ρ pq E{r pr q} σ 2 s 1 where σs 2 is the average signal power received at any receive antenna, assuing noralized channel gains We can then write 1 σ 2 V r = ηr Q 11 with the Q Q spatial correlation atrix R Q ρ 11 ρ 1Q ρ Q1 ρ QQ 12 where each ρ pq depends on antenna separation and the power distribution of the scattering environent For a two diensional propagation environent [9] showed that ρ pq = i n β n J n k z p z q e inφ pq 13 n= where z p is the location of the pth point, φ pq is the angle of the vector connecting z p and z q, k = 2π/λ is the wavenuber with λ the wavelength, and J n is the nth order bessel function of the first kind The coefficients β n characterize any possible scattering environent and are given by β n = 2π Pϕe inϕ dϕ 14 with Pϕ the average power density distribution over ϕ the angle to the scatters For essentially all coon choices of P ϕ: von-mises, gaussian, truncated gaussian, unifor, piecewise constant, polynoial, Laplacian, Fourier series expansion, etc, there is a closed for expression for the β n [9] Therefore we have a closed for representation for the spatial correlation 13 and, as we will see next, for the capacity of a MIMO channel The capacity in 9 can now be expressed as C = I Q + ηr Q 15 which is the capacity for the MIMO syste given the scattering environent, described by the average power density distribution Pϕ, and antenna placeent The capacity given

3 by 15 is axiized when there is no correlation between the receive antennas, ie, R Q = I Q, giving, C ax = Q 1 + η 16 Therefore, in the idealistic situation of zero correlation between receiver antennas we see the best capacity growth achievable is linear in the nuber of antennas This result agrees with the traditional capacity forulation [1], [2] which is widely used to advocate the use of MIMO systes However, as we shall show in the following section, the linear capacity growth result does not hold for the ore realistic situation where the antennas are restricted to a region in space III CAPACITY OF A UNIFORM CIRCULAR ARRAY IN A 2D ISOTROPIC DIFFUSE FIELD Consider a unifor circular array UCA with radius r and Q receiver eleents Denote the set {d l }, l =,, Q 1 as the distance between any eleent and the other eleents in the array in a clockwise or anticlockwise direction, with d = being the distance between the eleent and itself, then d l 2r sinπl/q 17 For the special case of scattering over all angles in the plane we have a 2D isotropic diffuse field often referred to as a rich scattering environent at the receiver and the noralized average power reduces to Pϕ = 1/2π, ϕ [, 2π, giving the spatial correlation between any two points in the plane as ρ pq = J k z p z q 18 Define the spatial correlation between any eleent on the UCA and its lth neighbour as ρ l J k d l 19 then due to UCA syetry, ρ l = ρ Q l, and the correlation atrix becoes a Q Q syetric circulant atrix, [ ] R Q = Circ ρ, ρ 1,, ρ, ρ 2,, ρ 2, ρ where and are the ceiling and floor operators respectively, and x 1 x 2 x N x N x 1 x N 2 Circ [x 1, x 2,, x N ] 21 x 2 x 3 x 1 defines the circulant atrix The deterinant in the capacity forula 15 can be expanded by the product of eigenvalues of the arguent, giving, C = = 1 + ηλ 22 where λ σr Q are the Q eigenvalues of the circulant spatial correlation atrix R Q Therefore we see that the capacity is governed by the eigenvalues of the spatial correlation atrix, and as such their properties dictate the behavior of the capacity given differing scattering environents, antenna nubers and placeent It is iportant to note that the eigenvalues in 22 belong to the spatial correlation atrix R Q and not the rando channel atrix product HH, as analyzed in other work for exaple see [1], [5] [7] Unlike previous work where the eigenvalues of the channel atrix product are used siply as a eans to bound or siplify the tedious ergodic capacity coputation, in the following we expose characteristics of the spatial correlation atrix eigenvalues that lead to valuable insights into the channel capacity A Eigenvalues of Spatial Correlation Matrix R Q The eigenvalues of the syetric circulant atrix R Q are given by a siple closed for expression [1] λ = l= ρ l e i2πl/q 23 For a UCA in a 2D isotropic diffuse field the correlation coefficients are real and syetric, hence 23 represents the Discrete Cosine Transfor DCT of the spatial correlation coefficients; λ = l= ρ l cos 2πl/Q 24 Since R Q is a positive-seidefinite Heritian atrix and with the properties of the DCT it is easy to show the following: λ R 25 λ 26 λ Q = λ, > 27 that is, all the eigenvalues of R Q are real, non-negative and syetric Theore 1 Maxiu Eigenvalue Threshold: For a UCA of radius r in a 2D isotropic diffuse field define the Maxiu Eigenvalue Threshold: M πer/λ 28 then, for {M + 1, Q M 1} the eigenvalues λ are vanishingly sall Before proving Theore 1 we clarify its significance with the following interpretation: For any UCA in a 2D isotropic diffuse field there is a finite set of non-zero spatial correlation atrix eigenvalues, where the set size increases linearly with the radius of the array and is independent of the nuber of antennas Proof: Substitution of 19 and 17 into 24 gives λ = l= J 2kr sin πl/q cos 2πl/Q 29 letting ξ = πl/q and assuing a large nuber of antennas, we can approxiate 29 with the integral λ Q π π J 2kr sin ξ cos 2ξ dξ 3

4 for = {, 1,, /2 } Using the identity [11, p32] J 2 nz = 1 π π then the eigenvalues can be expressed as J 2z sin ψ cos2nψdψ 31 λ QJ 2 kr 32 which is asyptotically equal to 29 with the antenna nuber Using the the following bound [12, p362] on the bessel functions for n J n z z n 2 n Γn + 1 the eigenvalues are then upper-bounded by 33 C/2λ 2 λ Q 34 Γ + 1 with C = 2πr the circuference of the circular array Since Gaa function Γ+1 increases faster than the exponential C/2λ then 34 will rapidly approach for soe > for which Γ + 1 > C/2λ Using a relaxed Stirling lower bound 1 for Γ + 1, we wish to find for which C > 35 e 2λ The inequality in 35 is clearly satisfied when > Ce/2λ, asserting that ust be an integer and fro the definition of C we see that the eigenvalues vanish for > πer/λ, thus giving the axiu eigenvalue threshold in 28 Given the syetric nature of the eigenvalues in 27 then for any nuber of antennas, Q 2M + 1, there is a finite set of 2M + 1 non-zero eigenvalues, λ = {λ, λ 1,, λ M, λ Q M,, λ Q 2, λ } 36 whose nuber of eleents grows only with the radius of the array, and is independent on the nuber of antennas Fig 1 shows the eigenvalues of the spatial correlation atrix R Q for various UCA radii in a 2D isotropic diffuse field Shown as a solid black line, it can be seen that the theoretical axiu eigenvalue threshold derived in Theore 1 gives a good indication of the axiu non-vanishing eigenvalue for each radius B Capacity Growth Liits: Antenna Saturation Due to the dependence of the capacity forula 22 on the eigenvalues of the spatial correlation atrix we see that Theore 1 has significant iplications on the capacity growth with increasing antenna nubers In this section we show that this fixed set size of eigenvalues, regardless of the nuber of antennas, leads to an antenna saturation effect on MIMO capacity Theore 2 Antenna Saturation Point: For a UCA of radius r in a 2D isotropic diffuse field define a saturation point 1 Γz + 1 > 2πz z z e z > z z e z, z > Fig 1 The eigenvalues of the spatial correlation atrix for various UCA radii in a 2D isotropic diffuse scattering field The dark solid line represents the theoretical Maxiu Eigenvalue Threshold derived in Theore 1, and clearly shows the boundary between the significant and vanishing eigenvalues of the spatial correlation atrix for each array radius as the iniu nuber of antennas that generate a full set of non-zero eigenvalues λ ; 2M then, for any Q the channel capacity is governed by C 1 + ηλ + 2 M 1 + ηλ 38 =1 where η = Q/ η is the scaled average SNR ratio at each receiver branch Before giving a proof of Theore 2 we give the following interpretation: For a MIMO syste with a UCA in a 2D isotropic diffuse field there exists a saturation point in the nuber of antennas, which is dependent only on the radius of the array, after which the addition of ore antennas gives diinishing arithic capacity gains Proof: Denoting λ Q σr Q as the eigenvalues generated fro Q antennas on a UCA of radius r, then the capacity 22 can be expressed as = 1 + ηλ Q 39 which, when using 27 and assuing an odd nuber of antennas can be written as 2 C = 1 + ηλ Q /2 + 2 =1 1 + ηλ Q 4 Consider the UCA placed in a 2D isotropic diffuse field, then as a direct result of Theore 1 for Q 2M + 1 the channel 2 fro Theore 1 the case of even Q gives identical results, however to siplify notation we assue an odd nuber of antennas

5 capacity given by 4 is well approxiated using the set of 2M + 1 non-vanishing eigenvalues, that is, C 1 + ηλ Q + 2 M =1 1 + ηλ Q 41 Given two UCAs of equal radius r with antenna nubers Q 1, Q 2 2M +1, and spatial correlation atrix eigenvalues λ Q1 and λ Q2 respectively, then fro 32 we have the following relationship between eigenvalues for systes with different nubers of receive antennas, λ Q 1 Q 1 λq2 42 Q 2 with the approxiation asyptotically equal with the nuber of antennas Define 2M +1 as the iniu nuber of antennas which generate the full set of non-zero eigenvalues, then letting Q 1 = and Q 2 = Q we have λ Q Q λ 43 where λ are the eigenvalues of the spatial correlation atrix R QM Thus the eigenvalues for any UCA of radius r with nuber of antennas Q are siply scaled versions of the eigenvalues generated by an array with antennas Substituting 43 into 41 gives C 1 + ηqλ M ηqλ 44 =1 which behaves arithically with Q since the eigenvalues are constant for all Q, hence the capacity gain is reduced to arithic growth once the antenna nuber reaches the saturation point given by Let η = Q/ η be the scaled average SNR at each antenna, then the capacity 44 becoes 38, thus we see that the effect of any additional antennas above the saturation point is just an increase in the average SNR, or in other words, a noise-averaging effect due to the assuption of independent noise at each antenna It can be observed fro Fig 2 that the capacity does indeed increase approxiately linearly up until the theoretical saturation point defined in Theore 2, after which the capacity reduces to arithic increase with antenna nuber This result has significant iplications for practical MIMO systes, we have shown that there is a saturation point in antenna nubers after which there are diinishing returns in capacity for additional antennas, therefore the saturation point gives the optial nuber of antennas that achieve axiu capacity with iniu cost Further to the UCA case, epirical studies have shown that there are only ever 2M + 1 significant eigenvalues generated by arbitrarily placed antennas within a circular region of radius r We believe the saturation effect seen in UCAs also holds for any antenna configuration within a circular region and we are currently developing theoretical results to support this Capacity bps/hz C ax r=7λ r=5λ r=3λ r=1λ Nuber of Antennas Fig 2 Capacity of MIMO systes for various antenna nubers of a UCA with radii r = 1, 3, 5, and 7 wavelengths in a 2D isotropic diffuse scattering field, along with the theoretical axiu capacity As indicated by the dashed lines for each radii, the Antenna Saturation Point theoretically derived in Theore 2 gives a good indication where the MIMO syste saturates and hence increasing antenna nubers gives only arginal capacity gain REFERENCES [1] IE Telatar, Capacity of ulti-antenna gaussian channels, Tech Rep, ATT Bell Labs, 1995 [2] GJ Foschini and MJ Gans, On liits of wireless counications in a fading environent when using ultiple antennas, Wireless Personal Counications, vol 6, no 3, pp 311, 1998 [3] Da-Shan Shiu, GJ Foschini, MJ Gans, and JM Kahn, Fading correlation and its effect on the capacity of ultieleent antenna systes, IEEE Trans Coun, vol 48, no 3, pp , 2 [4] S Loyka and A Kouki, New copound upper bound on MIMO channel capacity, IEEE Coun Lett, vol 6, no 3, pp 96 98, 22 [5] C Chen-Nee, DNC Tse, JM Kahn, and RA Valenzuela, Capacity scaling in MIMO wireless systes under correlated fading, IEEE Trans Infor Theory, vol 48, no 3, pp , 22 [6] TL Marzetta and BM Hochwald, Capacity of a obile ultipleantenna counication link in rayleigh flat fading, IEEE Trans Infor Theory, vol 45, no 1, pp , 1999 [7] L Hanlen and M Fu, MIMO wireless counication systes: Capacity liits for sparse scattering, in AusCTW 2, Canberra, Australia, 22, pp [8] T Cover and J Thoas, Eleents of Inforation Theory, Wiley, New York, 1991 [9] PD Teal, TD Abhayapala, and RA Kennedy, Spatial correlation for general distributions of scatterers, in ICASSP 2, Florida, 22, pp [1] PJ Davis, Circulant Matrices, Wiley, New York, 1979 [11] GN Watson, Theory of Bessel Functions, Cabridge University Press, 2nd edition, 1958 [12] M Abraowitz and IA Stegun, Handbook of Matheatical Functions, Dover Publications, Inc, New York, 1972

On capacity of multi-antenna wireless channels: Effects of antenna separation and spatial correlation

On capacity of multi-antenna wireless channels: Effects of antenna separation and spatial correlation 3rd AusCTW, Canberra, Australia, Feb. 4 5, 22 On capacity of multi-antenna wireless channels: Effects of antenna separation and spatial correlation Thushara D. Abhayapala 1, Rodney A. Kennedy, and Jaunty

More information

The Transactional Nature of Quantum Information

The Transactional Nature of Quantum Information The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.

More information

Rateless Codes for MIMO Channels

Rateless Codes for MIMO Channels Rateless Codes for MIMO Channels Marya Modir Shanechi Dept EECS, MIT Cabridge, MA Eail: shanechi@itedu Uri Erez Tel Aviv University Raat Aviv, Israel Eail: uri@engtauacil Gregory W Wornell Dept EECS, MIT

More information

On Constant Power Water-filling

On Constant Power Water-filling On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

Chapter 6 1-D Continuous Groups

Chapter 6 1-D Continuous Groups Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:

More information

Upper and Lower Bounds on the Capacity of Wireless Optical Intensity Channels

Upper and Lower Bounds on the Capacity of Wireless Optical Intensity Channels ISIT7, Nice, France, June 4 June 9, 7 Upper and Lower Bounds on the Capacity of Wireless Optical Intensity Channels Ahed A. Farid and Steve Hranilovic Dept. Electrical and Coputer Engineering McMaster

More information

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,

More information

Feature Extraction Techniques

Feature Extraction Techniques Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that

More information

Physics 215 Winter The Density Matrix

Physics 215 Winter The Density Matrix Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it

More information

Optimal Jamming Over Additive Noise: Vector Source-Channel Case

Optimal Jamming Over Additive Noise: Vector Source-Channel Case Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper

More information

Probability Distributions

Probability Distributions Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples

More information

On Conditions for Linearity of Optimal Estimation

On Conditions for Linearity of Optimal Estimation On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at

More information

On the Design of MIMO-NOMA Downlink and Uplink Transmission

On the Design of MIMO-NOMA Downlink and Uplink Transmission On the Design of MIMO-NOMA Downlink and Uplink Transission Zhiguo Ding, Meber, IEEE, Robert Schober, Fellow, IEEE, and H. Vincent Poor, Fellow, IEEE Abstract In this paper, a novel MIMO-NOMA fraework for

More information

Support recovery in compressed sensing: An estimation theoretic approach

Support recovery in compressed sensing: An estimation theoretic approach Support recovery in copressed sensing: An estiation theoretic approach Ain Karbasi, Ali Horati, Soheil Mohajer, Martin Vetterli School of Coputer and Counication Sciences École Polytechnique Fédérale de

More information

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points

More information

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer

More information

Minimum Rates Scheduling for MIMO OFDM Broadcast Channels

Minimum Rates Scheduling for MIMO OFDM Broadcast Channels IEEE Ninth International Syposiu on Spread Spectru Techniques and Applications Miniu Rates Scheduling for MIMO OFDM Broadcast Channels Gerhard Wunder and Thoas Michel Fraunhofer Geran-Sino Mobile Counications

More information

Copyright: 2003 by WPMC Steering Board

Copyright: 2003 by WPMC Steering Board Copyright: 2003 by WPMC Steering Board Copyright and reproduction perission: All rights are reserved and no part of this publication ay be reproduced or transitted in any for or by any eans, electronic

More information

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds

More information

In this chapter, we consider several graph-theoretic and probabilistic models

In this chapter, we consider several graph-theoretic and probabilistic models THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions

More information

3.3 Variational Characterization of Singular Values

3.3 Variational Characterization of Singular Values 3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and

More information

ESE 523 Information Theory

ESE 523 Information Theory ESE 53 Inforation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electrical and Systes Engineering Washington University 11 Urbauer Hall 10E Green Hall 314-935-4173 (Lynda Marha Answers) jao@wustl.edu

More information

Matrix Inversion-Less Signal Detection Using SOR Method for Uplink Large-Scale MIMO Systems

Matrix Inversion-Less Signal Detection Using SOR Method for Uplink Large-Scale MIMO Systems Matrix Inversion-Less Signal Detection Using SOR Method for Uplin Large-Scale MIMO Systes Xinyu Gao, Linglong Dai, Yuting Hu, Zhongxu Wang, and Zhaocheng Wang Tsinghua National Laboratory for Inforation

More information

A Simple Regression Problem

A Simple Regression Problem A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where

More information

Construction of One-Bit Transmit-Signal Vectors for Downlink MU-MISO Systems with PSK Signaling

Construction of One-Bit Transmit-Signal Vectors for Downlink MU-MISO Systems with PSK Signaling 1 Construction of One-Bit Transit-Signal Vectors for Downlink MU-MISO Systes with PSK Signaling Gyu-Jeong Park and Song-Na Hong Ajou University, Suwon, Korea, eail: {net2616, snhong}@ajou.ac.kr and quantized

More information

Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links

Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Tie-Varying Jaing Links Jun Kurihara KDDI R&D Laboratories, Inc 2 5 Ohara, Fujiino, Saitaa, 356 8502 Japan Eail: kurihara@kddilabsjp

More information

A GENERALISED (M, N R ) MIMO RAYLEIGH CHANNEL MODEL FOR NON- ISOTROPIC SCATTERER DISTRIBUTIONS

A GENERALISED (M, N R ) MIMO RAYLEIGH CHANNEL MODEL FOR NON- ISOTROPIC SCATTERER DISTRIBUTIONS A GENERALISED (M, N R MIMO RAYLEIGH CHANNEL MODEL FOR NON- ISOTROPIC SCATTERER DISTRIBUTIONS David B. Smith (1, Thushara D. Abhayapala (2, Tim Aubrey (3 (1 Faculty of Engineering (ICT Group, University

More information

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents

More information

Fixed-to-Variable Length Distribution Matching

Fixed-to-Variable Length Distribution Matching Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de

More information

Rate of Channel Hardening of Antenna Selection Diversity Schemes and Its Implication on Scheduling

Rate of Channel Hardening of Antenna Selection Diversity Schemes and Its Implication on Scheduling SUBMITTED TO THE IEEE TRANSACTIONS ON INFORMATION THEORY Rate of Channel Hardening of Antenna Selection Diversity Schees and Its Iplication on Scheduling arxiv:cs/0703022v [cs.it] 5 Mar 2007 Dongwoon Bai,

More information

Impact of Imperfect Channel State Information on ARQ Schemes over Rayleigh Fading Channels

Impact of Imperfect Channel State Information on ARQ Schemes over Rayleigh Fading Channels This full text paper was peer reviewed at the direction of IEEE Counications Society subject atter experts for publication in the IEEE ICC 9 proceedings Ipact of Iperfect Channel State Inforation on ARQ

More information

Optimal nonlinear Bayesian experimental design: an application to amplitude versus offset experiments

Optimal nonlinear Bayesian experimental design: an application to amplitude versus offset experiments Geophys. J. Int. (23) 155, 411 421 Optial nonlinear Bayesian experiental design: an application to aplitude versus offset experients Jojanneke van den Berg, 1, Andrew Curtis 2,3 and Jeannot Trapert 1 1

More information

Polygonal Designs: Existence and Construction

Polygonal Designs: Existence and Construction Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G

More information

Kernel Methods and Support Vector Machines

Kernel Methods and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic

More information

Physics 139B Solutions to Homework Set 3 Fall 2009

Physics 139B Solutions to Homework Set 3 Fall 2009 Physics 139B Solutions to Hoework Set 3 Fall 009 1. Consider a particle of ass attached to a rigid assless rod of fixed length R whose other end is fixed at the origin. The rod is free to rotate about

More information

Supporting Information for Supression of Auger Processes in Confined Structures

Supporting Information for Supression of Auger Processes in Confined Structures Supporting Inforation for Supression of Auger Processes in Confined Structures George E. Cragg and Alexander. Efros Naval Research aboratory, Washington, DC 20375, USA 1 Solution of the Coupled, Two-band

More information

Solutions 1. Introduction to Coding Theory - Spring 2010 Solutions 1. Exercise 1.1. See Examples 1.2 and 1.11 in the course notes.

Solutions 1. Introduction to Coding Theory - Spring 2010 Solutions 1. Exercise 1.1. See Examples 1.2 and 1.11 in the course notes. Solutions 1 Exercise 1.1. See Exaples 1.2 and 1.11 in the course notes. Exercise 1.2. Observe that the Haing distance of two vectors is the iniu nuber of bit flips required to transfor one into the other.

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

Chaotic Coupled Map Lattices

Chaotic Coupled Map Lattices Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each

More information

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN

More information

SPECTRUM sensing is a core concept of cognitive radio

SPECTRUM sensing is a core concept of cognitive radio World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile

More information

The degree of a typical vertex in generalized random intersection graph models

The degree of a typical vertex in generalized random intersection graph models Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent

More information

ASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical

ASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul

More information

CS Lecture 13. More Maximum Likelihood

CS Lecture 13. More Maximum Likelihood CS 6347 Lecture 13 More Maxiu Likelihood Recap Last tie: Introduction to axiu likelihood estiation MLE for Bayesian networks Optial CPTs correspond to epirical counts Today: MLE for CRFs 2 Maxiu Likelihood

More information

An Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control

An Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control An Extension to the Tactical Planning Model for a Job Shop: Continuous-Tie Control Chee Chong. Teo, Rohit Bhatnagar, and Stephen C. Graves Singapore-MIT Alliance, Nanyang Technological Univ., and Massachusetts

More information

Compression and Predictive Distributions for Large Alphabet i.i.d and Markov models

Compression and Predictive Distributions for Large Alphabet i.i.d and Markov models 2014 IEEE International Syposiu on Inforation Theory Copression and Predictive Distributions for Large Alphabet i.i.d and Markov odels Xiao Yang Departent of Statistics Yale University New Haven, CT, 06511

More information

Error Exponents in Asynchronous Communication

Error Exponents in Asynchronous Communication IEEE International Syposiu on Inforation Theory Proceedings Error Exponents in Asynchronous Counication Da Wang EECS Dept., MIT Cabridge, MA, USA Eail: dawang@it.edu Venkat Chandar Lincoln Laboratory,

More information

Linear Precoding for Large MIMO Configurations and QAM Constellations

Linear Precoding for Large MIMO Configurations and QAM Constellations 1 Linear Precoding for Large MIMO Configurations and QAM Constellations Abstract In this paper, the proble of designing a linear precoder for Multiple-Input Multiple-Output (MIMO systes in conjunction

More information

12 Towards hydrodynamic equations J Nonlinear Dynamics II: Continuum Systems Lecture 12 Spring 2015

12 Towards hydrodynamic equations J Nonlinear Dynamics II: Continuum Systems Lecture 12 Spring 2015 18.354J Nonlinear Dynaics II: Continuu Systes Lecture 12 Spring 2015 12 Towards hydrodynaic equations The previous classes focussed on the continuu description of static (tie-independent) elastic systes.

More information

Complex Quadratic Optimization and Semidefinite Programming

Complex Quadratic Optimization and Semidefinite Programming Coplex Quadratic Optiization and Seidefinite Prograing Shuzhong Zhang Yongwei Huang August 4 Abstract In this paper we study the approxiation algoriths for a class of discrete quadratic optiization probles

More information

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109

More information

1 Proof of learning bounds

1 Proof of learning bounds COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a

More information

Power-Controlled Feedback and Training for Two-way MIMO Channels

Power-Controlled Feedback and Training for Two-way MIMO Channels 1 Power-Controlled Feedback and Training for Two-way MIMO Channels Vaneet Aggarwal, and Ashutosh Sabharwal, Senior Meber, IEEE arxiv:0901188v3 [csit] 9 Jan 010 Abstract Most counication systes use soe

More information

Extension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels

Extension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique

More information

Iterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel

Iterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel 1 Iterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel Rai Cohen, Graduate Student eber, IEEE, and Yuval Cassuto, Senior eber, IEEE arxiv:1510.05311v2 [cs.it] 24 ay 2016 Abstract In

More information

Research Article Data Reduction with Quantization Constraints for Decentralized Estimation in Wireless Sensor Networks

Research Article Data Reduction with Quantization Constraints for Decentralized Estimation in Wireless Sensor Networks Matheatical Probles in Engineering Volue 014, Article ID 93358, 8 pages http://dxdoiorg/101155/014/93358 Research Article Data Reduction with Quantization Constraints for Decentralized Estiation in Wireless

More information

Compressive Sensing Over Networks

Compressive Sensing Over Networks Forty-Eighth Annual Allerton Conference Allerton House, UIUC, Illinois, USA Septeber 29 - October, 200 Copressive Sensing Over Networks Soheil Feizi MIT Eail: sfeizi@it.edu Muriel Médard MIT Eail: edard@it.edu

More information

Symbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm

Symbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat

More information

arxiv: v1 [cs.ds] 17 Mar 2016

arxiv: v1 [cs.ds] 17 Mar 2016 Tight Bounds for Single-Pass Streaing Coplexity of the Set Cover Proble Sepehr Assadi Sanjeev Khanna Yang Li Abstract arxiv:1603.05715v1 [cs.ds] 17 Mar 2016 We resolve the space coplexity of single-pass

More information

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either

More information

Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding

Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED PAPER) 1 Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding Lai Wei, Student Meber, IEEE, David G. M. Mitchell, Meber, IEEE, Thoas

More information

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co

More information

1 Bounding the Margin

1 Bounding the Margin COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost

More information

Nonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy

Nonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy Storage Capacity and Dynaics of Nononotonic Networks Bruno Crespi a and Ignazio Lazzizzera b a. IRST, I-38050 Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I-38050 Povo (Trento) Italy INFN Gruppo

More information

Testing equality of variances for multiple univariate normal populations

Testing equality of variances for multiple univariate normal populations University of Wollongong Research Online Centre for Statistical & Survey Methodology Working Paper Series Faculty of Engineering and Inforation Sciences 0 esting equality of variances for ultiple univariate

More information

arxiv: v1 [cs.ds] 3 Feb 2014

arxiv: v1 [cs.ds] 3 Feb 2014 arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/

More information

4196 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER 2016

4196 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER 2016 4196 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER 2016 Linear Precoding ain for Large MIMO Configurations With QAM and Reduced Coplexity Thoas Ketseoglou, Senior Meber, IEEE, and Ender

More information

A Markov Framework for the Simple Genetic Algorithm

A Markov Framework for the Simple Genetic Algorithm A arkov Fraework for the Siple Genetic Algorith Thoas E. Davis*, Jose C. Principe Electrical Engineering Departent University of Florida, Gainesville, FL 326 *WL/NGS Eglin AFB, FL32542 Abstract This paper

More information

Distributed Subgradient Methods for Multi-agent Optimization

Distributed Subgradient Methods for Multi-agent Optimization 1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions

More information

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More information

Generalized Alignment Chain: Improved Converse Results for Index Coding

Generalized Alignment Chain: Improved Converse Results for Index Coding Generalized Alignent Chain: Iproved Converse Results for Index Coding Yucheng Liu and Parastoo Sadeghi Research School of Electrical, Energy and Materials Engineering Australian National University, Canberra,

More information

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone Characterization of the Line Coplexity of Cellular Autoata Generated by Polynoial Transition Rules Bertrand Stone Abstract Cellular autoata are discrete dynaical systes which consist of changing patterns

More information

DERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS

DERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS DERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS N. van Erp and P. van Gelder Structural Hydraulic and Probabilistic Design, TU Delft Delft, The Netherlands Abstract. In probles of odel coparison

More information

RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE

RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE Proceedings of ICIPE rd International Conference on Inverse Probles in Engineering: Theory and Practice June -8, 999, Port Ludlow, Washington, USA : RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS

More information

Bipartite subgraphs and the smallest eigenvalue

Bipartite subgraphs and the smallest eigenvalue Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.

More information

Topic 5a Introduction to Curve Fitting & Linear Regression

Topic 5a Introduction to Curve Fitting & Linear Regression /7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline

More information

Sharp Time Data Tradeoffs for Linear Inverse Problems

Sharp Time Data Tradeoffs for Linear Inverse Problems Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used

More information

Computable Shell Decomposition Bounds

Computable Shell Decomposition Bounds Coputable Shell Decoposition Bounds John Langford TTI-Chicago jcl@cs.cu.edu David McAllester TTI-Chicago dac@autoreason.co Editor: Leslie Pack Kaelbling and David Cohn Abstract Haussler, Kearns, Seung

More information

Research Article On the Isolated Vertices and Connectivity in Random Intersection Graphs

Research Article On the Isolated Vertices and Connectivity in Random Intersection Graphs International Cobinatorics Volue 2011, Article ID 872703, 9 pages doi:10.1155/2011/872703 Research Article On the Isolated Vertices and Connectivity in Rando Intersection Graphs Yilun Shang Institute for

More information

A remark on a success rate model for DPA and CPA

A remark on a success rate model for DPA and CPA A reark on a success rate odel for DPA and CPA A. Wieers, BSI Version 0.5 andreas.wieers@bsi.bund.de Septeber 5, 2018 Abstract The success rate is the ost coon evaluation etric for easuring the perforance

More information

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter

More information

Secret-Key Sharing Based on Layered Broadcast Coding over Fading Channels

Secret-Key Sharing Based on Layered Broadcast Coding over Fading Channels Secret-Key Sharing Based on Layered Broadcast Coding over Fading Channels Xiaojun Tang WINLAB, Rutgers University Ruoheng Liu Princeton University Predrag Spasojević WINLAB, Rutgers University H. Vincent

More information

Fairness via priority scheduling

Fairness via priority scheduling Fairness via priority scheduling Veeraruna Kavitha, N Heachandra and Debayan Das IEOR, IIT Bobay, Mubai, 400076, India vavitha,nh,debayan}@iitbacin Abstract In the context of ulti-agent resource allocation

More information

Hyperbolic Horn Helical Mass Spectrometer (3HMS) James G. Hagerman Hagerman Technology LLC & Pacific Environmental Technologies April 2005

Hyperbolic Horn Helical Mass Spectrometer (3HMS) James G. Hagerman Hagerman Technology LLC & Pacific Environmental Technologies April 2005 Hyperbolic Horn Helical Mass Spectroeter (3HMS) Jaes G Hageran Hageran Technology LLC & Pacific Environental Technologies April 5 ABSTRACT This paper describes a new type of ass filter based on the REFIMS

More information

Computable Shell Decomposition Bounds

Computable Shell Decomposition Bounds Journal of Machine Learning Research 5 (2004) 529-547 Subitted 1/03; Revised 8/03; Published 5/04 Coputable Shell Decoposition Bounds John Langford David McAllester Toyota Technology Institute at Chicago

More information

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t. CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when

More information

On the approximation of Feynman-Kac path integrals

On the approximation of Feynman-Kac path integrals On the approxiation of Feynan-Kac path integrals Stephen D. Bond, Brian B. Laird, and Benedict J. Leikuhler University of California, San Diego, Departents of Matheatics and Cheistry, La Jolla, CA 993,

More information

Sparse beamforming in peer-to-peer relay networks Yunshan Hou a, Zhijuan Qi b, Jianhua Chenc

Sparse beamforming in peer-to-peer relay networks Yunshan Hou a, Zhijuan Qi b, Jianhua Chenc 3rd International Conference on Machinery, Materials and Inforation echnology Applications (ICMMIA 015) Sparse beaforing in peer-to-peer relay networs Yunshan ou a, Zhijuan Qi b, Jianhua Chenc College

More information

The accelerated expansion of the universe is explained by quantum field theory.

The accelerated expansion of the universe is explained by quantum field theory. The accelerated expansion of the universe is explained by quantu field theory. Abstract. Forulas describing interactions, in fact, use the liiting speed of inforation transfer, and not the speed of light.

More information

IN modern society that various systems have become more

IN modern society that various systems have become more Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto

More information

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving

More information

Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography

Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography Tight Bounds for axial Identifiability of Failure Nodes in Boolean Network Toography Nicola Galesi Sapienza Università di Roa nicola.galesi@uniroa1.it Fariba Ranjbar Sapienza Università di Roa fariba.ranjbar@uniroa1.it

More information

A note on the realignment criterion

A note on the realignment criterion A note on the realignent criterion Chi-Kwong Li 1, Yiu-Tung Poon and Nung-Sing Sze 3 1 Departent of Matheatics, College of Willia & Mary, Williasburg, VA 3185, USA Departent of Matheatics, Iowa State University,

More information

An Improved Particle Filter with Applications in Ballistic Target Tracking

An Improved Particle Filter with Applications in Ballistic Target Tracking Sensors & ransducers Vol. 72 Issue 6 June 204 pp. 96-20 Sensors & ransducers 204 by IFSA Publishing S. L. http://www.sensorsportal.co An Iproved Particle Filter with Applications in Ballistic arget racing

More information

Multiple Antennas in Wireless Communications

Multiple Antennas in Wireless Communications Multiple Antennas in Wireless Communications Luca Sanguinetti Department of Information Engineering Pisa University luca.sanguinetti@iet.unipi.it April, 2009 Luca Sanguinetti (IET) MIMO April, 2009 1 /

More information

Recovering Data from Underdetermined Quadratic Measurements (CS 229a Project: Final Writeup)

Recovering Data from Underdetermined Quadratic Measurements (CS 229a Project: Final Writeup) Recovering Data fro Underdeterined Quadratic Measureents (CS 229a Project: Final Writeup) Mahdi Soltanolkotabi Deceber 16, 2011 1 Introduction Data that arises fro engineering applications often contains

More information

MIMO Channel Correlation in General Scattering Environments

MIMO Channel Correlation in General Scattering Environments MIMO Channel Correlation in General Scattering Environments Tharaka A Lamahewa, Rodney A Kennedy, Thushara D Abhayapala and Terence Betlehem Research School of Information Sciences and Engineering, The

More information