A Generalized Framework on Beamformer Design and CSI Acquisition for Single-Carrier Massive MIMO Systems in Millimeter-Wave Channels

Size: px
Start display at page:

Download "A Generalized Framework on Beamformer Design and CSI Acquisition for Single-Carrier Massive MIMO Systems in Millimeter-Wave Channels"

Transcription

1 1 A Generaized Framework on Beamformer esign and CSI Acquisition for Singe-Carrier Massive MIMO Systems in Miimeter-Wave Channes Gokhan M. Guvensen, Member, IEEE and Ender Ayanogu, Feow, IEEE Abstract In this paper, we estabish a genera framework on the reduced dimensiona channe state information (CSI) estimation and pre-beamformer design for frequency-seective massive mutipe-input mutipe-output (MIMO) systems empoying singe-carrier (SC) moduation in time division dupex (T) mode by expoiting the joint ange-deay domain channe sparsity in miimeter (mm) wave frequencies. First, based on a generic subspace projection taking the joint ange-deay power profie and user-grouping into account, the reduced-rank minimum mean square error (RR-MMSE) instantaneous CSI estimator is derived for spatiay correated wideband MIMO channes. Second, the statistica pre-beamformer design is considered for frequency-seective SC massive MIMO channes. We examine the dimension reduction probem and subspace (beamspace) construction on which the RR-MMSE estimation can be reaized as accuratey as possibe. Finay, a spatio-tempora domain correator-type reduced-rank channe estimator, as an approximation of the RR-MMSE estimate, is obtained by carrying out east square (LS) estimation in a proper reduced dimensiona beamspace. It is observed that the proposed techniques show remarkabe robustness to the piot interference (or contamination) with a significant reduction in piot overhead. Index Terms Beamforming, massive MIMO, miimeter wave, channe estimation, dimension reduction, reduced rank Wiener fiter, MMSE estimator, user-grouping, ange-deay channe sparsity, singe-carrier, muti-path channe, spatia correation, AoA support, JSM The authors are with the Center for Pervasive Communications and Computing (CPCC), ept. of EECS, UC Irvine, CA, USA (e-mai: g.m.guvensen@uci.edu and ayanogu@uci.edu)

2 2 I. INTROUCTION It is anticipated that massive MIMO systems in the mm wave range, where arge antenna arrays can be packed into sma form factors and extremey arge bandwidths are avaiabe for commercia use (e.g., up to 7 GHz in the 60 GHz band) [1], [2], form an important part of the next-generation ceuar systems such as the upcoming 5G standard expected to support much arger (e.g., 1000 times faster) data rates than the currenty depoyed systems [3]. In order to capitaize these spatia diversity and mutipexing benefits with its potentia arge gains in spectra and energy efficiency, instantaneous CSI at the base station (BS) is essentia, since muti-user precoding at downink or muti-user decoding at upink necessitates accurate CSI [4]. In practice, CSI is typicay obtained with the assistance of the periodicay inserted piot signas [4]. This brings the piot overhead consumed by the training data to be proportiona to the number of active users in the system for upink training, and the number of BS antennas for downink training respectivey [5]. We assume instantaneous CSI at the BS can be acquired by means of upink training in time division dupex (T) mode, where the upink piots provide the BS with downink as we as upink channe estimates simutaneousy via everaging channe reciprocity [4], [5]. The processing of the signas with very arge dimensionaity, the piot interference, and the piot overhead are thought to be imiting factors for an accurate channe acquisition and throughput of massive MIMO transmission in mm wave especiay in high mobiity or in appications requiring ow atency and short-packet duration 1. Moreover, the piot overhead woud be prohibitivey arge for mm wave channes, where the signa-to-noise ratio (snr) before beamforming is very sma, and thus directiona precoding/beamforming is inevitabe to support onger outdoor inks and to provide sufficient received signa power for an accurate channe acquisition [7], [8]. Recenty, the two-stage beamforming concept under the name of Joint Spatia ivision and Mutipexing (JSM) [9], [10] has been proposed to reduce the dimension of the MIMO channe effectivey, and to enabe massive MIMO gains and simpified system operations [11]. Even though JSM is suggested as an effective reduced-compexity two-stage downink precoding scheme for fat-fading muti-user MIMO systems in frequency division dupex (F) mode initiay, the idea of two-stage beamforming (in [9] [11]) can be appied to both downink and upink transmission in T. The key idea ies in user-grouping, i.e., partitioning the user popuation supported by the serving BS into mutipe groups each with approximatey the same channe covariance eigenspaces. Then, one can decompose the MIMO beamformer at the BS 1 These features are desirabe for incorporating machine-type communications in next generation systems [3], [6].

3 3 into two steps via the use of a spatia pre-beamformer, which distinguishes intra-group signas from other groups by suppressing the inter-group interference whie reducing the signaing dimension. The major compexity reduction comes from the approach that the pre-beamformer is propery designed based ony on the ong-term parameters (described by using the second-order statistics of the channe) and not on the instantaneous CSI (which may vary on a much higher rate). In this case, the subsequent operations such as downink muti-user precoding and upink detection/decoding agorithms can be fufied based on the CSI of the effective channe with significanty reduced dimensions thanks to the pre-beamforming projection. At the same time, the training dimension necessary to earn the effective channes of each user termina (UT) is reduced consideraby. These motivate the use of the hybrid beamforming architecture [7], [12] [14], where the statistica pre-beamformer (which depends on sowy varying parameters) can be impemented in the anaog radio frequency (RF) domain, whie the subsequent muti-user MIMO precoding/decoding stage can be impemented by standard baseband processing. In this paper, a genera framework on the reduced-dimensiona CSI estimation and the pre-beamformer design based on the statistica user-grouping idea (used in the JSM scheme) is estabished for frequencyseective massive MIMO systems empoying singe-carrier (SC) moduation in T mode. The statistica pre-beamformer was designed to reduce dimensionaity and piot overhead whie mitigating inter-group interference eading to piot contamination (due to inner or outer ce users) by expoiting the channe sparsity indicated by the joint ange-deay domain power profie. The channe sparsity [15], [16], which becomes particuary reevant at mm wave frequencies, is observed in practica ceuar systems, where the channes are often characterized with imited scattering and hence correated in the spatia domain; the BS sees the incoming muti-path components (MPCs) under a very constrained anguar range, i.e., ange of arriva (AoA) support, and the MPCs occur in custers in the ange-deay pane corresponding to the interaction with physica custers of scatterers in the rea word [15]. Moreover, ony MPCs, undergoing one or two refections, can have significant power [15], [17]. Thus, the wideband massive MIMO channe is expected to be sparse both in the ange and time (deay) domains. The main contributions of the paper are summarized as foows. First, the reduced-rank minimum mean square error (MMSE) channe estimator, based on a subspace projection and the second order statistics, is presented for the first time when the SC transmission in T mode for wideband muti-user spatiay correated MIMO systems is considered. It can be interpreted as the reduced-rank approximation of the fu-dimensiona spatio-tempora domain Wiener fiter by using two different generic transform basis

