Machine Learning Inspired Energy-Efficient Hybrid Precoding for MmWave Massive MIMO Systems

Size: px
Start display at page:

Download "Machine Learning Inspired Energy-Efficient Hybrid Precoding for MmWave Massive MIMO Systems"

Transcription

1 Machie Learig Ispired Eergy-Efficiet Hybrid Precodig for MmWave Massive MIMO ystems Xiyu Gao, Liglog Dai, Yig u, huagfeg Ha, ad Chih-Li I Tsighua atioal Laboratory for Iformatio ciece ad Techology (TList), Departmet of Electroic Egieerig, Tsighua Uiversity, Beijig, Chia Gree Commuicatio Research Ceter, Chia Mobile Research Istitute, Beijig 00053, Chia Abstract Hybrid precodig is a promisig techique for mmwave massive MIMO systems, as it ca cosiderably reduce the umber of required radio-frequecy () chais without obvious performace loss. However, most of the existig hybrid precodig schemes require a complicated phase shifter etwor, which still ivolves high eergy cosumptio. I this paper, we propose a eergy-efficiet hybrid precodig architecture, where the aalog part is realized by a small umber of switches ad iverters istead of a large umber of high-resolutio phase shifters. Our aalysis proves that the performace gap betwee the proposed hybrid precodig architecture ad the traditioal oe is small ad eeps costat whe the umber of ateas goes to ifiity. The, ispired by the cross-etropy (CE) optimizatio developed i machie learig, we propose a adaptive CE (ACE)-based hybrid precodig scheme for this ew architecture. It aims to adaptively update the probability distributios of the elemets i hybrid precoder by miimizig the CE, which ca geerate a solutio close to the optimal oe with a sufficietly high probability. imulatio results verify that our scheme ca achieve the ear-optimal sum-rate performace ad much higher eergy efficiecy tha traditioal schemes. I. ITRODUCTIO Millimeter-wave (mmwave) massive multiple-iput multiple-output (MIMO) has bee cosidered as a promisig techology for future 5G wireless commuicatios [], sice it ca provide wider badwidth [] ad achieve higher spectral efficiecy [3]. However, i MIMO systems, each atea usually requires a dedicated radio-frequecy () chai (icludig high-resolutio digital-to-aalog coverter, mixer, etc.) to realize the fully digital sigal processig (e.g., precodig) [4]. For mmwave massive MIMO, this will result i uaffordable hardware complexity ad eergy cosumptio, as the umber of ateas becomes huge ad the eergy cosumptio of chai is high [5]. To reduce the umber of required chais, hybrid precodig has bee recetly proposed [6]. Its ey idea is to decompose the fully digital precoder ito a large-size aalog beamformer (realized by the aalog circuit) ad a small-size digital precoder (requirig a small umber of chais). Thas to the low-ra characteristics of mmwave chaels [], a small-size digital precoder ca achieve the spatial multiplexig gais, maig hybrid precodig ejoy the ear-optimal performace [5]. evertheless, most of the existig hybrid precodig schemes require a complicated phase shifter etwor, where each chai is coected to all ateas with high-resolutio phase shifters [6], [7]. Although this architecture ca provide high desig freedom to achieve the ear-optimal performace, it requires hudreds or eve thousads of high-resolutio phase shifters with high hardware cost ad eergy cosumptio [5]. To solve this problem, two categories of schemes have bee proposed very recetly. The first category is to directly employ fiite-resolutio phase shifters istead of high-resolutio phase shifters [8], [9]. It ca reduce the eergy cosumptio of phase shifter etwor without obvious performace loss, but it still requires a large umber of phase shifters with cosiderable eergy cosumptio. The secod category is to utilize the switch etwor to replace the phase shifter etwor [0] []. It ca sigificatly reduce the hardware cost ad eergy cosumptio, but it suffers from a obvious performace loss. I this paper, we propose a switch ad iverter (I)- based hybrid precodig architecture with cosiderably reduced hardware cost ad eergy cosumptio. Istead of usig phase shifters, the aalog part of the proposed architecture is realized by a small umber of eergy-efficiet switches ad iverters. The, we provide the performace aalysis to quatify the performace gap betwee the proposed hybrid precodig architecture ad the traditioal oes. After that, ispired by the crossetropy (CE) optimizatio developed i machie learig [3], we propose a adaptive CE (ACE)-based hybrid precodig scheme for this ew architecture. pecifically, accordig to the probability distributios of the elemets i hybrid precoder, this scheme first radomly geerates several cadidate hybrid precoders. The, it adaptively weights these cadidate hybrid precoders accordig to their achievable sum-rates, ad refies the probability distributios of elemets i hybrid precoder by miimizig the CE. Repeatig such procedure, we ca fially geerate a hybrid precoder close to the optimal oe with a sufficietly high probability. imulatio results verify that our scheme ca achieve the ear-optimal sum-rate performace ad much higher eergy efficiecy tha traditioal schemes. otatio: Lower- ad upper-case boldface letters deote vectors ad matrices, respectively; ( ) T, ( ) H, ( ), tr ( ), ad F deote the traspose, cojugate traspose, iversio, trace, ad Frobeius orm of a matrix, respectively; deotes the absolute operator; E( ) deotes the expectatio; deotes the roecer product; I is the idetity matrix. II. YTEM MODEL I this paper, we cosider a typical mmwave massive MI- MO system, where the base statio (B) employs ateas /7/$ IEEE

2 ad chais to simultaeously serve K sigle-atea users (the extesio to users with multiple-ateas is also possible as will be explaied later). To fully achieve the multiplexig gais, we assume = K [9]. For hybrid precodig systems as show i Fig., the K received sigal vector y for all K users ca be preseted by y = HF F BB s +, () Digital precoder chai chai Fiite-resolutio phase shifters where H =[h, h,, h K ] H is the chael matrix with h presetig the chael vector betwee the B ad the th user, s is the K trasmitted sigal vector for all K users satisfyig E ( ss H) = I K, F of size is the aalog beamformer realized by aalog circuit (differet architectures icur differet hardware costraits as will be discussed later), F BB is the basebad digital precoder of size K satisfyig the total trasmit power costrait as F F BB F = ρ, where ρ is total trasmit power. Fially, C ( ) 0,σ I K of size K is the additive white Gaussia oise (AWG) vector, where σ presets the oise power. For the chael vector h of the th user, we adopt the geometric chael model to capture the characteristics of mmwave massive MIMO chaels as [5] h = L L l= ( ) α (l) a ϕ (l),θ(l), () where L deotes the umber of paths for user, α (l) ad ϕ (l) (θ (l) ) for l L are the complex gai ad azimuth (elevatio) agle of departure (AoD) of the path l for user, a (ϕ, θ) presets the array steerig vector. For the typical uiform plaar array (UPA) with elemets i horizo ad elemets i vertical ( = ), we have [6] a (ϕ, θ) =a az (ϕ) a el (θ), (3) [ where a az (ϕ) = ] e jπi(d T /λ)siϕ for i I( ), [ a el (θ) = ] e jπj(d T /λ)siθ for j I( ), I () ={0,,, }, λ is the sigal wavelegth, ad d (d ) is the horizotal (vertical) atea spacig. At mmwave frequecies, we usually have d = d = λ/ [4]. III. EERGY EFFICIET HYBRID PRECODIG I this sectio, we first describe the proposed I-based hybrid precodig architecture. The, we propose a ACEbased hybrid precodig scheme for this ew architecture. Fially, the complexity aalysis is provided. A. The proposed I-based hybrid precodig architecture Fig. (a) ad (b) show the traditioal precodig architectures, i.e., the oe with fiite-resolutio phase shifters (Pbased architecture) [9] ad the oe with switches (W-based architecture) [], respectively. As show i Fig. (a), the traditioal P-based architecture requires a complicated phase shifter etwor, ad the correspodig eergy cosumptio ca be preseted as P P architecture = ρ + P + P P + P BB, (4) Digital precoder Digital precoder (a) (b) (c) Aalog beamformer witches Aalog beamformer Iverters ad switches Aalog beamformer Fig.. Hybrid precodig: (a) traditioal P-based architecture; (b) traditioal W-based architecture; (c) proposed I-based architecture. where P, P P, ad P BB are the eergy cosumptio of chai, fiite-resolutio phase shifter, ad basebad, respectively. ote that although the P-based architecture ejoys high desig freedom to achieve the earoptimal performace [9], it requires a large umber (e.g., =64 6 = 04 [9]) of phase shifters. Moreover, the eergy cosumptio of fiite phase shifter is also cosiderable (e.g., P P = 40mW for 4-bit phase shifter []), These mae the traditioal P-based architecture still suffer from high eergy cosumptio [4]. By cotrast, as show i Fig. (b), W-based architecture ca efficietly relieve such problem by employig a small umber ( istead of ) of eergy-efficiet switches. The eergy cosumptio of W-based architecture ca be preseted as P W architecture = ρ + P + P W + P BB, (5) where P W is the eergy cosumptio of switch, which is much lower tha P P (e.g., P W =5mW[]). evertheless,

