DFT-based Beamforming Weight-Vector Codebook Design for Spatially Correlated Channels in the Unitary Precoding Aided Multiuser Downlink

Size: px
Start display at page:

Download "DFT-based Beamforming Weight-Vector Codebook Design for Spatially Correlated Channels in the Unitary Precoding Aided Multiuser Downlink"

Transcription

1 DFT-based Beamformng Weght-Vector Codeboo Desgn for Spatally Correlated Channels n the Untary Precodng Aded Multuser Downln Du Yang Le-Lang Yang and Lajos Hanzo School of ECS Unversty of Southampton SO7 BJ UK Tel: ; Fax: E-mal: dy5rllylh@ecssotonacu; Abstract The DFT-based beamformng weght-vector codeboo s consdered as an effectve desgn for spatally correlated channels In ths paper we demonstrate that when the antenna elements are unformly spaced as well as lnearly arranged and the channels are spatally correlated the codewords n a DFTbased beaformng weght-vector codeboo approxmately match the dstrbuton of the optmal beamformng weght-vectors As a result the DFT-based codeboo s ndeed effectve Furthermore we also demonstrate that f the antenna elements are unformly spaced and crculary arranged the statstcal dstrbuton of the optmal beamformng weght-vectors becomes dfferent We wll demonstrate that n ths scenaro the DFT-based codeboo wll no longer outperform the Grassmannan codeboo whch has not been shown n prevous studes Fnally an algorthm s proposed for constructng the DFT-based precodng matrx whch outperforms the conventonal algorthm by ensurng the orthogonalty of the precodng matrx Index Terms DFT-based codeboo spatal correlated channel untary precodng multuser downln I INTRODUCTION In ths paper we employ the Untary Precodng (UP) preprocessng scheme proposed for the Long-Term-Evoluton (LTE) standard ] n a multuser DL system havng multple antenna aded Base Statons (BS) and sngle antenna aded Moble Termnals (MTs) The Channel State Informaton (CSI) requred by the UP scheme ncludes the nowledge of the untary beamformng weght-vector and the channel qualty For a Frequency-Dvson-Duplex (FDD) system where the Dowln (DL) and the Upln (UL) channels occupy dfferent frequency bands and have dfferent CSI the most common way of acqurng CSI at the transmtter sde s to estmate the CSI at the recever to quantse the estmated CSI usng a predefned codeboo and then to feed bac the ndex of the chosen CSI codeword to the transmtter through a bandlmted and potentally error-nfected feedbac channel Hence the desgn of the CSI quantzaton codeboo s crucal for the success of any preprocessng technque The quantzer desgn for the beamformng weght-vector s challengng because t s a mult-dmensonal varable Substantal research studes have been dedcated to ths area and several solutons have been proposed ] 5] The Grassmannan lne-pacng codeboo The fnancal support of the EPSRC UK under the auspces of the UK- Inda Centre of Excellence n Wreless Communcatons and that of the EU s Optmx project s gratefully acnowledged was proposed n ] for a beamformng aded system communcatng over spatally ndependent channels whle the Grassmannan subspace pacng codeboo was proposed n ] for a spatal multplexng asssted system For spatally correlated channels a modfed Grassmannan-based codeboo desgn was proposed n 5] However the LTE standard favours the Dscrete Fourer Transform (DFT) based codeboo proposed n ] 7] for ts smplcty whose beamformng weght-vector codewords are actually permuted columns of a DFT matrx However to the best of our nowledge there s no study n the open lterature on nvestgatng the reason why the DFTbased codeboo s effectve for spatally correlated channels The most detaled explanaton we found n the open lterature s n ] where the author argued that the ampltude dfference between the dfferent antenna elements s reduced by spatally correlated fadng hence the constant-modulus DFT codeboo mposes a lower CSI quantzaton error than the nonconstant-modulus Grassmannan codeboo In ths paper we demonstrate that the DFT-based codeboo hosts the Unformly spaced and Lnearly arranged Antenna Elements (UL-AEs ) Normalzed Impulse Responses (NIRs) to a Sngle Resolvable Path (SRP) By explotng the propertes of ths UL-AE NIR-SRP a benefcal scheme s proposed for constructng an orthogonal DFT-based precodng matrx Moreover we demonstrate that for UL-AEs - provded that the channel s spatally correlated - the beamformng weght-vectors n a DFT-based codeboo approxmately match the dstrbuton of the optmal beamformng weght-vectors As a result the DFT-based codeboo s ndeed effectve However we wll demonstrate that for Unformly spaced and Crculary arranged Antenna Elements (UC-AEs) the statstcal dstrbuton of the optmal beamformng weght-vectors becomes dfferent and hence the DFT-based codeboo wll no longer outperform the Grassmannan codeboo even for hgh spatal correlatons Ths problem has not been addressed n prevous studes where smplfed statstcal channel models were used Ths paper s organsed as follows In Secton II the UP preprocessng scheme the DFT-based beamformng weghtvector codeboo and the UL-AE NIR-SRP are ntroduced In Secton III the relatonshp between the beamformng weghtvector n a DFT-based codeboo and the UL-AE NIR-SRP s presented followed by the desgn of an algorthm for constructng an orthogonal precodng matrx In Secton IV the //$ IEEE