4 4 sets; namey, the dimension-reducing subspace projection (pre-beamformer), and the Karhunen-Loéve Transform (KLT) characterizing channe sparsity in the joint ange-deay domain. Second, the dimension reduction probem from three different viewpoints reated to the instantaneous CSI estimation accuracy are examined in order to find a good beamspace (subspace in spatia domain). The adopted criteria of the probem resuts in three equivaent optimization probems yieding the same optima pre-beamformer. Finay, a spatio-tempora domain correator type reduced-rank channe estimator as an approximation of the RR-MMSE estimate is derived where the statistica (spatia) pre-beamforming and (tempora) correator are appied in a successive manner. The key idea is to reaize east square (LS) estimation in a proper reduced dimensiona beamspace so that the number of unknown parameters is reduced whie capturing the signas of the inter-group users, and switching off the interference subspace. II. SYSTEM MOEL We consider a ceuar system based on massive MIMO transmission operating at mm wave bands in the T mode empoying SC in which a BS, having N antennas, serves K singe-antenna UTs. In order to reduce the overhead whie acquiring the instantaneous CSI associated with massive MIMO, two-stage beamforming [9] [11] is adopted throughout this paper. It is assumed that K users are partitioned into G groups, where the K g users in group g have statisticay independent but identicay distributed (i.i.d.) channes [9], [10]. At the beginning of every coherence interva, a users of the intended group g transmit training sequences with ength T. We assume a inear moduation (e.g., PSK or QAM) and a transmission over frequency-seective channe for a UTs with a sow evoution in time reative to the signaing interva (symbo duration). Under such conditions, the baseband equivaent received signa sampes, taken at symbo rate (W) after puse matched fitering, are expressed as 2 y n = K g {k=1, g k Ω g} for n=0,..., T 1, where h (g k ) L g 1 =0 h (g k ) x (g k ) n } {{ } Intra-Group Signa K g L g 1 + h (g k ) x (g k ) + n { g k Ω g g g } n n k=1 =0 } {{ } η n (g) :Inter-Group Interference + AWGN is N 1 muti-path channe vector, namey, the array impuse response of the serving BS stemming from the th muti-path component (MPC) of k th user in group g. Here, { (g x k ) n ; L g + 1 n T 1 } are the training symbos for the k th user in group g 3, L g is the channe 2 Ony the UTs, beonging to same group, are assumed to be synchronized for coherent upink SC transmission. 3 Training sequences are assumed to be non-orthogona for synchronized intra-group users for SC transmission in genera. (1)

5 5 memory of group g muti-path channes,ω g is the set of a UTs beonging to group g with cardinaity Ω g =K g, and{g k } K g k=1 are UT indices formingω g. The L g 1 symbos at the start of the preambe, prior to the first observation at n=0, are the precursors. Training symbos are seected from a signa consteation S CandE { x (g k ) n 2} is set to E s for a g k. In (1), n n are the additive white Gaussian noise (AWGN) vectors during upink piot segment with spatiay and temporariy i.i.d. ascn (0, N 0 I N ), and N 0 is the noise power. The first term of (1) is the transmitted signa of the intended group g, named as the intra-group signa of group g users. The second term, η n (g), namey the inter-group interference, comprises of a the interfering signas, which stem from a inner or outer ce users beonging to different groups other than g. Finay, the average received signa-to-noise ratio (snr) can be defined as snr E s N 0 4. Here, we assume users come in groups, either by nature or by the appication of proper user grouping agorithms in [10], [15], which are out of scope of this work. A. Fundamenta Assumptions on Signa and Channe Mode Each resovabe MPC of the users, beonging to any group g, is assumed to span some particuar anguar sector in the azimuth-eevation pane, capturing oca scattering around the corresponding UTs ange of arriva (AoA) (with respect to the BS). Then, their corresponding cross-covariance matrices can be expressed in the form of E { ( ) h (g k ) h (g k ) H } =ρ (g) R (g) δ gg δ kk δ, (2) for L g 1 ρ (g) =0 = 1 and Tr { R (g) } = 1 by using the uncorreated oca scattering mode where a MPCs are assumed to be mutuay independent according to the we-known wide sense stationary uncorreated scattering (WSSUS) mode [15], [16]; the muti-path channe vectors are uncorreated with respect to, and aso mutuay uncorreated with that of the different users (independent of whether in the same group or not). In (2), ρ (g) is the power deay profie (pdp) of the group g muti-path channes, showing the average channe strength at each deay, and the auto-covariance of each MPCs in group g is given by R (g) = U (g) Λ (g) ( ) (g) H, U = 0,..., Lg 1, (3) where U (g) is the N r g, matrix of the eigenvectors corresponding to the r g, non-zero or dominant eigenvaues of R (g), given as the diagona eements of the diagona r g, r g, matrixλ (g) in (3). In (2), R (g) can be considered as the common spatia covariance matrix of group g UTs at th deay. In this mode, 4 It shows the maximum achievabe snr after beamforming when the beam is steered towards a point, i.e., anguar ocation by assuming that the channe is normaized so that 1 E s N N 0 can be seen as the average received snr at each antenna eement before beamforming.

6 6 each antenna eement at a BS is assumed to see the incoming MPCs at the same common support on the ange-deay pane (simiar to the one in [15]). Aso, the effective rank of R (g), namey, r g, is expected to be much smaer than the number of array eements, N, due to the channe sparsity pronounced at mm wave [15], [17]. When Rayeigh-correated channe coefficients are assumed such as h (g k ) CN ( 0,ρ (g) R (g) ), mutuay independent across the users for a g k, the Karhunen-Loéve representation [18] of the muti-path channe vector beonging to the k th user in group g is given as the foowing by using (3) h (g k ) = ( ρ (g) ) 1/2 (g) U ( ) (g) 1/2 (g Λ c k ), = 0,..., L g 1, (4) where the entries of c (g k ) C r g, 1 CN ( 0, I rg, ). The channe auto-covariance of each group in (3) is sowy varying in time as the AoA of each user signa evoves depending on the user mobiity, variation rate of the scattering environment characteristics, etc. [15], [19], [20]. Thus, their rate of change is significanty ower than that of the sma-scae fading (instantaneous CSI), and they can be estimated with guaranteed accuracy for a intended groups in practice. Spatio-tempora covariance matrix of the inter-group interference in (1) can be cacuated by taking ong-term expectation over a MPCs h (g k ) s other than the ones beonging to group (g) in the spatia domain, and transmitted symbos x (g k ) n s in the tempora domain. Considering the mutua independence across muti-path channe vectors (due to the WSSUS mode) given by (2), and considering that the transmitted symbos of different users are uncorreated (incuding the data transmission period), i.e., { ( ) E x (g k ) n x (g k ) H } n =γ (g) E s δ nn δ gg δ kk, the foowing is obtained { E η n (g) ( ) (g) H } η n = R (g) η δ nn, where R η (g) E s γ (g ) K g g g L g 1 =0 ρ (g ) R (g ) + N 0 I N, (5) andγ (g ) for g g can be regarded as the reative average received power at BS of inter-group users normaized with that of the group g users. In (5),γ (g ) s are accountabe for the near-far effect stemming from the fact that the average received signa strength of different UTs may differ significanty depending on their distance to the BS. Moreover, it is important to note that the N N covariance matrix of the inter-group interference R (g) η in (5) consists of a the statistica information of the CSI in the spatia domain (i.e., AoA support) for a inner and outer ce users interfering with group g users.

7 7 B. Spatio-Tempora omain Vector efinitions Before eaborating on the detais of the estimation technique, we give the foowing matrix and vector definitions that wi be usefu in the subsequent sections. First, the training matrix (or the convoution matrix), comprising of the transmitted piots with the precursors for k th user in group g is defined as X (g) [ x (g ] k ) k i j. The extended muti-path channe vector of the k th user, beonging to the intended T L g group g, and its corresponding expansion coefficients after Karhunen-Loéve Transform (KLT) in (4) are given as f (g) [ h (g ] k ) k i 1 and b(g) [ c (g ] k) (Lg 1 ) N L g 1 k i 1 by concatenating a MPCs of the r =0 g, 1 kth user in group g. Then, by using the vectors given in (1) and the previousy defined ones, it wi be usefu to construct the foowing vectors that represent the whoe received vector of signas at the BS (in the spatiotempora domain) during the training phase, the concatenated channe vector and its KLT coefficients (that incude the channe parameters of a users in group g to be estimated) respectivey {[ ] } yvec y 0 y 1 y T 1 (6) N T {[ ] } h (g) vec f (g) f (g) f (g), c (g) vec [ ] 1 2 K g b (g) b (g) b (g) ( N L g K g 1 2 K Lg 1 ). (7) g r =0 g, K g In a simiar way, the inter-group interference matrix with respect to the group g in the spatio-tempora {[ ] } domain can be defined as ξ (g) vec η (g) 0 η (g) 1 η (g) with the covariance matrix T 1 N T { R (g) E ξ (g)( ξ (g)) H } = I ξ T R η (g). (8) Finay, the compete training matrix that consists of the training data of a users in group g during the signaing interva T is given by X (g) [ ] X (g) 1 X (g) 2 X (g) K g T K g L g. (9) The extended muti-path channe vector of group g in (7), carrying the compete CSI of a UTs in g, can be expressed in terms of the KLT coefficients (sma-scae fading) given in (4) as [{ (ρ ) (g) 1/2 ( (g) (g) U Λ h (g) = ( I Kg V ) c (g) where Vbdiag } {{ } Υ (g) U ) 1/2 } Lg ] 1. (10) ( In (10),Υ (g) U I Lg ) 1 K g V is a NK g L g K g =0 r g, transform matrix (in the spatio-tempora domain) { constructed by the eigenbasis of group g at each deay, ande c (g)( c (g)) } H = I ( ) Lg 1. Kg r =0 g, The pre-beamforming is appied in order to distinguish intra-group signa of group g users from other groups by suppressing the inter-group interference whie reducing the signaing dimension of y in (7). At =0

8 8 the pre-beamforming stage, a T-dimensiona space-time vector y (g) can be formed based on (1) for a intra-ce groups by a inear transformation through a matrix ( Υ (g) ) H ( S I T [ S (g) ] H ) as ] H ) where S (g) sampes{y n } T 1 n=0 y (g) ( Υ (g) ) H ( S y= X (g) [ S (g) h (g) + ( Υ (g) ) H S ξ (g), g=1,..., G (11) is an N statistica pre-beamforming matrix that projects the N-dimensiona received signa in (1) onto a suitabe -dimensiona subspace in spatia domain. III. COVARIANCE-BASE REUCE-RANK CHANNEL ESTIMATION In this section, based on the mode in (11), the reduced dimensiona inear minimum mean square error (LMMSE) channe estimator is derived whie the side information ying in the second order statistics of the MPCs of each group is utiized. As it is we-known, the LMMSE channe estimator is often referred to as the Wiener fiter [18]. The reduced-rank MMSE (RR-MMSE) estimate of the instantaneous CSI can be expressed in the foowing genera form: ĥ (g) =Υ (g) U ĉ(g) =Υ (g) ( ) (g) H U W mmse, y (g) =Υ (g) ( ) (g) H ( ) (g) H U W mmse, Υ S } {{ } Reduced-Rank Wiener Fiter y (12) where the RR-MMSE estimate of h (g), namey, ĥ (g) is written in terms of the RR-MMSE estimate of c (g), namey, ĉ (g) (sma-scae fading) by the KLT through theυ (g) U matrix given in (10). In (12), first, ĉ(g) is formed by a reduced dimensiona inear Wiener fiter (or MMSE fiter) in the spatio-tempora domain through the K g L g T ( W mmse,) (g) H matrix for group g users after projecting (reducing the dimension in kerne space) fu dimensiona observation y in (6) onto a suitabe subspace represented by ( Υ (g) S (pre-beamforming) in (11). Then, the LMMSE estimate of the fu-dimensiona muti-path channe vector of group g, ĥ (g), is constructed by transforming ĉ (g) back to the origina space by KLT throughυ (g) U. The transform matrices ( Υ (g) ) H (g) S andυ U do not depend on the training data and instantaneous CSI, and are to be designed based on ony ong-term channe second order statistics, which brings significant compexity reduction especiay when one considers the use of adaptive fitering and tracking agorithms since N. A. Joint Ange-eay omain RR-MMSE Estimator After pre-beamforming, the reduced dimensiona spatio-tempora domain Wiener fiter ( W (g) mmse,) H of group g in (12), depending on the covariances of the intra-group signa and inter-group interference (reated to the joint ange-deay power profie and sparsity information), can be obtained by soving the ) H

9 9 Wiener-Hopf equation [18], based on (11), as 5 whereψ (g) = ( W (g) mmse, =( R y (g) ) 1Ψ ( (g) = ] H ) X (g) [ S (g) by substituting W (g) mmse, Ψ (g) Υ (g) U, and R(g) y [ Ψ (g) ] H+ ( Υ (g) S ) H ( IT R (g) η ) ) (g) 1Ψ (g) Υ S (13) is defined as the covariance matrix of y (g) in (11). Then, in (13) into the expression in (12), and after foowing some mathematica steps using the identities (A B) 1 = ( A 1 B 1), (A+B) 1 = B 1( I+AB 1) 1 and the Kronecker product rue (A 1 A 2 ) (B 1 B 2 )=(A 1 B 1 ) (A 2 B 2 ) successivey, and noting that VV H = L g 1 ρ =0 E Lg, R (g) from (3) and (10), the reduced-rank LMMSE estimate ĥ (g) in (12) can be written expicity as ĥ (g) = L g 1 =0 L g 1 =0 [ IKg ρ E Lg, ] [ ] X (g) H (g) R S (g) R (g) code () [ SNR (g) ()] H + IT ([ ] (g) H ) 1 (g) S R η S (g) 1 y (g). (14) where E Lg, is an L g L g eementary diagona matrix where a the entries except the (+ 1) th diagona one are zero. The matrices SNR (g) SNR (g) ()ρ(g) () and R(g) code ( [S (g) (), appearing in (14), are defined as ] H ) 1 ( (g) [S R η S (g) ] (g) H (g) R S (g) ), (15) R (g) code () (X (g) [ I Kg E Lg,] [ X (g) ] H ). (16) The positive semi-definite matrices SNR (g) () in (15) for = 0,..., L g 1 in the spatia domain can be regarded as the generaized definition of the beamformer output snr for genera rank signa modes [22] 6, and have usefu properties provided in Appendix I. In the tempora domain, the T T positive semidefinite R (g) () matrices are defined as the deterministic correation matrix obtained from the coumns code of X (g) [ I Kg E Lg,] for = 0,..., Lg 1. Effective Channe: The subsequent downink or upink processing, preceded by the pre-beamformer, can access and utiize ony the foowing effective muti-path channe vector of each group user: h (g k ),e f f [ ] (g) H (g S h k ). Then, from the definition of the extended muti-path channe for group g in (7), the effective extended muti-path channe seen after pre-beamforming can be expressed as ( h (g) e f f I Kg L g [ S (g) ] H ) h (g). (17) 5 The deveopment is avaiabe in more detai in [21]. Aso, the reader shoud review the properties of Kronecker products of matrices in a thorough manner to foow the deveopment throughout the paper. 6 If the dimension of S (g) is one, SNR(g) () is the snr at the beamformer output when the beam is steered towards the AoA of the th MPC of group g through the pre-beamformer S (g) for stochastic signas [23]. The maximum vaue of snr is attained when the Capon Beamformer is utiized if the eigenspace of th MPC is rank 1 [24].

10 10 Based on (14), the RR-MMSE estimate of the effective channe h (g) in (17) is constructed as e f f ( ĥ (g) e f f I Kg L g [ S (g) ] H ) ĥ(g) L g 1 H = ( [ ]) X (g) (g) I Kg E Lg, SNR () R (g) code () [ SNR (g) ()] H + IT y (g). (18) =0 =0 ifferent than the previous ow-rank LMMSE approaches in [20], [25], the RR-MMSE estimator in (18) can be interpreted as the reduced-rank approximation of the fu-dimensiona spatio-tempora Wiener fiter by using two different transform basis sets, namey, the dimension reducing subspace projection (pre-beamformer) and the KLT characterizing the joint ange-deay channe sparsity. The RR-MMSE shows remarkabe robustness to the piot interference or contamination due to the use of non-orthogona piots among inter-ce users or piot reuse among intra-ce users since the intergroup interference is mitigated by the statistica pre-beamformer in the spatia domain. In addition to the considerabe reduction in piot interference, the piot overhead is aso reduced when the piot ength T is kept sma by aowing non-orthogona training sequences among intra-group or inter-group users. B. Ange omain RR-MMSE Estimator One can consider the foowing approximation of (18) by assuming that the MPCs of each group have the same AoA support (common anguar sector) with the foowing covariance matrix: R (g) sum L g 1 L g 1 1 =0 ρ (g) This corresponds to the use of anguar information ony when a the AoA supports of each MPC, beonging to the same group, are unified. In (15), by repacing ρ (g) R (g) foowing approximation for the effective channe estimate in (18): R (g). with R (g) sum, one can get the ĥ (g) e f f,2 =( X (g) SNR tota,(g) ) H ( (g) R code ) 1 SNRtota,(g) + I T y (g) (19) where SNR tota,(g) ([ ] (g) H ) 1 ([ (g) S R η S (g) ] (g) H ) (g) S R sums (g), R (g) code [ X(g) X (g)] H. (20) This estimator is caed the ange domain RR-MMSE estimator, which wi be used in pre-beamformer design and performance comparison in the seque. IV. NEARLY OPTIMAL BEAMFORMER ESIGN In this section, our goa is to find a good subspace (spanned by the coumns of S (g) matrix) on which the reduced dimensiona instantaneous channe estimation can be reaized as accuratey as possibe, so that a minima performance compromise in the subsequent statistica signa processing operations after

11 11 beamforming is provided. The probem of statistica pre-beamformer design is handed for two-stage beamforming framework using JSM in severa recent studies [9], [11], [13], [26] where the bock diagonaization (B) agorithms were investigated in order to reduce the dimensionaity for simpified system operation. A of these recent studies, reated to the pre-beamformer design, consider fat-fading spatiay-correated massive MIMO channe, whereas in this paper, the pre-beamformer design is tacked for frequency-seective massive MIMO systems empoying SC in T mode. A. Beamformer esign Criteria We examine the dimension reduction probem from three different viewpoints based on the instantaneous CSI estimation accuracy. These criteria resut in an equivaent optimization probem yieding the optima dimension-reducing subspace. 1) Reconstruction Error Minimizing Subspace The reduced-rank Wiener fitering in (12) can be seen as the data reconstruction process from noisy observations after dimension reduction. A egitimate goa is the minimization of the reconstruction error according to a criterion. If we denote the reconstruction error vector with e (g) h (g) ĥ (g) for group g channes, the covariance matrix of error R e mmse E{ (h (g) ĥ (g))( h (g) ĥ (g)) H } can be cacuated as foows: where R (g) y R mmse e = R (g) f u R(g) f u F(g) s = ( F (g) ) H (g) s R f u F(g) s { R (g) f ue h (g)( h (g)) } L H g 1 = + ( Υ (g) ) H (g) S R =0 ( R (g) y ξ Υ(g) S ) 1 ( ) (g) H (g) F s R (21) f u, F(g) s ([ ] ) X (g) H (g) S [ ] IKg E Lg, ρ R (g). (22) The R e mmse expression in (21) was obtained by appying spatio-tempora domain Wiener fiter W (g) mmse, in (13) to y (g) in (11), and using the Kronecker product rue successivey. In (22), the first term, named R (g), is cacuated by using the spatio-tempora KLT definition in (10). Moreover, it is important to note f u that the inverse of R e mmse is actuay the Fisher information matrix [18]. Error Voume: The minimization of the estimation error voume, namey, the determinant of R e mmse in (21), can be regarded as one of the important objectives on which -dimensiona subspace S (g) is

12 12 optimized. If one takes the determinant of both parts in (21), the foowing expression is obtained det ( R (g) ) f u V= ( det I T + ) (23) L g 1 R (g) () SNR(g) =0 code () wherev det (R e mmse ) and R (g) f u defined in (22) can be seen as a priori error voume of h (g) before the training period. The mathematica detais of this derivation can be found in Appendix II. Normaized Mean Square Error: The normaized mean square error (nmse) covariance can be defined as the estimation error covariance matrix of KLT coefficients c (g) in (10) as nmse (g) E{( c (g) ĉ (g))( c (g) ĉ (g)) H }. (24) Then, the trace of nmse (g), as an aternative objective function, can be obtained in the foowing compact form as Tr { nmse (g)} L g 1 1 = Tr R (g) () SNR(g) code ()+ I T + L g 1 g r g, T =0 K =0 (25) after some mathematica manipuations given in Appendix II. We woud ike to note that the scaar version of the reation (25) for T= 1, = 1, and K g = 1, L g = 1 that is nmse= 1/(1+ snr), is utiized in the anaysis of communication systems [27], [28]. 2) Mutua Information Preserving Subspace The probem can aso be stated as the preservation of the mutua information with a inear transformation under a rank constraint: rank { S (g) } =. The mutua information between h (g) and y (g) in (11) can be compacty obtained by assuming that both h (g) and y (g) are jointy Gaussian after using the MIMO channe capacity resuts in [29], the covariance matrix of inter-group interference R (g) ξ in (8), and the Kronecker product rue as foows I ( h (g) ; y (g)) = I ( c (g) ; y (g)) = og det I T + B. Neary Optima Soution: Generaized Eigenvector Space L g 1 =0 R (g) () SNR(g) code (). (26) A three criteria in Section IV-A, namey, the minimization of (23) or (25) and the maximization of (26) can be shown to resut in equivaent optimization probems yieding the same optima pre-beamformer S (g). It is possibe to simpify this optimization probem where the optima pre-beamformer depends on the training pattern X (g) in genera.