3 sice oly ateas are active simultaeously, W-based architecture caot fully achieve the array gais of mmwave massive MIMO, leadig to a obvious performace loss [5]. To overcome the problems faced by traditioal architectures, we propose the I-based architecture as show i Fig. (c), which ca be cosidered as a better trade-off betwee the ear-optimal P-based architecture ad the eergy-efficiet W-based architecture. pecifically, i the proposed I-based architecture, each chai is oly coected to a sub atea array with M = / (assumed to be a iteger) ateas istead of all ateas [6]. Moreover, each chai is coected to the sub atea array via oly oe iverter ad M switches istead of phase shifters. The eergy cosumptio of I-based architecture ca be preseted by P I architecture =ρ+ P + P I +P W +P BB, (6) where P I is the eergy cosumptio of iverter. It worth poitig out that the iverters ca be realized by the digital chip with the eergy cosumptio similar to switches (i.e., P I P W ) [5]. As a result, by comparig (4)-(6), we ca coclude that the eergy cosumptio of the proposed Ibased architecture is much lower tha that of P-based oe. Furthermore, as all ateas are used, I-based architecture ca also achieve the potetial array gais of mmwave massive MIMO, which will be further proved as follows. To do this, we eed to first explai the hardware costraits iduced by the proposed I-based architecture, which are differet from those of the traditioal oes. The first costrait is that the aalog beamformer F should be a bloc diagoal matrix istead of a full matrix as f f 0 F =....., (7) f where f is the M aalog beamformer o the th sub atea array. The secod costrait is that sice oly iverters ad switches are used, all the ozero elemets of F should belog to {, +}. (8) Based o these costraits, we have the followig Lemma. Lemma. Assume that the chael h of user oly has sigle path, i.e., L =[]. Whe ad /M =, the ratio ζ betwee the array gais achieved by I-based architecture ad that achieved by P-based architecture with sufficietly high-resolutio phase shifters ca be preseted by 4 lim ζ =, M = π. (9) Proof: For the traditioal P-based architecture with sufficietly high-resolutio phase shifters, the phases of the elemets i the aalog beamformer ca be arbitrarily adjusted to capture the power of h. Therefore, the array gais achieved by P-based architecture is α (). By cotrast, the array gais achieved by I-based architecture ca be preseted by h H f = α () a H (ϕ ) f (0) = α () M e j φ m m= = α () M cos ( ) M φm + si ( ) φm, m= m= where f is the th colum of F icludig the zeros ad φ m deotes the phase quatizatio error. ice the ozero elemets i f belog to {, +}, φm ca be assumed to follow the uiform distributio U ( π/,π/) for m M [0]. The, we have M lim ζ = cos ( ) M φm + si ( ) φm M /M= m= m= = ( [ ( )]) ( [ ( )]) E cos φm + E si φm 4 = π, () which verifies the coclusio i Lemma. Lemma idicates that although the proposed I-based architecture suffers from some loss of array gais compared to the ear-optimal P-based architecture, the performace loss eeps costat ad limited, which does ot grow as the umber of B ateas goes to ifiity. Recallig the low eergy cosumptio of I-based architecture, we ca coclude that our scheme is a better trade-off betwee the traditioal architectures, which will be also verified by simulatio. ext, we will desig a ear-optimal hybrid precodig scheme for Ibased architecture with quite differet hardware costraits. B. ACE-based hybrid precodig scheme We aim to desig the aalog beamformer F ad the digital precoder F BB to maximize the achievable sum-rate R, which ca be preseted as ( F opt, BB) Fopt =argmax R, F,F BB s.t. F F, () F F BB F = ρ, where F deotes the set with all possible aalog beamformers satisfyig the two costraits (7) ad (8) described above, ad the achievable sum-rate R ca be preseted by K R = log ( + γ ), (3) = where γ presets the sigal-to-iterferece-plus-oise ratio (IR) of the th user as h H γ = F f BB, (4) K h H F f BB + σ

