Feasibility Conditions of Interference Alignment via Two Orthogonal Subcarriers

Size: px
Start display at page:

Download "Feasibility Conditions of Interference Alignment via Two Orthogonal Subcarriers"

Transcription

1 Feasblty Condtons of Interference Algnment va Two Ortogonal Subcarrers Stefan Ders and Gerard Kramer Insttute for Communcatons Engneerng Tecnsce Unverstät Müncen, Munc, Germany Emal: {stefan.ders, Wolfgang Zrwas Noa Semens Networs Munc, Germany Emal: arxv:0.5v [cs.it] Mar 0 Abstract Condtons are derved on e-of-sgt cannels to ensure te feasblty of nterference algnment. Te condtons nvolve coosng only te spacng between two subcarrers of an ortogonal frequency dvson multplexng OFDM sceme. Te maxmal degrees-of-freedom are aceved and even an upper bound on te sum-rate of nterference algnment s approaced arbtrarly closely. I. INTRODUCTION Interference algnment IA s a promsng metod because t aceves ger trougput n nterference lmted scenaros tan conventonal metods suc as tme- or frequency-dvson multplexng or treatng nterference as nose []. Te man dea of IA s to use precodng at te transmtters to algn nterference at eac recever n one subspace. Te ortogonal subspace s used for nterference-free communcaton. One commonly measures performance by te sum of te rates tat te users can transmt relably. Te degrees-offreedom DoF are defned as C sum SNR d = lm SNR logsnr, were C sum SNR s te sum-rate capacty at te sgnal to nose rato SNR. Te DoF represent te number of nonnterferng data streams tat can be smultaneously transmtted over te networ. For sngle antennas IA aceves te maxmal DoF asymptotcally wt an nfnte number of subcarrers or tme-slots []. We derve condtons for wc two subcarrers mae IA feasble for general cannels n Secton III and for e-ofsgt cannels n Secton IV. For e-of-sgt.e. sngletap cannels tese condtons are fulflled by coosng te subcarrer spacng carefully, wle n pror art te subcarrers are assumed to be fxed wen IA s appled. Hence for e-ofsgt cannels we aceve te maxmal DoF and even aceve an upper bound on te sum-rate of IA arbtrarly closely. II. SYSTEM MODEL Consder an nterference cannel wt K user pars, were eac transmtter sends eter one or two streams to ts recever. Eac node s equpped wt a sngle antenna and uses te same two ortogonal subcarrers. Te receved sgnal n te frequency doman at recever s K y = U H,V s + U H,V s +U z =, were s s te vector of symbols at transmtter wt lengt D {,}, V s a D precodng matrx, H, s a cannel matrx n te frequency doman between transmtter and recever, U s a D receve flter matrx. U s te complex conjugate transpose of matrx U, wle u s te complex conjugate of scalar u. Te precodng and te receve flter matrces are cosen to satsfy V F and U F, were F denotes te Frobenus norm. z s a proper complex AWGN vector of lengt and varance σ. Te frst term on te rgt and sde of carres te data of recever, wle te sum represents te nterference, and te last term s fltered nose. Cannels connectng te transmtter and recever of te same user par are called drect cannels; te oter cannels.e. H, are called cross cannels. For ortogonal subcarrers te cannel matrces H are dagonal. Te dagonal entres are denoted by l, C, were l ndcates te subcarrer ndex. We wrte [ ] H, =, 0 0, =,e j, 0 0,e j,, were x denotes te ampltude ofxand x denotes te pase of x n radans. For e-of-sgt cannels te ampltudes are equal for all subcarrers, wle te pase rotatons depend on te delay τ, and te subcarrer frequences f and f : [ ] e H LoS jπf τ, 0, =,. 4 0 e jπf τ, Te ampltudes are bounded as 0 < l, to avod degenerate cannel condtons. We assume perfect cannel nowledge of all cannel parameters at all nodes. III. FEASIBILITY OF INTERFERENCE ALIGNMENT VIA TWO SUBCARRIERS For sngle antenna nodes, te DoF are upper-bounded by / per user par []. Te precoder and receve flters reduce

2 to vectors v and u and nterference s algned f [] u H,v = 0, 5 u H,v > 0,. 6 Te equatons 5 mean tat te nterference les n te nullspace of te receve flter, wle te equatons 6 ensure tat te effectve cannel = u H,v wc s nterferencefree f te frst set of equatons s fulflled as unt ran. Te queston of IA feasblty ass f tere s a soluton for u and v suc tat 5 and 6 are fulflled. Suppose tat all cannel coeffcents are cosen ndependently wt a contnuous dstrbuton. Te condtons 6 are fulflled wt probablty f te precoder and receve flters satsfy 5. Hence we need to examne te feasblty of 5 to sow tat te maxmal DoF are acevable. Te queston of feasblty s tacled, e.g., n []-[5]. In [] t s sown tat te maxmal DoF are asymptotcally acevable wt IA for tme-varyng cannels by ncreasng te number of symbol extensons.e. te number of subcarrers or tme slots. We sow tat for nterestng cannel condtons IA s feasble wt two subcarrers. For ts we use Lemma to wrte te IA equaton set 5 as te sum of logartms of te cannel, precoder, and receve flter coeffcent fractons. Wt Lemma we prove Teorem wc states feasblty condtons on te cannel coeffcents for te user pars case. In te followng subsecton we examne K user pars. Lemma. For sngle antenna nodes and two ortogonal subcarrers te IA condtons 5 are u v, + = jπ+n u v, 7, for all, were n, Z can be any nteger. Proof: We wrte 5 as te equaton set u, v +u, v = 0,. 8 Tere exst trval solutons of 8: u = 0 or v = 0, wc bot volate 6; u =v =0 or v =u =0, wc, wen examnng te equaton set, lead to te nvald solutons u = 0 or v = 0. Oter trval solutons wt u l =0 or v l =0 do not exst, snce we ave, 0 and, 0 recall tat l, > 0. Hence all u and v are non-zero for nontrval solutons. Manpulatng 8 we obtan and terefore were n, Z. u, v u, v u, v u, v = 9 = jπ+n, 0 Note tat, = 0 or, = 0 ave zero probablty for contnuous dstrbutons. A. User Pars Teorem. Tree DoF over two subcarrers are feasble for tree user pars wt sngle antennas f te followng condton olds,,,,,,,,,,, =., Proof: For tree users tere are sx cross-cannels. Accordng to Lemma sx equatons of type 7 must be satsfed. We wrte tese equatons n te form Ax = b as follows: u u jπ+n,,, u u jπ+n,,, u u jπ+n,, v =, v jπ+n,.,, v v }{{} jπ+n,,, RanA=5 jπ+n, v v,, Snce te ran of A s 5, wc s less tan te number of equatons, a soluton exsts f and only f te ran of te augmented matrx A b s equal to te ran of A or b s n te column space or mage of A. Ts condton s fulflled for,,,, +,, + = jπn,,,,,,, were n = n, n, +n, n, +n, n, Z. Teorem can be expressed as two equatons: One for te subcarrer ampltudes,,,,,,,,,,,, = 4 Te proof can also be obtaned by examnng te subspaces spanned by te cannel matrx and te precodng vector as s done n Secton IV-D of []. For nterference to algn one must ave spanh, v = spanh, v and spanh, v = spanh, v and spanh, v = spanh, v. From ts one obtans spanv = spantv, were T = H, H, H, H, H, H,. Due to te dagonal structure of te cannel matrces, T s also dagonal. Unless T s a scaled dentty matrx te precoder v must be an egenvector of all cannel matrces, leadng to nterference not beng algned. Settng T as a scaled dentty matrx leads to.

3 and one for te subcarrer pase rotatons, +, +,,, +, +,,, +, +,, = πn. 5 B. K User Pars For K user pars tere are KK cross-cannels and we ence ave KK equatons of type 7. We collect tem nto an equaton system Ax = b, were A s of dmenson KK K, but as ran K. Te augmented matrx A b agan must ave te same ran as A for a soluton to exst. Transformng A to rowecelon form by usng Gaussan elmnaton results n a new matrx A were te last KK K = K K + 6 rows are zero. We apply te same transformatons to b to obtan b. Te last K K + entres of b must be zero, and are of te form, α [w]. jπ+n,,, 7 were α [w]. {,0,} are te wegts of te w-t row. Hence we obtan K K + equatons of type smlar to wc must be fulflled for feasblty of IA. IV. SPECIAL CASE: USER PAIRS AND LINE-OF-SIGHT CHANNELS We examne IA for te specal case of e-of-sgt cannels and K =. We sow tat te feasblty condton of te cannel can be fulflled by coosng te subcarrer spacng carefully. We also derve te ampltudes of te effectve cannels and sow tat for ncreasng bandwdt an upper bound on te sum-rate of te presented sceme can be reaced arbtrary closely. Corollary. For e-of-sgt cannels te condton of Teorem smplfes to f f τ, τ, +τ, τ, +τ, τ, = n 8 were n Z\{0}. Proof: For sngle tap cannels te subcarrer ampltudes satsfy = and ence only te pase rotaton,, dfference remans. Insertng l, = πfl τ, gves π f f τ, +π f f τ, π f f τ, +π f f τ, 9 π f f τ, +π f f τ, = πn. After some manpulatons one obtans 8. Coosng n = 0 volates te assumpton of ortogonal sub-carrers, snce ts means f = f. Accordng to 8 e-of-sgt cannels may create condtons were IA s feasble by coosng te sub-carrer spacng f = f f carefully. Ts means tat te precodng and receve flter vectors can be cosen suc tat 5 olds. Te requred spacng depends only on te delays of te cross cannels and te non-zero nteger n wc can be cosen freely. Hence we can dentfy a mnmal sub-carrer spacng f mn = /τ, τ, +τ, τ, +τ, τ, 0 for wc IA s feasble. Any multple of f mn, except 0, creates feasblty agan. For te specal case τ, τ, +τ, τ, +τ, τ, = 0 IA s drectly feasble and te subcarrer spacng can be cosen arbtrarly. For contnuously and ndependently dstrbuted delays te probablty of ts event s zero and s not treated furter. Note tat we are not lmted to usng two subcarrers. Snce te feasblty depends solely on te spacng, subcarrer par f +f offset and f +f offset s feasble f par f and f s. Even dfferent user pars, wc requre dfferent f mn, can be sceduled n one OFDM frame. It mgt not be possble to use all subcarrers wt IA n wc case te remanng subcarrers are used as usual. A. Effectve Cannel Ampltudes If 8 s fulflled, te ratos of te precodng and receve flter coeffcents are obtaned from te system of ear equatons. Snce A s ran-defcent tere s one ndependent varable n x, wc we coose wtout loss of generalty to be u /u. Te remanng varables are determned as v v v v u u u u v v = jπ+n, + fτ, = jπ+n, + fτ, = jπ+n, + fτ, = jπ+n, + fτ, = jπ+n, + fτ, u u u u v u v v u u From -6 one obtans, for {,,}, v = u v. 7 u Togeter wt v F and u F one obtans u v /. 8 v v

4 For all else eld fxed te -t ampltude s largest f = v = u = u = / 9 v wc we use wen obtanng te ampltudes. Te ampltude of te frst drect cannel s = u H,v =, u e jπf τ, v +u e πf τ, v a =, b =, +e jπ fτ,+ u /u + v /v e jπ f τ,+τ, τ,+τ,+n, n,+n, c =, snπn f mn τ 0 were τ = τ, +τ, τ, +τ,. For a we used 9. For b we nserted 6, nto wc we nserted 4 and. For c we used f = n f mn, e jθ = snθ/ and snθ+πl = snθ for l Z. Te ampltudes of te second and trd drect cannels follow smlarly and are =, snπn f mn τ =, snπn f mn τ were τ = τ, +τ, τ, +τ, and τ = τ, + τ, τ, +τ,. Examnng te effectve cannel ampltudes, we observe tat te ampltude of te -t cannel s bounded by 0,. For a gven cannel one can nfluence only te nteger n of te argument of te sne functon, as te τ and te f mn are fxed. B. Upper Bound Te sum-rate of te proposed sceme for a tree user pars system wt e-of-sgt cannels s upper bounded by R sum log + σ. Snce te sum-rate s dfferent for dfferent coces of n, one can optmze te coce of f = n f mn wtn te avalable bandwdt to obtan te optmal sum-rate. Lemma. For contnuously and ndependently dstrbuted delays te upper bound on te sum-rate of te presented sceme s aceved arbtrarly closely for ncreasng bandwdt. Proof: Te mnmal sub-carrer spacng depends only on te delays and te delays are contnuously and ndependently dstrbuted. Hence also te products λ = f mn τ are contnuously dstrbuted. Tey are even ndependently dstrbuted, snce τ, appears only n τ. We can wrte λ mod wt ts nfntely long decmal expanson as λ mod = 0.λ [] λ [] λ []..., 4 were eac element λ [l] of te sequence s..d. and taes on te values {0,,,...9} wt equal probablty. We ws to sow tat n {Z : 0 < n < N} wt N suc tat nλ mod s arbtrarly close to some number µ 0,. We do ts by loong for strngs of decmal places of λ wc are equal for all and wc are, wen sfted to te frst decmal places, close enoug to te desred number µ. We ten coose n to sft te resultng sequence to te frst decmal places. We coose R Z suc tat 0 R < ǫ, were 0 < ǫ <. { Our goal s to fnd an r suc, tat te random } varables M r = λ [w] :,w = r,r +,...,r+r λ [r] λ [r+] fulfll te condton...λ [r+r ] = µ [] µ []...µ [R],, 5 were µ [w] s te w-t poston of te decmal expanson of µ. Te probablty tat te varables M r fulfll te condtons 5 for a gven r s postve. Tere are nfnte ndependent realzatons of te set M r, ence r suc tat te set M r fulflls condtons 5. We complete te proof by coosng n = 0 r and µ = /. Lemma ensures tat by ncreasng te bandwdt and optmzng te coce of f = n f mn we can get arbtrarly close to te upper bound of te presented sceme. C. Connecton to Tme Based Interference Algnment Tme based IA algns nterference by transmttng only n every oter tme slot and by possbly usng dfferent offsets. Interference s algned wen at te recevers te nterference arrves n te same tme slot, wle te useful sgnals arrve n a dfferent tme slot. Analyses of tme based IA can be found n [4], [6] or [7] for example. We sow tat tme based IA s a specal case of subcarrer IA. Coosng a precoderv n te frequency doman translates to te tme doman sgnal [ X [t] X [t+] ] = [ ] }{{} F [ ] v v s = v +v v v s s 6 were F s te IDFT matrx. Snce for tme based IA notng s transmtted n te second tme slot, we ave v v = 0. Tus v /v = 0, follows. In a smlar way we obtan u /u = 0,. Ts means tat te rgtand sde n must be b = 0, wc automatcally fulflls and ence and 8. From b = 0 t follows tat jπ+n, = = jπ fτ,, 7,, from were we obtan te condtons on te subcarrer spacng f = +n, τ,,. 8 For K = tere are sx fractons tat must be equal to eac oter and wc determne f. Te denomnators

5 of te fractons are real numbers wle te numerators are ntegers. Snce te delays are..d., equalty of tese fractons s approaced only by coosng larger nteger numerators. Ts means tat feasblty s aceved only asymptotcally for ncreasng f, wc translates to decreasng slot lengts n te tme doman. Ts s precsely wat Teorem n [4] states. But we are able to determne subcarrer spacngs wc aceve feasblty exactly for K =. Ts sows tat restrctng te coce of te precoder, as tme based IA does, probts acevng te DoF exactly. V. SIMULATION RESULTS Consder a user par e-of-sgt cannel, were te transmtter-recever dstances d, are contnuously and ndependently dstrbuted. Te delays are related to te dstances by τ, = c d, 9 were c s te speed of wave propagaton, wc we set to te speed of lgt c = 0 8 m/s. Te cannel ampltudes are obtaned from te dstances as γ m, = 40 d, were we coose te pat-loss exponent γ =.76. Te dstances of te drect cannels are dstrbuted as d, [50m,50m], and te dstances of te cross cannels asd, [50m, 50m],. Te drect cannels tus ave te largest ampltudes and we do not ave too small dstances for wc treatng nterference as nose wors best. We average over 0 4 cannel realzatons. As bencmar scemes we consder I treatng Interference as Nose and II an ortogonal access sceme, were we use TDMA. For treatng Interference as Nose, eac transmtter transmts two streams for every cannel use and at te recevers te nterference s treated as nose. For te TDMA sceme, eac transmtter transmts only n everyk-t slot, but wt K tmes te power. Snce only one par communcates per slot, te recever can receve two streams wtout nterference. To obtan te precoder and receve flter for IA, we use te pseudo-nverse of A to obtan a soluton or a least-squares soluton, f IA s nfeasble for te system of ear equatons. Snce we are nterested manly n te DoF, we consder only nterference-zero-forcng approaces. Oter approaces, e.g. MaxSINR or MMSE, wll be examned n future wor. Te values of f mn seem to be Rayleg-dstrbuted, were more tan95% of te values are between0 6 Hz and0 8 Hz for te consdered scenaro. Tese values depend strongly on te dstances and te speed of wave propagaton. For ncreasng dstances or decreasng c e.g. under-water communcaton te dstrbuton of f mn s sfted to lower frequences. Fgure sows te average sum-rate of te bencmar scemes and of IA for an average receved SNR from te drect cannels of 0dB. Te x-axs s normalzed to / f mn, were f mn s dfferent for every cannel realzaton. As expected, te bencmar scemes perform ndependent of te subcarrer spacng. For IA we plot tree curves. Te curve labeled IA ZF s te average sum-rate wt te current subcarrer spacng. As expected, we observe peas at multples of f mn. Note tat for small devatons from te optmal f mn tere are small reductons n sum-rate. A subcarrer spacng between multples of f mn leads to leaage nterference, wc prevents acevng te maxmal DoF. But for fnte SNR we aceve a good performance wen te drect cannel s ampltude s large. Te curve labeled Max IA ZF s obtaned n two steps: For eac cannel realzaton te maxmal sum-rate wtn te bandwdt equal to te x-axs value s determned. In te next step we tae te average and obtan te curve labeled Max IA ZF. A steep ncrease of ts curve can be observed around f mn due to te feasblty of IA. Wt ncreasng bandwdt te curve labeled Max IA ZF approaces te curve labeled IA Upper Bound, wc s te average of te upper bounds. Average sum rate n bts per use TDMA Interference as Nose IA ZF Max IA ZF IA Upper Bound f/ f mn Fg.. Average sum-rate for randomly dstrbuted dstances, were d, [50m,50m] and d, [50m,50m], and γ =.76 and te average receved SNR from te drect cannels s 0dB. VI. CONCLUSIONS We derved condtons for feasblty of IA va two ortogonal subcarrers. For e-of-sgt cannels tese condtons can be fulflled by carefully coosng te subcarrer spacng. ACKNOWLEDGMENT S. Ders and G. Kramer were supported by te German Mnstry of Educaton and Researc n te framewor of an Alexander von Humboldt Professorsp. REFERENCES [] S. A. Jafar, Interference Algnment A New Loo at Sgnal Dmensons n a Communcaton Networ. Foundatons and Trends n Communcatons and Informaton Teory, 00, vol. 7, no.. [One]. Avalable: [] V. R. Cadambe and S. A. Jafar, Interference Algnment and Degrees of Freedom of te K-User Interference Cannel, IEEE Trans. Inf. Teory, vol. 54, no. 8, pp , Aug. 008.

6 [] K. Gomadam, V. R. Cadambe, and S. A. Jafar, A Dstrbuted Numercal Approac to Interference Algnment and Applcatons to Wreless Interference Networs, IEEE Trans. Inf. Teory, vol. 57, no. 6, pp. 09, Jun. 0. [4] V. R. Cadambe and S. A. Jafar, Degrees of Freedom of Wreless Networs - Wat a Dfference Delay Maes, n ACSSC 007-4t Aslomar Conf. Sgnals, Sys. Comp., Nov. 007, pp. 7. [5] C. M. Yets, T. Gou, S. A. Jafar, and A. H. Kayran, Feasblty Condtons for Interference Algnment, n GLOBECOM IEEE Global Telecommun. Conf., Nov. 009, pp. 6. [6] L. H. Groop, D. N. C. Tse, and R. D. Yates, Interference Algnment for Lne-of-Sgt Cannels, IEEE Trans. Inf. Teory, vol. 57, no. 9, pp , Sep. 0. [7] F. Lazaro Blasco, F. Rossetto, and G. Bauc, Tme Interference Algnment va Delay Offset for Long Delay Networs, n GLOBECOM 0 - IEEE Global Telecommun. Conf., Dec. 0, pp. 6.

Rethinking MIMO for Wireless Networks: Linear Throughput Increases with Multiple Receive Antennas

Rethinking MIMO for Wireless Networks: Linear Throughput Increases with Multiple Receive Antennas Retnng MIMO for Wreless etwors: Lnear Trougput Increases wt Multple Receve Antennas ar Jndal Unversty of Mnnesota Unverstat Pompeu Fabra Jont wor wt Jeff Andrews & Steven Weber MIMO n Pont-to-Pont Cannels

More information

Stanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7

Stanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7 Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every

More information

COMP4630: λ-calculus

COMP4630: λ-calculus COMP4630: λ-calculus 4. Standardsaton Mcael Norrs Mcael.Norrs@ncta.com.au Canberra Researc Lab., NICTA Semester 2, 2015 Last Tme Confluence Te property tat dvergent evaluatons can rejon one anoter Proof

More information

On Pfaff s solution of the Pfaff problem

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

More information

Not-for-Publication Appendix to Optimal Asymptotic Least Aquares Estimation in a Singular Set-up

Not-for-Publication Appendix to Optimal Asymptotic Least Aquares Estimation in a Singular Set-up Not-for-Publcaton Aendx to Otmal Asymtotc Least Aquares Estmaton n a Sngular Set-u Antono Dez de los Ros Bank of Canada dezbankofcanada.ca December 214 A Proof of Proostons A.1 Proof of Prooston 1 Ts roof

More information

Multivariate Ratio Estimator of the Population Total under Stratified Random Sampling

Multivariate Ratio Estimator of the Population Total under Stratified Random Sampling Open Journal of Statstcs, 0,, 300-304 ttp://dx.do.org/0.436/ojs.0.3036 Publsed Onlne July 0 (ttp://www.scrp.org/journal/ojs) Multvarate Rato Estmator of te Populaton Total under Stratfed Random Samplng

More information

Throughput Capacities and Optimal Resource Allocation in Multiaccess Fading Channels

Throughput Capacities and Optimal Resource Allocation in Multiaccess Fading Channels Trougput Capactes and Optmal esource Allocaton n ultaccess Fadng Cannels Hao Zou arc 7, 003 Unversty of Notre Dame Abstract oble wreless envronment would ntroduce specal penomena suc as multpat fadng wc

More information

A SINR Improvement Algorithm for D2D Communication Underlaying Cellular Networks

A SINR Improvement Algorithm for D2D Communication Underlaying Cellular Networks Advanced Scence and Tecnology Letters Vol.3 (CST 06), pp.78-83 ttp://dx.do.org/0.457/astl.06.3.34 A SINR Improvement Algortm for DD Communcaton Underlayng Cellular Networks Ceng uan, Youua Fu,, Jn Wang

More information

The Finite Element Method: A Short Introduction

The Finite Element Method: A Short Introduction Te Fnte Element Metod: A Sort ntroducton Wat s FEM? Te Fnte Element Metod (FEM) ntroduced by engneers n late 50 s and 60 s s a numercal tecnque for solvng problems wc are descrbed by Ordnary Dfferental

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

TR/95 February Splines G. H. BEHFOROOZ* & N. PAPAMICHAEL

TR/95 February Splines G. H. BEHFOROOZ* & N. PAPAMICHAEL TR/9 February 980 End Condtons for Interpolatory Quntc Splnes by G. H. BEHFOROOZ* & N. PAPAMICHAEL *Present address: Dept of Matematcs Unversty of Tabrz Tabrz Iran. W9609 A B S T R A C T Accurate end condtons

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

ECE559VV Project Report

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

More information

Competitive Experimentation and Private Information

Competitive Experimentation and Private Information Compettve Expermentaton an Prvate Informaton Guseppe Moscarn an Francesco Squntan Omtte Analyss not Submtte for Publcaton Dervatons for te Gamma-Exponental Moel Dervaton of expecte azar rates. By Bayes

More information

Lecture 3: Shannon s Theorem

Lecture 3: Shannon s Theorem CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

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

More information

5 The Laplace Equation in a convex polygon

5 The Laplace Equation in a convex polygon 5 Te Laplace Equaton n a convex polygon Te most mportant ellptc PDEs are te Laplace, te modfed Helmoltz and te Helmoltz equatons. Te Laplace equaton s u xx + u yy =. (5.) Te real and magnary parts of an

More information

Error Probability for M Signals

Error Probability for M Signals Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal

More information

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A

More information

Matrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD

Matrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo

More information

Multigrid Methods and Applications in CFD

Multigrid Methods and Applications in CFD Multgrd Metods and Applcatons n CFD Mcael Wurst 0 May 009 Contents Introducton Typcal desgn of CFD solvers 3 Basc metods and ter propertes for solvng lnear systems of equatons 4 Geometrc Multgrd 3 5 Algebrac

More information

Infinite Length MMSE Decision Feedback Equalization

Infinite Length MMSE Decision Feedback Equalization Infnte Lengt SE ecson Feedbac Equalzaton FE N * * Y F Z ' Z SS ˆ Y Q N b... Infnte-Lengt ecson Feedbac Equalzer as reoval ^ Y Z Feedforward Flter Feedbac Flter - Input to Slcer - Z Y Assung prevous decsons

More information

Bernoulli Numbers and Polynomials

Bernoulli Numbers and Polynomials Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

Solution for singularly perturbed problems via cubic spline in tension

Solution for singularly perturbed problems via cubic spline in tension ISSN 76-769 England UK Journal of Informaton and Computng Scence Vol. No. 06 pp.6-69 Soluton for sngularly perturbed problems va cubc splne n tenson K. Aruna A. S. V. Rav Kant Flud Dynamcs Dvson Scool

More information

Chapter 7 Channel Capacity and Coding

Chapter 7 Channel Capacity and Coding Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models

More information

Energy-Aware Fault Tolerance in Fixed-Priority Real-Time Embedded Systems*

Energy-Aware Fault Tolerance in Fixed-Priority Real-Time Embedded Systems* Energy-Aware Fault Tolerance n Fxed-Prorty Real-Tme Embedded Systems Yng Zang, Krsnendu Cakrabarty and Vsnu Swamnatan Department of Electrcal & Computer Engneerng Duke Unversty, Duram, NC 778, USA Abstract

More information

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

More information

Formulas for the Determinant

Formulas for the Determinant page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

Eigenvalues of Random Graphs

Eigenvalues of Random Graphs Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

The Fading Number of Memoryless Multiple-Input Multiple-Output Fading Channels

The Fading Number of Memoryless Multiple-Input Multiple-Output Fading Channels 1 Te Fadng Number of Memoryless Multple-Input Multple-Output Fadng Cannels Stefan M. Moser, Member, IEEE Abstract We derve te fadng number of multple-nput multpleoutput MIMO) flat fadng cannels of general