2 reasons behnd the effcency of the DFT-based beamformng weght-vector codeboo desgned for UL-AEs are hghlghted whch are contrasted to ts neffcency for UC-AEs Our smulaton results are provded n Secton V followed by our conclusons II PRELIMINARIES A The Untary Precodng Aded Mult-User System As llustrated n Fg a BS equpped wth downln (DL) antennas communcates wth K sngle-antenna aded MTs whch are unformly dspersed over the cell The wreless channels are assumed to be quas-statonary flat Raylegh fadng e they have a constant envelope durng each transmtted bloc The smplfyng assumpton of perfect power control s used hence no path-loss and shadowng are consdered It s also assumed that the total transmt power s equal to unty and that the nose varance N s the same for all the K users The beamformng weght-vector feedbac channel s dealzed e t s assumed to be both error-free and delay-free The Shannon-Hartley law the hghest supportable rate of the th user equals to Γ ( j )=log ( + γ ) In practce Γ wll be quantzed usng another codeboo and fed bac to the BS together wth the above mentoned PMI and PVI In ths study we assumed that usng an arbtrary modulaton and codng scheme s feasble n order to smplfy our study Havng receved the feedbac nformaton the precodng matrx W s and the assocated ntended users are selected wth the ad of the followng equaton n order to maxmse the achevable sum-rate of the B users W s = () argmax N B j= max K Γ (γ ( j ))δ( j j ) wherewehaveδ ( j j )=for ( j) =( j ) and zero otherwse The number of supported users s equal to B when the number of actve users K s suffcently hgh but t may be less than B when K s small Fnally the nformaton sgnals of the B supported users are preprocessed by the precodng matrx W s and they are transmtted smultaneously usng the transmt antennas CB s s s s B s w () w (j) w (B) W Schedulng x x x x h h h h ( j) Γ( j) MT e jarg(ht w(j) ) MT data det & dem MTB h codeword selecton CB: {W =w () w(b) ]; ; W N =w () N w(b) N ]}w(j) C Fg A mult-user system equpped wth transmt antennas at the BS and a sngle antenna at the MTs usng the untary precodng aded transmsson scheme beamformng weght-vector codeboo CB consstng of N precodng matrces W N] s employed at both the BS and the MTs Each precodng matrx W conssts of B untary precodng vectors w (j) w (j) C w (j)h w (j) =Inths study we assumed that B and the precodng vectors of a gven precodng matrx are orthogonal to each other e we have w (j)h w () =for B The th MT frst estmates ts own Channel Impulse Response (CIR) h wth the ad of the receved plot symbols and then selects the preferred Precodng Matrx Index (PMI) as well as the Precodng Vector Index (PVI) j from a prestored codeboo CB n order to maxmse ts own receved SINR γ expressed as ] ( j )=argmax N j B γ ( j) () h T = argmax w(j) N j B BN + n j ht w(n) where ( ) represents the conjugate of a complex-valued scalar/vector/matrx Ths selecton crteron suggests that the MTs assume that all other beams n the precodng matrx W -except for w (j) -wll be scheduled for other users at an dentcal transmt power of B Consequently accordng to the ŝ CB B DFT-based Beamformng Weght-Vector Codeboo The -by- DFT matrx W equals to ] W = (3) e jπ e jπ jπ e e jπ e jπ jπ e e jπ ( ) e jπ ( ) e jπ ( ) e jπ ( ) e jπ ( ) jπ ( ) e The frst rows of W wth a normalzaton factor of consttute the DFT-based beamformng weght-vector codeboo whose codeword w s expressed as w(l) = e jπ l e jπ l e jπ ( ) l ] T () l = Moreover for constructng precodng matrx t s defned n ] that the jth beamformng weght-vector n the th precodng matrx w (j) s calculated usng Equaton () by settng l = j N+ However the orthogonalty of the constructed precodng matrx cannot be guaranteed usng ths algorthm C UL-AE NIR-SRP As llustrated n Fg the transmt AEs are arranged n a lne wth a spacng of λ c where represents the dstance between the adjacent antennas normalsed by the wavelength λ c of the carrer frequency For a sngle resolvable path havng an Angle of Departure (AOD) of θ the CIR h s s formulated as 9] h s (θ) =