4 where f BB is the th colum of F BB. It is worth poitig out that the costraits (7) ad (8) o the aalog beamformer F are o-covex. This maes () very difficult to be solved. Fortuately, as all the ozero elemets of F belog to the set {, +}, the umber of possible F is fiite. Therefore, () ca be regarded as a o-coheret combiig problem [3]. To solve it, we ca first select a cadidate F, ad compute the optimal F BB accordig to the effective chael matrix HF without o-covex costraits. After all possible F s have bee searched, we ca obtai the optimal aalog beamformer F opt ad digital precoder F opt BB. However, such exhaustive search scheme requires to search possible F s ad F BB s, which ivolves uaffordable complexity as is usually large i mmwave massive MIMO systems (e.g., =64, ). To solve this problem, we propose a ACE algorithm, which ca be cosidered as a improved versio of the CE algorithm developed from machie learig [3]. At first, we would lie to briefly itroduce the covetioal CE algorithm, which is a probabilistic model-based algorithm to solve the combiig problem by a iterative procedure. I each iteratio, the CE algorithm first geerates cadidates (e.g., possible hybrid precoders i our problem) accordig to a probability distributio. The, it computes the objective value (e.g., achievable sum-rate i our problem) of each cadidate, ad selects elite best cadidates as elite [3]. Fially, based o the selected elites, the probability distributio is updated by miimizig the CE. Repeatig such procedure, the probability distributio will be refied to geerate a solutio close to the optimal oe with a sufficietly high probability. However, although the CE algorithm has bee widely used i machie learig [3], it still has some disadvatages. Oe is that the cotributios of all elites are treated as the same. Ituitively, the elite with better objective value should be more importat whe we update the probability distributio. Therefore, if we ca adaptively weight the elites accordig to their objective values, better performace ca be expected. Followig this idea, we propose a ACE algorithm to solve (). The pseudo-code of the proposed ACE-based hybrid precodig scheme is summarized i Algorithm, which ca be explaied as follows. At the begiig, we formulate the ozero elemets i F as vector [ ) f = ( f T ), T ) ] ( f, ( f T T, ad set the probability parameter u =[u,u,,u ] T as a vector, where 0 u presets the probability that f =/, f is the th elemet of f. The, by iitializig u (0) = ( is the all-oe vector), we assume that all the ozero elemets of F belog to {, +} with equal probability, sice o priori iformatio is available. Durig the ith iteratio, i step, we first geerate cadidate aalog beamformers {F s } s= based o the probability distributio Ξ ( F; u (i)) (i.e., geerate {f s } s= accordig to u(i), ad reshape them as matrices belog to F). The, i step, we ote that the covergece of the proposed ACE-based hybrid precodig scheme ca be proved by extedig the Theorem i [7]. Iput: Chael matrix H; umber of iteratios I; umber of cadidates ; umber of elites elite. Iitializatio: i =0; u (0) =. for 0 i I. Radomly geerate cadidate aalog beamformers {F s } s= based o Ξ ( F; u (i)) ;. Compute correspodig digital precoders {F s BB } s= based o the effective chael H s eq = HF s ; 3. Calculate the achievable sum-rate {R (F s )} s= (3); 4. ort {R( (F s ) )} s=( i a ) desced order ( as ) R F [] R F [] R F [] ; 5. elect elites as F [], F[],, F[elite] ; 6. Calculate weight w s for each elite F [s], { s } elite; 7. Update u (i+) accordig to {w s } elite s= ad F [s] elite ; s= 8. i = i +; ed for Output: Aalog beamformer F [] ; Digital precoder F[] BB. Algorithm : The proposed ACE-based hybrid precodig calculate the correspodig digital precoder F s BB accordig to the effective chael H s eq = HF s for s. ote that there are lots of advaced digital precoder schemes [3]. I this paper, we adopt the classical ZF digital precoder with the earoptimal performace ad low complexity as the example [3], ad F s BB ca be computed as G s = ( H s ) ( H eq H s ) ) eq( H s H, eq F s BB = β s G s, (5) where β s = ρ/ F s Gs F is power ormalized factor. After that, i step 3, the achievable sum-rate {R (F s )} s= are calculated by substitutig F s ad Fs BB (also a fuctio of F s ) ito (3). We sort {R (Fs )} s= i a desced order i step 4. The, the elites ca be obtaied i step 5. I the covetioal CE algorithm, the ext step is to usig elites to update u (i+) by miimizig CE, which is equivalet to [3] u (i) elite ( l Ξ F [s] ; u(i)), (6) u (i+) =argmax s= ( ) where Ξ F [s] ; u(i) deotes the probability to geerate F [s]. As metioed above, i (6), the cotributios of all elites are treated as the same, leadig to performace degradatio. To solve this problem, we propose to weight each elite adaptively based o its achievable sum-rate. pecifically, we first defie a auxiliary parameter T presetig the average achievable sum-rate of all elites as T = elite elite s= R ( The, the weight ( w s of ) the elite F [s] step 6 as w s = R F [s] modified as F [s] /T. Based o {w s } elite s= s= ). (7) ca be calculated i, (6) ca be u (i+) elite ( =argmax w s l Ξ F [s] u (i) ; u(i)). (8)

5 ( ) ote that Ξ F [s] ; u(i) =Ξ ( f [s] ; u (i)), ad the th elemet f [s] of f [s] is a Beroulli radom variable, where f [s] with probability u (i) ad f [s] u (i). Therefore, we have ( ( ) Ξ F [s] ; u(i)) = u (i) = =/ = / with probability (+ f [s] ) ( u (i) ) ( f [s] ). (9) After substitutig (9) ito (8), the first derivative of the target i (8) with respect to u (i) ca be derived as elite w s + f [s] f [s] ( ). (0) u (i) u (i) s= ettig (0) to zero, u (i+) ca be updated i step 7 as ( elite f ) s= w [s] s + u (i+) = elite s= w s. () uch procedure above will be repeated (i = i + i step 8) util the maximum umber of iteratios I is reached, ad the aalog beamformer ad digital precoder will be selected as F [] ad F[] BB, respectively. Fially, it is worth poitig out that the proposed ACE-based hybrid precodig scheme ca be also exteded to the sceario where users employ multiple ateas. I this case, the aalog beamformers at the B ad users should be joitly searched by the ACE algorithm. C. Computatioal complexity aalysis I this subsectio, the computatioal complexity of the proposed ACE-based hybrid precodig scheme is discussed. From Algorithm, we ca observe that the complexity of the ACE-based hybrid precodig scheme maily comes from steps, 3, 6, ad 7. I step, we eed to compute effective chael matrices { Heq} s ad digital precoders s= {F s BB } s= accordig to (5). Therefore, the complexity of this part is O ( K ). I step 3, the achievable sum-rate of each cadidate is computed. ice we employ the digital ZF precoder, the IR γ s of the th user for the sth cadidate is simplified to γ s =(βs /σ). As a result, this part oly ivolves the complexity O (). I step 6, we calculate elite weights based o (7), which is quite simple with the complexity O ( elite ). Fially, i step 7, the probability parameter u (i+) is updated accordig to () with the complexity O ( elite ). I summary, after I iteratios, the total computatioal complexity of the proposed ACE hybrid precodig scheme is O ( IK ). ice K is usually small, I ad also do ot have to be very large as will be verified i the ext sectio, we ca coclude that the complexity of the proposed ACE-based hybrid precodig scheme is acceptable, which is comparable with the simple least squares (L) algorithm. IV. IMULATIO REULT I this sectio, we provide the simulatio results i terms of achievable sum-rate ad eergy-efficiecy to evaluate the performace of the proposed ACE-based hybrid precodig Fig.. Achievable sum-rate compariso. I Fig. 3. Achievable sum-rate agaist ad I. scheme. The simulatio parameters are described as follows: We assume that the B employs a UPA with atea s- pacig d = d = λ/. For the th user, we geerate the chael h based o (), where we assume: ) L =3;) α (l) C(0, ) for l L ;3)ϕ (l) ad θ (l) follow the uiform distributio U ( π, π) for l L []. Fially, the sigal-to-oise ratio (R) is defied as ρ/σ. Fig. shows the achievable sum-rate compariso i a typical mmwave massive MIMO system with =64, = K =4. I Fig., the proposed CE-based (i.e., usig the covetioal CE algorithm to solve ()) ad ACEbased hybrid precodig schemes are desiged for I-based architecture, where we set = 00, elite =40, ad I =0 for Algorithm, the covetioal two-stage hybrid precodig scheme is desiged for P-based architecture with 4-bit phase shifters [9], ad the covetioal atea selectio (A)-based hybrid precodig scheme is desiged for W-based architecture [] with switches. Firstly, we ca observe from Fig. that the proposed ACE algorithm outperforms the traditioal CE algorithm, where the R gap is about db. ote that the ACE algorithm oly ivolves oe additioal step (i.e., step 6iAlgorithm ) with egligible complexity. Therefore, the proposed ACE algorithm is more efficiet. Moreover, Fig. also shows that the proposed ACE-based hybrid precodig ca

