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

Size: px
Start display at page:

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

Transcription

1 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

2 MIMO n Pont-to-Pont Cannels y Hx z Foscn-Gans '98: Capacty of a pont-to-pont MIMO cannel scales lnearly wt mn( t, r ) C mn(, )log t r SR Transmt mn( t, r ) data streams, eac at rate ~ log (SR) o ncrease n power or bandwdt MIMO an ntegral part of every contemporary g-rate wreless systems (LTE, 80.n, WMax)

3 MIMO n Ad-Hoc etwors Many TX-RX pars smultaneously communcatng, mutually nterferng If eac node as antennas, use pont-to-pont MIMO tecnques to ncrease per-ln rate lnearly wt Interference power does not ncrease wt Spatal color of nterference ncreases rates Lnear ncrease n system trougput: transport capacty & area spectral effcency (ASE) Is ts te only way?

4 Multple RX Antennas n Ad-Hoc etwors Eac TX as antenna, eac RX as antennas Man Result: System trougput scales lnearly wt Use RX antennas to smultaneously: Cancel nearby nterferers Increase receved sgnal power (array gan) Mantan a constant per-ln rate (SIR) & ncrease spatal densty of smultaneous transmssons lnearly wt Lnear ncrease n densty, constant per-ln rate -> lnear ncrease n system trougput

5 etwor Model Decentralzed networ wt randomly located TX-RX pars (sngle-op) TX s randomly located accordng to -D Posson process Densty λ, nfnte # of TX's on nfnte -D plane Eac TX assocated wt a RX a dstance d meters away Models networ usng ALOHA

6 etwor Model () Consder reference par TX0-RX0 Interferers stll form a -D Posson process (densty λ) TX-RX dstance: d meters : pat-loss exponent X :dstance to -t nearest nterferer :vector cannel to -t nterferer d complex Gaussan components Receved sgnal (-dm vector): y d u 0 0 X u SIR after RX flter v z SIR TX 0 TX 3 TX d meters H ρ v η ρ v 0 H X X 3 d TX X RX 0 X X 4 TX 4