More information

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)? Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1 C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

UNIVERSITY OF BOLTON RAK ACADEMIC CENTRE BENG(HONS) MECHANICAL ENGINEERING SEMESTER TWO EXAMINATION 2017/2018 FINITE ELEMENT AND DIFFERENCE SOLUTIONS

UNIVERSITY OF BOLTON RAK ACADEMIC CENTRE BENG(HONS) MECHANICAL ENGINEERING SEMESTER TWO EXAMINATION 2017/2018 FINITE ELEMENT AND DIFFERENCE SOLUTIONS OCD0 UNIVERSITY OF BOLTON RAK ACADEMIC CENTRE BENG(HONS) MECHANICAL ENGINEERING SEMESTER TWO EXAMINATION 07/08 FINITE ELEMENT AND DIFFERENCE SOLUTIONS MODULE NO. AME6006 Date: Wednesda 0 Ma 08 Tme: 0:00

More information

The Concept of Beamforming

The Concept of Beamforming ELG513 Smart Antennas S.Loyka he Concept of Beamformng Generc representaton of the array output sgnal, 1 where w y N 1 * = 1 = w x = w x (4.1) complex weghts, control the array pattern; y and x - narrowband

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

The lower and upper bounds on Perron root of nonnegative irreducible matrices

The lower and upper bounds on Perron root of nonnegative irreducible matrices Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College