13 13 Joint Ange-eay omain: In mm wave massive MIMO channes, channe sparsity impies that eigenspaces of each MPC are neary orthogona [15], [16]. In ight of this near-orthogonaity assumption, the prebeamformer of group g can be constructed as [ S (g) S (g) (0) S(g) (1) S(g) (L g 1) where the N d matrix S (g) () can be seen as the sub-beamformer that aows the th resovabe MPC of group g to pass whie suppressing the inter-group interference in the spatia domain, and L g 1 =0 d =. ue to the apparent near-orthogonaity among the different MPCs (especiay for mm wave frequencies), S (g) () is aso expected to reject each MPC of group g other than the one at th deay. Therefore, if the orthogonaity among different MPCs is preserved after pre-beamforming, the eigenspaces of each SNR (g) () matrix (with rank d ) are mutuay orthogona. In this case, the dominant eigenvaues of the ([ ) SNR (g) () are the same as that of the d d ρ (g) (g) S ()] H 1 ([ ) (g) R η S (g) () (g) S ()] H (g) R S (g) () matrix for = 0,..., L g 1, whereas the other eigenvaues of SNR (g) () are neary zero. The eigendecomposition of SNR (g) () in (15) and R(g) code () in (16) matrices for = 0,..., L g 1 can be expressed as R (g) code ()= {m β m>0} β m φ m ] N (27) [ ] φ H, [ (g) {λ m SNR ()=Γ } ] diag n (Γ n=1 ) 1 (28) whereγ [ ] γ 1 γ showing the nth dominant eigenvector γ n in its nth coumn andλ n is defined as the corresponding eigenvaue of the SNR (g) () matrix. In a simiar fashion, φ m andβ m are defined as the m th dominant eigenvector and eigenvaue of R (g) product rue ( R (g) code () SNR(g) code () respectivey. Then, the foowing Kronecker ) ( ) ( ( ) (g) = R code ()φ (g) m SNR n) ()γ = β m λn)( φ m γ n ())( φ m γ n impies that { φ m } γ n is the set of eigenvectors for R(g) () SNR(g) m,n code () with the corresponding set of eigenvaues { } βm λ n for = 1,..., L m,n g 1. By using the eigenspace properties of the SNR (g) () matrix above foowed by the orthogonaity assumption, and the definitions given in (28), the eigenspace of L g 1 R (g) () SNR(g) =0 code () matrix in (23), (25) and (26) can be written as the orthogona direct sum of the eigenspaces of R (g) () SNR(g) code () matrices, i.e., L g 1 { =0 φ m γn} with the corresponding eigenvaues { β m λ n wheree }. This eads to the foowing approximation of the optimization criterion in (25) m,n L g 1 R d Tr { nmse (g)} 1 β =0 m=1 n=1 mλ +E (29) n+ 1 ( Lg 1 K g r =0 g, ) L g 1 R =0 d, and R is the rank of the R (g) code () matrix with R min { } T, K g m,n

14 14 from (16). For a given dimension of the pre-beamformer S (g) () in (27) with d =, and the training pattern determiningβ m, it can be noted that the minimum vaue of the cost function Tr{ nmse (g)} in (29), under the constraint that S (g) eigenvectors of R (g) is a fu coumn rank matrix is achieved by the first d dominant generaized and R (g) η from Appendix I. The minimum vaue of (29) is attained by choosingλ n as the n th dominant generaized eigenvaue of R (g) and R (g) η for = 0,..., L g 1 as noted in Appendix I. One can aso determine the optima d vaues among the possibe aternatives satisfying d = by using the generaized eigenvauesλ n minimizing (29). In order to mitigate the spatia interference stemming from the ack of orthogonaity among different MPCs, the dominant generaized eigenvectors ) ( and R η (g) + ) L g 1 =0, ρ(g) R (g) of ( ρ (g) R (g) can be chosen as the coumns of S (g) (). The generaized eigenvaue probem can be soved by the Lanczos agorithm in a computationay efficient way where d is much smaer than N. It is observed that the piot overhead is significanty reduced since even for T= K g (independent of N), Tr { nmse (g)} approaches zero when d = r g, and R = K g. Moreover, it is important to note that the piot overhead is consideraby high if channe estimation is fufied before dimension reduction, since the snr eve at each antenna eement is expected to be very sma before beamforming in mm wave channes. R (g) Ange-Ony omain: By unification of different MPCs in anguar domain corresponding to the use of sum in (20) as the common AoA support of a MPCs in group g, the optimization criterion in (25) can {( (g) be simpified as Tr R code ) 1 } SNRtota,(g) + I T from Section III-B. The eigendecomposition of the matrices SNR tota,(g) and R (g) code R (g) code = in (20) can be expressed as {m β m >0} β m φ m φm H, SNRtota,(g) =Γ diag [ ] {λ n } n=1 Γ 1 whereγ [ γ 1 γ ]. Then, the minimum cost m n=1 1 β m λ n +1 dominant generaized eigenvectors of R (g) sum and R (g) η as the coumns of S (g). (30) is achieved by choosing the first V. APPROXIMATE CORRELATOR TYPE ESTIMATORS AFTER BEAMFORMING IN HIGH SNR REGIME In this section, a reduced-rank correator-type estimator in the spatio-tempora domain based ony on the pre-beamforming matrix (designed by using ony ong-term channe statistica properties) is constructed. The key idea is to provide a reduced-rank approximation of the Wiener estimator, which performs the optimum weighting of the decorreated channe coefficients in the basis of the eigenvectors given by the coumns of the KLT matrix (10) defined in the spatio-tempora domain. This can be reaized by appying the maximum ikeihood (ML) estimator after a suitabe subspace projection, which suppresses spatia

15 15 interference whie reducing dimensionaity, thus yieds optimum bias-variance tradeoff [20], [30]. The ML (or zero-forcing) estimate, which is unbiased, achieves the Cramer-Rao bound (CRB) [18], [30]. The Wiener estimator converges to the ML estimator as snr approaches infinity after beamforming, i.e., E s N 0. The ML estimator, based on the deterministic signa mode in (11), does not expoit spatia correations in the muti-path channe vector, nameyρ (g) R (g). Particuary, ML variance approaches to infinity for ow snr [30]. Therefore, the principe of reducing the number of parameters to be estimated, without osing the intended part of the group g signa, can be adopted again. Then, the reduced-rank ML estimator as a post-processing stage can be constructed on a suitabe subspace spanned by the coumns of the pre-beamformer matrix S (g). By this way, one can reduce the estimation error variance (or MSE) consideraby at the expense of the introduced bias when compared to the conventiona (fu dimensiona) ML estimator, since the noise and interference subspace are switched off by the pre-beamforming in the spatia domain. The neary optima pre-beamformer, constructed by the generaized eigenvector beamspace (GEB) in Section IV-B, is used here to reduce the dimensionaity before appying the ML estimator. The GEB is an appropriate aternative for subspace projection, since it captures a significant portion of a MPCs in group g, whie rejecting inter-group interference. A. High SNR Approximation for Ange omain Estimator First, the reduced-rank correator-type approximation for the ange domain RR-MMSE in (19) is obtained. As mentioned in Section III-B, it corresponds to the case where a MPCs of group g are unified in the anguar domain, and the rank reduction is performed based on the spatia channe properties captured by R (g) sum in (20). If the GEB is used, the SNR tota,(g) S (g) matrix, obtained after pre-beamforming in (20), is competey diagonaizabe (as shown in Appendix I). In this case, the reduced-rank ML estimate of the effective channe in (17) can be obtained by etting E s N 0 in (19). This can be fufied by keeping N 0 fixed in (20), and aowing the training power E s to approach infinity. After foowing the mathematica steps provided in Appendix III, the RR-MMSE estimate of the effective channe in (19) can be approximated as ĥ (g) e f f,2 {( [X (g) ] H X (g) ) 1 [X ] (g) H [ ] } (g) H S y if T K g L g, { [X ] ( (g) H X [ (g) X (g)] ) H 1 [ ] } (g) H S y where X (g) in (9) is assumed to be fu coumn or row rank. if T< K g L g (31)

16 16 B. High SNR Approximation for Joint Ange-eay omain Estimator The joint ange-deay domain RR-MMSE in (18) can aso be approximated in a simiar fashion by obtaining the ML estimate in reduced dimensiona subspace. After pre-beamforming, it is assumed that the eigenspaces of each MPC of group g are neary orthogona, an effect more strongy observed in mm wave channes especiay for the case of a arge number of antenna eements. In this case, the matrices R (g) () SNR(g) code () for = 0,..., L g 1 in (18) have orthogona eigenspaces as expained in Section IV-B, and SNR (g) () matrices are competey diagonaizabe with the use of GEB (see Appendix I). 1) Rank-1 Approximation By assuming that the rank of each MPC is one, i.e., r g, = 1 for a in (3), which is reasonabe in the case of highy directiona propagation, and using the pre-beamformer structure in (27), the foowing approximation for the RR-MMSE estimate of the effective channe in (18) is obtained after some mathematica steps given in Appendix III L g 1 ĥ (g) e f f pinv { X [ ]} (g) I Kg E Lg, [ S (g) } {{ } E ] H, } {{ } y (32) =0 (tempora) correator pre-beamformer where pinv{} is a generaized operation known as the Moore-Penrose pseudoinverse, used to obtain the inverse of singuar or non-square matrices. In (32), E, is defined as a eementary diagona matrix where a the entries except the (+ 1) th diagona one are zero, and the dimension of the pre-beamformer is set as =L g. Here, S (g) E, is steered towards the AoA of the th MPC of group g whie rejecting other MPCs of groups g and inter-group interference. After the beamspace processing, the tempora processing, in the form of correator, is appied in order to differentiate between the MPCs of a group g users at the th deay, and to combat with other interfering sources (with overapping AoA support) by simpy pacing the tempora finger on the th tempora diversity path for a K g intra-group users. 2) Approximation for Genera-Rank Signa Modes The approximate spatio-tempora correator in (32) can be extended to the more genera case, where the rank of each resovabe MPC covariance is greater than one, and there exists significant overap among some of the MPCs in the anguar domain. In this case, one can simpify the probem by partitioning the MPCs of group g into groups in the anguar domain such that some of the MPCs at a specific deay, having approximatey simiar eigenspaces (common AoA support), are paced into the same group. The key idea is to construct MPC groups (resovabe in anguar domain) whose AoA supports are neary orthogona