7 Performance Metrcs Outage probablty relatve to SIR tresold β: P out ( λ,, β ) P[ SIR β ] Increasng n λ, decreasng n (good RX flter) Correspondng spectral effcency: log (β) bpshz Transmsson Capacty [Weber, Andrews, et. al '05]: maxmum densty λ suc tat outage no larger tan ε λ ε (, β ) P out ( ε ) Objectve: Sow λ ε (,β) ncreases lnearly wt

8 RX Flter Desgn Maxmum-rato combnng (MRC): [Hunter-Andrews-Weber] max sgnal power by coosng flter n drecton of desred cannel Full Zero-Forcng (ZF): [Huang-Andrews-Heat-Guo-Berry] mnmze nt. power by coosng flter ortogonal to cannels of nearest - nterferers MMSE: maxmzes SIR,..., v ( ) 0 0 v 0 X I v H η 0 H H X v d v SIR ρ η ρ

9 Pror Wor [Hunter-Andrews-Weber '07]: Maxmum rato combnng allows densty to ncrease wt as: λ O ( ) [Huang-Andrews-Heat-Guo-Berry '08]: Full zero-forcng allows densty to ncrease wt as λ O ( ) [Govndasamy-Blss-Staeln '07]: For fxed densty, wt MMSE expected SIR scales wt as E [ SIR] O ( )

10 Partal Zero Forcng Coose flter ortogonal to ( -) nearest nterferers Sgnal term Interference terms ( ) v v,...,,..., 0 on ullspace of Projecton ) ( 0 ~ H v χ,...,..., 0 v v H H ~ χ ) ( ~ a X d SIR χ ρ η χ ρ

11 Expected Interference Power Expected nterference power: Ordered squared-dstances ~ -D PPP(πλ) Dstance-squared to -t nearest nterferer ~ ) ( ~ X d SR SIR χ χ [ ] [ ] [ ] ( ) ) ( ) ( λ π πλ χ χ < Γ Γ X E X E E X E ( ) χ πλ η ρ SR d

12 Outage Probablty Upper Bound For fxed densty and : Proof: Use Marov nequalty & ndependence of S, I ( ) ( ) ) ( ] [ SR SIR P β νλ β ( ) ( ) ] [ < SR S E I E S I E S I P I S P β νλ β β β β

13 Densty Lower Bound Invert outage probablty upper bound to get max-densty lower bound: λ ε ε β ( ) ε πd β SR ( ) Array Gan Int. Cancellaton eed to coose suc tat bound s lnear n

14 Acevng Lnear Densty Scalng Use a strct fracton of RX degrees of freedom to cancel nterference: θ for any 0 < θ < Max-densty lower bound: λ ε ε β ( ) πd ( θ ) Lower bound scales lnearly wt ε βsr θ θ ( θ )

15 Intuton Expected sgnal power Expected nt power (cancel ) Fxed outage requres constant rato between sgnal power & nt power MRC (0) [H-A-W Sgnal ~ O Full ZF (-) [H-A-H-G-B] Sgnal ~, Partal ZF (θ for θ<) Sgnal ~, Int ~ λ λ Int ~ λ d ( ) π ~ λ ( ) λ O ( ) ( θ ) λ O( ) ( θ ), Int ~ λ

16 Optmzaton of Partal ZF Densty lower bound converges to: ε ( ) β Maxmze wt respect to θ: πd * θ ( ) θ θ Small PL exponent: far nterferers powerful, so no pont n cancelng nearby ones Large PL exponent: nearby nterferers muc more powerful, so get beneft by cancelng

17 umercal Results Maxmum densty vs. (ε0.) β,d m, 3 (left), 4 (rgt) Very large densty gans even for small

18 umercal Results () Maxmum densty vs. # cancelled, 0, 3, ε0. Consstent wt θ * 3

19 Rate vs. Densty Increase [Govndasamy-Blss-Staeln] consdered almost dentcal model for fxed densty, optmal MMSE recever Expected SIR scales superlnearly: Expected spectral effcency scales logartmcally: () log() If densty ept constant and RX antennas used to ncrease per-ln rate: trougput ~ log() Increasng densty sub-lnearly (wt ) leads to sublnear trougput scalng Implcaton of ncreasng densty: In ALOHA networ, can ncrease contenton probablty wt In general, can be more aggressve wt smultaneous transmssons

20 Concluson RX cancellaton allows transmtter densty to grow lnearly wt # of RX antennas, wtout requrng multple TX antennas Constant per-ln rate, lnearly ncreasng densty Results suggest MIMO can be very powerful n ad-oc networs Spatal nterference cancellaton canges perspectve on mult-user nterference: s careful transmsson scedulng needed? Extensons: Evaluate beneft n mult-op settng MMSE recever Imperfect CSI

CDMA Network Design. Robert Akl, D.Sc.

CDMA Network Design. Robert Akl, D.Sc. CDMA Network Desgn Robert Akl, D.Sc. Outlne CDMA overvew and nter-cell effects Network capacty Senstvty analyss Base staton locaton Plot-sgnal power Transmsson power of the mobles Numercal results Problem

More information

Flexible Allocation of Capacity in Multi-Cell CDMA Networks

Flexible Allocation of Capacity in Multi-Cell CDMA Networks Flexble Allocaton of Capacty n Mult-Cell CDMA Networs Robert Al, Manu Hegde, Mort Naragh-Pour*, Paul Mn Washngton Unversty, St. Lous, MO *Lousana State Unversty, Baton Rouge, LA Outlne Capacty and Probablty

More information

Concepts for Wireless Ad Hoc

Concepts for Wireless Ad Hoc Bandwdth and Avalable Bandwdth oncepts for Wreless Ad Hoc Networks Marco A. Alzate Unversdad Dstrtal, Bogotá Néstor M. Peña Unversdad de los Andes, Bogotá Mguel A. abrador Unversty of South Florda, Tampa

More information

Feasibility Conditions of Interference Alignment via Two Orthogonal Subcarriers

Feasibility Conditions of Interference Alignment via Two Orthogonal Subcarriers 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, gerard.ramer}@tum.de

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

Transmission Capacity of Carrier Sensing Ad Hoc Networks with Multiple Antennas

Transmission Capacity of Carrier Sensing Ad Hoc Networks with Multiple Antennas 1 Transmsson Capacty of Carrer ensng Ad Hoc Networs wth ultple Antennas Andrew. Hunter, Radha Krshna Gant, and Jeffrey G. Andrews Abstract ultple antennas have become a common component of wreless networs,

More information

A Feedback Reduction Technique for MIMO Broadcast Channels

A Feedback Reduction Technique for MIMO Broadcast Channels A Feedback Reducton Technque for MIMO Broadcast Channels Nhar Jndal Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455, USA Emal: nhar@umn.edu Abstract A multple antenna

More information

Error Bars in both X and Y

Error Bars in both X and Y Error Bars n both X and Y Wrong ways to ft a lne : 1. y(x) a x +b (σ x 0). x(y) c y + d (σ y 0) 3. splt dfference between 1 and. Example: Prmordal He abundance: Extrapolate ft lne to [ O / H ] 0. [ He

More information

Antenna Combining for the MIMO Downlink Channel

Antenna Combining for the MIMO Downlink Channel Antenna Combnng for the IO Downlnk Channel arxv:0704.308v [cs.it] 0 Apr 2007 Nhar Jndal Department of Electrcal and Computer Engneerng Unversty of nnesota nneapols, N 55455, USA Emal: nhar@umn.edu Abstract

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

MIMO Systems and Channel Capacity

MIMO Systems and Channel Capacity MIMO Systems and Channel Capacty Consder a MIMO system wth m Tx and n Rx antennas. x y = Hx ξ Tx H Rx The power constrant: the total Tx power s x = P t. Component-wse representaton of the system model,

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

Pricing and Resource Allocation Game Theoretic Models

Pricing and Resource Allocation Game Theoretic Models Prcng and Resource Allocaton Game Theoretc Models Zhy Huang Changbn Lu Q Zhang Computer and Informaton Scence December 8, 2009 Z. Huang, C. Lu, and Q. Zhang (CIS) Game Theoretc Models December 8, 2009

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

Consider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder.

Consider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder. PASSBAND DIGITAL MODULATION TECHNIQUES Consder the followng passband dgtal communcaton system model. cos( ω + φ ) c t message source m sgnal encoder s modulator s () t communcaton xt () channel t r a n

More information

I + HH H N 0 M T H = UΣV H = [U 1 U 2 ] 0 0 E S. X if X 0 0 if X < 0 (X) + = = M T 1 + N 0. r p + 1

I + HH H N 0 M T H = UΣV H = [U 1 U 2 ] 0 0 E S. X if X 0 0 if X < 0 (X) + = = M T 1 + N 0. r p + 1 Homework 4 Problem Capacty wth CSI only at Recever: C = log det I + E )) s HH H N M T R SS = I) SVD of the Channel Matrx: H = UΣV H = [U 1 U ] [ Σr ] [V 1 V ] H Capacty wth CSI at both transmtter and