3 BS Θ t Θ t cluster cluster MT Lnear Antennas λ c Crcular Antennas λ c Fg Physcal channel model for unformly spaced lnearly allocated antenna elements and unformly spaced crcularly allocated antenna elements ae jφ e jπ Δtcosθ e jπ ( ) Δtcosθ ] T where a and φ represent the sgnal ampltude and the phase rotaton respectvely Hence the UL-AEs normalzed mpulse response to a sngle resolvable path s expressed as e UL AEs (θ) = h s (θ) h s (θ) = e jπ cosθ e jπ ( ) Δtcosθ ] T III CONSTRUCTION OF AN ORTHOGONAL DFT-BASED PRECODING MATRIX RELYING ON THE RELATIONSHIP BETWEEN w (j) AND e UL AEs By comparng Equatons () and (5) t may be shown that f l =Δ c cosθ wehave: w(l) = ] e jπl e jπ(n T t )l () = = e UL AEs(θ) e jπ( cosθ) (5) e jπ( )( cosθ) ] T Hence the beamformng weght-vectors n a DFT-based codeboo host the UL-AE NIR-SRP One of the mportant propertes of e UL AEs stated n 9] s that the absolute value of ts nner product g e = e UL AEs (θ ) H e UL AEs (θ ) equals to sn(π(δtcosθ Δtcosθ)) sn(π(cosθ cosθ )) Furthermore g e =when we have cosθ cosθ = = Physcally ths mples that a beam steered to θ wll completely suppress any sgnal arrvng from θ as long as cosθ cosθ = By substtutng cosθ for l the suffcent condton of havng two orthogonal beamformng weght-vectors w s obtaned as follows: If two beamformng weght-vectors n a DFT-based codeboo w (l ) and w (l ) l l ] are orthogonal to each other then we have l Δ = l l = = Consequently an algorthm of constructng an orthogonal DFT-based precodng matrx s proposed and llustrated n Table I usng Matlab code The dea s to frst calculate an approprate perodc value T and then to assgn the adjacent beamformng codewords of a gven precodng matrx accordng to the relatonshp of x (j) = T Ths algorthm s applcable for B For x (j+) = nb n N the same codeboo s generated by usng ths algorthm and by usng the one proposed n ] descrbed n Secton II-B snce they employ the same value of T TABLE I THE IMPROVED DFT CODEBOOK GENERATION ALGORITHM T = floor(/b)/; %floor(x) = x for =:N end x = ; for j =:B l = x + T (j ); w (j) = w(l); %w(x) s expressed n Equaton () end IV EFFICIENCY OF THE DFT-BASED BEAMFORMING WEIGHT-VECTOR CODEBOOK Based on quantzaton theory the DFT-based beamformng weght-vector codeboo can be consdered as an effcent desgn f t assgns ts quantzaton levels accordng to the statstcal dstrbuton of the optmal beamformng weght-vectors w opt so as to mnmze the quantzaton error ] Moreover the optmal weght-vector w opt n our study s equvalent to the normalsed CIR w opt = h h whch maxmzes the recever s SINR as well as the resultant sum-rate accordng to Equaton () The statstcal dstrbuton of w opt depends on the channel s propertes whch are dscussed as follows A Spatally Correlated Channels Usng UL-AEs For full spatally correlated channels usng UL-AEs w opt s equal to the UL-AE NIR-SRP Usng the physcal channel model characterzed n Fg the CIR h s formulated as h = J I j h s = J I ejφ() j a() j j e UL AEs (θ () j ) where I represents the number of resolvable paths n a cluster whle J denotes the number of clusters The θ () j of each path AOD has a Gaussan dstrbuton wth a mean value of Θ j and an angular spreadng varance of σ j The spatal correlaton ρ of the CIR h wll ncrease when the number of paths clusters and the angular spreadng varance decrease The channel exhbts full spatal correlaton assocated wth ρ =f J = I = and σ j = In ths case we have w opt = h h = h s h s = e UL AEs Based on Equaton (5) the vector e UL AEs can be represented as a functon of a real-valued scalar varable x expressed as e UL AEs (x) = e jπ x e ] jπ ( ) x T x = Δt cosθ Moreover e UL AEs (x) s a perodc functon wth a perod of T =for e jπ x = e jπ (x+) By settng β = mod(x T )x = cosθ x ]T = β ) a unque and unambguous one-to-one relatonshp s constructed between the varable β and the vector e UL AEs As a result we have the Probablty Densty Functon (PDF) p(e UL AEs )=p(f(β)]) = p(β) where the orgnal problem of fndng the dstrbuton of the optmal beamformng vectors w opt becomes equvalent to that of dentfyng the dstrbuton of the varable β Snce the users are unformly dspersed n a cell we have θ U( π)p(θ) = π Upon defnng Ω = cosθ the PDF of Ω becomes equal to p(ω) = π The PDF of the Ω