17 17 in the anguar domain so that the reduced-rank ML estimator for each group of resovabe MPCs can be reaized separatey. By assuming that the eigenspaces of each SNR (g) () matrix in (18) are mutuay orthogona as expained in Section IV-B, and etting E s N 0 (18) is obtained after carrying out simiar mathematica steps to (32):, the foowing genera approximation for ĥ (g) MPC 1 e f f pinv X (g) H I Kg E Lg,m =0 m L S (g) E,n } {{ } n y (33) } {{ } (tempora) correator pre-beamformer where MPC is the tota number of MPC groups, resovabe in anguar domain, in g having neary non-overapping AoA support,l is the set of non-zero (tempora) deays beonging to the th resovabe muti-path group having MPCs with common AoA support in the anguar domain, and MPC 1 =0 L = L g. In (33), the set is defined as { n Z + 1 m=0 d m< n m=0 d m } for > 0, and { n Z + 0<n d 0 } for = 0 where =d and MPC 1 =0 d =. Here, shows the coumn indices of the pre-beamformer matrix S (g) is constructed as in (27), and S (g) in (27) aowed to pass the th resovabe MPC of group g. In (33), S (g) n E,n, whose non-zero coumns equa to that of S (g) () in (27), can be thought as the N beamformer matrix obtained by repacing a sub-matrices in (27) with zero matrix except S (g) (). The sub-beamformer matrix S(g) () is designated to reject other MPCs of group g in addition to the inter-group interference, and to capture a significant portion of the th resovabe MPC (in a simiar way to the one expained in Section IV-B). In (33), pinv{} operation can be seen as the tempora correator preceded by the pre-beamformer. It performs the task of Least Square (LS) type estimation of reduced dimensiona channes corresponding to the th MPC in group g. The form of (33) appears as the decouped spatio-tempora processing where spatia pre-beamforming and tempora (Rake-type) correator are appied in a successive manner. This further simpifies the RR-MMSE estimator in (18). For L g = 1, =N (no dimension reduction), and S (g) = I N, i.e., the spatia covariance structure of the MIMO channe is not expoited, the approximate estimator in (33) reduces to the conventiona LS type CSI acquisition technique, we-known in the iterature [4], [5], which reies on correating the received signa with the known piot sequence and suffering from piot contamination, whereas with the use of pre-beamformer in (33), the inter-group interfering users eading to piot interference are mitigated in the spatia domain. Moreover, the estimator in (33) does not necessitate the a priori power profie given by KLT in the ange-deay domain.

18 18 VI. NUMERICAL RESULTS AN ISCUSSION In this section, we provide some numerica resuts to evauate the performance of the reduced-rank channe estimators and examine the efficiency of the GEB in Section IV-B for the reduced dimensiona processing. Throughout the demonstrations, we consider a massive MIMO system with upink training in T mode where a BS is equipped with a uniform inear array (ULA) of N= 100 antenna eements aong the y-axis 7, and each of K users has a singe receive antenna. In the studied scenario, K users were custered into eight groups (G=8), and each UT is assumed to be ocated at a specific azimuth angeθ aong the ring centered at the origin in x-y pane. Here, we assume users come in groups, either by nature or by the appication of proper user grouping agorithms in [10], [15], which are out of scope of this work. The channe covariance matrix of each group is specified with the center azimuth angeθ (AoA), and can be cacuated in a simiar way to the ones in [9], [11]. In the simuations, our focus is on the channe estimation accuracy of the intended group g with 3 MPCs, i.e., L g = 3. The first two MPCs of group g stem from a azimuth anguar sector [ 1, 1 ] for deays at = 0, 1, and the anguar sector of the ast MPC at = 2 of g is given as [5, 7 ] in azimuth. We assume two users served simutaneousy for group g, i.e., K g = 2. Each of the other 7 groups (interfering with the intended one) consists of three users, i.e., K g = 3, g g and these users have 3 MPCs whose anguar sectors have same supports of AoA (L g = 3, g g) given by [ 29, 26], [ 21, 19], [ 12, 9], [ 5.5, 3.5], [9.5, 12.5], [15, 17], [24, 27] in azimuth respectivey. The channe vector for each user is independenty generated according to the mode (4). The noise power is set as N 0 = 1 so that a db power vaues are reative to 1. In T mode, inter-group users do not need to be synchronized, and even are aowed to use the same sequences during the upink training mode. Intra-group users (of the intended group) use non-orthogona training waveforms composed of 6 symbos (T = 6), and these are obtained by truncating ength-63 Kasami codes [31] by simpy choosing the first T symbos of ast K g Kasami sequences without any optimization 8. Then, the training matrix in (9) can be constructed to be expoited by the BS during the CSI acquisition period. The trace of the estimation error covariance matrix (for the extended channe vector of group g users in (7) given by R e E{ (h (g) ĥ (g))( h (g) ĥ (g)) H } is evauated to compare the performance of different estimators. Here, the channe estimates in the origina space and in the reduced dimensiona subspace 7 Athough the system mode and the proposed estimators are vaid for an arbitrary array structure in this work, ULA is considered for ease of exposition ony. 8 There are more efficient approaches (other than the truncation of Kasami codes) yieding waveforms with better cross- and auto-correation properties and minimizing (23) or (25), but training optimization is beyond the scope of this work

19 19 after pre-beamforming are defined as ĥ (g) ( W (g)) H y and ĥ (g) e f f ( W (g) ) H e f f y respectivey. For these arbitrary inear estimators, the error covariance can be cacuated by using the R e mmse in (21) (achieved by the reduced-rank Wiener fiter (14)): R e = R mmse e + ( W (g) W mmse (g) ) H ( Ry W (g) W mmse (g) ) (34) where ( W mmse (g) ) HΥ ( ) (g) (g) H ( ) (g) H U W mmse, Υ S in (12), and W (g) is an (NT) (NK g L g ) arbitrary fiter. In a simiar manner, the error covariance matrix of the effective channe estimate (18) can be cacuated in the reduced dimensiona subspace. The covariance matrix of the inter-group interference is evauated by (5) when the anguar sector of each group is provided. The GEB is constructed in a simiar way to the one in Section IV-B by taking the number of resovabe MPCs in the anguar domain as 2, namey,mpc = 2 and setting d 0 = d 1 = 2 in (33). In this work, we compare the performance of dimension reduction based on the GEB (shown to be neary optima under some reaistic assumptions) with that of the conventiona subspace composed of the first dominant eigenvectors of R (g) sum in (20). We ca this conventiona beamspace as discrete Fourier transform (FT) beamspace because the eigenvectors of the spatia correation matrix of the ULA channe are we-approximated by the coumns of the N N unitary FT matrix whose indices correspond to the support of the Fourier transform of the spatia correation function (owing to the Szegö s asymptotic theory) [10] depending on the anguar sector of group g UTs. This conventiona beamspace is known to be information preserving for the spatiay white interference case, and thus, is widey used in practica hybrid beamforming appications, where the beamforming in the RF anaog domain can be impemented by simpe phase shifters [13]. In Figure 1, the beam patterns created by the GEB and FT beamspaces are depicted for =6at snr= 30 (db). The GEB is designed based on the AoA support of the intended group g for = 0, 1, 2 whie taking the anguar ocations of the interfering groups into account. The signas of the inter-group users are assumed to have the same power eve with that of the intended group. As can be seen from the figure, the GEB tries to create deep nus at the anguar ocations of the interfering UTs, whereas the conventiona pre-beamformer ony tries to maximize the captured power of the intended group MPCs for a given dimension. It is expected that as the number of BS antennas increases, the eigenspaces of each group are approximatey orthogona. However, the number of transmit antennas is finite in practice, and there aways exists some overap among the virtua anguar sectors of each group which eads into

20 20 a eakage to the intended group signa. Therefore, as it wi be shown ater, the accuracy of the channe estimation reaized on the reduced dimensiona subspace, spanned by the conventiona FT beamspace, is consideraby ost due to the residua inter-group interference after pre-beamforming. On the other hand, the GEB suppresses the inter-group interference whie aowing the MPCs of the intended group to pass with a negigibe distortion so that the subsequent processing in reduced dimensions, here the instantaneous CSI estimation, can be carried out as accuratey as possibe FT Beamspace ( = 6) Optimized Beamspace ( = 6) Anguar Sector of the intended MPCs Normaized Gain (in db) Interfering Groups Azimuth Ange of Arriva (AoA) Fig. 1. Beam pattern of different pre-beamformers. In Figure 2, the average mean square error (MSE) vaues given by Tr{R e }/K g as a function of the dimension of the spatia domain pre-beamformer () are depicted for both joint ange-deay domain and ange domain RR-MMSE estimators given in (14) at snr= 30 db. For joint ange-deay, the exact knowedge of covariance for each MPC is used, whereas for the ange domain, a common anguar region (obtained by the unification of each deay) is assumed for each MPC (of group g) and used instead of R (g) in (14). Aso, the performance of the fu dimensiona Wiener estimator ( = N) is demonstrated when there are no interfering groups. It is cear that ange domain RR-MMSE estimator is inferior to joint ange-deay domain estimator due to the inefficient use of the training and noise enhancement. Moreover, it is seen that there is a remarkabe performance gap between the performances of RR-MMSE estimators based on two different pre-beamformers (the GEB and the conventiona one) especiay at ower dimensions. Aso, it can be concuded that the RR-MMSE estimator based on the GEB achieves a very cose performance to that of the fu dimensiona estimator even for = 7 (for group g), that is roughy

21 21 15-fod dimension reduction. On the other hand, with the conventiona beamspace, in spite of the optima Wiener fitering after dimension reduction, the MSE performance is not satisfactory for dimensions beow FT Beamspace + RR MMSE Est. (Ange Ony) Opt. Beamspace + RR MMSE Est. (Ange Ony) FT Beamspace + RR MMSE Est. (Joint Ange eay) Opt. Beamspace + RR MMSE Est. (Joint Ange eay) No Interfering Groups, Fu Rank MMSE Est. (Joint Ange eay) 10 1 MSE 10 2 = imension of the Beamspace () Fig. 2. MSE vaues of RR-MMSE estimator versus dimension of the pre-beamformer. In Figure 3, by adopting the same settings used to obtain in Figure 2, the MSE performance for different estimators of the effective channe in -dimensiona spatia subspace are shown. The performance of joint ange-deay RR-MMSE estimator based on the GEB in (18) is used as the performance benchmark. The MSE vaues achieved by different effective channe estimators are normaized by this benchmark for each dimension, and these reative MSE vaues are given as a function of the dimension (starting at 7). Aso, the spatio-tempora correator-type estimators in (31) and (33), obtained after the high snr approximation of the reduced-rank Wiener fiter, are depicted. It is seen that reative performance of these approximate correator-type estimators degrades as the dimension increases. This degradation is expected, since LS-type estimation does not expoit spatia correations in the channe coefficients, and does not appy optimum spatia weights when compared to MMSE fitering. In this case, adding extra dimensions beyond 7 eads to noise enhancement, since the noise subspace is not switched off propery with increasing dimensions, and starts to contaminate the effective channe estimates. In addition to that, the approximate estimator is more sensitive to which pre-beamformer is utiized such that there is a remarkabe performance gap between the GEB and the conventiona beamspaces when the approximate estimator is reaized for both joint ange-

Gokhan M. Guvensen, Member, IEEE, and Ender Ayanoglu, Fellow, IEEE. Abstract

Gokhan M. Guvensen, Member, IEEE, and Ender Ayanoglu, Fellow, IEEE. Abstract A Generaized Framework on Beamformer esign 1 and CSI Acquisition for Singe-Carrier Massive MIMO Systems in Miimeter Wave Channes Gokhan M. Guvensen, Member, IEEE, and Ender Ayanogu, Feow, IEEE arxiv:1607.01436v1

More information

Source and Relay Matrices Optimization for Multiuser Multi-Hop MIMO Relay Systems

Source and Relay Matrices Optimization for Multiuser Multi-Hop MIMO Relay Systems Source and Reay Matrices Optimization for Mutiuser Muti-Hop MIMO Reay Systems Yue Rong Department of Eectrica and Computer Engineering, Curtin University, Bentey, WA 6102, Austraia Abstract In this paper,

More information

Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization

Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization Scaabe Spectrum ocation for Large Networks ased on Sparse Optimization innan Zhuang Modem R&D Lab Samsung Semiconductor, Inc. San Diego, C Dongning Guo, Ermin Wei, and Michae L. Honig Department of Eectrica

More information

ESTIMATION OF SAMPLING TIME MISALIGNMENTS IN IFDMA UPLINK

ESTIMATION OF SAMPLING TIME MISALIGNMENTS IN IFDMA UPLINK ESTIMATION OF SAMPLING TIME MISALIGNMENTS IN IFDMA UPLINK Aexander Arkhipov, Michae Schne German Aerospace Center DLR) Institute of Communications and Navigation Oberpfaffenhofen, 8224 Wessing, Germany

More information

A Brief Introduction to Markov Chains and Hidden Markov Models

A Brief Introduction to Markov Chains and Hidden Markov Models A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,

More information

Massive MIMO Communications

Massive MIMO Communications Massive MIMO Communications Trinh Van Chien and Emi Björnson Book Chapter N.B.: When citing this work, cite the origina artice. Part of: 5G Mobie Communications, Ed. Wei Xiang, an Zheng, Xuemin Sherman)