6 K Fig. 4. Eergy efficiecy compariso. achieve the sum-rate much higher tha the covetioal Abased hybrid precodig, as it ca achieve the potetial array gais i mmwave massive MIMO systems. Fially, we ca observe that the performace gap betwee ACE-based hybrid precodig ad two-stage hybrid precodig is limited ad eeps costat, which further verifies the coclusio i Lemma. Fig. 3 shows the achievable sum-rate of the proposed ACEbased hybrid precodig agaist the umber of cadidates ad the umber of iteratios I, whe elite / =0., =64, = K =4, ad R = 0 db. From Fig. 3, we ca observe that whe is small, icreasig will lead to a obvious improvemet i the sum-rate performace. However, whe is sufficietly large, such tred is o loger obvious. This idicates that the umber of cadidates does ot have to be very large, e.g., = 00 is eough. Furthermore, Fig. 3 also idicates that the proposed ACE-based hybrid precodig ca coverge with a small umber of iteratios, e.g., I =0. These observatios verify the ratioality of the parameters for Algorithm we used i Fig.. Fig. 4 shows the eergy efficiecy compariso whe =64 is fixed ad = K varies from to 6. The parameters for Algorithm are the same as Fig.. Accordig to [5], [6], the eergy efficiecy ca be defied as the ratio betwee the achievable sum-rate ad the eergy cosumptio, which should be (4), (5), ad (6) for twostage hybrid precodig, A-based hybrid precodig, ad ACEbased hybrid precodig, respectively. I this paper, we adopt the practical values ρ = 30mW [6], P = 300mW [6], P BB = 00mW [5], P P = 40mW (4-bit phase shifter) [5], ad P W = P I =5mW [5]. From Fig. 4, we ca observe that the proposed ACE-based hybrid precodig with I-based architecture ca achieve much higher eergy efficiecy tha the others, especially whe K is ot very large (e.g., K ). Furthermore, it is iterestig to observe that whe K 8, the eergy efficiecy of the two-stage hybrid precodig with Pbased architecture is eve lower tha that of the fully digital ZF precodig. This is due to the fact that as K grows, the umber of phase shifters i P-based architecture icreases rapidly. As a result, the eergy cosumptio of the phase shifter etwor will be huge, eve higher tha that of chais. V. COCLUIO I this paper, we propose a eergy-efficiet I-based hybrid precodig architecture, where the aalog part is realized by a small umber of switches ad iverters. The performace aalysis proves that the performace gap betwee the proposed I-based architecture ad the traditioal ear-optimal oe eeps costat ad limited. The, by employig the idea of CE optimizatio i machie learig, we further propose a ACEbased hybrid precodig scheme with low complexity for Ibased architecture. imulatio results verify that our scheme ca achieve the satisfyig sum-rate performace ad much higher eergy efficiecy tha traditioal schemes. REFERECE [] A. L. widlehurst, E. Ayaoglu, P. Heydari, ad F. Capolio, Millimeter-wave massive MIMO: The ext wireless revolutio? IEEE Commu. Mag., vol. 5, o. 9, pp. 56 6, ep. 04. [] T.. Rappaport,. u, R. Mayzus, H. Zhao, Y. Azar, K. Wag, G.. Wog, J. K. chulz, M. amimi, ad F. Gutierrez, Millimeter wave mobile commuicatios for 5G cellular: It will wor! IEEE Access, vol., pp , May 03. [3] T. L. Marzetta, ocooperative cellular wireless with ulimited umbers of base statio ateas, IEEE Tras. Wireless Commu., vol. 9, o., pp , ov. 00. [4] H. Xie, F. Gao,. Zhag, ad. Ji, A uified trasmissio strategy for TDD/FDD massive MIMO systems with spatial basis expasio model, to appear i IEEE Tras. Veh. Techol., 07. [5] R. W. Heath,. Gozalez-Prelcic,. Raga, W. Roh, ad A. ayeed, A overview of sigal processig techiques for millimeter wave MIMO systems, IEEE J. el. Top. igal Process., vol. 0, o. 3, pp , Apr. 06. [6] O. El Ayach,. Rajagopal,. Abu-urra, Z. Pi, ad R. W. Heath, patially sparse precodig i millimeter wave MIMO systems, IEEE Tras. Wireless Commu., vol. 3, o. 3, pp , Mar. 04. [7] H. Xie, F. Gao, ad. Ji, A overview of low-ra chael estimatio for massive MIMO systems, IEEE Access, vol. 4, pp , ov. 06. [8] F. ohrabi ad W. Yu, Hybrid beamformig with fiite-resolutio phase shifters for large-scale MIMO systems, i Proc. IEEE PAWC Worshops, Jul. 05, pp [9] A. Alhateeb, G. Leus, ad R. W. Heath, Limited feedbac hybrid precodig for multi-user millimeter wave systems, IEEE Tras. Wireless Commu., vol. 4, o., pp , ov. 05. [0] A. Alhateeb, Y.-H. am, J. Zhag, ad R. W. Heath, Massive MIMO combiig with switches, IEEE Wireless Commu. Lett., vol. 5, o. 3, pp. 3 35, Ju. 06. [] R. Medez-Rial, C. Rusu, A. Alhateeb,. Gozález-Prelcic, ad R. W. Heath, Chael estimatio ad hybrid combiig for mmwave: Phase shifters or switches? i Proc. ITA Worshops, Feb. 05, pp [] A. ayeed ad J. Brady, Beamspace MIMO for high-dimesioal multiuser commuicatio at millimeter-wave frequecies, i Proc. IEEE GLOBECOM, Dec. 03, pp [3] R. Y. Rubistei ad D. P. Kroese, The cross-etropy method: A uified approach to combiatorial optimizatio, Mote-Carlo simulatio ad machie learig. priger ciece & Busiess Media, 03. [4]. Ha, C.-L. I, Z. Xu, ad C. Rowell, Large-scale atea systems with hybrid precodig aalog ad digital beamformig for millimeter wave 5G, IEEE Commu. Mag., vol. 53, o., pp , Ja. 05. [5] R. Médez-Rial, C. Rusu,. Gozález-Prelcic, A. Alhateeb, ad R. W. Heath, Hybrid MIMO architectures for millimeter wave commuicatios: Phase shifters or switches? IEEE Access, vol. 4, pp , Ja. 06. [6] X. Gao, L. Dai,. Ha, C.-L. I, ad R. W. Heath, Eergy-efficiet hybrid aalog ad digital precodig for mmwave MIMO systems with large atea arrays, IEEE J. el. Areas Commu., vol. 34, o. 4, pp , Apr. 06. [7] J.-C. Che, C.-K. We, ad K.-K. Wog, A efficiet sesor ode selectio algorithm for sidelobe cotrol i collaborative beamformig, IEEE Tras. Veh. Techol., vol. 65, o. 8, pp , Aug. 06.

Beamspace Channel Estimation for Wideband Millimeter-Wave MIMO with Lens Antenna Array

Beamspace Channel Estimation for Wideband Millimeter-Wave MIMO with Lens Antenna Array Beamspace Chael Estimatio for Widebad Millimeter-Wave MIMO with Les Atea Array Xiyu Gao, Liglog Dai, Shidog Zhou, Akbar M. Sayeed, ad Lajos Hazo Tsighua Natioal Laboratory for Iformatio Sciece ad Techology,