More information

Digital Signal Processing

Digital Signal Processing Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over

More information

Direct Methods for Solving Macromolecular Structures Ed. by S. Fortier Kluwer Academic Publishes, The Netherlands, 1998, pp

Direct Methods for Solving Macromolecular Structures Ed. by S. Fortier Kluwer Academic Publishes, The Netherlands, 1998, pp Drect Metods for Solvng Macromolecular Structures Ed. by S. Forter Kluwer Academc Publses, Te Neterlands, 998, pp. 79-85. SAYRE EQUATION, TANGENT FORMULA AND SAYTAN FAN HAI-FU Insttute of Pyscs, Cnese

More information

Signal space Review on vector space Linear independence Metric space and norm Inner product

Signal space Review on vector space Linear independence Metric space and norm Inner product Sgnal space.... Revew on vector space.... Lnear ndependence... 3.3 Metrc space and norm... 4.4 Inner product... 5.5 Orthonormal bass... 7.6 Waveform communcaton system... 9.7 Some examples... 6 Sgnal space

More information

DUE: WEDS FEB 21ST 2018

DUE: WEDS FEB 21ST 2018 HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities Supplementary materal: Margn based PU Learnng We gve the complete proofs of Theorem and n Secton We frst ntroduce the well-known concentraton nequalty, so the covarance estmator can be bounded Then we