More information

Maximum Ratio Combining of Correlated Diversity Branches with Imperfect Channel State Information and Colored Noise

Maximum Ratio Combining of Correlated Diversity Branches with Imperfect Channel State Information and Colored Noise Maximum Ratio Combining of Correated Diversity Branches with Imperfect Channe State Information and Coored Noise Lars Schmitt, Thomas Grunder, Christoph Schreyoegg, Ingo Viering, and Heinrich Meyr Institute

More information

MC-CDMA CDMA Systems. Introduction. Ivan Cosovic. Stefan Kaiser. IEEE Communication Theory Workshop 2005 Park City, USA, June 15, 2005

MC-CDMA CDMA Systems. Introduction. Ivan Cosovic. Stefan Kaiser. IEEE Communication Theory Workshop 2005 Park City, USA, June 15, 2005 On the Adaptivity in Down- and Upink MC- Systems Ivan Cosovic German Aerospace Center (DLR) Institute of Comm. and Navigation Oberpfaffenhofen, Germany Stefan Kaiser DoCoMo Euro-Labs Wireess Soution Laboratory

More information

Maximizing Sum Rate and Minimizing MSE on Multiuser Downlink: Optimality, Fast Algorithms and Equivalence via Max-min SIR

Maximizing Sum Rate and Minimizing MSE on Multiuser Downlink: Optimality, Fast Algorithms and Equivalence via Max-min SIR 1 Maximizing Sum Rate and Minimizing MSE on Mutiuser Downink: Optimaity, Fast Agorithms and Equivaence via Max-min SIR Chee Wei Tan 1,2, Mung Chiang 2 and R. Srikant 3 1 Caifornia Institute of Technoogy,

More information

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c)

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c) A Simpe Efficient Agorithm of 3-D Singe-Source Locaization with Uniform Cross Array Bing Xue a * Guangyou Fang b Yicai Ji c Key Laboratory of Eectromagnetic Radiation Sensing Technoogy, Institute of Eectronics,

More information

Stochastic Variational Inference with Gradient Linearization

Stochastic Variational Inference with Gradient Linearization Stochastic Variationa Inference with Gradient Linearization Suppementa Materia Tobias Pötz * Anne S Wannenwetsch Stefan Roth Department of Computer Science, TU Darmstadt Preface In this suppementa materia,

More information

FRST Multivariate Statistics. Multivariate Discriminant Analysis (MDA)

FRST Multivariate Statistics. Multivariate Discriminant Analysis (MDA) 1 FRST 531 -- Mutivariate Statistics Mutivariate Discriminant Anaysis (MDA) Purpose: 1. To predict which group (Y) an observation beongs to based on the characteristics of p predictor (X) variabes, using

More information