4 varable β recorded for =5; =and = 3 usng Monte-Claro smulaton s shown n Fg 3 In fact the curve correspondng to =respresents the shape of all PDFs when we have = N Fg 3 demonstrates that except for a few hgh-densty dstrbuton peas β s nearunformly dstrbuted n the range of ) Equaton () demonstrated that the beamformng weghtvector codewords n a DFT-based codeboo are also unformly dstrbuted over ) wth samples at dstances of Hence the DFT-based beamformng weght-vector codeboo has a PDF remnscent of the dstrbuton of the optmal beamformng vector of a fully spatally correlated channel Naturally when the spatal correlaton coeffcent ρ decreases the dstrbuton of β becomes less smlar to the dstrbuton of the optmal beamformng vector Consequently the DFT-based codeboo becomes less effectve B Spatally Correlated Channels Usng UC-AEs When antennas are equally spaced around a crcle wth a dstance of λ c the UC- AEs NIR-SRP s represented as e UC AEs (θ) = where Δ R = π jπδrcos(θ e N ) t sn( π ) ] T e jπδrcos(θ π( ) N ) t s the radus of the crcle Smlarly e UC AEs s the optmal beamformng weght-vector for fully spatally correlated channels usng UC-AEs However ts dstrbuton cannot be modelled by that of the same scalar varable β whch s unformly dstrbuted betwen and As a result the DFT-based beamformng weght-vector codeboo does not represent an effcent desgn for the UC-AEs The smulaton results of Secton V wll demonstrate that the performance of the DFT-based codeboo n fact becomes even worse than that of the Grassmannan codeboo Unfortunately the UC-AEs unt spatal sgnature e UC AEs cannot be expressed as a functon of a scalar varable such as θ or any combnaton of and θ As a result t s dffcult to capture and characterze ts dstrbuton However we have observed n our nformal nvestgatons that for =5 the beamwdth Φ s the same for any AOD Hence we proposed a quantzaton method whch unformly samples the angular range of θ π) wth a dsplacement equal to Φ = Consequently any angular samples wth an angular separaton of Φ are orthogonal wth respect to each other and can be used to construct orthogonal codeboos for B =In practce however more sophstcated desgns are needed for arbtrary values of B and V SIMULATION RESULTS Fg demonstrates the achevable throughput gan of the mproved DFT-based codeboo generated by the algorthm summarsed n Table I as well as the achevable throughput of the conventonal DFT-based beamformng weght-vector codeboo generated accordng to Equaton () at SNR=dB when the AEs are unformly spaced and are arranged n a lne The throughput was calculated as B = log( + γ ) where γ represents the SINR of the th selected user defned n Equaton () usng the selecton crteron stated n Equaton () Four scenaros were consdered namely = 3ρ =B =N =; =3ρ =B =N =; = ρ = B = N = and = ρ = B =N = Four feedbac bts were used for all four scenaros snce the codeboo-sze was = The followng observatons can be made based on the smulaton results of Fg Frstly the achevable sum-rate ncreases wth the number of actve users as a beneft of the ncreased multuser dversty Secondly f = nb n N for example we have = B = then the conventonal scheme and the proposed scheme generate the same codeboo both representng orthogonal precodng matrces hence the same performances are acheved Thrdly f nb n Nfor example we have =3B =and =B = Then usng the codeboo generated by the proposed algorthm s capable of achevng a substantally hgher throughput snce the nter-user nterference s reduced when usng an orthogonal precodng matrx Fourthly the achevable throughput s sgnfcantly reduced when the spatal correlaton coeffcent s ρ = ( =J =I =σ j =5) because the DFTbased conventonal codeboo s less effectve for channels exhbtng a low spatal correlaton Fg 5 compared the achevable sum-rate of the K users for both the DFT-based codeboo and for the Grassmannan subspace pacng codeboo ] at SNR =db and = usng UL-AEs When the channel s fully spatally correlated as ndcated by ρ = the achevable sum-rate of the K users employng the DFT-based codeboo and B = N = s almost twce the achevable sum-rate of the Grassmannan subspace pacng codeboo havng the same codeboo sze By contrast when the spatal correlaton was decreased to ρ = ( = 5J = I = σ j = 5) the performance of the DFT-based codeboo degraded whle that of the Grassmannan subspace pacng codeboo mproved When the channel became spatally ndependent e we had ρ = the achevable rate of usng the Grassmannan subspace pacng codeboo and the one usng the DFT-based codeboo assocated wth =codewords was smlar However when the codeboo sze ncreased to B =N =the achevable sum-rate of the K users employng the Grassmannan subspace pacng codeboo was about bts/symbol hgher than that of the one usng the DFT-based codeboo havng the same codeboo sze Hence the followng conclusons may be obtaned Frstly the DFT-based codeboo havng a small sze consttutes an effectve desgn for both spatally correlated and ndependent channels Secondly the Grassmannan-based codeboo assocated wth a suffcently large codeboo sze s an effectve desgn alternatve for spatally ndependent channels Thrdly more quantzaton bts are requred for spatally ndependent channels because the beamformng vectors are more dssmlar Fg 5 also demonstrates that the achevable sum-rate of spatally ndependent channels usng the Grassmannan-based codeboo havng seven feedbac bts s sgnfcantly lower than that of the fully spatally correlated channel usng the DFT-based codeboo havng only four feedbac bts Ths ndcates that a BS can ether reduce the AE spacng to obtan an ncreased throughput or ncrease the AE spacng to acheve a dversty gan