More information

On Spatial Capacity of Wireless Ad Hoc Networks with Threshold Based Scheduling

On Spatial Capacity of Wireless Ad Hoc Networks with Threshold Based Scheduling On Spatal Capacty of Wreless Ad Hoc Networks wth Threshold Based Schedulng Yue Lng Che, Ru Zhang, Y Gong, and Lngje Duan Abstract arxv:49.2592v [cs.it] 9 Sep 24 Ths paper studes spatal capacty n a stochastc

More information

An Analytical Model for Interference Alignment in Multi-hop MIMO Networks

An Analytical Model for Interference Alignment in Multi-hop MIMO Networks 1 An Analytcal Model for Interference Algnment n Mult-hop MIMO Networks Huacheng Zeng, Student Member, IEEE, Y Sh, Senor Member, IEEE, Y. Thomas Hou, Fellow, IEEE, Wenng Lou, Fellow, IEEE, Sastry Kompella,

More information

Application of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations

Application of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work

More information

Communication with AWGN Interference

Communication with AWGN Interference Communcaton wth AWG Interference m {m } {p(m } Modulator s {s } r=s+n Recever ˆm AWG n m s a dscrete random varable(rv whch takes m wth probablty p(m. Modulator maps each m nto a waveform sgnal s m=m

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

A Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control

A Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control A ower Bound on SIR Threshold for Call Admsson Control n Multple-Class CDMA Systems w Imperfect ower-control Mohamed H. Ahmed Faculty of Engneerng and Appled Scence Memoral Unversty of ewfoundland St.

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

Lecture 12: Classification

Lecture 12: Classification Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna

More information

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal

More information

COGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK

COGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK COGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK Ayman MASSAOUDI, Noura SELLAMI 2, Mohamed SIALA MEDIATRON Lab., Sup Com Unversty of Carthage 283 El Ghazala Arana, Tunsa

More information

A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS

A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS Shervn Haamn A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS INTRODUCTION Increasng computatons n applcatons has led to faster processng. o Use more cores n a chp

More information

x = x 1 + :::+ x K and the nput covarance matrces are of the form ± = E[x x y ]. 3.2 Dualty Next, we ntroduce the concept of dualty wth the followng t

x = x 1 + :::+ x K and the nput covarance matrces are of the form ± = E[x x y ]. 3.2 Dualty Next, we ntroduce the concept of dualty wth the followng t Sum Power Iteratve Water-fllng for Mult-Antenna Gaussan Broadcast Channels N. Jndal, S. Jafar, S. Vshwanath and A. Goldsmth Dept. of Electrcal Engg. Stanford Unversty, CA, 94305 emal: njndal,syed,srram,andrea@wsl.stanford.edu

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

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering / Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons

More information

Efficient, General Point Cloud Registration with Kernel Feature Maps

Efficient, General Point Cloud Registration with Kernel Feature Maps Effcent, General Pont Cloud Regstraton wth Kernel Feature Maps Hanchen Xong, Sandor Szedmak, Justus Pater Insttute of Computer Scence Unversty of Innsbruck 30 May 2013 Hanchen Xong (Un.Innsbruck) 3D Regstraton

More information

FUll-duplex (FD) is a promising technique to increase

FUll-duplex (FD) is a promising technique to increase 1 Jont Relay-User Beamformng Desgn n Full-Duplex Two-Way Relay Channel Zhgang Wen, Shua Wang, Xaoqng Lu, and Junwe Zou arxv:1610.04974v1 cs.it] 17 Oct 2016 Abstract A full-duplex two-way relay channel

More information

MULTI-INPUT multi-output (MIMO) communication is

MULTI-INPUT multi-output (MIMO) communication is IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 66, NO. 8, AUGUST 217 681 Coverage Performance n Multstream MIMO-ZFBF Heterogeneous Networks Mohammad G. Khoshkholgh, Kang G. Shn, Lfe Fellow, IEEE, Kevan

More information

Support Vector Machines

Support Vector Machines Separatng boundary, defned by w Support Vector Machnes CISC 5800 Professor Danel Leeds Separatng hyperplane splts class 0 and class 1 Plane s defned by lne w perpendcular to plan Is data pont x n class

More information

Natural Language Processing and Information Retrieval

Natural Language Processing and Information Retrieval Natural Language Processng and Informaton Retreval Support Vector Machnes Alessandro Moschtt Department of nformaton and communcaton technology Unversty of Trento Emal: moschtt@ds.untn.t Summary Support

More information

An Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control

An Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com

More information

Secret Communication using Artificial Noise

Secret Communication using Artificial Noise Secret Communcaton usng Artfcal Nose Roht Neg, Satashu Goel C Department, Carnege Mellon Unversty, PA 151, USA {neg,satashug}@ece.cmu.edu Abstract The problem of secret communcaton between two nodes over

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

Support Vector Machines

Support Vector Machines /14/018 Separatng boundary, defned by w Support Vector Machnes CISC 5800 Professor Danel Leeds Separatng hyperplane splts class 0 and class 1 Plane s defned by lne w perpendcular to plan Is data pont x

More information

Hybrid Unicast and Multicast Flow Control: A Linear Optimization Approach

Hybrid Unicast and Multicast Flow Control: A Linear Optimization Approach Hybrd Uncast and Multcast Flow Control: A Lnear Optmzaton Approach Homayoun Youse zadeh Fatemeh Fazel Hamd Jaarhan Department o EECS Unversty o Calorna, Irvne Flow Control Motvaton Content delvery over

More information

Average Decision Threshold of CA CFAR and excision CFAR Detectors in the Presence of Strong Pulse Jamming 1

Average Decision Threshold of CA CFAR and excision CFAR Detectors in the Presence of Strong Pulse Jamming 1 Average Decson hreshold of CA CFAR and excson CFAR Detectors n the Presence of Strong Pulse Jammng Ivan G. Garvanov and Chrsto A. Kabachev Insttute of Informaton echnologes Bulgaran Academy of Scences

More information

Introduction to Antennas & Arrays

Introduction to Antennas & Arrays Introducton to Antennas & Arrays Antenna transton regon (structure) between guded eaves (.e. coaxal cable) and free space waves. On transmsson, antenna accepts energy from TL and radates t nto space. J.D.

More information

OPTIMUM BEAMFORMING USING TRANSMIT ANTENNA ARRAYS. feasible points with monotonically decreasing costs).

OPTIMUM BEAMFORMING USING TRANSMIT ANTENNA ARRAYS. feasible points with monotonically decreasing costs). OPTIMUM BEAMFORMING USING TRANSMIT ANTENNA ARRAYS Eugene Vsotsky Upamanyu Madhow Abstract - Transmt beamformng s a powerful means of ncreasng capacty n systems n whch the transmtter s eupped wth an antenna