FREQUENCY modulated differential chaos shift key (FM-

FREQUENCY modulated differential chaos shift key (FM- Accepted in IEEE 83rd Vehicuar Technoogy Conference VTC, 16 1 SNR Estimation for FM-DCS System over Mutipath Rayeigh Fading Channes Guofa Cai, in Wang, ong ong, Georges addoum Dept. of Communication Engineering,

More information

Turbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University

Turbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University Turbo Codes Coding and Communication Laboratory Dept. of Eectrica Engineering, Nationa Chung Hsing University Turbo codes 1 Chapter 12: Turbo Codes 1. Introduction 2. Turbo code encoder 3. Design of intereaver

More information

T.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA

T.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA ON THE SYMMETRY OF THE POWER INE CHANNE T.C. Banwe, S. Gai {bct, sgai}@research.tecordia.com Tecordia Technoogies, Inc., 445 South Street, Morristown, NJ 07960, USA Abstract The indoor power ine network

More information

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries c 26 Noninear Phenomena in Compex Systems First-Order Corrections to Gutzwier s Trace Formua for Systems with Discrete Symmetries Hoger Cartarius, Jörg Main, and Günter Wunner Institut für Theoretische

More information

Transmit Antenna Selection for Physical-Layer Network Coding Based on Euclidean Distance

Transmit Antenna Selection for Physical-Layer Network Coding Based on Euclidean Distance Transmit ntenna Seection for Physica-Layer Networ Coding ased on Eucidean Distance 1 arxiv:179.445v1 [cs.it] 13 Sep 17 Vaibhav Kumar, arry Cardiff, and Mar F. Fanagan Schoo of Eectrica and Eectronic Engineering,

More information

Subspace Estimation and Decomposition for Hybrid Analog-Digital Millimetre-Wave MIMO systems

Subspace Estimation and Decomposition for Hybrid Analog-Digital Millimetre-Wave MIMO systems Subspace Estimation and Decomposition for Hybrid Anaog-Digita Miimetre-Wave MIMO systems Hadi Ghauch, Mats Bengtsson, Taejoon Kim, Mikae Skogund Schoo of Eectrica Engineering and the ACCESS Linnaeus Center,

More information

LOW-COMPLEXITY LINEAR PRECODING FOR MULTI-CELL MASSIVE MIMO SYSTEMS

LOW-COMPLEXITY LINEAR PRECODING FOR MULTI-CELL MASSIVE MIMO SYSTEMS LOW-COMPLEXITY LINEAR PRECODING FOR MULTI-CELL MASSIVE MIMO SYSTEMS Aba ammoun, Axe Müer, Emi Björnson,3, and Mérouane Debbah ing Abduah University of Science and Technoogy (AUST, Saudi Arabia Acate-Lucent

More information

BICM Performance Improvement via Online LLR Optimization

BICM Performance Improvement via Online LLR Optimization BICM Performance Improvement via Onine LLR Optimization Jinhong Wu, Mostafa E-Khamy, Jungwon Lee and Inyup Kang Samsung Mobie Soutions Lab San Diego, USA 92121 Emai: {Jinhong.W, Mostafa.E, Jungwon2.Lee,

More information

Cryptanalysis of PKP: A New Approach

Cryptanalysis of PKP: A New Approach Cryptanaysis of PKP: A New Approach Éiane Jaumes and Antoine Joux DCSSI 18, rue du Dr. Zamenhoff F-92131 Issy-es-Mx Cedex France eiane.jaumes@wanadoo.fr Antoine.Joux@ens.fr Abstract. Quite recenty, in

More information

sensors Beamforming Based Full-Duplex for Millimeter-Wave Communication Article

sensors Beamforming Based Full-Duplex for Millimeter-Wave Communication Article sensors Artice Beamforming Based Fu-Dupex for Miimeter-Wave Communication Xiao Liu 1,2,3, Zhenyu Xiao 1,2,3, *, Lin Bai 1,2,3, Jinho Choi 4, Pengfei Xia 5 and Xiang-Gen Xia 6 1 Schoo of Eectronic and Information

More information

Centralized Coded Caching of Correlated Contents

Centralized Coded Caching of Correlated Contents Centraized Coded Caching of Correated Contents Qianqian Yang and Deniz Gündüz Information Processing and Communications Lab Department of Eectrica and Eectronic Engineering Imperia Coege London arxiv:1711.03798v1

More information

Power Control and Transmission Scheduling for Network Utility Maximization in Wireless Networks

Power Control and Transmission Scheduling for Network Utility Maximization in Wireless Networks ower Contro and Transmission Scheduing for Network Utiity Maximization in Wireess Networks Min Cao, Vivek Raghunathan, Stephen Hany, Vinod Sharma and. R. Kumar Abstract We consider a joint power contro

More information

Throughput Optimal Scheduling for Wireless Downlinks with Reconfiguration Delay

Throughput Optimal Scheduling for Wireless Downlinks with Reconfiguration Delay Throughput Optima Scheduing for Wireess Downinks with Reconfiguration Deay Vineeth Baa Sukumaran vineethbs@gmai.com Department of Avionics Indian Institute of Space Science and Technoogy. Abstract We consider

More information

Supporting Information for Suppressing Klein tunneling in graphene using a one-dimensional array of localized scatterers

Supporting Information for Suppressing Klein tunneling in graphene using a one-dimensional array of localized scatterers Supporting Information for Suppressing Kein tunneing in graphene using a one-dimensiona array of ocaized scatterers Jamie D Was, and Danie Hadad Department of Chemistry, University of Miami, Cora Gabes,

More information

https://doi.org/ /epjconf/

https://doi.org/ /epjconf/ HOW TO APPLY THE OPTIMAL ESTIMATION METHOD TO YOUR LIDAR MEASUREMENTS FOR IMPROVED RETRIEVALS OF TEMPERATURE AND COMPOSITION R. J. Sica 1,2,*, A. Haefee 2,1, A. Jaai 1, S. Gamage 1 and G. Farhani 1 1 Department

More information

(This is a sample cover image for this issue. The actual cover is not yet available at this time.)

(This is a sample cover image for this issue. The actual cover is not yet available at this time.) (This is a sampe cover image for this issue The actua cover is not yet avaiabe at this time) This artice appeared in a journa pubished by Esevier The attached copy is furnished to the author for interna

More information

OPPORTUNISTIC SPECTRUM ACCESS (OSA) [1], first. Cluster-Based Differential Energy Detection for Spectrum Sensing in Multi-Carrier Systems

OPPORTUNISTIC SPECTRUM ACCESS (OSA) [1], first. Cluster-Based Differential Energy Detection for Spectrum Sensing in Multi-Carrier Systems Custer-Based Differentia Energy Detection for Spectrum Sensing in Muti-Carrier Systems Parisa Cheraghi, Student Member, IEEE, Yi Ma, Senior Member, IEEE, Rahim Tafazoi, Senior Member, IEEE, and Zhengwei

More information

ASummaryofGaussianProcesses Coryn A.L. Bailer-Jones

ASummaryofGaussianProcesses Coryn A.L. Bailer-Jones ASummaryofGaussianProcesses Coryn A.L. Baier-Jones Cavendish Laboratory University of Cambridge caj@mrao.cam.ac.uk Introduction A genera prediction probem can be posed as foows. We consider that the variabe

More information

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations Optimaity of Inference in Hierarchica Coding for Distributed Object-Based Representations Simon Brodeur, Jean Rouat NECOTIS, Département génie éectrique et génie informatique, Université de Sherbrooke,

More information

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After

More information

SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS

SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS ISEE 1 SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS By Yingying Fan and Jinchi Lv University of Southern Caifornia This Suppementary Materia

More information

Doubly Iterative Receiver for Block Transmissions with EM-Based Channel Estimation

Doubly Iterative Receiver for Block Transmissions with EM-Based Channel Estimation 656 IEEE RANSACIONS ON WIRELESS COMMUNICAIONS, VOL. 8, NO. 2, FEBRUARY 2009 Douby Iterative Receiver for Bock ransmissions with EM-Based Channe Estimation he-hanh Pham, Ying-Chang Liang, Senior Member,

More information

EasyChair Preprint. Time-Domain Channel Estimation for the LTE-V System Over High-Speed Mobile Channels

EasyChair Preprint. Time-Domain Channel Estimation for the LTE-V System Over High-Speed Mobile Channels EasyChair Preprint 184 Time-Domain Channe Estimation for the LTE-V System Over High-Speed Mobie Channes Qu Huiyang, Liu Guanghui, Wang Yanyan, Wen Shan and Chen Qiang EasyChair preprints are intended for

More information

Related Topics Maxwell s equations, electrical eddy field, magnetic field of coils, coil, magnetic flux, induced voltage

Related Topics Maxwell s equations, electrical eddy field, magnetic field of coils, coil, magnetic flux, induced voltage Magnetic induction TEP Reated Topics Maxwe s equations, eectrica eddy fied, magnetic fied of cois, coi, magnetic fux, induced votage Principe A magnetic fied of variabe frequency and varying strength is

More information

LINEAR DETECTORS FOR MULTI-USER MIMO SYSTEMS WITH CORRELATED SPATIAL DIVERSITY

LINEAR DETECTORS FOR MULTI-USER MIMO SYSTEMS WITH CORRELATED SPATIAL DIVERSITY LINEAR DETECTORS FOR MULTI-USER MIMO SYSTEMS WITH CORRELATED SPATIAL DIVERSITY Laura Cottateucci, Raf R. Müer, and Mérouane Debbah Ist. of Teecommunications Research Dep. of Eectronics and Teecommunications

More information

A Robust Voice Activity Detection based on Noise Eigenspace Projection

A Robust Voice Activity Detection based on Noise Eigenspace Projection A Robust Voice Activity Detection based on Noise Eigenspace Projection Dongwen Ying 1, Yu Shi 2, Frank Soong 2, Jianwu Dang 1, and Xugang Lu 1 1 Japan Advanced Institute of Science and Technoogy, Nomi

More information

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel Sequentia Decoding of Poar Codes with Arbitrary Binary Kerne Vera Miosavskaya, Peter Trifonov Saint-Petersburg State Poytechnic University Emai: veram,petert}@dcn.icc.spbstu.ru Abstract The probem of efficient

More information

Optimality of Gaussian Fronthaul Compression for Uplink MIMO Cloud Radio Access Networks

Optimality of Gaussian Fronthaul Compression for Uplink MIMO Cloud Radio Access Networks Optimaity of Gaussian Fronthau Compression for Upink MMO Coud Radio Access etworks Yuhan Zhou, Yinfei Xu, Jun Chen, and Wei Yu Department of Eectrica and Computer Engineering, University of oronto, Canada

More information

Formulas for Angular-Momentum Barrier Factors Version II

Formulas for Angular-Momentum Barrier Factors Version II BNL PREPRINT BNL-QGS-06-101 brfactor1.tex Formuas for Anguar-Momentum Barrier Factors Version II S. U. Chung Physics Department, Brookhaven Nationa Laboratory, Upton, NY 11973 March 19, 2015 abstract A

More information

Physics 566: Quantum Optics Quantization of the Electromagnetic Field

Physics 566: Quantum Optics Quantization of the Electromagnetic Field Physics 566: Quantum Optics Quantization of the Eectromagnetic Fied Maxwe's Equations and Gauge invariance In ecture we earned how to quantize a one dimensiona scaar fied corresponding to vibrations on

More information

$, (2.1) n="# #. (2.2)

$, (2.1) n=# #. (2.2) Chapter. Eectrostatic II Notes: Most of the materia presented in this chapter is taken from Jackson, Chap.,, and 4, and Di Bartoo, Chap... Mathematica Considerations.. The Fourier series and the Fourier

More information

An approximate method for solving the inverse scattering problem with fixed-energy data

An approximate method for solving the inverse scattering problem with fixed-energy data J. Inv. I-Posed Probems, Vo. 7, No. 6, pp. 561 571 (1999) c VSP 1999 An approximate method for soving the inverse scattering probem with fixed-energy data A. G. Ramm and W. Scheid Received May 12, 1999

More information

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network An Agorithm for Pruning Redundant Modues in Min-Max Moduar Network Hui-Cheng Lian and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University 1954 Hua Shan Rd., Shanghai

More information

arxiv:quant-ph/ v3 6 Jan 1995

arxiv:quant-ph/ v3 6 Jan 1995 arxiv:quant-ph/9501001v3 6 Jan 1995 Critique of proposed imit to space time measurement, based on Wigner s cocks and mirrors L. Diósi and B. Lukács KFKI Research Institute for Partice and Nucear Physics

More information

DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM

DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM MIKAEL NILSSON, MATTIAS DAHL AND INGVAR CLAESSON Bekinge Institute of Technoogy Department of Teecommunications and Signa Processing

More information

An Average Cramer-Rao Bound for Frequency Offset Estimation in Frequency-Selective Fading Channels

An Average Cramer-Rao Bound for Frequency Offset Estimation in Frequency-Selective Fading Channels IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 9, NO. 3, MARCH 010 871 An Average Cramer-Rao Bound for Frequency Offset Estimation in Frequency-Seective Fading Channes Yinghui Li, Haing Minn, Senior

More information

Research of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance

Research of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance Send Orders for Reprints to reprints@benthamscience.ae 340 The Open Cybernetics & Systemics Journa, 015, 9, 340-344 Open Access Research of Data Fusion Method of Muti-Sensor Based on Correation Coefficient

More information

Online Appendices for The Economics of Nationalism (Xiaohuan Lan and Ben Li)

Online Appendices for The Economics of Nationalism (Xiaohuan Lan and Ben Li) Onine Appendices for The Economics of Nationaism Xiaohuan Lan and Ben Li) A. Derivation of inequaities 9) and 10) Consider Home without oss of generaity. Denote gobaized and ungobaized by g and ng, respectivey.