5 Fg llustrates the achevable sum-rate of the K users for the DFT-based codeboo the Grassmannan-based codeboo and the proposed codeboo descrbed n Secton IV-B at SNR = db = = 5B = N = when the AEs are unformly spaced and arranged n a crcle When the channel s fully spatally correlated the achevable sum-rate usng the DFT-based codeboo becomes lower than that of the Grassmannan-based codeboo When usng the proposed codeboo a substantal throughput gan s obtaned Hence we conclude that the DFT-based codeboo s neffectve for UC-AEs When the spatal correlaton was decreased to ρ = 7 the achevable sum-rate of both the DFTbased codeboo and of the Grassmannan codeboo ncreased compared to the ρ =scenaro and ther dfference became subtle Ths s because the beamformng vectors dstrbuton becomes more dspersed across the entre -dmensonal unt sphere As a result both the DFT-based and the Grassmannanbased codeboos become more effectve VI CONCLUSION In ths paper we have analysed the DFT-based beamformng weght-vector codeboo employed n the untary precodng aded mult-user downln By recognsng the fact that the beamformng weght-vector n a DFT-based codeboo s consttuted by the UL-AE NIR-SRP an algorthm was proposed for constructng the correspondng DFT-based orthogonal precodng matrx It was demonstrated that the DFT-based codeboo s effectve for UL-AEs but not for UC- AEs The smulaton results of Fg 5 also demonstrated that for spatally ndependent channels the Grassmannan codeboo wll only outperform the DFT-based codeboo f the codeboo sze s suffcently large REFERENCES ] S Sesa I Touf and M Baer LTE: The UMTS Long Term Evoluton from Theory to Practce John Wley and Sons Ltd 9 ] D J Love R W Heath and T Strohmer Grassmannan beamformng for multple-nput multple-output wreless systems IEEE Transactons on Informaton Theory vol 9 no pp Oct 3 3] D Yang L L Yang and L Hanzo Performance of SDMA systems usng transmtter preprocessng based on nosy feedbac of vectorquantzed channel mpulse responses n Vehcular Technology Conference 7 VTC7-Sprng IEEE 5th Dubln Apr 7 pp 9 3 ] D J Love and R W Heath Lmted feedbac untary precodng for spatal multplexng systems IEEE Transactons on Informaton Theory vol 5 no pp Aug 5 5] V Raghavan R W Heath and A M Sayeed Systematc codeboo desgns for quantzed beamformng n correlated MIMO channels IEEE Journal on Selected Areas n Communcatons vol 5 no 7 pp 9 3 Sept 7 ] Results on zero-forcng MU-MIMO Freescale Semconductor Inc 3GPP TSG RAN WG R-75 Tech Rep 7 Onlne] Avalable: 7] D J Love and R W Heath Equal gan transmsson n multple-nput multple-output wreless systems vol pp Nov ] J Zhu J Lu X She and L Chen Investgaton on precodng technques n E-UTRA and proposed adaptve precodng scheme for MIMO systems n th Asa-Pacfc Conference on Communcatons Oct pp 5 9] D Tse and P Vswanath Fundamentals of wreless communcaton Cambrdge Unversty Press 5 ] A Gersho and R M Gray Vector Quantzaton and Sgnal Compresson Kluwer Academc Publshers 99 Fg 3 p(β) =5 = =/3 β The pdf of β when =5; =and = 3 respectvely Achevable sum rate (bts/sym) SNR=dB unformly spaced lnearly allocated antenna elements 3 5 Number of Actve Users K =3ρ=B=N=old scheme =3ρ=B=N=old scheme =3ρ=B=N=new scheme =3ρ=B=N=new scheme =ρ=b=n=old scheme =ρ=b=n=new scheme =ρ=b=n=old scheme =ρ=b=n=new scheme Fg Comparson of the conventonal DFT-based codeboo generated from Equaton () and the proposed mproved DFT-based codeboo generated by the algorthm summarsed n Table I n terms of the achevable sum-rate versus the number of actve users K when ) =3ρ =B =N =; ) =3ρ =B =N =; 3) =ρ =B =N =and ) =ρ=b =N = Achevable sum rate (bts/sym) SNR=dB = N r = unformly spaced lnearly allocated antenna elements ρ=dft basedb=n= ρ=grass sub B=N= ρ=dft based B=N= ρ= Grass sub B=N= ρ=dft basedb=n= ρ=grass sub B=N= ρ=dft basedb=n= ρ=grass subb=n= 3 5 Number of Actve Users K Fg 5 The achevable sum-rate versus the number of actve users K for spatally correlated channels assocated wth ρ = ρ = and spatally ndependent channels havng ρ = whenb = N = and usng ether the DFT codeboo or the Grassmannan subspace pacng codeboo respectvely SNR=dB = =5 B= N= unformly spaced crcularly allocated antenna elements Achevable sum rate (bts/sym) DFT based ρ= Grasss sub ρ= proposedρ= proposed ρ=7 DFT based ρ=7 Grass sub ρ=7 3 5 Number of Actve Users K Fg Comparson of the achevable sum-rate versus the number of actve users K usng the DFT-based codeboo the Grassmannan subspace pacng codeboo wth B = N = as well as the proposed codeboo wth B =N =9for spatal correlated channels assocated wth ρ =and ρ =7 respectvely when antenna elements are unformly spaced and allocated n a crcle

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

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

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

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

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

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