More information

An Improved Proportionate Normalized Least Mean Square Algorithm with Orthogonal Correction Factors for Echo Cancellation

An Improved Proportionate Normalized Least Mean Square Algorithm with Orthogonal Correction Factors for Echo Cancellation 202 Iteratioal Coferece o Electroics Egieerig ad Iformatics (ICEEI 202) IPCSI vol. 49 (202) (202) IACSI Press, Sigapore DOI: 0.7763/IPCSI.202.V49.33 A Improved Proportioate Normalized Least Mea Square

More information

Diversity Combining Techniques

Diversity Combining Techniques Diversity Combiig Techiques Whe the required sigal is a combiatio of several waves (i.e, multipath), the total sigal amplitude may experiece deep fades (i.e, Rayleigh fadig), over time or space. The major

More information

Summary and Discussion on Simultaneous Analysis of Lasso and Dantzig Selector

Summary and Discussion on Simultaneous Analysis of Lasso and Dantzig Selector Summary ad Discussio o Simultaeous Aalysis of Lasso ad Datzig Selector STAT732, Sprig 28 Duzhe Wag May 4, 28 Abstract This is a discussio o the work i Bickel, Ritov ad Tsybakov (29). We begi with a short

More information

Direction of Arrival Estimation Method in Underdetermined Condition Zhang Youzhi a, Li Weibo b, Wang Hanli c

Direction of Arrival Estimation Method in Underdetermined Condition Zhang Youzhi a, Li Weibo b, Wang Hanli c 4th Iteratioal Coferece o Advaced Materials ad Iformatio Techology Processig (AMITP 06) Directio of Arrival Estimatio Method i Uderdetermied Coditio Zhag Youzhi a, Li eibo b, ag Hali c Naval Aeroautical

More information

OFDM Precoder for Minimizing BER Upper Bound of MLD under Imperfect CSI

OFDM Precoder for Minimizing BER Upper Bound of MLD under Imperfect CSI MIMO-OFDM OFDM Precoder for Miimizig BER Upper Boud of MLD uder Imperfect CSI MCRG Joit Semiar Jue the th 008 Previously preseted at ICC 008 Beijig o May the st 008 Boosar Pitakdumrogkija Kazuhiko Fukawa

More information

Formation of A Supergain Array and Its Application in Radar