More information

Differential Phase Shift Keying (DPSK)

Differential Phase Shift Keying (DPSK) Dfferental Phase Shft Keyng (DPSK) BPSK need to synchronze the carrer. DPSK no such need. Key dea: transmt the dfference between adjacent messages, not messages themselves. Implementaton: b = b m m = 1

More information

Lagrange Multipliers Kernel Trick

Lagrange Multipliers Kernel Trick Lagrange Multplers Kernel Trck Ncholas Ruozz Unversty of Texas at Dallas Based roughly on the sldes of Davd Sontag General Optmzaton A mathematcal detour, we ll come back to SVMs soon! subject to: f x

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

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

Goodness of fit and Wilks theorem

Goodness of fit and Wilks theorem DRAFT 0.0 Glen Cowan 3 June, 2013 Goodness of ft and Wlks theorem Suppose we model data y wth a lkelhood L(µ) that depends on a set of N parameters µ = (µ 1,...,µ N ). Defne the statstc t µ ln L(µ) L(ˆµ),

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

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

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

Lecture 5. ALOHAnet. ALOHA protocols. Client. Client. Hub. Client

Lecture 5. ALOHAnet. ALOHA protocols. Client. Client. Hub. Client Lecture 5 ALOHA protocols ALOHAnet Aloha was a poneerng computer networkng system developed at the Unversty of Hawa n 97 s. The dea was to use rado to create a computer network lnkng the far-flung campuses