More information

Adaptive Joint Self-Interference Cancellation and Equalization for Space-Time Coded Bi-Directional Relaying Networks

Adaptive Joint Self-Interference Cancellation and Equalization for Space-Time Coded Bi-Directional Relaying Networks 1 Adaptive Joint Sef-Interference Canceation and Equaization for Space-Time Coded Bi-Directiona Reaying Networs Jeong-Min Choi, Jae-Shin Han, and Jong-Soo Seo Department of Eectrica and Eectronic Engineering,

More information

LINK BETWEEN THE JOINT DIAGONALISATION OF SYMMETRICAL CUBES AND PARAFAC: AN APPLICATION TO SECONDARY SURVEILLANCE RADAR

LINK BETWEEN THE JOINT DIAGONALISATION OF SYMMETRICAL CUBES AND PARAFAC: AN APPLICATION TO SECONDARY SURVEILLANCE RADAR LINK BETWEEN THE JOINT DIAGONALISATION OF SYMMETRICAL CUBES AND PARAFAC: AN APPLICATION TO SECONDARY SURVEILLANCE RADAR Nicoas PETROCHILOS CReSTIC, University of Reims Mouins de a Housse, BP 1039 51687

More information

Combining reaction kinetics to the multi-phase Gibbs energy calculation

Combining reaction kinetics to the multi-phase Gibbs energy calculation 7 th European Symposium on Computer Aided Process Engineering ESCAPE7 V. Pesu and P.S. Agachi (Editors) 2007 Esevier B.V. A rights reserved. Combining reaction inetics to the muti-phase Gibbs energy cacuation

More information

TENSOR-BASED FRAMEWORK FOR THE PREDICTION OF FREQUENCY-SELECTIVE TIME-VARIANT MIMO CHANNELS

TENSOR-BASED FRAMEWORK FOR THE PREDICTION OF FREQUENCY-SELECTIVE TIME-VARIANT MIMO CHANNELS TENSOR-BASED FRAMEWORK FOR THE PREDICTION OF FREQUENCY-SELECTIVE TIME-VARIANT MIMO CHANNELS Marko Miojević, Giovanni De Gado, and Martin Haardt Imenau University of Technoogy, Communications Research Laboratory,

More information

Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problem

Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problem 1 Maximum ikeihood decoding of treis codes in fading channes with no receiver CSI is a poynomia-compexity probem Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department

More information

Fast Blind Recognition of Channel Codes

Fast Blind Recognition of Channel Codes Fast Bind Recognition of Channe Codes Reza Moosavi and Erik G. Larsson Linköping University Post Print N.B.: When citing this work, cite the origina artice. 213 IEEE. Persona use of this materia is permitted.

More information

Multiple Beam Interference

Multiple Beam Interference MutipeBeamInterference.nb James C. Wyant 1 Mutipe Beam Interference 1. Airy's Formua We wi first derive Airy's formua for the case of no absorption. ü 1.1 Basic refectance and transmittance Refected ight

More information

Statistics for Applications. Chapter 7: Regression 1/43

Statistics for Applications. Chapter 7: Regression 1/43 Statistics for Appications Chapter 7: Regression 1/43 Heuristics of the inear regression (1) Consider a coud of i.i.d. random points (X i,y i ),i =1,...,n : 2/43 Heuristics of the inear regression (2)

More information

Pilot Contamination Problem in Multi-Cell. TDD Systems

Pilot Contamination Problem in Multi-Cell. TDD Systems Piot Contamination Probem in Muti-Ce 1 TDD Systems Jubin Jose, Aexei Ashikhmin, Thomas L. Marzetta, and Sriram Vishwanath Laboratory for Informatics, Networks and Communications LINC) Department of Eectrica

More information

Target Location Estimation in Wireless Sensor Networks Using Binary Data

Target Location Estimation in Wireless Sensor Networks Using Binary Data Target Location stimation in Wireess Sensor Networks Using Binary Data Ruixin Niu and Pramod K. Varshney Department of ectrica ngineering and Computer Science Link Ha Syracuse University Syracuse, NY 344

More information

HIGHER ORDER DIRECTION FINDING WITH POLARIZATION DIVERSITY: THE PD-2q-MUSIC ALGORITHMS

HIGHER ORDER DIRECTION FINDING WITH POLARIZATION DIVERSITY: THE PD-2q-MUSIC ALGORITHMS 15th European Signa Processing Conference (EUSIPCO 2007), Poznan, Poand, September 3-7, 2007, copyright by EURASIP HIGHER ORDER DIRECTION FINDING WITH POLARIZATION DIVERSITY: THE PD-2-MUSIC ALGORITHMS

More information

A SIMPLIFIED DESIGN OF MULTIDIMENSIONAL TRANSFER FUNCTION MODELS

A SIMPLIFIED DESIGN OF MULTIDIMENSIONAL TRANSFER FUNCTION MODELS A SIPLIFIED DESIGN OF ULTIDIENSIONAL TRANSFER FUNCTION ODELS Stefan Petrausch, Rudof Rabenstein utimedia Communications and Signa Procesg, University of Erangen-Nuremberg, Cauerstr. 7, 958 Erangen, GERANY

More information

Alberto Maydeu Olivares Instituto de Empresa Marketing Dept. C/Maria de Molina Madrid Spain

Alberto Maydeu Olivares Instituto de Empresa Marketing Dept. C/Maria de Molina Madrid Spain CORRECTIONS TO CLASSICAL PROCEDURES FOR ESTIMATING THURSTONE S CASE V MODEL FOR RANKING DATA Aberto Maydeu Oivares Instituto de Empresa Marketing Dept. C/Maria de Moina -5 28006 Madrid Spain Aberto.Maydeu@ie.edu

More information

The influence of temperature of photovoltaic modules on performance of solar power plant

The influence of temperature of photovoltaic modules on performance of solar power plant IOSR Journa of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vo. 05, Issue 04 (Apri. 2015), V1 PP 09-15 www.iosrjen.org The infuence of temperature of photovotaic modues on performance

More information

arxiv: v1 [cs.it] 13 Jun 2014

arxiv: v1 [cs.it] 13 Jun 2014 SUBMITTED TO IEEE SIGNAL PROCESSING LETTERS, OCTOBER 8, 2018 1 Piot Signa Design for Massive MIMO Systems: A Received Signa-To-Noise-Ratio-Based Approach Jungho So, Donggun Kim, Yuni Lee, Student Members,

More information

BALANCING REGULAR MATRIX PENCILS

BALANCING REGULAR MATRIX PENCILS BALANCING REGULAR MATRIX PENCILS DAMIEN LEMONNIER AND PAUL VAN DOOREN Abstract. In this paper we present a new diagona baancing technique for reguar matrix pencis λb A, which aims at reducing the sensitivity

More information

Theory and implementation behind: Universal surface creation - smallest unitcell

Theory and implementation behind: Universal surface creation - smallest unitcell Teory and impementation beind: Universa surface creation - smaest unitce Bjare Brin Buus, Jaob Howat & Tomas Bigaard September 15, 218 1 Construction of surface sabs Te aim for tis part of te project is

More information

arxiv: v1 [cs.lg] 31 Oct 2017

arxiv: v1 [cs.lg] 31 Oct 2017 ACCELERATED SPARSE SUBSPACE CLUSTERING Abofaz Hashemi and Haris Vikao Department of Eectrica and Computer Engineering, University of Texas at Austin, Austin, TX, USA arxiv:7.26v [cs.lg] 3 Oct 27 ABSTRACT

More information

In-plane shear stiffness of bare steel deck through shell finite element models. G. Bian, B.W. Schafer. June 2017

In-plane shear stiffness of bare steel deck through shell finite element models. G. Bian, B.W. Schafer. June 2017 In-pane shear stiffness of bare stee deck through she finite eement modes G. Bian, B.W. Schafer June 7 COLD-FORMED STEEL RESEARCH CONSORTIUM REPORT SERIES CFSRC R-7- SDII Stee Diaphragm Innovation Initiative

More information

Lecture Note 3: Stationary Iterative Methods