VQ widely used in coding speech, image, and video

VQ widely used in coding speech, image, and video at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng

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

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

Pulse Coded Modulation

Pulse Coded Modulation Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal

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

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

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

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

CHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER. In real environmental conditions the speech signal may be

CHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER. In real environmental conditions the speech signal may be 55 CHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER 4.1 Introducton In real envronmental condtons the speech sgnal may be supermposed by the envronmental nterference. In general, the spectrum

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

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

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

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

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

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

Markov Chain Monte Carlo Lecture 6

Markov Chain Monte Carlo Lecture 6 where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways

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

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

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

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

Multigradient for Neural Networks for Equalizers 1

Multigradient for Neural Networks for Equalizers 1 Multgradent for Neural Netorks for Equalzers 1 Chulhee ee, Jnook Go and Heeyoung Km Department of Electrcal and Electronc Engneerng Yonse Unversty 134 Shnchon-Dong, Seodaemun-Ku, Seoul 1-749, Korea ABSTRACT

More information

TLCOM 612 Advanced Telecommunications Engineering II

TLCOM 612 Advanced Telecommunications Engineering II TLCOM 62 Advanced Telecommuncatons Engneerng II Wnter 2 Outlne Presentatons The moble rado sgnal envronment Combned fadng effects and nose Delay spread and Coherence bandwdth Doppler Shft Fast vs. Slow

More information

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be

More information

Appendix B: Resampling Algorithms

Appendix B: Resampling Algorithms 407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles

More information

Grover s Algorithm + Quantum Zeno Effect + Vaidman

Grover s Algorithm + Quantum Zeno Effect + Vaidman Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the

More information

A Robust Method for Calculating the Correlation Coefficient

A Robust Method for Calculating the Correlation Coefficient A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal

More information

Linear Regression Analysis: Terminology and Notation