More information

CLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS

CLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS CLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS Yawgeng A. Cha and Karl Yng-Ta Hang Department of Commncaton Engneerng,

More information

EM and Structure Learning

EM and Structure Learning EM and Structure Learnng Le Song Machne Learnng II: Advanced Topcs CSE 8803ML, Sprng 2012 Partally observed graphcal models Mxture Models N(μ 1, Σ 1 ) Z X N N(μ 2, Σ 2 ) 2 Gaussan mxture model Consder

More information

Multi-beam multiplexing using multiuser diversity and random beams in wireless systems

Multi-beam multiplexing using multiuser diversity and random beams in wireless systems Mult-eam multplexng usng multuser dversty and random eams n reless systems Sung-Soo ang Telecommuncaton R&D center Samsung electroncs co.ltd. Suon-cty Korea sungsoo.hang@samsung.com Yong-an Lee School

More information

Online Classification: Perceptron and Winnow

Online Classification: Perceptron and Winnow E0 370 Statstcal Learnng Theory Lecture 18 Nov 8, 011 Onlne Classfcaton: Perceptron and Wnnow Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton In ths lecture we wll start to study the onlne learnng

More information

Hierarchical State Estimation Using Phasor Measurement Units

Hierarchical State Estimation Using Phasor Measurement Units Herarchcal State Estmaton Usng Phasor Measurement Unts Al Abur Northeastern Unversty Benny Zhao (CA-ISO) and Yeo-Jun Yoon (KPX) IEEE PES GM, Calgary, Canada State Estmaton Workng Group Meetng July 28,

More information

Multi-User Communication: Capacity, Duality, and Cooperation. Nihar Jindal Stanford University Dept. of Electrical Engineering