More information

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

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

More information

Singular Value Decomposition: Theory and Applications

Singular Value Decomposition: Theory and Applications Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real

More information

Problem Set 9 Solutions

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

More information

Adaptive Kernel Estimation of the Conditional Quantiles

Adaptive Kernel Estimation of the Conditional Quantiles Internatonal Journal of Statstcs and Probablty; Vol. 5, No. ; 206 ISSN 927-7032 E-ISSN 927-7040 Publsed by Canadan Center of Scence and Educaton Adaptve Kernel Estmaton of te Condtonal Quantles Rad B.

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry Workshop: Approxmatng energes and wave functons Quantum aspects of physcal chemstry http://quantum.bu.edu/pltl/6/6.pdf Last updated Thursday, November 7, 25 7:9:5-5: Copyrght 25 Dan Dll (dan@bu.edu) Department

More information

1 Introducton Nonlnearty crtera of Boolean functons Cryptograpc transformatons sould be nonlnear to be secure aganst varous attacks. For example, te s

1 Introducton Nonlnearty crtera of Boolean functons Cryptograpc transformatons sould be nonlnear to be secure aganst varous attacks. For example, te s KUIS{94{000 Nonlnearty crtera of Boolean functons HIROSE Souc IKEDA Katsuo Tel +81 75 753 5387 Fax +81 75 751 048 E-mal frose, kedag@kus.kyoto-u.ac.jp July 14, 1994 1 Introducton Nonlnearty crtera of Boolean

More information

Tracking with Kalman Filter

Tracking with Kalman Filter Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,

More information

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton

More information

ECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006)

ECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006) ECE 534: Elements of Informaton Theory Solutons to Mdterm Eam (Sprng 6) Problem [ pts.] A dscrete memoryless source has an alphabet of three letters,, =,, 3, wth probabltes.4,.4, and., respectvely. (a)