Formation of A Supergain Array and Its Application in Radar Formatio of A Supergai Array ad ts Applicatio i Radar Tra Cao Quye, Do Trug Kie ad Bach Gia Duog. Research Ceter for Electroic ad Telecommuicatios, College of Techology (Coltech, Vietam atioal Uiversity,

More information

Information-based Feature Selection

Information-based Feature Selection Iformatio-based Feature Selectio Farza Faria, Abbas Kazeroui, Afshi Babveyh Email: {faria,abbask,afshib}@staford.edu 1 Itroductio Feature selectio is a topic of great iterest i applicatios dealig with

More information

Probability of error for LDPC OC with one co-channel Interferer over i.i.d Rayleigh Fading

Probability of error for LDPC OC with one co-channel Interferer over i.i.d Rayleigh Fading IOSR Joural of Electroics ad Commuicatio Egieerig (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 4, Ver. III (Jul - Aug. 24), PP 59-63 Probability of error for LDPC OC with oe co-chael

More information

Lecture 7: MIMO Architectures Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH

Lecture 7: MIMO Architectures Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH : Theoretical Foudatios of Wireless Commuicatios 1 Thursday, May 19, 2016 12:30-15:30, Coferece Room SIP 1 Textbook: D. Tse ad P. Viswaath, Fudametals of Wireless Commuicatio 1 / 1 Overview Lecture 6:

More information

Element sampling: Part 2

Element sampling: Part 2 Chapter 4 Elemet samplig: Part 2 4.1 Itroductio We ow cosider uequal probability samplig desigs which is very popular i practice. I the uequal probability samplig, we ca improve the efficiecy of the resultig

More information

BER results for a narrowband multiuser receiver based on successive subtraction for M-PSK modulated signals

BER results for a narrowband multiuser receiver based on successive subtraction for M-PSK modulated signals results for a arrowbad multiuser receiver based o successive subtractio for M-PSK modulated sigals Gerard J.M. Jasse Telecomm. ad Traffic-Cotrol Systems Group Dept. of Iformatio Techology ad Systems Delft

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

Complex Algorithms for Lattice Adaptive IIR Notch Filter

Complex Algorithms for Lattice Adaptive IIR Notch Filter 4th Iteratioal Coferece o Sigal Processig Systems (ICSPS ) IPCSIT vol. 58 () () IACSIT Press, Sigapore DOI:.7763/IPCSIT..V58. Complex Algorithms for Lattice Adaptive IIR Notch Filter Hog Liag +, Nig Jia

More information

Direct Position Determination Algorithm Based on Multi-array in the Presence of Gain-phase Errors

Direct Position Determination Algorithm Based on Multi-array in the Presence of Gain-phase Errors 2016 Joit Iteratioal Coferece o Artificial Itelligece ad Computer Egieerig (AICE 2016) ad Iteratioal Coferece o Network ad Commuicatio Security (NCS 2016) ISBN: 978-1-60595-362-5 Direct Positio Determiatio

More information

Supplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate

Supplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate Supplemetary Material for Fast Stochastic AUC Maximizatio with O/-Covergece Rate Migrui Liu Xiaoxua Zhag Zaiyi Che Xiaoyu Wag 3 iabao Yag echical Lemmas ized versio of Hoeffdig s iequality, ote that We

More information

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12 Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig

More information

Cooperative Communication Fundamentals & Coding Techniques

Cooperative Communication Fundamentals & Coding Techniques 3 th ICACT Tutorial Cooperative commuicatio fudametals & codig techiques Cooperative Commuicatio Fudametals & Codig Techiques 0..4 Electroics ad Telecommuicatio Research Istitute Kiug Jug 3 th ICACT Tutorial

More information

Session 5. (1) Principal component analysis and Karhunen-Loève transformation

Session 5. (1) Principal component analysis and Karhunen-Loève transformation 200 Autum semester Patter Iformatio Processig Topic 2 Image compressio by orthogoal trasformatio Sessio 5 () Pricipal compoet aalysis ad Karhue-Loève trasformatio Topic 2 of this course explais the image

More information

Linear Algebra Issues in Wireless Communications

Linear Algebra Issues in Wireless Communications Rome-Moscow school of Matrix Methods ad Applied Liear Algebra August 0 September 18, 016 Liear Algebra Issues i Wireless Commuicatios Russia Research Ceter [vladimir.lyashev@huawei.com] About me ead of

More information

Encoding-Assisted Temporal Direct Mode Decision for B Pictures in H.264/AVC

Encoding-Assisted Temporal Direct Mode Decision for B Pictures in H.264/AVC Ecodig-Assisted Temporal Direct Mode Decisio for B Pictures i H.64/AVC Ya-Neg Fag ad Yiyi Li Hui-Jae Hsieh Departmet of Commuicatio Egieerig Departmet of Iformatio Maagemet Natioal Cetral Uiversity, Taiwa

More information

OPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE

OPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE Joural of ELECTRICAL EGIEERIG, VOL. 56, O. 7-8, 2005, 200 204 OPTIMAL PIECEWISE UIFORM VECTOR QUATIZATIO OF THE MEMORYLESS LAPLACIA SOURCE Zora H. Perić Veljo Lj. Staović Alesadra Z. Jovaović Srdja M.

More information

Orthogonal Gaussian Filters for Signal Processing

Orthogonal Gaussian Filters for Signal Processing Orthogoal Gaussia Filters for Sigal Processig Mark Mackezie ad Kiet Tieu Mechaical Egieerig Uiversity of Wollogog.S.W. Australia Abstract A Gaussia filter usig the Hermite orthoormal series of fuctios

More information

Random assignment with integer costs

Random assignment with integer costs Radom assigmet with iteger costs Robert Parviaie Departmet of Mathematics, Uppsala Uiversity P.O. Box 480, SE-7506 Uppsala, Swede robert.parviaie@math.uu.se Jue 4, 200 Abstract The radom assigmet problem

More information

Asymptotic Coupling and Its Applications in Information Theory

Asymptotic Coupling and Its Applications in Information Theory Asymptotic Couplig ad Its Applicatios i Iformatio Theory Vicet Y. F. Ta Joit Work with Lei Yu Departmet of Electrical ad Computer Egieerig, Departmet of Mathematics, Natioal Uiversity of Sigapore IMS-APRM

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

REGRESSION WITH QUADRATIC LOSS

REGRESSION WITH QUADRATIC LOSS REGRESSION WITH QUADRATIC LOSS MAXIM RAGINSKY Regressio with quadratic loss is aother basic problem studied i statistical learig theory. We have a radom couple Z = X, Y ), where, as before, X is a R d

More information

Supplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate

Supplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate Supplemetary Material for Fast Stochastic AUC Maximizatio with O/-Covergece Rate Migrui Liu Xiaoxua Zhag Zaiyi Che Xiaoyu Wag 3 iabao Yag echical Lemmas ized versio of Hoeffdig s iequality, ote that We

More information

A New Simulation Model of Rician Fading Channel Xinxin Jin 1,2,a, Yu Zhang 1,3,b, Changyong Pan 4,c

A New Simulation Model of Rician Fading Channel Xinxin Jin 1,2,a, Yu Zhang 1,3,b, Changyong Pan 4,c 6 Iteratioal Coferece o Iformatio Egieerig ad Commuicatios Techology (IECT 6 ISB: 978--6595-375-5 A ew Simulatio Model of Ricia Fadig Chael Xixi Ji,,a, Yu Zhag,3,b, Chagyog Pa 4,c Tsighua atioal Laboratory

More information

Quantum Annealing for Heisenberg Spin Chains

Quantum Annealing for Heisenberg Spin Chains LA-UR # - Quatum Aealig for Heiseberg Spi Chais G.P. Berma, V.N. Gorshkov,, ad V.I.Tsifriovich Theoretical Divisio, Los Alamos Natioal Laboratory, Los Alamos, NM Istitute of Physics, Natioal Academy of

More information

Uniform Strict Practical Stability Criteria for Impulsive Functional Differential Equations

Uniform Strict Practical Stability Criteria for Impulsive Functional Differential Equations Global Joural of Sciece Frotier Research Mathematics ad Decisio Scieces Volume 3 Issue Versio 0 Year 03 Type : Double Blid Peer Reviewed Iteratioal Research Joural Publisher: Global Jourals Ic (USA Olie

More information

Statistical Pattern Recognition

Statistical Pattern Recognition Statistical Patter Recogitio Classificatio: No-Parametric Modelig Hamid R. Rabiee Jafar Muhammadi Sprig 2014 http://ce.sharif.edu/courses/92-93/2/ce725-2/ Ageda Parametric Modelig No-Parametric Modelig

More information

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices A Hadamard-type lower boud for symmetric diagoally domiat positive matrices Christopher J. Hillar, Adre Wibisoo Uiversity of Califoria, Berkeley Jauary 7, 205 Abstract We prove a ew lower-boud form of

More information

On Random Line Segments in the Unit Square

On Random Line Segments in the Unit Square O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,

More information

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy

More information

On Constellation Shaping for Short Block Lengths

On Constellation Shaping for Short Block Lengths O Costellatio Shapig for Short Block Legths Y.C. Gülteki W.J. va Houtum F.M.J. Willems Iformatio ad Commuicatio Theory Lab Sigal Processig Systems Group Departmet of Electrical Egieerig, TU/e, The Netherlads

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

DIRECTION OF ARRIVAL ESTIMATION

DIRECTION OF ARRIVAL ESTIMATION Research Article DIRECTION OF ARRIVAL ESTIMATION Lalita Gupta, R P Sigh Address for correspodece Dept. of Electroics & Commuicatio Egieerig, Maulaa Azad Natioal Istitute of Techology, Bhopal MP Email:gupta.lalita@gmail.com

More information

Regression with quadratic loss

Regression with quadratic loss Regressio with quadratic loss Maxim Ragisky October 13, 2015 Regressio with quadratic loss is aother basic problem studied i statistical learig theory. We have a radom couple Z = X,Y, where, as before,

More information

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula Joural of Multivariate Aalysis 102 (2011) 1315 1319 Cotets lists available at ScieceDirect Joural of Multivariate Aalysis joural homepage: www.elsevier.com/locate/jmva Superefficiet estimatio of the margials

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

Detailed derivation of multiplicative update rules for NMF

Detailed derivation of multiplicative update rules for NMF 1 Itroductio Detailed derivatio of multiplicative update rules for NMF Jua José Burred March 2014 Paris, Frace jjburred@jjburredcom The goal of No-egative Matrix Factorizatio (NMF) is to decompose a matrix

More information

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;

More information

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound Lecture 7 Ageda for the lecture Gaussia chael with average power costraits Capacity of additive Gaussia oise chael ad the sphere packig boud 7. Additive Gaussia oise chael Up to this poit, we have bee

More information

Random Variables, Sampling and Estimation

Random Variables, Sampling and Estimation Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig

More information

Mixtures of Gaussians and the EM Algorithm

Mixtures of Gaussians and the EM Algorithm Mixtures of Gaussias ad the EM Algorithm CSE 6363 Machie Learig Vassilis Athitsos Computer Sciece ad Egieerig Departmet Uiversity of Texas at Arligto 1 Gaussias A popular way to estimate probability desity

More information

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the

More information

Inequalities for Entropies of Sets of Subsets of Random Variables

Inequalities for Entropies of Sets of Subsets of Random Variables Iequalities for Etropies of Sets of Subsets of Radom Variables Chao Tia AT&T Labs-Research Florham Par, NJ 0792, USA. tia@research.att.com Abstract Ha s iequality o the etropy rates of subsets of radom

More information

Invariability of Remainder Based Reversible Watermarking

Invariability of Remainder Based Reversible Watermarking Joural of Network Itelligece c 16 ISSN 21-8105 (Olie) Taiwa Ubiquitous Iformatio Volume 1, Number 1, February 16 Ivariability of Remaider Based Reversible Watermarkig Shao-Wei Weg School of Iformatio Egieerig

More information

Warped, Chirp Z-Transform: Radar Signal Processing

Warped, Chirp Z-Transform: Radar Signal Processing arped, Chirp Z-Trasform: Radar Sigal Processig by Garimella Ramamurthy Report o: IIIT/TR// Cetre for Commuicatios Iteratioal Istitute of Iformatio Techology Hyderabad - 5 3, IDIA Jauary ARPED, CHIRP Z

More information

The DOA Estimation of Multiple Signals based on Weighting MUSIC Algorithm

The DOA Estimation of Multiple Signals based on Weighting MUSIC Algorithm , pp.10-106 http://dx.doi.org/10.1457/astl.016.137.19 The DOA Estimatio of ultiple Sigals based o Weightig USIC Algorithm Chagga Shu a, Yumi Liu State Key Laboratory of IPOC, Beijig Uiversity of Posts

More information

Volume Growth and General Rate Quantization on Grassmann Manifolds

Volume Growth and General Rate Quantization on Grassmann Manifolds Volume Growth ad Geeral Rate Quatizatio o Grassma Maifolds Wei Dai, Bria C. Rider ad Youjia Liu Dept. of Electrical ad Computer Egieerig, Mathematics Departmet Uiversity of Colorado at Boulder 45 UCB,

More information

Information Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame

Information Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame Iformatio Theory Tutorial Commuicatio over Chaels with memory Chi Zhag Departmet of Electrical Egieerig Uiversity of Notre Dame Abstract A geeral capacity formula C = sup I(; Y ), which is correct for

More information

On the Connectivity of One-dimensional Vehicular Ad Hoc Networks

On the Connectivity of One-dimensional Vehicular Ad Hoc Networks RESEARCH PAPER 论文集锦 O the Coectivity of Oe-dimesioal Vehicular Ad Hoc Networs Liao Jiaxi 1,2, Li Yuazhe 1,2, Li Toghog 3, Zhu Xiaomi 1,2, Zhag Lei 1,2 1 State Key Laboratory of Networig ad Switchig Techology,

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

The log-behavior of n p(n) and n p(n)/n

The log-behavior of n p(n) and n p(n)/n Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity

More information

A Slight Extension of Coherent Integration Loss Due to White Gaussian Phase Noise Mark A. Richards

A Slight Extension of Coherent Integration Loss Due to White Gaussian Phase Noise Mark A. Richards A Slight Extesio of Coheret Itegratio Loss Due to White Gaussia Phase oise Mark A. Richards March 3, Goal I [], the itegratio loss L i computig the coheret sum of samples x with weights a is cosidered.

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A. Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)

More information

Live Line Measuring the Parameters of 220 kv Transmission Lines with Mutual Inductance in Hainan Power Grid

Live Line Measuring the Parameters of 220 kv Transmission Lines with Mutual Inductance in Hainan Power Grid Egieerig, 213, 5, 146-151 doi:1.4236/eg.213.51b27 Published Olie Jauary 213 (http://www.scirp.org/joural/eg) Live Lie Measurig the Parameters of 22 kv Trasmissio Lies with Mutual Iductace i Haia Power

More information

Rank Modulation with Multiplicity

Rank Modulation with Multiplicity Rak Modulatio with Multiplicity Axiao (Adrew) Jiag Computer Sciece ad Eg. Dept. Texas A&M Uiversity College Statio, TX 778 ajiag@cse.tamu.edu Abstract Rak modulatio is a scheme that uses the relative order

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series. .3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(

More information

Output Analysis and Run-Length Control

Output Analysis and Run-Length Control IEOR E4703: Mote Carlo Simulatio Columbia Uiversity c 2017 by Marti Haugh Output Aalysis ad Ru-Legth Cotrol I these otes we describe how the Cetral Limit Theorem ca be used to costruct approximate (1 α%

More information

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314

More information

Approximate Analysis of Power Offset over Spatially Correlated MIMO Channels

Approximate Analysis of Power Offset over Spatially Correlated MIMO Channels Commuicatios ad Network, 9, 5-3 doi:.36/c.9. Published Olie August 9 (http://www.scirp.org/joural/c) Approximate Aalysis of Power Offset over Spatially Correlated MIMO Chaels Guagwei YU, Xuzhe WANG School

More information

1 Duality revisited. AM 221: Advanced Optimization Spring 2016

1 Duality revisited. AM 221: Advanced Optimization Spring 2016 AM 22: Advaced Optimizatio Sprig 206 Prof. Yaro Siger Sectio 7 Wedesday, Mar. 9th Duality revisited I this sectio, we will give a slightly differet perspective o duality. optimizatio program: f(x) x R

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

Complexity Analysis of Highly Improved Hybrid Turbo Codes

Complexity Analysis of Highly Improved Hybrid Turbo Codes I J C T A, 8(5, 015, pp. 433-439 Iteratioal Sciece Press Complexity Aalysis of Highly Improved Hybrid Turbo Codes M. Jose Ra* ad Sharmii Eoch** Abstract: Moder digital commuicatio systems eed efficiet

More information

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series

More information

Increasing timing capacity using packet coloring

Increasing timing capacity using packet coloring 003 Coferece o Iformatio Scieces ad Systems, The Johs Hopkis Uiversity, March 4, 003 Icreasig timig capacity usig packet colorig Xi Liu ad R Srikat[] Coordiated Sciece Laboratory Uiversity of Illiois e-mail:

More information

School of Computer Engineering, Nanyang Technological University, Singapore

School of Computer Engineering, Nanyang Technological University, Singapore NARROWBAND DETECTION IN OCEAN WIT IMPULSIVE NOISE USING AN ACOUSTIC VECTOR SENSOR ARRAY V. N. ari 1, Aad G. V. 2, P. V. Nagesha 2 ad A. B. Premkumar 1 1 School of Computer Egieerig, Nayag Techological

More information

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ. 2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For

More information

Vector Quantization: a Limiting Case of EM

Vector Quantization: a Limiting Case of EM . Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z

More information

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology Advaced Aalysis Mi Ya Departmet of Mathematics Hog Kog Uiversity of Sciece ad Techology September 3, 009 Cotets Limit ad Cotiuity 7 Limit of Sequece 8 Defiitio 8 Property 3 3 Ifiity ad Ifiitesimal 8 4

More information

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 11

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 11 Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract We will itroduce the otio of reproducig kerels ad associated Reproducig Kerel Hilbert Spaces (RKHS). We will cosider couple

More information

Mathematical Modeling of Optimum 3 Step Stress Accelerated Life Testing for Generalized Pareto Distribution

Mathematical Modeling of Optimum 3 Step Stress Accelerated Life Testing for Generalized Pareto Distribution America Joural of Theoretical ad Applied Statistics 05; 4(: 6-69 Published olie May 8, 05 (http://www.sciecepublishiggroup.com/j/ajtas doi: 0.648/j.ajtas.05040. ISSN: 6-8999 (Prit; ISSN: 6-9006 (Olie Mathematical

More information

Bounds for the Extreme Eigenvalues Using the Trace and Determinant

Bounds for the Extreme Eigenvalues Using the Trace and Determinant ISSN 746-7659, Eglad, UK Joural of Iformatio ad Computig Sciece Vol 4, No, 9, pp 49-55 Bouds for the Etreme Eigevalues Usig the Trace ad Determiat Qi Zhog, +, Tig-Zhu Huag School of pplied Mathematics,

More information

Study on Coal Consumption Curve Fitting of the Thermal Power Based on Genetic Algorithm

Study on Coal Consumption Curve Fitting of the Thermal Power Based on Genetic Algorithm Joural of ad Eergy Egieerig, 05, 3, 43-437 Published Olie April 05 i SciRes. http://www.scirp.org/joural/jpee http://dx.doi.org/0.436/jpee.05.34058 Study o Coal Cosumptio Curve Fittig of the Thermal Based

More information

arxiv: v1 [math.pr] 20 Nov 2017

arxiv: v1 [math.pr] 20 Nov 2017 WHEN FOURTH MOMENTS ARE ENOUGH CHRIS JENNINGS-SHAFFER, DANE R. SKINNER, AND EDWARD C. WAYMIRE arxiv:1711.0788v1 [math.pr] 0 Nov 017 Abstract. This ote cocers a somewhat iocet questio motivated by a observatio

More information

Power Comparison of Some Goodness-of-fit Tests

Power Comparison of Some Goodness-of-fit Tests Florida Iteratioal Uiversity FIU Digital Commos FIU Electroic Theses ad Dissertatios Uiversity Graduate School 7-6-2016 Power Compariso of Some Goodess-of-fit Tests Tiayi Liu tliu019@fiu.edu DOI: 10.25148/etd.FIDC000750

More information

MOMENT-METHOD ESTIMATION BASED ON CENSORED SAMPLE

MOMENT-METHOD ESTIMATION BASED ON CENSORED SAMPLE Vol. 8 o. Joural of Systems Sciece ad Complexity Apr., 5 MOMET-METHOD ESTIMATIO BASED O CESORED SAMPLE I Zhogxi Departmet of Mathematics, East Chia Uiversity of Sciece ad Techology, Shaghai 37, Chia. Email:

More information

Design and Analysis of Algorithms

Design and Analysis of Algorithms Desig ad Aalysis of Algorithms Probabilistic aalysis ad Radomized algorithms Referece: CLRS Chapter 5 Topics: Hirig problem Idicatio radom variables Radomized algorithms Huo Hogwei 1 The hirig problem

More information

Efficient Reverse Converter Design for Five Moduli

Efficient Reverse Converter Design for Five Moduli Joural of Computatios & Modellig, vol., o., 0, 93-08 ISSN: 79-765 (prit), 79-8850 (olie) Iteratioal Scietific ress, 0 Efficiet Reverse Coverter Desig for Five Moduli Set,,,, MohammadReza Taheri, Elham

More information

A Unified Approach on Fast Training of Feedforward and Recurrent Networks Using EM Algorithm

A Unified Approach on Fast Training of Feedforward and Recurrent Networks Using EM Algorithm 2270 IEEE TRASACTIOS O SIGAL PROCESSIG, VOL. 46, O. 8, AUGUST 1998 [12] Q. T. Zhag, K. M. Wog, P. C. Yip, ad J. P. Reilly, Statistical aalysis of the performace of iformatio criteria i the detectio of

More information

THE seminal work of Marzetta introduced massive

THE seminal work of Marzetta introduced massive IEEE TRASACTIOS O SIGAL PROCESSIG, VOL. 66, O. 3, JULY, 08 3599 Spectral Efficiecy of Mixed-ADC Massive MIMO Hessam Pirzadeh, Studet Member, IEEE, ad A. Lee Swidlehurst, Fellow, IEEE Abstract We study

More information

Lecture 11: Channel Coding Theorem: Converse Part

Lecture 11: Channel Coding Theorem: Converse Part EE376A/STATS376A Iformatio Theory Lecture - 02/3/208 Lecture : Chael Codig Theorem: Coverse Part Lecturer: Tsachy Weissma Scribe: Erdem Bıyık I this lecture, we will cotiue our discussio o chael codig

More information

PRELIM PROBLEM SOLUTIONS

PRELIM PROBLEM SOLUTIONS PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems

More information

The Choquet Integral with Respect to Fuzzy-Valued Set Functions

The Choquet Integral with Respect to Fuzzy-Valued Set Functions The Choquet Itegral with Respect to Fuzzy-Valued Set Fuctios Weiwei Zhag Abstract The Choquet itegral with respect to real-valued oadditive set fuctios, such as siged efficiecy measures, has bee used i

More information

Signals & Systems Chapter3

Signals & Systems Chapter3 Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of

More information

Statistical Analysis on Uncertainty for Autocorrelated Measurements and its Applications to Key Comparisons

Statistical Analysis on Uncertainty for Autocorrelated Measurements and its Applications to Key Comparisons Statistical Aalysis o Ucertaity for Autocorrelated Measuremets ad its Applicatios to Key Comparisos Nie Fa Zhag Natioal Istitute of Stadards ad Techology Gaithersburg, MD 0899, USA Outlies. Itroductio.

More information

Disjoint Systems. Abstract

Disjoint Systems. Abstract Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio

More information

Problem Set 4 Due Oct, 12

Problem Set 4 Due Oct, 12 EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios

More information

Support vector machine revisited

Support vector machine revisited 6.867 Machie learig, lecture 8 (Jaakkola) 1 Lecture topics: Support vector machie ad kerels Kerel optimizatio, selectio Support vector machie revisited Our task here is to first tur the support vector

More information

Stochastic Matrices in a Finite Field

Stochastic Matrices in a Finite Field Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices

More information

HARMONIC ANALYSIS FOR OPTICALLY MODULATING BODIES USING THE HARMONIC STRUCTURE FUNCTION (HSF) Lockheed Martin Hawaii

HARMONIC ANALYSIS FOR OPTICALLY MODULATING BODIES USING THE HARMONIC STRUCTURE FUNCTION (HSF) Lockheed Martin Hawaii HARMONIC ANALYSIS FOR OPTICALLY MODULATING BODIES USING THE HARMONIC STRUCTURE FUNCTION (HSF) Dr. R. David Dikema Chief Scietist Mr. Scot Seto Chief Egieer Lockheed Marti Hawaii Abstract Lockheed Marti

More information

Lainiotis filter implementation. via Chandrasekhar type algorithm

Lainiotis filter implementation. via Chandrasekhar type algorithm Joural of Computatios & Modellig, vol.1, o.1, 2011, 115-130 ISSN: 1792-7625 prit, 1792-8850 olie Iteratioal Scietific Press, 2011 Laiiotis filter implemetatio via Chadrasehar type algorithm Nicholas Assimais

More information

MODEL CHANGE DETECTION WITH APPLICATION TO MACHINE LEARNING. University of Illinois at Urbana-Champaign

MODEL CHANGE DETECTION WITH APPLICATION TO MACHINE LEARNING. University of Illinois at Urbana-Champaign MODEL CHANGE DETECTION WITH APPLICATION TO MACHINE LEARNING Yuheg Bu Jiaxu Lu Veugopal V. Veeravalli Uiversity of Illiois at Urbaa-Champaig Tsighua Uiversity Email: bu3@illiois.edu, lujx4@mails.tsighua.edu.c,

More information

Taylor polynomial solution of difference equation with constant coefficients via time scales calculus

Taylor polynomial solution of difference equation with constant coefficients via time scales calculus TMSCI 3, o 3, 129-135 (2015) 129 ew Treds i Mathematical Scieces http://wwwtmscicom Taylor polyomial solutio of differece equatio with costat coefficiets via time scales calculus Veysel Fuat Hatipoglu

More information

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.

More information