Multi-User Communication: Capacity, Duality, and Cooperation. Nihar Jindal Stanford University Dept. of Electrical Engineering Multi-User Communication: Capacity, Duality, and Cooperation Niar Jindal Stanford University Dept. of Electrical Engineering February 3, 004 Wireless Communication Vision Cellular Networks Wireless LAN

More information

EURASIP Journal on Wireless Communications and Networking

EURASIP Journal on Wireless Communications and Networking EURASIP Journal on Wreless Communcatons and Networkng Ths Provsonal PDF corresponds to the artcle as t appeared upon acceptance. Fully formatted PDF and full text (TM) versons wll be made avalable soon.

More information

Assuming that the transmission delay is negligible, we have

Assuming that the transmission delay is negligible, we have Baseband Transmsson of Bnary Sgnals Let g(t), =,, be a sgnal transmtted over an AWG channel. Consder the followng recever g (t) + + Σ x(t) LTI flter h(t) y(t) t = nt y(nt) threshold comparator Decson ˆ

More information

Joint Scheduling and Power-Allocation for Interference Management in Wireless Networks

Joint Scheduling and Power-Allocation for Interference Management in Wireless Networks Jont Schedulng and Power-Allocaton for Interference Management n Wreless Networks Xn Lu *, Edwn K. P. Chong, and Ness B. Shroff * * School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette,

More information

Image classification. Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing i them?

Image classification. Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing i them? Image classfcaton Gven te bag-of-features representatons of mages from dfferent classes ow do we learn a model for dstngusng tem? Classfers Learn a decson rule assgnng bag-offeatures representatons of

More information

Problem Points Score Total 100

Problem Points Score Total 100 Physcs 450 Solutons of Sample Exam I Problem Ponts Score 1 8 15 3 17 4 0 5 0 Total 100 All wor must be shown n order to receve full credt. Wor must be legble and comprehensble wth answers clearly ndcated.

More information

EXTENSION OF SEDJOCO AND ITS USE IN A COMBINATION OF MULTICAST AND COORDINATED MULTI-POINT SYSTEMS

EXTENSION OF SEDJOCO AND ITS USE IN A COMBINATION OF MULTICAST AND COORDINATED MULTI-POINT SYSTEMS EXTENSION OF SEDJOCO AND ITS USE IN A COMBINATION OF MULTICAST AND COORDINATED MULTI-POINT SYSTEMS Yao Cheng 1, Are Yeredor 2, and Martn Haardt 1 1 Communcatons Research Laboratory 2 School of Electrcal

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

Efficient Algorithm for Detecting Layered Space-Time Codes

Efficient Algorithm for Detecting Layered Space-Time Codes 4TH INTERNATIONAL ITG CONFERENCE ON SOURCE AND CHANNEL CODING, BERLIN, JANUARY 2002 1 Effcent Algorthm for Detectng Layered Space-Tme Codes D. Wübben, J. Rnas, R. Böhnke, V. Kühn and K.D. Kammeyer Department

More information

EN40: Dynamics and Vibrations. Homework 4: Work, Energy and Linear Momentum Due Friday March 1 st

EN40: Dynamics and Vibrations. Homework 4: Work, Energy and Linear Momentum Due Friday March 1 st EN40: Dynamcs and bratons Homework 4: Work, Energy and Lnear Momentum Due Frday March 1 st School of Engneerng Brown Unversty 1. The fgure (from ths publcaton) shows the energy per unt area requred to

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

Kernel Methods and SVMs Extension

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

More information

Outage Probability of Macrodiversity Reception in the Presence of Fading and Weibull Co- Channel Interference