More information

Shuai Dong. Isaac Newton. Gottfried Leibniz

Shuai Dong. Isaac Newton. Gottfried Leibniz Computatonal pyscs Sua Dong Isaac Newton Gottred Lebnz Numercal calculus poston dervatve ntegral v velocty dervatve ntegral a acceleraton Numercal calculus Numercal derentaton Numercal ntegraton Roots

More information

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

Lossy Compression. Compromise accuracy of reconstruction for increased compression. Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost

More information

Lecture 3. Ax x i a i. i i

Lecture 3. Ax x i a i. i i 18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

More information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information

Problem Set 4: Sketch of Solutions

Problem Set 4: Sketch of Solutions Problem Set 4: Sketc of Solutons Informaton Economcs (Ec 55) George Georgads Due n class or by e-mal to quel@bu.edu at :30, Monday, December 8 Problem. Screenng A monopolst can produce a good n dfferent

More information

Average SIR of the desired user ([7]) β=0.99. β= Average NSE of the desired user (BADD) β=0.95. µ= β=0.9

Average SIR of the desired user ([7]) β=0.99. β= Average NSE of the desired user (BADD) β=0.95. µ= β=0.9 A Blnd Adaptve Decorrelatng Detector for CDMA Systems Sennur Ulukus Roy D. Yates Department of lectrcal and Computer ngneerng Wreless Informaton Networks Laboratory (WINLAB) Rutgers Unversty, PO Box 909,