Linear Regression Analysis: Terminology and Notation ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented

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

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1 Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons

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

OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION. Christophe De Luigi and Eric Moreau

OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION. Christophe De Luigi and Eric Moreau OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION Chrstophe De Lug and Erc Moreau Unversty of Toulon LSEET UMR CNRS 607 av. G. Pompdou BP56 F-8362 La Valette du Var Cedex

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

Low Complexity Soft-Input Soft-Output Hamming Decoder

Low Complexity Soft-Input Soft-Output Hamming Decoder Low Complexty Soft-Input Soft-Output Hammng Der Benjamn Müller, Martn Holters, Udo Zölzer Helmut Schmdt Unversty Unversty of the Federal Armed Forces Department of Sgnal Processng and Communcatons Holstenhofweg

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

Time-Varying Systems and Computations Lecture 6

Time-Varying Systems and Computations Lecture 6 Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy

More information

Pop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing

Pop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,

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

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

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

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

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

More information

Inductance Calculation for Conductors of Arbitrary Shape

Inductance Calculation for Conductors of Arbitrary Shape CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors

More information

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method

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

Lecture 5 Decoding Binary BCH Codes

Lecture 5 Decoding Binary BCH Codes Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture

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 Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models

More information

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013 ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run

More information

Asymptotic Quantization: A Method for Determining Zador s Constant

Asymptotic Quantization: A Method for Determining Zador s Constant Asymptotc Quantzaton: A Method for Determnng Zador s Constant Joyce Shh Because of the fnte capacty of modern communcaton systems better methods of encodng data are requred. Quantzaton refers to the methods

More information

CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION

CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING N. Phanthuna 1,2, F. Cheevasuvt 2 and S. Chtwong 2 1 Department of Electrcal Engneerng, Faculty of Engneerng Rajamangala

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

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

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

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

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

A New Scrambling Evaluation Scheme based on Spatial Distribution Entropy and Centroid Difference of Bit-plane

A New Scrambling Evaluation Scheme based on Spatial Distribution Entropy and Centroid Difference of Bit-plane A New Scramblng Evaluaton Scheme based on Spatal Dstrbuton Entropy and Centrod Dfference of Bt-plane Lang Zhao *, Avshek Adhkar Kouch Sakura * * Graduate School of Informaton Scence and Electrcal Engneerng,

More information

Distributed Non-Autonomous Power Control through Distributed Convex Optimization

Distributed Non-Autonomous Power Control through Distributed Convex Optimization Dstrbuted Non-Autonomous Power Control through Dstrbuted Convex Optmzaton S. Sundhar Ram and V. V. Veeravall ECE Department and Coordnated Scence Lab Unversty of Illnos at Urbana-Champagn Emal: {ssrnv5,vvv}@llnos.edu

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

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

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

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

Multi-user Detection Based on Weight approaching particle filter in Impulsive Noise

Multi-user Detection Based on Weight approaching particle filter in Impulsive Noise Internatonal Symposum on Computers & Informatcs (ISCI 2015) Mult-user Detecton Based on Weght approachng partcle flter n Impulsve Nose XIAN Jn long 1, a, LI Sheng Je 2,b 1 College of Informaton Scence

More information

STAT 511 FINAL EXAM NAME Spring 2001

STAT 511 FINAL EXAM NAME Spring 2001 STAT 5 FINAL EXAM NAME Sprng Instructons: Ths s a closed book exam. No notes or books are allowed. ou may use a calculator but you are not allowed to store notes or formulas n the calculator. Please wrte

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

Linköping University Post Print. Combining Long-Term and Low-Rate Short- Term Channel State Information over Correlated MIMO Channels

Linköping University Post Print. Combining Long-Term and Low-Rate Short- Term Channel State Information over Correlated MIMO Channels Lnköpng Unversty Post Prnt Combnng Long-Term and Low-Rate Short- Term Channel State Informaton over Correlated MIMO Channels Tùng T. Km, Mats Bengtsson, Erk G. Larsson and Mkael Skoglund N.B.: When ctng

More information

Chapter 8 Indicator Variables

Chapter 8 Indicator Variables Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n

More information

Distributed Transmit Diversity in Relay Networks

Distributed Transmit Diversity in Relay Networks Dstrbuted Transmt Dversty n Relay etworks Cemal Akçaba, Patrck Kuppnger and Helmut Bölcske Communcaton Technology Laboratory ETH Zurch, Swtzerland Emal: {cakcaba patrcku boelcske}@nareeethzch Abstract

More information

Comparison of Regression Lines