Outage Probability of Macrodiversity Reception in the Presence of Fading and Weibull Co- Channel Interference ISSN 33-365 (Prnt, ISSN 848-6339 (Onlne https://do.org/.7559/tv-67847 Orgnal scentfc paper Outage Probablty of Macrodversty Recepton n the Presence of Fadng and Webull Co- Channel Interference Mloš PERIĆ,

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

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

CHANNEL state information (CSI) has a significant impact

CHANNEL state information (CSI) has a significant impact Ffty-second Annual Allerton Conference Allerton House, UIUC, Illnos, USA October 1-3, 2014 Ergodc Capacty Under Channel Dstrbuton Uncertanty Sergey Loyka, Charalambos D. Charalambous and Ioanna Ioannou

More information

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,

More information

Review: Fit a line to N data points

Review: Fit a line to N data points Revew: Ft a lne to data ponts Correlated parameters: L y = a x + b Orthogonal parameters: J y = a (x ˆ x + b For ntercept b, set a=0 and fnd b by optmal average: ˆ b = y, Var[ b ˆ ] = For slope a, set

More information

Lecture 10: Dimensionality reduction

Lecture 10: Dimensionality reduction Lecture : Dmensonalt reducton g The curse of dmensonalt g Feature etracton s. feature selecton g Prncpal Components Analss g Lnear Dscrmnant Analss Intellgent Sensor Sstems Rcardo Guterrez-Osuna Wrght

More information

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute

More information

The SIR Meta Distribution in Poisson Cellular Networks with Base Station Cooperation

The SIR Meta Distribution in Poisson Cellular Networks with Base Station Cooperation The SIR Meta Dstrbuton n Posson Cellular Networs wth Base Staton Cooperaton Qme Cu, Senor Member, IEEE, Xnle Yu, Yuanje Wang, and Martn Haengg, Fellow, IEEE Abstract The meta dstrbuton provdes fne-graned

More information

Conjugate Gradient Projection Approach for MIMO Gaussian Broadcast Channels

Conjugate Gradient Projection Approach for MIMO Gaussian Broadcast Channels Conjugate Gradent Projecton Approach for MIMO Gaussan Broadcast Channels Ja Lu Y. Thomas Hou Sastry Kompella Hanf D. Sheral Department of Electrcal and Computer Engneerng, Vrgna Tech, Blacksburg, VA 4061

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Analyss of Varance and Desgn of Experment-I MODULE VIII LECTURE - 34 ANALYSIS OF VARIANCE IN RANDOM-EFFECTS MODEL AND MIXED-EFFECTS EFFECTS MODEL Dr Shalabh Department of Mathematcs and Statstcs Indan

More information

Equal-Optimal Power Allocation and Relay Selection Algorithm Based on Symbol Error Probability in Cooperative Communication

Equal-Optimal Power Allocation and Relay Selection Algorithm Based on Symbol Error Probability in Cooperative Communication INTERNATIONAL JOURNAL OF COUNICATIONS Volume 1, 18 Equal-Optmal Power Allocaton and Relay Selecton Algorthm Based on Symbol Error Probablty n Cooperatve Communcaton Xn Song, Syang Xu and ngle Zhang Abstract

More information

MACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression

MACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression 11 MACHINE APPLIED MACHINE LEARNING LEARNING MACHINE LEARNING Gaussan Mture Regresson 22 MACHINE APPLIED MACHINE LEARNING LEARNING Bref summary of last week s lecture 33 MACHINE APPLIED MACHINE LEARNING

More information

Effective Beam Width of Directional Antennas in Wireless Ad Hoc Networks

Effective Beam Width of Directional Antennas in Wireless Ad Hoc Networks AG AD LEW: EFFEVE EAM WD OF DREOAL AEAS WRELESS AD O EWORKS Effectve eam Wdt of Drectonal Antennas n Wreless Ad oc etwors Jalang ang and Soung-ang Lew Absact t s nown at a qualtatve level tat drectonal

More information

Numerical Investigation of Power Tunability in Two-Section QD Superluminescent Diodes

Numerical Investigation of Power Tunability in Two-Section QD Superluminescent Diodes Numerca Investgaton of Power Tunabty n Two-Secton QD Superumnescent Dodes Matta Rossett Paoo Bardea Ivo Montrosset POLITECNICO DI TORINO DELEN Summary 1. A smpfed mode for QD Super Lumnescent Dodes (SLD)

More information

UNIVERSITY OF CINCINNATI

UNIVERSITY OF CINCINNATI UNIVERSITY OF CINCINNATI DATE: Marc st, 004 I, Bn Xu ereby submt ts as part of te requrements for te degree of: Master of Scence n: Electrcal Engneerng It s enttled: A Blnd Space-Tme Decorrelatng RAKE

More information

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

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

More information

Linear discriminants. Nuno Vasconcelos ECE Department, UCSD

Linear discriminants. Nuno Vasconcelos ECE Department, UCSD Lnear dscrmnants Nuno Vasconcelos ECE Department UCSD Classfcaton a classfcaton problem as to tpes of varables e.g. X - vector of observatons features n te orld Y - state class of te orld X R 2 fever blood

More information

Which Separator? Spring 1

Which Separator? Spring 1 Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal

More information

Numerical Simulation of One-Dimensional Wave Equation by Non-Polynomial Quintic Spline

Numerical Simulation of One-Dimensional Wave Equation by Non-Polynomial Quintic Spline IOSR Journal of Matematcs (IOSR-JM) e-issn: 78-578, p-issn: 319-765X. Volume 14, Issue 6 Ver. I (Nov - Dec 018), PP 6-30 www.osrournals.org Numercal Smulaton of One-Dmensonal Wave Equaton by Non-Polynomal

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

Based on Partial CSI in MIMO Ad-Hoc Networks

Based on Partial CSI in MIMO Ad-Hoc Networks s Based on Partial CSI in MIMO Ad-Hoc Networks Y. Richter & I. Bergel Faculty of Engineering, Bar-Ilan University Austin, May 2015 1 Outline s &. Optimal routing in random ad-hoc networks. antenna routing.

More information

Conjugate Gradient Projection Approach for Multi-Antenna Gaussian Broadcast Channels

Conjugate Gradient Projection Approach for Multi-Antenna Gaussian Broadcast Channels Conjugate Gradent Projecton Approach for Mult-Antenna Gaussan Broadcast Channels Ja Lu, Y. Thomas Hou, and Hanf D. Sheral Department of Electrcal and Computer Engneerng Department of Industral and Systems

More information

Highly Efficient Gradient Computation for Density-Constrained Analytical Placement Methods

Highly Efficient Gradient Computation for Density-Constrained Analytical Placement Methods Hghly Effcent Gradent Computaton for Densty-Constraned Analytcal Placement Methods Jason Cong and Guoje Luo UCLA Computer Scence Department { cong, gluo } @ cs.ucla.edu Ths wor s partally supported by

More information

Channel Carrying: A Novel Hando Scheme. for Mobile Cellular Networks. Purdue University, West Lafayette, IN 47907, U.S.A.

Channel Carrying: A Novel Hando Scheme. for Mobile Cellular Networks. Purdue University, West Lafayette, IN 47907, U.S.A. Cannel Carryng: A Novel Hando Sceme for oble Cellular Networks Juny L Ness B. Sro y Edwn K.P. Cong Scool of Electrcal and Computer Engneerng Purdue Unversty, West Lafayette, IN 47907, U.S.A. E-mal: funy,

More information

Spectral Efficiency of Dynamic Coordinated Beamforming: A Stochastic Geometry Approach

Spectral Efficiency of Dynamic Coordinated Beamforming: A Stochastic Geometry Approach Spectral Effcency of Dynamc Coordnated Beamformng: A Stochastc Geometry Approach Namyoon Lee, Davd Morales-Jmenez, Angel Lozano, and Robert W. Heath Jr. Abstract Ths paper characterzes the performance

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

Linköping University Post Print. Cooperative Beamforming for the MISO Interference Channel

Linköping University Post Print. Cooperative Beamforming for the MISO Interference Channel Lnköpng Unversty Post Prnt Cooperatve Beamformng for the MISO Interference Channel Johannes Lndblom and Eleftheros Karpds N.B.: When ctng ths work, cte the orgnal artcle. 9 IEEE. Personal use of ths materal

More information

No Downlink Pilots Are Needed in TDD Massive MIMO

No Downlink Pilots Are Needed in TDD Massive MIMO No Downln Plots Are Needed n TDD Massve MIMO Hen Quoc Ngo, r G Larsson The self-archved verson of ths journal artcle s avalable at Lnöpng Unversty lectronc Press: http://urn.b.se/resolve?urn=urn:nbn:se:lu:dva-13871

More information

Linear precoding via conic optimization for fixed MIMO receivers

Linear precoding via conic optimization for fixed MIMO receivers Lnear precodng va conc optmzaton for fxed MIMO recevers Am Wesel, Yonna C Eldar, and Shlomo Shama (Shtz) Department of Electrcal Engneerng Technon - Israel Insttute of Technology June 8, 004 Abstract We

More information