More information

Chapter 7 Channel Capacity and Coding

Chapter 7 Channel Capacity and Coding Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform

More information

Digital Modems. Lecture 2

Digital Modems. Lecture 2 Dgtal Modems Lecture Revew We have shown that both Bayes and eyman/pearson crtera are based on the Lkelhood Rato Test (LRT) Λ ( r ) < > η Λ r s called observaton transformaton or suffcent statstc The crtera

More information

The Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD

The Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD he Gaussan classfer Nuno Vasconcelos ECE Department, UCSD Bayesan decson theory recall that we have state of the world X observatons g decson functon L[g,y] loss of predctng y wth g Bayes decson rule s

More information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

More information

Math 217 Fall 2013 Homework 2 Solutions

Math 217 Fall 2013 Homework 2 Solutions Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

The optimal delay of the second test is therefore approximately 210 hours earlier than =2.

The optimal delay of the second test is therefore approximately 210 hours earlier than =2. THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

One-sided finite-difference approximations suitable for use with Richardson extrapolation

One-sided finite-difference approximations suitable for use with Richardson extrapolation Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,

More information

5 The Rational Canonical Form

5 The Rational Canonical Form 5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces

More information

Maximizing the number of nonnegative subsets

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

More information

A New Recursive Method for Solving State Equations Using Taylor Series