Comparison of Regression Lines STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence

More information

Iterative Multiuser Receiver Utilizing Soft Decoding Information

Iterative Multiuser Receiver Utilizing Soft Decoding Information teratve Multuser Recever Utlzng Soft Decodng nformaton Kmmo Kettunen and Tmo Laaso Helsn Unversty of Technology Laboratory of Telecommuncatons Technology emal: Kmmo.Kettunen@hut.f, Tmo.Laaso@hut.f Abstract

More information

Negative Binomial Regression

Negative Binomial Regression STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...

More information

A Fast Computer Aided Design Method for Filters

A Fast Computer Aided Design Method for Filters 2017 Asa-Pacfc Engneerng and Technology Conference (APETC 2017) ISBN: 978-1-60595-443-1 A Fast Computer Aded Desgn Method for Flters Gang L ABSTRACT *Ths paper presents a fast computer aded desgn method

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

2016 Wiley. Study Session 2: Ethical and Professional Standards Application

2016 Wiley. Study Session 2: Ethical and Professional Standards Application 6 Wley Study Sesson : Ethcal and Professonal Standards Applcaton LESSON : CORRECTION ANALYSIS Readng 9: Correlaton and Regresson LOS 9a: Calculate and nterpret a sample covarance and a sample correlaton

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

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

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

Time Delay Estimation in Cognitive Radio Systems

Time Delay Estimation in Cognitive Radio Systems Tme Delay Estmaton n Cogntve Rado Systems Invted Paper Fath Kocak, Hasar Celeb, Snan Gezc, Khald A. Qaraqe, Huseyn Arslan, and H. Vncent Poor Department of Electrcal and Electroncs Engneerng, Blkent Unversty,

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

Lecture 3: Probability Distributions

Lecture 3: Probability Distributions Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the

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

Cognitive Access Algorithms For Multiple Access Channels

Cognitive Access Algorithms For Multiple Access Channels 203 IEEE 4th Workshop on Sgnal Processng Advances n Wreless Communcatons SPAWC) Cogntve Access Algorthms For Multple Access Channels Ychuan Hu and Alejandro Rbero, Department of Electrcal and Systems Engneerng,

More information

arxiv:cs.cv/ Jun 2000

arxiv:cs.cv/ Jun 2000 Correlaton over Decomposed Sgnals: A Non-Lnear Approach to Fast and Effectve Sequences Comparson Lucano da Fontoura Costa arxv:cs.cv/0006040 28 Jun 2000 Cybernetc Vson Research Group IFSC Unversty of São

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

is the calculated value of the dependent variable at point i. The best parameters have values that minimize the squares of the errors

is the calculated value of the dependent variable at point i. The best parameters have values that minimize the squares of the errors Multple Lnear and Polynomal Regresson wth Statstcal Analyss Gven a set of data of measured (or observed) values of a dependent varable: y versus n ndependent varables x 1, x, x n, multple lnear regresson

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

Entropy Coding. A complete entropy codec, which is an encoder/decoder. pair, consists of the process of encoding or

Entropy Coding. A complete entropy codec, which is an encoder/decoder. pair, consists of the process of encoding or Sgnal Compresson Sgnal Compresson Entropy Codng Entropy codng s also known as zero-error codng, data compresson or lossless compresson. Entropy codng s wdely used n vrtually all popular nternatonal multmeda

More information

Number of cases Number of factors Number of covariates Number of levels of factor i. Value of the dependent variable for case k

Number of cases Number of factors Number of covariates Number of levels of factor i. Value of the dependent variable for case k ANOVA Model and Matrx Computatons Notaton The followng notaton s used throughout ths chapter unless otherwse stated: N F CN Y Z j w W Number of cases Number of factors Number of covarates Number of levels

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

Regularized Discriminant Analysis for Face Recognition

Regularized Discriminant Analysis for Face Recognition 1 Regularzed Dscrmnant Analyss for Face Recognton Itz Pma, Mayer Aladem Department of Electrcal and Computer Engneerng, Ben-Guron Unversty of the Negev P.O.Box 653, Beer-Sheva, 845, Israel. Abstract Ths

More information

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,

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

Supporting Information

Supporting Information Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to

More information

THE optimal detection of a coded signal in a complicated

THE optimal detection of a coded signal in a complicated IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 6, NO., NOVEMBER 24 773 Achevable Rates of MIMO Systems Wth Lnear Precodng and Iteratve LMMSE Detecton Xaojun Yuan, Member, IEEE, L Png, Fellow, IEEE, Chongbn

More information