Lecture Note 3: Stationary Iterative Methods MATH 5330: Computationa Methods of Linear Agebra Lecture Note 3: Stationary Iterative Methods Xianyi Zeng Department of Mathematica Sciences, UTEP Stationary Iterative Methods The Gaussian eimination (or

More information

FFTs in Graphics and Vision. Spherical Convolution and Axial Symmetry Detection

FFTs in Graphics and Vision. Spherical Convolution and Axial Symmetry Detection FFTs in Graphics and Vision Spherica Convoution and Axia Symmetry Detection Outine Math Review Symmetry Genera Convoution Spherica Convoution Axia Symmetry Detection Math Review Symmetry: Given a unitary

More information

Partial permutation decoding for MacDonald codes

Partial permutation decoding for MacDonald codes Partia permutation decoding for MacDonad codes J.D. Key Department of Mathematics and Appied Mathematics University of the Western Cape 7535 Bevie, South Africa P. Seneviratne Department of Mathematics

More information

LECTURE NOTES 9 TRACELESS SYMMETRIC TENSOR APPROACH TO LEGENDRE POLYNOMIALS AND SPHERICAL HARMONICS

LECTURE NOTES 9 TRACELESS SYMMETRIC TENSOR APPROACH TO LEGENDRE POLYNOMIALS AND SPHERICAL HARMONICS MASSACHUSETTS INSTITUTE OF TECHNOLOGY Physics Department Physics 8.07: Eectromagnetism II October 7, 202 Prof. Aan Guth LECTURE NOTES 9 TRACELESS SYMMETRIC TENSOR APPROACH TO LEGENDRE POLYNOMIALS AND SPHERICAL

More information

8 Digifl'.11 Cth:uits and devices

8 Digifl'.11 Cth:uits and devices 8 Digif'. Cth:uits and devices 8. Introduction In anaog eectronics, votage is a continuous variabe. This is usefu because most physica quantities we encounter are continuous: sound eves, ight intensity,

More information

A Statistical Framework for Real-time Event Detection in Power Systems

A Statistical Framework for Real-time Event Detection in Power Systems 1 A Statistica Framework for Rea-time Event Detection in Power Systems Noan Uhrich, Tim Christman, Phiip Swisher, and Xichen Jiang Abstract A quickest change detection (QCD) agorithm is appied to the probem

More information

Nonlinear Analysis of Spatial Trusses

Nonlinear Analysis of Spatial Trusses Noninear Anaysis of Spatia Trusses João Barrigó October 14 Abstract The present work addresses the noninear behavior of space trusses A formuation for geometrica noninear anaysis is presented, which incudes

More information

More Scattering: the Partial Wave Expansion

More Scattering: the Partial Wave Expansion More Scattering: the Partia Wave Expansion Michae Fower /7/8 Pane Waves and Partia Waves We are considering the soution to Schrödinger s equation for scattering of an incoming pane wave in the z-direction

More information

Simplified Algorithms for Optimizing Multiuser Multi-Hop MIMO Relay Systems

Simplified Algorithms for Optimizing Multiuser Multi-Hop MIMO Relay Systems 2896 IEEE TRANSACTIONS ON COMMUNICATIONS, VO. 59, NO. 10, OCTOBER 2011 Simpified Agorithms for Optimizing Mutiuser Muti-op MIMO Reay Systems Yue Rong, Senior Member, IEEE Abstract In this paper, we address

More information

Physics 127c: Statistical Mechanics. Fermi Liquid Theory: Collective Modes. Boltzmann Equation. The quasiparticle energy including interactions

Physics 127c: Statistical Mechanics. Fermi Liquid Theory: Collective Modes. Boltzmann Equation. The quasiparticle energy including interactions Physics 27c: Statistica Mechanics Fermi Liquid Theory: Coective Modes Botzmann Equation The quasipartice energy incuding interactions ε p,σ = ε p + f(p, p ; σ, σ )δn p,σ, () p,σ with ε p ε F + v F (p p

More information

A. Distribution of the test statistic

A. Distribution of the test statistic A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch

More information

C. Fourier Sine Series Overview

C. Fourier Sine Series Overview 12 PHILIP D. LOEWEN C. Fourier Sine Series Overview Let some constant > be given. The symboic form of the FSS Eigenvaue probem combines an ordinary differentia equation (ODE) on the interva (, ) with a

More information

Introduction to LMTO method

Introduction to LMTO method 1 Introduction to MTO method 24 February 2011; V172 P.Ravindran, FME-course on Ab initio Modeing of soar ce Materias 24 February 2011 Introduction to MTO method Ab initio Eectronic Structure Cacuations

More information

Duality, Polite Water-filling, and Optimization for MIMO B-MAC Interference Networks and itree Networks

Duality, Polite Water-filling, and Optimization for MIMO B-MAC Interference Networks and itree Networks Duaity, Poite Water-fiing, and Optimization for MIMO B-MAC Interference Networks and itree Networks 1 An Liu, Youjian Eugene) Liu, Haige Xiang, Wu Luo arxiv:1004.2484v3 [cs.it] 4 Feb 2014 Abstract This

More information

A GENERAL METHOD FOR EVALUATING OUTAGE PROBABILITIES USING PADÉ APPROXIMATIONS

A GENERAL METHOD FOR EVALUATING OUTAGE PROBABILITIES USING PADÉ APPROXIMATIONS A GENERAL METHOD FOR EVALUATING OUTAGE PROBABILITIES USING PADÉ APPROXIMATIONS Jack W. Stokes, Microsoft Corporation One Microsoft Way, Redmond, WA 9852, jstokes@microsoft.com James A. Ritcey, University

More information

In Coulomb gauge, the vector potential is then given by

In Coulomb gauge, the vector potential is then given by Physics 505 Fa 007 Homework Assignment #8 Soutions Textbook probems: Ch. 5: 5.13, 5.14, 5.15, 5.16 5.13 A sphere of raius a carries a uniform surface-charge istribution σ. The sphere is rotate about a

More information

arxiv:nlin/ v2 [nlin.cd] 30 Jan 2006

arxiv:nlin/ v2 [nlin.cd] 30 Jan 2006 expansions in semicassica theories for systems with smooth potentias and discrete symmetries Hoger Cartarius, Jörg Main, and Günter Wunner arxiv:nin/0510051v [nin.cd] 30 Jan 006 1. Institut für Theoretische

More information

Estimating the Power Spectrum of the Cosmic Microwave Background

Estimating the Power Spectrum of the Cosmic Microwave Background Estimating the Power Spectrum of the Cosmic Microwave Background J. R. Bond 1,A.H.Jaffe 2,andL.Knox 1 1 Canadian Institute for Theoretica Astrophysics, Toronto, O M5S 3H8, CAADA 2 Center for Partice Astrophysics,

More information

Recursive Constructions of Parallel FIFO and LIFO Queues with Switched Delay Lines

Recursive Constructions of Parallel FIFO and LIFO Queues with Switched Delay Lines Recursive Constructions of Parae FIFO and LIFO Queues with Switched Deay Lines Po-Kai Huang, Cheng-Shang Chang, Feow, IEEE, Jay Cheng, Member, IEEE, and Duan-Shin Lee, Senior Member, IEEE Abstract One

More information

Preconditioned Locally Harmonic Residual Method for Computing Interior Eigenpairs of Certain Classes of Hermitian Matrices

Preconditioned Locally Harmonic Residual Method for Computing Interior Eigenpairs of Certain Classes of Hermitian Matrices MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.mer.com Preconditioned Locay Harmonic Residua Method for Computing Interior Eigenpairs of Certain Casses of Hermitian Matrices Vecharynski, E.; Knyazev,

More information

Sum Capacity and TSC Bounds in Collaborative Multi-Base Wireless Systems

Sum Capacity and TSC Bounds in Collaborative Multi-Base Wireless Systems IEEE TRANSACTIONS ON INFORMATION THEORY, VOL X, NO X, DECEMBER 004 1 Sum Capacity and TSC Bounds in Coaborative Muti-Base Wireess Systems Otiia Popescu, Student Member, IEEE, and Christopher Rose, Member,

More information

4 Separation of Variables

4 Separation of Variables 4 Separation of Variabes In this chapter we describe a cassica technique for constructing forma soutions to inear boundary vaue probems. The soution of three cassica (paraboic, hyperboic and eiptic) PDE

More information

Space-Division Approach for Multi-pair MIMO Two Way Relaying: A Principal-Angle Perspective

Space-Division Approach for Multi-pair MIMO Two Way Relaying: A Principal-Angle Perspective Gobecom 03 - Wireess Communications Symposium Space-Division Approach for Muti-pair MIMO Two Way Reaying: A Principa-Ange Perspective Haiyang Xin, Xiaojun Yuan, and Soung-Chang Liew Dept. of Information

More information

Rate-Distortion Theory of Finite Point Processes

Rate-Distortion Theory of Finite Point Processes Rate-Distortion Theory of Finite Point Processes Günther Koiander, Dominic Schuhmacher, and Franz Hawatsch, Feow, IEEE Abstract We study the compression of data in the case where the usefu information

More information

Feedback Schemes for Multiuser MIMO-OFDM Downlink

Feedback Schemes for Multiuser MIMO-OFDM Downlink Feedback Schemes for utiuser IO-OFD Downink Giuseppe Caire EE Department University of Southern Caifornia Los Angees, CA 90089 caire@usc.edu Hooman Shirani-ehr EE Department University of Southern Caifornia

More information

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is

More information

Impact of Line-of-Sight and Unequal Spatial Correlation on Uplink MU- MIMO Systems

Impact of Line-of-Sight and Unequal Spatial Correlation on Uplink MU- MIMO Systems Impact of ine-of-sight and Unequa Spatia Correation on Upin MU- MIMO Systems Tataria,., Smith, P. J., Greenstein,. J., Dmochowsi, P. A., & Matthaiou, M. (17). Impact of ine-of-sight and Unequa Spatia Correation

More information

TWO DENOISING SURE-LET METHODS FOR COMPLEX OVERSAMPLED SUBBAND DECOMPOSITIONS

TWO DENOISING SURE-LET METHODS FOR COMPLEX OVERSAMPLED SUBBAND DECOMPOSITIONS TWO DENOISING SUE-ET METHODS FO COMPEX OVESAMPED SUBBAND DECOMPOSITIONS Jérôme Gauthier 1, aurent Duva 2, and Jean-Christophe Pesquet 1 1 Université Paris-Est Institut Gaspard Monge and UM CNS 8049, 77454

More information

Applied Nuclear Physics (Fall 2006) Lecture 7 (10/2/06) Overview of Cross Section Calculation

Applied Nuclear Physics (Fall 2006) Lecture 7 (10/2/06) Overview of Cross Section Calculation 22.101 Appied Nucear Physics (Fa 2006) Lecture 7 (10/2/06) Overview of Cross Section Cacuation References P. Roman, Advanced Quantum Theory (Addison-Wesey, Reading, 1965), Chap 3. A. Foderaro, The Eements

More information

Discrete Techniques. Chapter Introduction

Discrete Techniques. Chapter Introduction Chapter 3 Discrete Techniques 3. Introduction In the previous two chapters we introduced Fourier transforms of continuous functions of the periodic and non-periodic (finite energy) type, we as various

More information

Mode in Output Participation Factors for Linear Systems

Mode in Output Participation Factors for Linear Systems 2010 American ontro onference Marriott Waterfront, Batimore, MD, USA June 30-Juy 02, 2010 WeB05.5 Mode in Output Participation Factors for Linear Systems Li Sheng, yad H. Abed, Munther A. Hassouneh, Huizhong

More information