A New Recursive Method for Solving State Equations Using Taylor Series I J E E E C Internatonal Journal of Electrcal, Electroncs ISSN No. (Onlne) : 77-66 and Computer Engneerng 1(): -7(01) Specal Edton for Best Papers of Mcael Faraday IET Inda Summt-01, MFIIS-1 A New Recursve

More information

CENTROID (AĞIRLIK MERKEZİ )

CENTROID (AĞIRLIK MERKEZİ ) CENTOD (ĞLK MEKEZİ ) centrod s a geometrcal concept arsng from parallel forces. Tus, onl parallel forces possess a centrod. Centrod s tougt of as te pont were te wole wegt of a pscal od or sstem of partcles

More information

Feb 14: Spatial analysis of data fields

Feb 14: Spatial analysis of data fields Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

e - c o m p a n i o n

e - c o m p a n i o n OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency

More information

Y = X + " E [X 0 "] = 0 K E ["" 0 ] = = 2 I N : 2. So, you get an estimated parameter vector ^ OLS = (X 0 X) 1 X 0 Y:

Y = X +  E [X 0 ] = 0 K E [ 0 ] = = 2 I N : 2. So, you get an estimated parameter vector ^ OLS = (X 0 X) 1 X 0 Y: 1 Ecent OLS 1. Consder te model Y = X + " E [X 0 "] = 0 K E ["" 0 ] = = 2 I N : Ts s OLS appyland! OLS s BLUE ere. 2. So, you get an estmated parameter vector ^ OLS = (X 0 X) 1 X 0 Y: 3. You know tat t

More information

1 GSW Iterative Techniques for y = Ax

1 GSW Iterative Techniques for y = Ax 1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn

More information

Solution Set #3

Solution Set #3 5-55-7 Soluton Set #. Te varaton of refractve ndex wt wavelengt for a transarent substance (suc as glass) may be aroxmately reresented by te emrcal equaton due to Caucy: n [] A + were A and are emrcally

More information

, rst we solve te PDE's L ad L ad n g g (x) = ; = ; ; ; n () (x) = () Ten, we nd te uncton (x), te lnearzng eedbac and coordnates transormaton are gve

, rst we solve te PDE's L ad L ad n g g (x) = ; = ; ; ; n () (x) = () Ten, we nd te uncton (x), te lnearzng eedbac and coordnates transormaton are gve Freedom n Coordnates Transormaton or Exact Lnearzaton and ts Applcaton to Transent Beavor Improvement Kenj Fujmoto and Tosaru Suge Dvson o Appled Systems Scence, Kyoto Unversty, Uj, Kyoto, Japan suge@robotuassyoto-uacjp

More information

AGC Introduction

AGC Introduction . Introducton AGC 3 The prmary controller response to a load/generaton mbalance results n generaton adjustment so as to mantan load/generaton balance. However, due to droop, t also results n a non-zero

More information

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system. Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

PubH 7405: REGRESSION ANALYSIS. SLR: INFERENCES, Part II

PubH 7405: REGRESSION ANALYSIS. SLR: INFERENCES, Part II PubH 7405: REGRESSION ANALSIS SLR: INFERENCES, Part II We cover te topc of nference n two sessons; te frst sesson focused on nferences concernng te slope and te ntercept; ts s a contnuaton on estmatng

More information

Important Instructions to the Examiners:

Important Instructions to the Examiners: Summer 0 Examnaton Subject & Code: asc Maths (70) Model Answer Page No: / Important Instructons to the Examners: ) The Answers should be examned by key words and not as word-to-word as gven n the model

More information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

More information