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

Size: px
Start display at page:

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

Transcription

1 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 Engineering, Beihang University, Beijing 191, China; eeiuxiao@buaa.edu.cn X.L.);.bai@buaa.edu.cn L.B.) 2 Coaborative Innovation Center of Geospatia Technoogy, Wuhan 4379, China 3 Beijing Key Laboratory for Network-Based Cooperative Air Traffic Management, and Beijing Laboratory for Genera Aviation Technoogy, Beijing 191, China 4 Schoo of Eectrica Engineerng and Computer Science, Gwangju Institute of Science and Technoogy GIST), Gwangju 65, Korea; jchoi114@gist.ac.kr 5 Schoo of Eectronics and Information Engineering and the Key Laboratory of Embedded System and Service Computing, Tongji University, Shanghai 92, China; pengfei.xia@gmai.com 6 Department of Eectrica and Computer Engineering, University of Deaware, Newark, DE 19716, USA; xianggen@ude.edu * Correspondence: xiaozy@buaa.edu.cn; Te.: ext. 6249) Academic Editors: He Henry) Chen, Yonghui Li, Kei Sakaguchi and Yong Li Received: 26 Apri 16; Accepted: 14 Juy 16; Pubished: 21 Juy 16 Abstract: In this paper, we study beamforming based fu-dupex FD) systems in miimeter-wave mmwave) communications. A joint transmission and reception Tx/Rx) beamforming probem is formuated to maximize the achievabe rate by mitigating sef-interference SI). Since the optima soution is difficut to find due to the non-convexity of the objective function, suboptima schemes are proposed in this paper. A ow-compexity agorithm, which iterativey maximizes signa power whie suppressing SI, is proposed and its convergence is proven. Moreover, two cosed-form soutions, which do not require iterations, are aso derived under minimum-mean-square-error MMSE), zero-forcing ZF), and maximum-ratio transmission MRT) criteria. Performance evauations show that the proposed iterative scheme converges fast within ony two iterations on average) and approaches an upper-bound performance, whie the two cosed-form soutions aso achieve appeaing performances, athough there are noticeabe differences from the upper bound depending on channe conditions. Interestingy, these three schemes show different robustness against the geometry of Tx/Rx antenna arrays and channe estimation errors. Keywords: fu dupex; sef-interference canceation; beamforming; miimeter-wave; mmwave 1. Introduction Fu-dupex wireess communications FDWC) for simutaneous transmission and reception Tx/Rx) in the same frequency band [1 5] have attracted increasing attention recenty due to the potentia of doubing the spectrum efficiency. However, in order to achieve FDWC, the sef-interference SI) generated from a oca transmitter to a oca receiver must be mitigated for satisfactory performances [1,6], and this constitutes one of the critica chaenges in FDWC. There are basicay three different approaches for SI canceation. The first one is radio-frequency RF) canceation or anaog canceation), where the RF signa to be transmitted at the Tx is expoited as a reference RF signa for SI canceation in the Rx RF chain [1,3,4,7]. The second one is antenna canceation, where mutipe transmit receive) antennas are carefuy paced to generate two repicas with opposite phases [8,9] such that canceation can be achieved by just adding these two repicas. The third one is digita canceation, which is generay used together with RF or antenna canceation Sensors 16, 16, 113; doi:.339/s

2 Sensors 16, 16, of 22 to further mitigate the residua SI at baseband [1,3 5,8,9]. Bharadia et a. [] showed that fu-dupex FD) radio with a combined canceation approach is abe to cance about 1 db SI. In this paper, we consider a beamforming-based approach to mitigate SI for FDWC. A distinct advantage of this approach is that with beamforming canceation, some of the conventiona RF, antenna and baseband canceation operations may be avoided, and this greaty reduces the system compexity. Beamforming canceation is particuary meaningfu for miimeter wave mmwave) wireess communications, where arge antenna arrays are typicay required to compensate for the high pass oss in the mmwave frequency band [11 19]. Note that athough frequency re-use may be easier for mmwave communication since the pass oss is high for mmwave signa, more spectrum efficiency is amost aways a pus. To improve the spectra efficiency for mmwave communication may be aways favored for certain scenarios, e.g., mmwave backhau appications, where high capacity is required to support high data rate. Aso, in the case of mmwave ceuar with dense users, e.g., stadiums and movie theaters, FD transmission can significanty increase the muti-user capacity. On the other hand, the FD mmwave communication does not significanty increase the system compexity. To iustrate this, et us compare the compexity of an FD-mmWave node and that of a reguar mmwave node with frequency-division dupex FDD). There are a Tx RF chain and Tx antenna array, as we as a Rx RF chain and a Rx antenna array, at both the FD-mmWave node and the reguar FDD mmwave node. The ony difference is that at the FD-mmWave node the Rx needs to mitigate SI, whie at the reguar FDD mmwave node, the Rx does not need to mitigate SI. For FD-mmWave communication, SI canceation can be done by using the beamforming technoogy proposed in this paper, which ony needs to contro the antenna weight vectors and amost does not increase the system compexity. In brief, if beamforming technoogy is adopted to mitigate the SI, the compexity of an FD-mmWave node is simiar to that of a reguar FDD mmwave node. However, in order to reaize FD in mmwave communications, we face a joint Tx/Rx beamforming JTR-BF) probem to maximize the Tx/Rx achievabe rate. As this probem is non-convex, suboptima soutions are expected. The existing JTR-BF schemes proposed in mmwave communications are basicay infeasibe, because SI was not considered in these schemes [13, 26]. Athough the mitigation of oopback SI [27,28] as we as the utiization of oopback SI [29,3] are considered in mutipe-input mutipe-output MIMO) reays, these methods cannot be empoyed in our setup, as their signa modes are buit for reay systems, but in this paper a bi-directiona FD transmission system is considered. In [31], digita beamforming to cance SI in FDWC was studied from an experimenta perspective, where the JTR-BF with SI was not anayticay investigated. Athough some suboptima distributed soutions proposed for the K-user interference aignment IA) probem [32 35], e.g., the max-signa-to-interference-pus-noise-ratio Max-SINR), maximum power Max-Power), minimum eakage Min-Leakage), and minimum-mean-square-error MMSE) schemes [35], may be appicabe, they are a iterative soutions designed for genera K-user IA probems. Appying them to FD mmwave communications woud resut in high computationa compexity for arge antenna arrays. Moreover, the convergence of some of them is not yet proven in the iterature [35] to the best of our knowedge. In this paper, we propose severa suboptima soutions to the JTR-BF probem for FD mmwave communications. Firsty, an iterative agorithm, which iterativey maximizes the signa power with zero-forcing ZF) SI ZF-Max-Power), is proposed, and its convergence is proven. Next, two cosed-form soutions are derived under MMSE, ZF, and maximum-ratio transmission MRT) criteria, namey a ower bound based MMSE soution LB-MMSE) and ZF SI with MRT SI-ZF-MRT), where iterations are not required. Performance evauations show that ZF-Max-Power approaches an upper bound on the joint achievabe rate, and it needs ony two iterations on average to achieve the convergence with random initia points. These performances of ZF-MAx-Power are amost the same as those of the best baseine for the IA probem [32 35], namey Max-SINR. However, the convergence of Max-SINR is unproven yet [35] to the best of our knowedge, and the computationa compexity of ZF-Max-Power is significanty ower than that of Max-SINR since matrix inversion is not needed.

3 Sensors 16, 16, of 22 The two cosed-form soutions achieve suboptima performances to the upper bound depending on channe conditions. In addition, ZF-Max-Power and SI-ZF-MRT are robust against the geometry of Tx/Rx antenna arrays due to the operation of ZF SI, whie LB-MMSE is not. ZF-Max-Power and LB-MMSE are robust against channe estimation errors, whie SI-ZF-MRT is not. These resuts verify the feasibiity of FD mmwave communication and the effectiveness of beamforming canceation. The rest of this paper is organized as foows. In Section 2, we introduce the system mode and formuate the probem. In Section 3, we study the optimization probem, propose the ZF-Max-Power approach, and conduct the convergence anaysis and compexity comparison. In Section 4, we propose the two cosed-form beamforming schemes, namey LB-MMSE and SI-ZF-MRT. In Section 5, we present performance evauations. The concusions are drawn asty in Section 6. Notation: a, a, A, and A denote a scaar variabe, a vector, a matrix, and a set, respectivey. ), ) T and ) H denote conjugate, transpose and conjugate transpose, respectivey. In addition, [x 1, x 2,..., x M ] denotes a row vector with its eements being x i. Some other operations used in this paper are defined as foows. E{ } Expectation operation. x Absoute vaue of scaar variabe x. x 2-norm of vector x. x, y Inner product, equas to y H x. x Optima vaue of variabe x. 2. System Mode and Probem Formuation 2.1. System Mode An FD mmwave communication system consisting of two nodes, namey Node #1 and Node #2, is iustrated in Figure 1. Each node is equipped with a transmit antenna array and a receive antenna array, and supports ony one data stream [21,22,36]. We denote by n t1 and n t2 the numbers of antenna eements of the transmit arrays at Node #1 and Node #2, respectivey, whie by n r1 and n r2 those of the receive arrays at Node #1 and Node #2, respectivey. In our mode, Node #1 transmits signas to Node #2 and receives signas from Node #2 simutaneousy; thus both the nodes suffer from SI transmitted by the oca transmitters. It is noteworthy that athough we depict separate antenna arrays for the Tx/Rx chains in Figure 1 this structure is indeed common in FDWC [1,3 5,8]), the Tx/Rx chains may aso share the same antenna array [1,]. Fortunatey, our signa mode is suitabe for both cases. Note that the SI with a shared array may be even higher than with separate arrays. Node #1 Far fied Node #2 Tx Rx Near Fied Near Fied Rx Tx Figure 1. Iustration of the FD mmwave communication system.

4 Sensors 16, 16, of Channe Mode As we can see from Figure 1, there are two types of channes. The first one is the communication channe, which represents the channe for information-bearing signas exchanged between Node #1 and Node #2, i.e., H 12 and H 21, where H ij represents the channe from Node #i to Node #j. The other one is the SI channe. Ceary, H 11 and H 22 are the SI channes Communication Channe We first consider the mode of communication channe. Since the distance between these two nodes is generay much greater than the waveength of mmwave, the commony used far-fied channe mode, which has a pane wavefront, is suitabe for H 12 and H 21. According to channe measurement resuts for mmwave communication [13,37], mosty refection contributes to generating mutipath components MPCs) besides the LOS component; scattering and diffraction effects are itte due to the extremey short waveength of mmwave communication. Thus, the MPCs in mmwave communication have a feature of directivity [22 24,38,39], i.e., different MPCs have different physica anges of departure AoDs), i.e., θ m 12) and θ 21), as we as anges of arriva AoAs), e.g., φ m 12) and φ 21), as shown in Figure 1. In genera, mmwave signas have a wide band, and thus a frequency seective channe may be suitabe [4]. However, with beamforming ony a very sma number or even ony one) of strong MPCs may be searched out to form beams between Tx and Rx. As a resut, the effect of deay spread may be substantiay mitigated [41]. Due to this reason, a frequency fat channe mode is extensivey used in mmwave communication [22 24,38,39], and the narrow band) communication channes can be expressed as H 12 = n t1 n r2 M m=1 α m g 12 φ m 12) )h H 12 θ12) m ) 1) and H 21 = n t2 n r1 L =1 β g 21 φ 21) )h H 21 θ21) ) 2) where M and L are the numbers of MPCs, α m and β are the coefficients of MPCs, g 12 φ m 12) ) and g 21 φ 21) ) are receive steering vectors, h 12 θ m 12) ) and h 21 θ 21) ) are transmit steering vectors of H 12 and H 21, respectivey. For uniform inear arrays ULAs) with haf-waveength spacing, these steering vectors are defined as Equation 4), and they are a functions of the corresponding steering anges. Athough ULA is adopted in this paper, the deveoped schemes are aso feasibe for other types of arrays, ike uniform panar array UPA) or circuar array, because different types of arrays affect ony the channe matrices. For convenience, we have the foowing normaization: M E{ α m 2 L } = E{ β 2 } = 1. 3) m=1 =1 In the case of Tx/Rx sharing the same antenna array at a node, we have n r1 = n t1, n r2 = n t2, L = M, θm 12 = φm 21, θm 21 = φm 12, and α m = β m, m = 1, 2,..., M, i.e., parameters of H 12 are the same as those of H 21. However, since Tx/Rx have different RF chains [1,], the beamforming and combining vectors are basicay different. Note that for mmwave communications there may be other modes. For instance, in [42] a custered channe mode was adopted, where the channe incudes severa custers, and a custer consists of many MPCs with sma ange differences. Different modes are suitabe for different communication circumstances. As our schemes do not expoit the specific feature of the communication channe, they can be used for different modes.

5 Sensors 16, 16, of 22 g 12 φ m 12) [ ) = exp jπ cosφ m 12) ) ), exp jπ1 cosφ m 12) ) ),..., exp g 21 φ 21) [ ) = exp jπ cosφ 21) ) ), exp jπ1 cosφ 21) ) ),..., exp h 12 θ m 12) [ ) = exp jπ cosθ m 12) ) ), exp jπ1 cosθ m 12) ) ),..., exp h 21 θ 21) [ ) = exp jπ cosθ 21) ) ), exp jπ1 cosθ 21) ) ),..., exp jπn r2 1) cosφ 12) m ))] T/ nr2 jπn r1 1) cosφ 21) ))] T/ nr1 jπn t1 1) cosθ 12) m ))] T/ nt1 jπn t2 1) cosθ 21) ))] T/ nt2 4) SI Channe Next, we consider the strength of SI and the SI channe. Note that even in mmwave band, where the center frequency is high and the signa strength attenuates rapidy, SI may be sti much more significant than the background noise, because Tx/Rx antennas ocate cose to each other in FD mmwave communication. For instance, if the waveength of the carrier frequency is 1 mm, the signa bandwidth is 1 GHz, and the transmission power is dbm, according to the Friis formua, the SI at a position cm λ) away from a transmit antenna is og 4π ) = 42 dbm, which is much greater than a typica noise power σ 2 = og κtb) = og ) = dbm, where κ, T, B are the Botzmann constant, ambient temperature and bandwidth, respectivey. Hence, SI shoud be taken into account in FD mmwave communication. As the distance between the transmit and receive arrays at each node is short in portabe devices, the far-fied range condition, i.e., R 2D 2 /λ [43], may not hod for SI channe, where D is the diameter of the antenna aperture, λ is the waveength of the carrier. For instance, considering a haf-waveength spaced ULA with 64 eements, the far-fied range shoud satisfy R 232λ) 2 /λ = 48λ, which is basicay too arge for sma-size devices ike mobie phones or aptops even at the mmwave band. Thus, the SI channes may empoy the near-fied mode, which has a spherica wavefront [43 47]. In such a case, the SI channes highy depend on the pacement of the transmit and receive arrays as we as the circumstances. In this paper we consider an antenna pacement as shown in Figure 2. The distance between the first eements of the two arrays is d, and the ange between these two ULAs is ω. Athough this pacement together with the two parameters, i.e., d and ω, cannot cover a the possibe antenna pacements, it aows us to perform tractabe anaysis. Moreover, it can refect the effects of two typica factors of antenna pacement, i.e., the distance and ange between these two arrays, on the beamforming performance. With this antenna pacement, the coefficient corresponding to the jth row and ith coumn of H 11 or H 22 is [43 47]. [H 11 or H 22 ] ij = h ij = ρ exp j2π r ) ij r ij λ where r ij is the distance between the i-th eement of the transmit array and the j-th eement of the receive array, and ρ is a constant for power normaization such that trh 11 H H 11 ) = n t1n r1 and trh 22 H H 22 ) = n t2n r2. The expression for r ij is shown in Equation 6). ) 2 ) 2 ) ) r ij = d tanω) + j 1) λ 2 + d sinω) + i 1) λ 2 2 d tanω) + j 1) λ d 2 sinω) + i 1) λ 2 cosω) 6) In the case of Tx/Rx sharing the same antenna array, we have d = and ω =. The SI channe mode adopted in this paper is a simpified one, which is typica [46,47] but not necessariy accurate. In practice, the SI channe can be very compicated, incuding signa refection, scattering and the couping effects between adjacent antennas. Hence, it is very difficut, if not impossibe, to eaborate an accurate SI channe. On the other hand, the proposed schemes can be used 5)

6 Sensors 16, 16, of 22 for arbitrary SI channes, incuding the competey accurate one. Hence, we adopt the simpe and typica mode shown in Equation 6) here, which can refect the robustness of the proposed schemes against the geometry of the Tx/Rx antenna arrays within a node. Transmit Array Receive Array Figure 2. The transmit and receive antenna arrays of a node Probem Formuation With the above system and channe modes, the received signas at Node #1 and Node #2 are written as y 1 = w H r1 ε 21 H 21 w t2 s 2 + ε 11 H 11 w t1 s 1 + n 1 ) 7) and y 2 = w H r2 ε 12 H 12 w t1 s 1 + ε 22 H 22 w t2 s 2 + n 2 ) 8) respectivey, where s 1 and s 2 are the transmitted symbos with unit power at Node #1 and Node #2, respectivey, ε 21 and ε 12 are the average powers of the desired received signas, ε 11 and ε 22 are the average powers of the SI, n 1 and n 2 are the Gaussian white noise vectors with E{n 1 n H 1 } = I n r1 and E{n 2 n H 2 } = I n r2, respectivey, w t1 and w t2 are the transmit antenna weight vectors AWVs), and w r1 and w r2 are the receive AWVs. The two-norms of a these AWVs are normaized to 1. With the transmit and receive AWVs, the joint achievabe rate JAR) can be expressed as R =og ε 21 w H r1 H ) 21w t ε 11 w H r1 H + 11w t1 2 og2 1 + ε 12 w H r2 H ) 12w t ε 22 w H r2 H 22w t2 2 where ε 11 w H r1 H 11w t1 2 and ε 22 w H r2 H 22w t2 2 are the average powers of SI at Nodes #1 and #2, respectivey. The JTR-BF probem is formuated as 9) maximize w t1,w r1,w t2,w r2 R subject to w t1 2 = w r1 2 = 1 w t2 2 = w r2 2 = 1 ) As the main purpose of this paper is to investigate the feasibiity of FD mmwave communications and evauate the performance of beamforming canceation, the channe matrices and powers in Equation ) are assumed known a-priori. In practice, these parameters can be estimated provided that the channe does not change too fast. For instance, as an mmwave communication channe has the feature of directivity and is sparse in the ange domain, schemes ike AoD/AoA estimation [48], beam searching [26,39,49], iterative training [22,5], and even compressed sensing [51,52] can be adopted for the communication channe estimation. The estimation of SI channe can be more straightforward, e.g., one can estimate a scaar channe coefficient between a singe Tx/Rx antenna pair i.e., the i-th transmit antenna and the j-th receive antenna) once a time. After n ri n ti i = 1, 2) measurements, the SI channe matrix can be estimated. Athough n ri n ti is arge in mmwave communication, each measurement may

7 Sensors 16, 16, of 22 require ony one symbo thanks to the high strength of SI, rather than a ong training sequence ike those in [22,26,39,49 51]. Thus, the time cost of the SI channe estimation is yet affordabe. In addition, in our mode both ampitudes and phases of the AWVs are controabe. In fact, a constant-ampitude CA) array with ony phases controabe has ower compexity [22,26,39,49,51]. An N-eement CA array needs N phase shifters, which are not difficut to impement. In contrast, an N-eement array with both ampitudes and phases controabe requires N phase shifters and N variabe gain ampifier. Hence, a CA array has a ower compexity than an ampitude-and-phase-controabe array, especiay when N is arge, and thus is favored in mmwave communications, where N is arge in genera. However, the array structure without the CA constraint cannot be definitey rued out, because it aso arouses particuar attention in both agorithm design [23,24,5,53,54] and impementation [55]. Moreover, the performance achieved with non-ca-constraint arrays can be seen as a bound achieved with the CA arrays, if the same scheme is adopted. Therefore, in this paper we adopt the arrays without the CA constraint to investigate the feasibiity of FD mmwave communication and evauate the beamforming performance, etting the probem with CA constraint be a further work. 3. The ZF-Max-Power Approach It is cear that the JAR in Equation ) is not a concave function, and the equaity constraints are not affine. Thus, Equation ) is not a convex/concave probem, and its gobay optima soution is hard to find. Consequenty, we first give an upper bound JAR, and then propose the ZF-Max-Power approach in this section Upper Bound of the JAR According to Equation 9), since ε 11 w H r1 H 11w t1 2 and ε 22 w H r2 H 22w t2 2, an upper bound function on the JAR, denoted by R ub, in the presence of SI can be easiy obtained as R og ε 21 w H r1 H 21w t2 2) + og ε 12 w H r2 H 12w t1 2) R ub 11) The corresponding optima AWVs for R ub are w t1 = RpSingVectH 12 ), w t2 = RpSingVectH 21 ) w r1 = LpSingVectH 21 ), w r2 = LpSingVectH 11 ) 12) where LpSingVectX) and RpSingVectX) represent the eft and right principa singuar vectors of X, respectivey. Thus, we have R R ub R ub < 13) where R ub is the maximum of the upper bound R ub, and thus it is an upper bound on R The ZF-Max-Power Approach As there are mutipe couped variabes in Equation ), we consider using the aternating optimization AO) approach [56] to obtain a suboptima soution of Equation ). The basic idea of AO is to aternatey optimize a few parameters, and assume the other parameters fixed and known [56]. In each round, a sub-probem with a few parameters are formuated and soved. Generay, this approach requires that the optima soution to each sub-probem can be found. However, for the probem in Equation ), the AO approach cannot be directy used, because, as we can see, even given w r1 and w r2, optima w t1 and w t2 sti cannot be easiy found. To make the AO approach feasibe, we propose the ZF-Max-Power scheme in this paper. The motivation of this scheme is as foows. Since the SI is usuay significant in FD mmwave communication, we can force the SI to zero and maximize the signa power. In particuar, we add

8 Sensors 16, 16, of 22 a constraint that the SI is competey mitigated. probem becomes maximize R ub w t1,w r1,w t2,w r2 subject to w t1 2 = w r1 2 = 1 In such a case, we have R = R ub, and the w t2 2 = w r2 2 = 1 w H r1 H 11w t1 = w H r2 H 22w t2 = Since we have added a new constraint to the origina probem in Equation ), the soution of the new probem in Equation 14) is suboptima to the origina probem. To sove the new probem in Equation 14), we need the foowing resut. Lemma 1. Given an arbitrary set of ineary independent vectors {a i C L 1 } i=1,2,...,n; N<L and an arbitrary vector a C L 1, the vector b C L 1 that maximizes b, a 2 with the constraint that b, a i = i=1,2,...,n and b = 1 is before normaization) b = a N i=1 a, b i b i, where b 1 = a 1 / a 1 and Proof. See Appendix A. b i = 14) a i i 1 j=1 a i, b j b j a i i 1 j=1 a i, b j b j, i > 1 ) Specificay, when N = 1 the optima b in Lemma 1 before normaization is b = a a, a 1 a 1 a 1 a 1 16) and when N = 2 the optima b in Lemma 1 before normaization is where b = a a, b 2 = a 2 a 2, a 2 a 2, a 1 a 1 a 1 a 1 a, b 2 b 2 17) a 1 a 1 a 1 a 1 a 1 a 1 a 1 a 1 18) Let us go back to the ZF-Max-Power scheme. According to Equation 16), given fixed w t1 and w t2, the optima w r1 and w r2 for Equation 14) before normaization) are w r1 = H 21 w t2 H 21 w t2, H 11 w t1 H 11 w t1 H 11w t1 H 11 w t1 19) and w r2 = H 12 w t1 H 12 w t1, H 22 w t2 H 22 w t2 H 22w t2 H 22 w t2 respectivey. Simiary, given fixed w r1 and w r2, the optima w t1 and w t2 for Equation 14) before normaization) are w t1 = H H 12 w r2 H H 12 w H H 11 r2, w r1 H H 11 w r1 HH 11 w r1 H H 11 w 21) r1 and w t2 = H H 21 w r1 H H 21 w r1, H H 22 w r2 H H 22 w r2 HH 22 w r2 H H 22 w r2 respectivey. Finay, the ZF-Max-Power scheme can be summarized as in Agorithm 1. ) 22)

9 Sensors 16, 16, of 22 Agorithm 1 The ZF-Max-Power Scheme. 1) Initiaize: Initiaize the transmit AWVs as w t1 = RpSingVectH 12 ), w t2 = RpSingVectH 21 ). 2) Iteration: Iterate the foowing process ρ times, then stop. Compute w r1 and w r2 according to Equations 19) and ), respectivey; then normaize them. Compute w t1 and w t2 according to Equations 21) and 22), respectivey; then normaize them. 3) Resut: w t1 and w t2 are the transmit AWVs, and w r1 and w r2 are the receive AWVs. It is noted that there are various stopping rues for the ZF-Max-Power scheme. A simpe one is to stop after a certain number of iterations, e.g., ρ iterations used in Agorithm 1. Another one is to compute R ub after the n-th iteration and get R n) ub according to Equation 9). When Rn) ub /Rn 1) ub < µ, stop the iteration, where µ is a predefined threshod sighty greater than 1, e.g., µ = Convergence Anaysis and Compexity Comparison To prove the convergence of the ZF-Max-Power scheme, we need the foowing theorem. Theorem 1. Let R n) denote the vaue of R after the n-th iteration. Then {R n) n = 1, 2,...} is a non-descending sequence, i.e., R n+1) R n). Proof. See Appendix B. According to Equation 13), R R ub <. Thus, {Rn) n = 1, 2,...} converges to a suboptima vaue, which guarantees the convergence of ZF-Max-Power. On the other hand, the computationa compexity of ZF-Max-Power is much ower than that of Max-SINR [35]. For simpicity, suppose n t1 = n t2 = n r1 = n r2 = N. According to Agorithm 1, in each iteration the main compexity of ZF-Max-Power ies in mutipications between a channe matrix and an AWV, as shown in Equations 19) 22). Hence, the computationa compexity of ZF-Max-Power is roughy ON 2 ), because there are about N 2 scaar mutipications for a mutipication of a channe matrix and an AWV. In contrast, according to [35] matrix inversion is required in each iteration of Max-SINR. Hence, Max-SINR has a computationa compexity of ON 3 ), which is significanty higher than that of ZF-Max-Power, especiay in FD mmwave communication where N is arge. 4. Cosed-Form Soutions In this section, we consider different criteria for the JTR-BF probem that provide us with cosed-form soutions LB-MMSE It is natura to perform receive and transmit beamforming separatey when considering cosed-form soutions. According to Equation 9), an optima soution can be achieved for receive beamforming by using the MMSE approach which is equivaent to maximizing the SINR. However, for transmit beamforming, the optima soution is hard to find. Thus, we propose to optimize the ower bound on the JAR with MMSE, and the method is referred to as the ower bound MMSE LB-MMSE) approach.

10 Sensors 16, 16, 113 of 22 According to Equation 9), we have ε 21 w H r1 R og H 21w t2 2 ε 12 w H r2 H ) 12w t1 2 2 w H r1 w r1 + ε 11 w H r1 H 11w t1 2 w H r2 w r2 + ε 22 w H r2 H 22w t2 2 ε 21 w H r1 = og H 21w t2 w H t2 HH 21 w r1 ε 12 w H 2 w H r1 I + ε11 H 11 w t1 w H ) r2 H 12w t1 w H t1 HH 12 w ) 23) r2 t1 HH 11 wr1 w H r2 I + ε22 H 22 w t2 w H ) R 1 t2 HH 22 wr2 First, we find w r1 and w r2 to maximize the ower bound R 1 by temporay treating w t1 and w t2 as fixed parameters. This subprobem is actuay to maximize SINR or minimize MSE) at the two nodes. According to Lemma 2 in Appendix C, the optima w r1 and w r2 before normaization) can be respectivey found as 1H21 w r1 = I + ε 11 H 11 w t1 w H t1 11) HH w t2 ) 1H12 24) w r2 = I + ε 22 H 22 w t2 w H t2 HH 22 w t1 With these two receive AWVs, we further have Equation ), where inequaities a) and b) are based on Lemmas 3 and 4, respectivey, in Appendix C. ) ) 1H21 ) )) 1H12 R 1 = og 2 ε 12 ε 21 w H t2 HH 21 I + ε 11 H 11 w t1 w H t1 HH 11 w t2 w H t1 HH 12 I + ε 22 H 22 w t2 w H t2 HH 22 w t1 a) og 2 b) og 2 = og 2 w H ε 12 ε t2 H H 21 H ) 2 21w t2 21 w H t2 HH 21 I + ε11 H 11 w t1 w H t1 HH 11 ε 12 ε 21 ε 12 ε 21 w H t1 w H t2 w H t2 HH 21 H 21w t2 w H I + ε11 H H 11 H ) t1 HH 12 H 12w t1 11 wt1 I + ε22 H H 22 H 22 w H t2 w H ) t1 H H 12 H ) 2 ) 12w t1 H21 w t2 w H t1 HH 12 I + ε22 H 22 w t2 w H ) t2 HH 22 H12 w t1 ) ) wt2 w H t2 HH 21 H 21w t2 w H I + ε22 H H 22 H ) t1 HH 12 H ) 12w t1 22 wt2 I + ε11 H H 11 H ) R 2 11 wt1 w H t1 ) Next, et us find w t1 and w t2 to maximize the ower bound R 2. This subprobem is equivaent to the foowing two optimization probems: arg w t1 max w H t1 w H t1 HH 12 H 12w t1 I + ε11 H H 11 H 26) 11) wt1 and arg w t2 max w H t2 These are generaized Rayeigh quotient probems, before normaization) are w H t2 HH 21 H 21w t2 I + ε22 H H 22 H 27) 22) wt2 ) ) 1H w t1 = peigvect I + ε 11H H 11 H H H 12 and the optima transmit AWVs 28) and ) ) 1H w t2 = peigvect I + ε 22H H 22 H H H 21 29) respectivey, where peigvectx) denotes the principa eigenvector of X. In brief, by expoiting the proposed LB-MMSE, the transmit AWVs are computed as Equations 28) and 29), respectivey. Based on the transmit AWVs, the receive AWVs before normaization) are found as Equation 24).

11 Sensors 16, 16, of SI-ZF-MRT In this scheme, we first consider transmit beamforming by adopting MRT, and then use ZF to suppress the SI for receive beamforming. This approach is referred to as SI-ZF-MRT. By expoiting MRT for transmit beamforming, we have To suppress the SI, we have w t1 = H H 12 w r2; w t2 = H H 21 w r1 3) w H r1 H 11H H 12 w r2 = = w H r2 H 22H H 21 w r1 31) There are many soutions of w r1 and w r2 for Equation 31). Among those, we want to find the receive AWVs to maximize JAR whie satisfying Equation 31). With Equations 3) and 31), the JAR becomes R = og ε 21 w H r1 H 21H H 21 w r1 2) + og ε 12 w H r2 H 12H H 12 w r2 2) 32) There are two options to design w r1 and w r2. One is to first derive w r1 that maximizes Equation 32) without considering the constraint Equation 31); then derive w r2 to optimize Equation 32) with Equation 31) satisfied. With this option, we have and ) w r1 = peigvect H 21 H H 21 w r2 = a a, where a = peigvect H 12 H H 12), a1 = H 12 H H 11 w r1, and b 2 = H 22H H 21 w r1 H 22 H H 21 w r1, H 22 H H 21 w r1 H 22 H H 21 w r1, 33) a 1 a 1 a 1 a 1 a, b 2 b 2 34) a 1 a 1 a 1 a 1 a 1 a 1 a 1 a 1 35) The other one is simiar to the first one but with the positions of w r1 and w r2 exchanged. With this option, we have ) w r2 = peigvect H 12 H H 12 36) and w r1 = a a, where a = peigvect H 21 H H 21), a1 = H 11 H H 12 w r2, and b 2 = H 21H H 22 w r2 H 21 H H 22 w r2, H 21 H H 22 w r2 H 21 H H 22 w r2, a 1 a 1 a 1 a 1 a, b 2 b 2 37) a 1 a 1 a 1 a 1 a 1 a 1 a 1 a 1 38) In brief, for SI-ZF-MRT, the two options are i) to find the receive AWVs according to Equations 33) and 34), and then obtain the transmit AWVs according to Equation 3); ii) to find the receive AWVs according to Equations36) and 37), and then obtain the transmit AWVs according to Equation 3). Therefore, the one which has a higher JAR can be seected as the soution for SI-ZF-MRT. Simiar to SI-ZF-MRT, SI-ZF-maximum-ratio combining MRC) is aso appicabe to the joint beamforming probem. With SI-ZF-MRC, receive beamforming is firsty performed by using MRC. Afterwards, transmit beamforming is carried out to maximize the JAR with the SI forced to zero. Since SI-ZF-MRC is simiar to SI-ZF-MRT in formuation and performance, we do not present the detais here.

12 Sensors 16, 16, of Steering Beamforming The conventiona SBF in mmwave communication can aso be introduced here to compare with the aternatives. SBF does not require fu channe information. Instead, it ony requires the knowedge of the transmit and steering vectors for the most significant MPC of the communication channe, and does not consider the SI. Suppose the m-th and -th mutipath components are the most significant ones from Node #1 to Node #2 and from Node #2 to Node #1, respectivey. By using SBF, the AWVs become w t2 = h 21 θ 21) ), w t1 = h 12 θ m 12) ) w r1 = g 21 φ 21) ), w r2 = g 12 φ 12) m ) By comparing the performance of SBF with those of the proposed schemes, we can see whether or not it is infeasibe not to consider the SI in FD mmwave communication, and how much performance degradation it causes if we do not consider the SI in beamforming. 5. Simuation Resuts In this section, we present the performances of a the invoved schemes through numerica simuations, where the communication channe mode and the SI channe mode introduced in Section 2 are adopted. In a the evauations, the near-fied SI channes are deterministic, and are decided by Equation 5); whie the far-fied signa channes are random. Both LOS and non-los NLOS) channes are considered for the communication channes. For NLOS channe, the transmit and receive steering anges are randomy generated within [, 2π), and the coefficients obey circuary symmetric compex Gaussian distribution with the same average power. For LOS channe, the LOS component has a fixed coefficient and fixed transmit and receive steering anges, whie the other NLOS components have random steering anges and coefficients with average power db ower than the LOS component. The tota power of a generated channe obeys Equation 3), and the tota number of MPCs is 3 We ve aso simuated with other numbers of MPCs, and simiar resuts were obtained.). For each curve in a the figures in this section, we have generated reaizations with the LOS or NLOS channe modes, and computed the average JAR based on these reaizations. Moreover, we have considered both types of array settings in the evauations, namey Tx/Rx have separate antenna arrays and the same antenna array at a node. In a the simuations, n t1 = n r1 = n t2 = n r2 = 32. Firsty, we consider the JAR and convergence performances of the ZF-Max-Power scheme with random initia transmit AWVs, which are shown in Figure 3 with reevant parameters isted in the caption. Both cases of separate arrays and the same array are incuded under LOS/NLOS channes. As ZF-Max-Power is an iterative method, we compare it with Max-SINR, which achieves the best performance within the typica soutions for the IA probem [35]. It is observed that ZF-Max-Power achieves a suboptima performance cose to the upper bound after convergence, under both LOS and NLOS channes, especiay with separate arrays. The sight superiority of the case with separate arrays is due to that the different channe parameters of H 12 and H 21 provide more degrees of spatia freedoms for beamforming than the case of the same array, where the channe parameters are the same. Moreover, the convergence speed of ZF-Max-Power is fast in a the cases. Basicay, ony two iterations are required to achieve convergence. Interestingy, under the considered scenario, ZF-Max-Power achieves amost the same JAR and convergence performances as Max-SINR. However, it is noteworthy that ZF-Max-Power is a centraized iterative approach, where the iteration is performed at a certain node, and does not expoit channe reciprocity. By contrast, Max-SINR is a distributed iterative approach, where the iteration is performed at a distributed nodes by expoiting channe reciprocity. As a consequence, the convergence of ZF-Max-Power can be proven, whie that of Max-SINR is sti unproven in the iterature [35] to the best of our knowedge. Moreover, ZF-Max-Power has a significanty ower computationa compexity than Max-SINR. 39)

13 Sensors 16, 16, of JAR Bps/Hz) JAR Bps/Hz) 5 LOS, Upper Bound LOS, Sep. Arrays, ZF Max Power LOS, Same Array, ZF Max Power LOS, Sep. Arrays, Max SINR LOS, Same Array, Max SINR 5 NLOS, Upper Bound NLOS, Sep. Arrays, ZF Max Power NLOS, Same Array, ZF Max Power NLOS, Sep. Arrays, Max SINR NLOS, Same Array, Max SINR ρ ρ Figure 3. JAR and convergence performances of ZF-Max-Power with random initia transmit AWVs Left: LOS channe, Right: NLOS channe). ε 11 = ε 22 = 4 db. For LOS channe, ε 12 = ε 21 = db, whie for NLOS channe, ε 12 = ε 21 = db. For the case of separate arrays, d/λ = 1 and ω = π/6 rad, whie for the case of sharing the same array, d/λ = and ω = rad. Next, et us see the JAR performances of the proposed schemes with respect to varying ω, d, i.e., the geometry of the arrays, when separate arrays are expoited at a node. Figure 4 shows the JAR performances with respect to varying ω under LOS and NLOS channes, respectivey, where SI is fixed. The eft hand side figure of Figure 5 shows the JAR performances with respect to d under LOS channe. Simiar resuts can be observed under NLOS channe. As we can see, SI is assumed fixed in the eft hand side figure of Figure 5, which may be not practicay reasonabe, because in practice d significanty affects SI. However, in order to adequatey evauate the effects of d on the JAR performance, we assume a fixed SI in the eft hand side figure of Figure 5. For rigorousness, we aso adopt varying SI in the right hand side figure of Figure 5, which is in accordance with the practice, where SI deteriorates with d 2. It is noteworthy that the strength of SI is typicay much higher than that of the desired signa, because SI comes from the oca transmitter at the same node, whie the designed signa comes from the remote transmitter at the other node. Reevant parameters for these figures are isted in the corresponding captions. JAR Bps/Hz) Upper Bound ZF Max Power LB MMSE SI ZF MRT SBF LB MMSE with d/λ= JAR Bps/Hz) Upper Bound ZF Max Power LB MMSE SI ZF MRT SBF LB MMSE with d/λ= ω π rad) ω π rad) Figure 4. JAR performance of the invoved schemes with respect to varying ω under LOS Left) and NLOS Right) channes in the case of separate arrays. ε 11 = ε 22 = 4 db, ε 12 = ε 21 = db, d/λ = 2. For LB-MMSE, the JAR with d/λ = is aso potted.

14 Sensors 16, 16, of 22 3 JAR Bps/Hz) 5 Upper Bound ZF Max Power LB MMSE SI ZF MRT SBF JAR Bps/Hz) 5 Upper Bound ZF Max Power LB MMSE SI ZF MRT SBF d/λ d/λ Figure 5. JAR performance of the invoved schemes with respect to varying d under LOS channe in the case of separate arrays. ω = π rad. In the Left) hand figure SI is assumed fixed, i.e., ε 11 = ε 22 = 4 db, ε 12 = ε 21 = db; whie in the Right) hand figure SI varies with d/λ, i.e., ε 11 = ε 22 = 6 og d/λ) db, ε 12 = ε 21 = db. By comparing these figures with each other, it can be observed that: i) ii) iii) ZF-Max-Power is robust against ω, d and SI, and approaches the upper bound in a these cases. This is because ZF-Max-Power not ony forces SI to zero, but aso iterativey maximizes signa power. Thus, it achieves compeing performance that is insensitive to the geometry of the Tx/Rx arrays and SI. SI-ZF-MRT is aso robust against ω, d and SI, thanks to its zero-forcing fitering to SI. In addition, it aso achieves an acceptabe performance, which is cose to the upper bound. It is noted that the JAR gap between SI-ZF-MRT and the upper bound is greater under LOS channe than that under NLOS channe. This phenomenon can be expained by referring to Equation 34), where w r2 is in fact set within an n r2 2)-dimension subspace, due to the two zero forcing equations shown in Equation 31). Ceary if a in Equation 34), which represents the dimension with the argest power of the channe, has ess energy projected on the n r2 2)-dimension subspace, the JAR performance wi be poorer. Under LOS channe, the majority of the channe energy concentrates on a singe path, or a singe dimension. Once this dimension has a sma projection on the subspace, the performance wi be poor. In contrast, under NLOS channe the channe energy eveny disperses on mutipe paths. Ony when a of these paths have a sma projection on the subspace, the performance wi be poor. In other words, the probabiity of a poor performance is ower under NLOS channe than that under LOS channe. Hence, on average the JAR gap between SI-ZF-MRT and the upper bound is greater under LOS channe than that under NLOS channe. LB-MMSE is sensitive to ω and d. From Figure 4 we observe that the performance of LB-MMSE fuctuates as ω changes, and the fuctuation is different for different d. From Figure 5 we observe that the performance of LB-MMSE has a -shape as d increases, but behaves stabe when d is arge. To understand these, we need to go back to Equations 28) and 29). From these two equations we can see that the transmit AWVs are decided to maximize the SINR rather than minimize SI based on the oca information. Taking Equation 28) for iustration, since usuay ε 11 is big, when H 11 has a ow rank, the eigenvector of H H 12 H 12 has a high probabiity to ocate within the nu space of H 11. In such a case, a high signa power can be achieved whie itte SI ocates within the signa subspace; thus good performance is achieved. Note that this statement is just for iustration. In practice, H 11 is generay with fu rank except when ω = or π. However, when most energy of H 11 ocates at a ow-dimensiona subspace, the situation wi be simiar to the statement that H 11 has a ow rank. In comparison, when H 11 has a high or even fu rank, SI wi amost unavoidaby ocate within the signa subspace and affects the received SINR, and thus the performance wi be

15 Sensors 16, 16, 113 of 22 iv) poor. When d is sma, the energy dispersion of H 11 is sensitive to ω and d according to the SI channe mode, and thus the JAR performance is aso sensitive to ω and d. However, when d is arge, the SI channe amost reduces to a directiona channe with rank 1, and thus SI has a ow probabiity to ocate within the signa subspace. In such a case, LB-MMSE can staby achieve a near-optima performance. SBF is aso sensitive to ω, d and SI. This is because SBF does not even consider SI in the beamforming design. Meanwhie, from Figure 5 it is found that SBF becomes improved as d increases. In the right hand side of Figure 5 the improving speed of SBF is faster than that in Figure 5, because SI is reduced as d increases. This phenomenon suggests that when the near-fied SI channe graduay reduces to a directiona channe, the conventiona beamforming schemes that to simpy steer towards each other may aso achieve good performance, because usuay the communication channe and SI channe have difference steering anges. However, in practica FD mmwave communication where d is generay sma, the SI channe does not have the feature of directivity; thus SBF is much poorer than the other candidates, and the performance of SBF does not show monotonicity with ω, as shown in Figure 4. Thus, SBF may not be a good choice for FD mmwave communication, where SI must be taken into account. Then, we compare the JAR performances of the discussed schemes with separate arrays and the same array. Figure 6 shows the comparison resuts with respect to SI under LOS and NLOS channes, respectivey, where reevant parameters are isted in the captions. From these two figures we observe that the schemes with separate arrays basicay achieve better performance than those with the same array. This advantage is aso due to that the different channe parameters of H 12 and H 21 when using separate arrays provide arger degrees of spatia freedom for beamforming than the case of using the same array, where the channe parameters are the same. Moreover, both ZF-Max-Power and SI-ZF-MRT are insensitive to the increase of SI, thanks to the operation of ZF SI, whie the performance of SBF becomes poorer as the increase of SI, due to no operation of ZF SI. Interestingy, the JAR of LB-MMSE with separate arrays sowy decreases as the increase of SI whereas that with the same array changes itte, which shows that LB-MMSE with the same array is more robust against the SI. To expain this, et us ook at the third and fourth ines of Equation ). In third ine, and w H t1 HH 12 H 12w t1 w H t2i+ε 22 H H 22 H 22)w t2 w H t2 HH 21 H 21w t2 w H t1i+ε 11 H H 11 H 11)w t1 can be roughy seen as the receive SINRs at Node #1 and Node #2 without considering the receive AWVs, respectivey. However, in order to obtain cosed-form expressions of the transmission AWVs, the denominators or numerators) of these two components are exchanged and optimized respectivey, as shown in Equations 26) and 27). This means that the optimizations in Equations 26) and 27) are not to directy optimize the receive SINRs at Node #1 and Node #2. Hence, in genera LB-MMSE is not so robust against the SI. However, in the case with the same array, the ink from Node #1 to Node #2 is symmetric; thus the denominators or numerators) of the two components in the third ine of Equation ) can be seen equa or at east proportiona to each other. In such a case, Equations 26) and 27) are in fact to optimize the receive SINRs at Node #1 and Node #2 without considering the receive AWVs. Hence, LB-MMSE with the same array is reativey more robust against the SI. Finay, we evauate the effects of channe estimation errors on the proposed schemes. For the SI channe, there exists Gaussian error; whie for the communication channe, it is possibe to miss some MPCs during the beam search process. Figure 7 shows the effects of these estimation errors on the proposed schemes with separate arrays the resuts are simiar with the same array) under LOS and NLOS channes, respectivey, where the parameters are specified in the captions. From these two figures we can observe that both ZF-Max-Power and LB-MMSE are reativey robust against the channe estimation error. Even ony one MPC is acquired, they can achieve promising performance, especiay under LOS channe. However, SI-ZF-MRT is not robust against the estimation error of the communication channe, i.e., if ony one MPC is acquired, the performance of SI-ZF-MRT

16 Sensors 16, 16, of 22 becomes rather poor, this is because the fu channe information is invoved in the SI ZF operation according to Equation 31). JAR Bps/Hz) 5 Upper Bound Separate, ZF Max Power Separate, LB MMSE Separate, SI ZF MRT Separate, SBF Same, ZF Max Power Same, LB MMSE Same, SI ZF MRT Same, SBF JAR Bps/Hz) 5 Upper Bound Separate, ZF Max Power Separate, LB MMSE Separate, SI ZF MRT Separate, SBF Same, ZF Max Power Same, LB MMSE Same, SI ZF MRT Same, SBF SI ε 11 and ε 22 db) SI ε 11 and ε 22 db) Figure 6. JAR comparison between different array settings separate arrays versus the same array) under LOS Left) and NLOS Right) channes with varying SI. ε 12 = ε 21 = db. For the case of separate arrays, ω =.6π rad, d/λ = 1. 3 JAR Bps/Hz) 5 A MPCs, ZF Max Power A MPCs, LB MMSE A MPCs, SI ZF MRT 1 MPC, ZF Max Power 1 MPC, LB MMSE 1 MPC, SI ZF MRT JAR Bps/Hz) 5 A MPCs, ZF Max Power A MPCs, LB MMSE A MPCs, SI ZF MRT 1 MPC, ZF Max Power 1 MPC, LB MMSE 1 MPC, SI ZF MRT MSE of SI Channe Estimation db) MSE of SI Channe Estimation db) Figure 7. Effects of channe estimation errors on the proposed schemes with separate arrays under LOS Left) and NLOS Right) channes. ε 12 = ε 21 = db, ε 11 = ε 22 = 4 db, ω = π rad, d/λ = 1. It is noteworthy that circuit imperfections are not taken into consideration in our system mode, i.e., in Equations 7) and 8). In a practica FD system, there are aways Tx/Rx hardware and impementation imperfections, incuding ow-noise ampifier LNA) noise figure, phase noise, in-phase and quadrature IQ) mismatch, noninear distortion of power ampifier, etc. These imperfections may be more severe in mmwave communication systems than in ow-frequency systems, because of the higher carrier frequency and arger bandwidth. Since SI is strong, the Tx imperfections, which are carried by the transmitted signas s 1 and s 2 in Equations 7) and 8), wi aso arrive at the Rx. When beamforming canceation is adopted to force the SI to zero, the performance wi be affected itte by the Tx circuit imperfections provided that the AWV contro is perfect, because a the SI, incuding the imperfections, can be fitered out by beamforming. However, in practice, the AWV contro may have error. In such a case the SI cannot be competey fitered out by beamforming, and the residua SI, which contains Tx imperfections, wi degrade the system performance. Athough baseband BB) canceation can be used to dea with the residua SI after beamforming canceation, it basicay cannot effectivey cance the residua Tx imperfections.

17 Sensors 16, 16, of 22 3 JAR Bps/Hz) No EVM Error, With BB Canceation No EVM Error, Without BB Canceation 5 EVM Error db with BB Canceation EVM Error db with BB Canceation EVM Error 5 db with BB Canceation AWV Error db) JAR Bps/Hz) No EVM Error, With BB Canceation 5 No EVM Error, Without BB Canceation EVM Error db with BB Canceation EVM Error db with BB Canceation EVM Error 5 db with BB Canceation AWV Error db) Figure 8. Effects of AWV error and EVM error on the JAR performance of ZF-Max-Power under LOS Left) and NLOS Right) channes. ε 12 = ε 21 = db, ε 11 = ε 22 = 5 db, ω =.8π rad, d/λ = 1. To further iustrate the effect of the circuit imperfections on the system performance, we mode a the typica Tx imperfections as a zero-mean Gaussian distributed error vector magnitude EVM) noise [57], and its average power can be measured in db with respect to the transmission power. On the other hand, we aso need to consider AWV contro error, which can aso be modeed as a zero-mean Gaussian variabe, and its average power can aso be measured in db with respect to the 2-norm of its corresponding weight. By expoiting this mode, we can evauate the effects of AWV error and EVM error on the JAR performance of ZF-Max-Power as shown in Figure 8, where reevant parameters are isted in the caption. The effects are simiar to the performances of the other schemes. From this figure we can find that when AWV contro is perfect or AWV error is sma enough, the SI as we as the EVM noise can be mitigated successfuy by beamforming. However, when there is significant AWV error, the system performance deteriorates as the AWV error becomes greater. In such a case, BB canceation is needed to cance the residua SI. From the figure we observe that with BB canceation, the performance is greaty improved and does not depend on the AWV error. On the other hand, BB canceation can hardy mitigate the residua EVM noise, because it is difficut to estimate reevant parameters of the EVM noise [57]. Hence, we can observe that even when BB canceation is adopted, if EVM noise exists, the performance sti deteriorates as the AWV error becomes greater. 6. Concusions In this paper, we investigate FD mmwave communications, where we empoy beamforming to cance SI, and study a JTR-BF probem in the presence of significant SI. As the probem of finding the optima beamforming vectors to maximize the JAR is non-convex, severa suboptima soutions are proposed. Firsty, ZF-Max-Power, which restricts the origina probem by ZF SI and aternativey optimizes the desired power, is proposed, and its convergence is proven. It is shown that the computationa compexity of ZF-Max-Power is ower than that of Max-SINR by one order of magnitude. Next, two cosed-form soutions, namey LB-MMSE and SI-ZF-MRT are proposed, by jointy using MMSE, ZF and MRT criteria. Performance evauations show that ZF-Max-Power approaches an upper bound on the JAR, and it needs ony 2 iterations on average to achieve the convergence with random initia points. LB-MMSE and SI-ZF-MRT achieve suboptima performances. In addition, we find that ZF-Max-Power and SI-ZF-MRT are robust against the geometry of Tx/Rx antenna arrays due to the operation of ZF SI, whie LB-MMSE is not. ZF-Max-Power and LB-MMSE are robust against channe estimation error, whie SI-ZF-MRT is not. Furthermore, these schemes basicay achieve better JAR performance with a separate-array setting than those sharing the same array. The resuts demonstrate the feasibiity of FD mmwave communications and the effectiveness of beamforming canceation.

18 Sensors 16, 16, of 22 Acknowedgments: The authors woud ike to thank the funding support from the Nationa Natura Science Foundation of China NSFC) under grant Nos. 67, 9384, , and , Nationa Key R&D Program under grant No. 16YFB, Nationa Basic Research Program of China under grant No.11CB77, and Foundation for Innovative Research Groups of the Nationa Natura Science Foundation of China under grant No Author Contributions: Z.X., J.C., P.X. and X.-G.X. conceived and designed the idea and simuations; X.L. and L.B. performed the simuations; X.L. and Z.X. anayzed the performance; a the authors contributed to writing and improving the paper. Conficts of Interest: The authors decare no confict of interest. Appendix A. Proof of Lemma 1 Since {a i C L 1 } i=1,2,...,n; N<L is a group of inear independent vectors, they span a inear subspace denoted by S S{a i i=1,2,...,n }. Suppose {v i } i=1,2,...,n is an orthogona basis of the inear subspace S. Then constraint a, a i = i=1,2,...,n is equivaent to a, v i = i=1,2,...,n. Remark The vector b C L 1 to maximize b, a 2 with the constraint that b, v i = i=1,2,...,n and b = 1 is before normaization) b = a N i=1 a, v i v i. According to the above remark, the next thing we need to prove is that {b i i=1,2,...,n } shown in Equation ) is an orthogona basis of {b i i=1,2,...,n }. This proposition hods because {b i i=1,2,...,n } is obtained according to the standard Gram-Schmidt process from {a i i=1,2,...,n }. Therefore, Lemma 1 hods. Appendix B. Proof of Theorem 1 Under the constraints in Equation 14), the JAR becomes Rw t1, w t2, w r1, w r2 ) = og ε 21 w H r1 H 21w t2 2) + og ε 12 w H r2 H 12w t1 2) R ub B1) which shows that R is a function of w t1, w t2, w r1, and w r2. Let w n) t1 and w n) t2 the receive AWVs after the n-th iteration. Then we have R n) R n+1) = Rw n+1) denote the transmit AWVs after the n-th iteration, and w n) r1 t1, w n+1) t2, w n+1) r1, w n+1) r2 ). According to Agorithms 1, as we as Equations 19) and ), we have and w n) r2 = Rw n) t1, wn) t2, wn) r1, wn) r2 ) and Rw n) t1, wn) t2, wn+1) r1, w n+1) r2 ) Rw n) t1, wn) t2, wn) r1, wn) r2 ) = Rn) B2) Aso, according to Agorithms 1, as we as Equations 21) and 22), we have Rw n+1) t1, w n+1) t2, w n+1) r1 Therefore, we have R n+1) R n). Appendix C. Lemmas 2, 3, 4, w n+1) r2 ) = R n+1) Rw n) t1, wn) t2, wn+1) r1, w n+1) r2 ) B3) Lemma 2. Given R C M M a positive define Hermitian matrix, the soution to maximize xh aa H x x H Rx x = R 1 a. is Proof. Since R is a positive define Hermitian matrix, R 1/2 is aso an invertibe Hermitian matrix. Thus, we have x H aa H x x H Rx = x H aa H x R 1/2 x ) H R 1/2 x ) C1)

19 Sensors 16, 16, of 22 Let x = R 1/2 x, the probem becomes to maximize xh R H/2 a)r H/2 a) H x. Therefore, the soution is x H x x = R H/2 a = R 1/2 a, i.e., x = R 1 a. Lemma 3. Given R C M M a positive define Hermitian matrix, a H R 1 a ah a) 2 a H Ra. Proof. Since R C M M is a positive define Hermitian matrix, it can be expressed as R = M i=1 λ iv i v H i, where λ i > and {v i } i=1,2,...,m constitutes an orthogona base in C M M. Thus, a can be expressed as a = M i=1 α iv i. Besides, we have R 1 = M i=1 1 λ i v i v H i. Thus, = = ) ) a H R 1 a a H Ra M i=1 M i=1 M i=1 =a H a) 2 α i 2 λ i α i 4 + α i ) M ) α i 2 λ i i=1 M i=1 i 1 j=1 M i 1 i=1 j=1 ) λj α i 2 α j 2 + λ i λ i λ j α i 2 α j 2 C2) Lemma 4. Given R C M M a positive define Hermitian matrix with the formuation R = I + εbb H, a H a a H Ra 1 1+εb H b. Proof. Let v = a/ a. We have a H a a H Ra = a H a a H I + εbb H ) a = 1 v H I + εbb H ) v 1 = 1 + ε b H v ε = 1 bh b b εb H b C3) References 1. Sabharwa, A.; Schniter, P.; Guo, D.; Biss, D.; Rangarajan, S.; Wichman, R. In-band fu-dupex wireess: Chaenges and opportunities. IEEE J. Se. Areas Commun. 14, 32, Ahmed, E.; Etawi, A.; Sabharwa, A. Simutaneous transmit and sense for cognitive radios using fu-dupex: A first study. In Proceedings of the IEEE Antennas and Propagation Society Internationa Symposium APSURSI), Chicago, IL, USA, 8 14 Juy 12; IEEE: Chicago, IL, USA, 12; pp Duarte, M.; Dick, C.; Sabharwa, A. Experiment-driven characterization of fu-dupex wireess systems. IEEE Trans. Wire. Commun. 11, 11, Duarte, M.; Sabharwa, A.; Aggarwa, V.; Jana, R.; Ramakrishnan, K.; Rice, C.; Shankaranarayanan, N. Design and characterization of a fu-dupex mutiantenna system for WiFi networks. IEEE Trans. Veh. Techno. 14, 63, Jain, M.; Choi, J.I.; Kim, T.; Bharadia, D.; Seth, S.; Srinivasan, K.; Levis, P.; Katti, S.; Sinha, P. Practica, rea-time, fu dupex wireess. In Proceedings of the 17th Annua Internationa Conference on Mobie Computing and Networking, Las Vegas, NV, USA, September 11; ACM: New York, NY, USA, 11; pp

20 Sensors 16, 16, 113 of Li, N.; Zhu, W.; Han, H. Digita interference canceation in singe channe, fu dupex wireess communication. In Proceedings of the 8th Internationa Conference on Wireess Communications, Networking and Mobie Computing WiCOM), Shanghai, China, September 12; IEEE: Shanghai, China, 12; pp Li, S.; Murch, R.D. Fu-dupex wireess communication using transmitter output based echo canceation. In Proceedings of the IEEE Goba Teecommunications Conference GLOBECOM 11), Houston, TX, USA, 5 9 December 11; IEEE: Houston, TX, USA, 11; pp Choi, J.I.; Jain, M.; Srinivasan, K.; Levis, P.; Katti, S. Achieving singe channe, fu dupex wireess communication. In Proceedings of the 16th Annua Internationa Conference on Mobie Computing and Networking MobiCom ), Chicago, IL, USA, 24 September ; IEEE: Chicago, IL, USA, ; pp Khojastepour, M.A.; Sundaresan, K.; Rangarajan, S.; Zhang, X.; Barghi, S. The case for antenna canceation for scaabe fu-dupex wireess communications. In Proceedings of the th ACM Workshop on Hot Topics in Networks, Cambridge, MA, USA, 14 November 11; ACM: New York, NY, USA, 11; pp Bharadia, D.; McMiin, E.; Katti, S. Fu dupex radios. In Proceedings of the Specia Interest Group on Data Communication SIGCOMM), Hong Kong, China, August 13; ACM: Hong Kong, China, Danies, R.C.; Murdock, J.N.; Rappaport, T.S.; Heath, R.W. 6 GHz wireess: Up cose and persona. IEEE Microw. Mag., 11, Perahia, E.; Cordeiro, C.; Park, M.; Yang, L.L. IEEE ad: Defining the next generation muti-gbps Wi-Fi. In Proceedings of the IEEE Consumer Communications and Networking Conference CCNC), Las Vegas, NV, USA, 9 12 January ; IEEE: Las Vegas, NV, USA, ; pp Yong, S.K.; Xia, P.; Vades-Garcia, A. 6GHz Technoogy for Gbps WLAN and WPAN: From Theory to Practice; Wiey: West Sussex, UK, Wang, P.; Li, Y.; Yuan, X.; Song, L.; Vucetic, B. Tens of gigabits wireess communications over E-band LoS MIMO channes with uniform inear antenna arrays. IEEE Trans. Wire. Commun. 14, 13, Wang, P.; Li, Y.; Song, L.; Vucetic, B. Muti-gigabit miimeter wave wireess communications for 5G: From fixed access to ceuar networks. IEEE Commun. Mag., 53, Gao, X.; Dai, L.; Han, S.; Chih-Lin, I.; Heath, R.W. Energy-efficient hybrid anaog and digita precoding for mmwave MIMO systems with arge antenna arrays. IEEE J. Se. Areas Commun. 16, 34, Gao, Z.; Dai, L.; Wang, Z.; Chen, S. Spatiay common sparsity based adaptive channe estimation and feedback for FDD massive MIMO. IEEE Trans. Signa Process., 63, Gao, Z.; Dai, L.; Lu, Z.; Yuen, C.; Wang, Z. Super-resoution sparse MIMO-OFDM channe estimation based on spatia and tempora correations. IEEE Commun. Lett. 14, 18, Niu, Y.; Li, Y.; Jin, D.; Su, L.; Vasiakos, A.V. A survey of miimeter wave communications mmwave) for 5G: Opportunities and chaenges. Wire. Netw., 21, Tang, Y.; Vucetic, B.; Li, Y. An iterative singuar vectors estimation scheme for beamforming transmission and detection in MIMO systems. IEEE Commun. Lett. 5, 9, Xiao, Z. Suboptima Spatia Diversity Scheme for 6 GHz Miimeter-Wave WLAN. IEEE Commun. Lett. 13, 17, Xiao, Z.; Bai, L.; Choi, J. Iterative Joint Beamforming Training with Constant-Ampitude Phased Arrays in Miimeter-Wave Communications. IEEE Commun. Lett. 14, 18, Park, M.; Pan, H. A Spatia Diversity Technique for IEEE ad WLAN in 6 GHz Band. IEEE Commun. Lett. 12, 16, Nsenga, J.; Van Thio, W.; Horin, F.; Ramon, V.; Bourdoux, A.; Lauwereins, R. Joint transmit and receive anaog beamforming in 6 GHz MIMO mutipath channes. In Proceedings of the 9 IEEE Internationa Conference on Communications ICC), Dresden, Germany, June 9; IEEE: Dresden, Germany, 9; pp Li, B.; Zhou, Z.; Zhang, H.; Naanathan, A. Efficient beamforming training for 6-GHz miimeter-wave communications: A nove numerica optimization framework. IEEE Trans. Veh. Techno. 14, 63, Li, B.; Zhou, Z.; Zou, W.; Sun, X.; Du, G. On the Efficient Beam-Forming Training for 6GHz Wireess Persona Area Networks. IEEE Trans. Wire. Commun. 13, 12, 54 5.

21 Sensors 16, 16, of Chun, B.; Lee, Y.H. A spatia sef-interference nuification method for fu dupex ampify-and-forward MIMO reays. In Proceedings of the IEEE Wireess Communications and Networking Conference WCNC), Sydney, Austraia, Apri ; IEEE: Sydney, Austraia, ; pp Riihonen, T.; Werner, S.; Wichman, R. Mitigation of oopback sef-interference in fu-dupex MIMO reays. IEEE Trans. Signa Process. 11, 59, Liu, Y.; Xia, X.G.; Zhang, H. Distributed space-time coding for fu-dupex asynchronous cooperative communications. IEEE Trans. Wire. Commun. 12, 11, Liu, Y.; Xia, X.G.; Zhang, H. Distributed inear convoutiona space-time coding for two-reay fu-dupex asynchronous cooperative networks. IEEE Trans. Wire. Commun. 13, 12, Snow, T.; Futon, C.; Chappe, W.J. Transmit receive dupexing using digita beamforming system to cance sef-interference. IEEE Trans. Microw. Theory Tech. 11, 59, Gomadam, K.; Cadambe, V.R.; Jafar, S.A. A distributed numerica approach to interference aignment and appications to wireess interference networks. IEEE Trans. Inf. Theory 11, 57, Santamaria, I.; Gonzaez, O.; Heath, R.; Peters, S.W. Maximum sum-rate interference aignment agorithms for MIMO channes. In Proceedings of the IEEE Goba Teecommunications Conference GLOBECOM ), Miami, FL, USA, 6 December ; IEEE: Miami, FL, USA, ; pp Peters, S.W.; Heath, R.W. Cooperative agorithms for MIMO interference channes. IEEE Trans. Veh. Techno. 11, 6, Schmidt, D.A.; Shi, C.; Berry, R.A.; Honig, M.L.; Utschick, W. Comparison of distributed beamforming agorithms for MIMO interference networks. IEEE Trans. Signa Process. 13, 61, Wang, J.; Lan, Z.; Pyo, C.; Baykas, T.; Sum, C.; Rahman, M.; Gao, J.; Funada, R.; Kojima, F.; Harada, H. Beam codebook based beamforming protoco for muti-gbps miimeter-wave WPAN systems. IEEE J. Se. Areas Commun. 9, 27, Matsev, A.; Masennikov, R.; Sevastyanov, A.; Lomayev, A.; Khoryaev, A.; Davydov, A.; Ssorin, V. Characteristics of indoor miimeter-wave channe at 6 GHz in appication to perspective WLAN system. In Proceedings of the Fourth European Conference on Antennas and Propagation EuCAP), Barceona, Spain, Apri ; IEEE: Barceona, Spain, ; pp Akhateeb, A.; Mo, J.; Gonzáez-Precic, N.; Heath, R. MIMO precoding and combining soutions for miimeter-wave systems. IEEE Commun. Mag. 14, 52, Hur, S.; Kim, T.; Love, D.J.; Krogmeier, J.V.; Thomas, T.A.; Ghosh, A. Miimeter wave beamforming for wireess backhau and access in sma ce networks. IEEE Trans. Commun. 13, 61, Xiao, Z.; Xia, P.; Xia, X.G. Enabing UAV ceuar with miimeter-wave communication: Potentias and approaches. IEEE Commun. Mag. 16, 54, Rangan, S.; Rappaport, T.S.; Erkip, E. Miimeter-wave ceuar wireess networks: Potentias and chaenges. Proc. IEEE 14, 2, E Ayach, O.; Rajagopa, S.; Abu-Surra, S.; Pi, Z.; Heath, R. Spatiay Sparse Precoding in Miimeter Wave MIMO Systems. IEEE Trans. Wire. Commun. 14, 13, Fenn, A.J. Evauation of adaptive phased array antenna, far-fied nuing performance in the near-fied region. IEEE Trans. Antennas Propag. 199, 38, Yaghjian, A.D. An overview of near-fied antenna measurements. IEEE Trans. Antennas Propag. 1986, 34, Sayers, A.; Dorsey, W.; O Haver, K.; Vaenzi, J. Panar near-fied measurement of digita phased arrays using near-fied scan pane reconstruction. IEEE Trans. Antennas Propag. 12, 6, Liao, Y.P.; Han, H.; Guo, Q. Design of robust near-fied muti-beam forming based on improved LCMV agorithm. J. Inf. Hiding Mutimed. Signa Process., 6, Lin, J.R.; Peng, Q.C.; Shao, H.Z. Near-fied robust adaptive beamforming based on worst-case performance optimization. Int. J. Eectr. Comput. Eng. 6, 1, Lee, M.S.; Park, J.Y.; Katkovnik, V.; Itoh, T.; Kim, Y.H. Adaptive robust DOA estimation for a 6-GHz antenna-array system. IEEE Trans. Veh. Techno. 7, 56, Tsang, Y.M.; Poon, A.S.; Addepai, S. Coding the beams: Improving beamforming training in mmwave communication system. In Proceedings of the IEEE Goba Teecommunications Conference GLOBECOM 11), Houston, TX, USA, 5 9 December 11; IEEE: Houston, TX, USA, 11; pp. 1 6.

22 Sensors 16, 16, of Xiao, Z.; Xia, X.G.; Jin, D.; Ge, N. Iterative Eigenvaue Decomposition and Mutipath-Grouping Tx/Rx Joint Beamformings for Miimeter-Wave Communications. IEEE Trans. Wire. Commun., 14, Akhateeb, A.; E Ayach, O.; Leus, G.; Heath, R. Channe estimation and hybrid precoding for miimeter wave ceuar systems. IEEE J. Se. Top. Signa Process. 14, 8, Peng, Y.; Li, Y.; Wang, P. An Enhanced Channe Estimation Method for Miimeter Wave Systems with Massive Antenna Arrays. IEEE Commun. Lett., 19, Vía, J.; Santamaría, I.; Evira, V.; Eickhoff, R. A genera criterion for anaog Tx-Rx beamforming under OFDM transmissions. IEEE Trans. Signa Process., 58, Kokshoorn, M.; Wang, P.; Li, Y.; Vucetic, B. Fast channe estimation for miimetre wave wireess systems using overapped beam patterns. In Proceedings of the IEEE Internationa Conference on Communications ICC), London, UK, 8 12 June ; IEEE: London, UK, ; pp Kang, D.W.; Kim, J.G.; Min, B.W.; Rebeiz, G.M. Singe and four-eement-ka-band transmit/receive phased-array siicon RFICs with 5-bit ampitude and phase contro. IEEE Trans. Microw. Theory Tech. 9, 57, Li, Q.; Hong, M.; Wai, H.T.; Liu, Y.F.; Ma, W.K.; Luo, Z.Q. Transmit Soutions for MIMO Wiretap Channes using Aternating Optimization. IEEE J. Se. Areas Commun. 13, 31, Li, W.; Lieberg, J.; Rikkinen, K. On rate region anaysis of haf-and fu-dupex OFDM communication inks. IEEE J. Se. Areas Commun. 14, 32, c 16 by the authors; icensee MDPI, Base, Switzerand. This artice is an open access artice distributed under the terms and conditions of the Creative Commons Attribution CC-BY) icense

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

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

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

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

Sum Rate Maximization for Full Duplex Wireless-Powered Communication Networks

Sum Rate Maximization for Full Duplex Wireless-Powered Communication Networks 06 4th European Signa Processing Conference (EUSIPCO) Sum Rate Maximization for Fu Dupex Wireess-Powered Communication Networks Van-Dinh Nguyen, Hieu V. Nguyen, Gi-Mo Kang, Hyeon Min Kim, and Oh-Soon Shin

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

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

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

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

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

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

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

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

Separation of Variables and a Spherical Shell with Surface Charge

Separation of Variables and a Spherical Shell with Surface Charge Separation of Variabes and a Spherica She with Surface Charge In cass we worked out the eectrostatic potentia due to a spherica she of radius R with a surface charge density σθ = σ cos θ. This cacuation

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

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

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

Polite Water-filling for the Boundary of the Capacity/Achievable Regions of MIMO MAC/BC/Interference Networks

Polite Water-filling for the Boundary of the Capacity/Achievable Regions of MIMO MAC/BC/Interference Networks 2011 IEEE Internationa Symposium on Information Theory Proceedings Poite Water-fiing for the Boundary of the Capacity/Achievabe Regions of MIMO MAC/BC/Interference Networks An iu 1, Youjian iu 2, Haige

More information

Introduction. Figure 1 W8LC Line Array, box and horn element. Highlighted section modelled.

Introduction. Figure 1 W8LC Line Array, box and horn element. Highlighted section modelled. imuation of the acoustic fied produced by cavities using the Boundary Eement Rayeigh Integra Method () and its appication to a horn oudspeaer. tephen Kirup East Lancashire Institute, Due treet, Bacburn,

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

CS229 Lecture notes. Andrew Ng

CS229 Lecture notes. Andrew Ng CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view

More information

Explicit overall risk minimization transductive bound

Explicit overall risk minimization transductive bound 1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,

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

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

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

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

Bayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems

Bayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems Bayesian Unscented Kaman Fiter for State Estimation of Noninear and Non-aussian Systems Zhong Liu, Shing-Chow Chan, Ho-Chun Wu and iafei Wu Department of Eectrica and Eectronic Engineering, he University

More information

A Novel Learning Method for Elman Neural Network Using Local Search

A Novel Learning Method for Elman Neural Network Using Local Search Neura Information Processing Letters and Reviews Vo. 11, No. 8, August 2007 LETTER A Nove Learning Method for Eman Neura Networ Using Loca Search Facuty of Engineering, Toyama University, Gofuu 3190 Toyama

More information

Asynchronous Control for Coupled Markov Decision Systems

Asynchronous Control for Coupled Markov Decision Systems INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of

More information

Robust Sensitivity Analysis for Linear Programming with Ellipsoidal Perturbation

Robust Sensitivity Analysis for Linear Programming with Ellipsoidal Perturbation Robust Sensitivity Anaysis for Linear Programming with Eipsoida Perturbation Ruotian Gao and Wenxun Xing Department of Mathematica Sciences Tsinghua University, Beijing, China, 100084 September 27, 2017

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

How to Understand LMMSE Transceiver. Design for MIMO Systems From Quadratic Matrix Programming

How to Understand LMMSE Transceiver. Design for MIMO Systems From Quadratic Matrix Programming How to Understand LMMSE Transceiver 1 Design for MIMO Systems From Quadratic Matrix Programming arxiv:1301.0080v4 [cs.it] 2 Mar 2013 Chengwen Xing, Shuo Li, Zesong Fei, and Jingming Kuang Abstract In this

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

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

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

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

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

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

Research on liquid sloshing performance in vane type tank under microgravity

Research on liquid sloshing performance in vane type tank under microgravity IOP Conference Series: Materias Science and Engineering PAPER OPEN ACCESS Research on iquid soshing performance in vane type tan under microgravity Reated content - Numerica simuation of fuid fow in the

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

Precoding for the Sparsely Spread MC-CDMA Downlink with Discrete-Alphabet Inputs

Precoding for the Sparsely Spread MC-CDMA Downlink with Discrete-Alphabet Inputs IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL.*, NO.*, MONTH 2016 1 Precoding for the Sparsey Spread MC-CDMA Downin with Discrete-Aphabet Inputs Min Li, Member, IEEE, Chunshan Liu, Member, IEEE, and Stephen

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

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

A Generalized Framework on Beamformer Design and CSI Acquisition for Single-Carrier Massive MIMO Systems in Millimeter-Wave Channels 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

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

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

Published in: Proceedings of the Twenty Second Nordic Seminar on Computational Mechanics

Published in: Proceedings of the Twenty Second Nordic Seminar on Computational Mechanics Aaborg Universitet An Efficient Formuation of the Easto-pastic Constitutive Matrix on Yied Surface Corners Causen, Johan Christian; Andersen, Lars Vabbersgaard; Damkide, Lars Pubished in: Proceedings of

More information

Primal and dual active-set methods for convex quadratic programming

Primal and dual active-set methods for convex quadratic programming Math. Program., Ser. A 216) 159:469 58 DOI 1.17/s117-15-966-2 FULL LENGTH PAPER Prima and dua active-set methods for convex quadratic programming Anders Forsgren 1 Phiip E. Gi 2 Eizabeth Wong 2 Received:

More information

XSAT of linear CNF formulas

XSAT of linear CNF formulas XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open

More information

NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION

NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION Hsiao-Chang Chen Dept. of Systems Engineering University of Pennsyvania Phiadephia, PA 904-635, U.S.A. Chun-Hung Chen

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

Gauss Law. 2. Gauss s Law: connects charge and field 3. Applications of Gauss s Law

Gauss Law. 2. Gauss s Law: connects charge and field 3. Applications of Gauss s Law Gauss Law 1. Review on 1) Couomb s Law (charge and force) 2) Eectric Fied (fied and force) 2. Gauss s Law: connects charge and fied 3. Appications of Gauss s Law Couomb s Law and Eectric Fied Couomb s

More information

arxiv: v1 [math.ca] 6 Mar 2017

arxiv: v1 [math.ca] 6 Mar 2017 Indefinite Integras of Spherica Besse Functions MIT-CTP/487 arxiv:703.0648v [math.ca] 6 Mar 07 Joyon K. Boomfied,, Stephen H. P. Face,, and Zander Moss, Center for Theoretica Physics, Laboratory for Nucear

More information

CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION

CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION SAHAR KARIMI AND STEPHEN VAVASIS Abstract. In this paper we present a variant of the conjugate gradient (CG) agorithm in which we invoke a subspace minimization

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

Symbolic models for nonlinear control systems using approximate bisimulation

Symbolic models for nonlinear control systems using approximate bisimulation Symboic modes for noninear contro systems using approximate bisimuation Giordano Poa, Antoine Girard and Pauo Tabuada Abstract Contro systems are usuay modeed by differentia equations describing how physica

More information

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete Uniprocessor Feasibiity of Sporadic Tasks with Constrained Deadines is Strongy conp-compete Pontus Ekberg and Wang Yi Uppsaa University, Sweden Emai: {pontus.ekberg yi}@it.uu.se Abstract Deciding the feasibiity

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

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, as we as various

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

Coded Caching for Files with Distinct File Sizes

Coded Caching for Files with Distinct File Sizes Coded Caching for Fies with Distinct Fie Sizes Jinbei Zhang iaojun Lin Chih-Chun Wang inbing Wang Department of Eectronic Engineering Shanghai Jiao ong University China Schoo of Eectrica and Computer Engineering

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

Efficiently Generating Random Bits from Finite State Markov Chains

Efficiently Generating Random Bits from Finite State Markov Chains 1 Efficienty Generating Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown

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

BDD-Based Analysis of Gapped q-gram Filters

BDD-Based Analysis of Gapped q-gram Filters BDD-Based Anaysis of Gapped q-gram Fiters Marc Fontaine, Stefan Burkhardt 2 and Juha Kärkkäinen 2 Max-Panck-Institut für Informatik Stuhsatzenhausweg 85, 6623 Saarbrücken, Germany e-mai: stburk@mpi-sb.mpg.de

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

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

Approximation and Fast Calculation of Non-local Boundary Conditions for the Time-dependent Schrödinger Equation

Approximation and Fast Calculation of Non-local Boundary Conditions for the Time-dependent Schrödinger Equation Approximation and Fast Cacuation of Non-oca Boundary Conditions for the Time-dependent Schrödinger Equation Anton Arnod, Matthias Ehrhardt 2, and Ivan Sofronov 3 Universität Münster, Institut für Numerische

More information

Coordination and Antenna Domain Formation in Cloud-RAN systems

Coordination and Antenna Domain Formation in Cloud-RAN systems Coordination and ntenna Domain Formation in Coud-RN systems Hadi Ghauch, Muhammad Mahboob Ur Rahman, Sahar Imtiaz, James Gross, Schoo of Eectrica Engineering and the CCESS Linnaeus Center, Roya Institute

More information

<C 2 2. λ 2 l. λ 1 l 1 < C 1

<C 2 2. λ 2 l. λ 1 l 1 < C 1 Teecommunication Network Contro and Management (EE E694) Prof. A. A. Lazar Notes for the ecture of 7/Feb/95 by Huayan Wang (this document was ast LaT E X-ed on May 9,995) Queueing Primer for Muticass Optima

More information

Nonlinear Gaussian Filtering via Radial Basis Function Approximation

Nonlinear Gaussian Filtering via Radial Basis Function Approximation 51st IEEE Conference on Decision and Contro December 10-13 01 Maui Hawaii USA Noninear Gaussian Fitering via Radia Basis Function Approximation Huazhen Fang Jia Wang and Raymond A de Caafon Abstract This

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

Algorithms to solve massively under-defined systems of multivariate quadratic equations

Algorithms to solve massively under-defined systems of multivariate quadratic equations Agorithms to sove massivey under-defined systems of mutivariate quadratic equations Yasufumi Hashimoto Abstract It is we known that the probem to sove a set of randomy chosen mutivariate quadratic equations

More information

Approximated MLC shape matrix decomposition with interleaf collision constraint

Approximated MLC shape matrix decomposition with interleaf collision constraint Approximated MLC shape matrix decomposition with intereaf coision constraint Thomas Kainowski Antje Kiese Abstract Shape matrix decomposition is a subprobem in radiation therapy panning. A given fuence

More information

Fractional Power Control for Decentralized Wireless Networks

Fractional Power Control for Decentralized Wireless Networks Fractiona Power Contro for Decentraized Wireess Networks Nihar Jinda, Steven Weber, Jeffrey G. Andrews Abstract We consider a new approach to power contro in decentraized wireess networks, termed fractiona

More information

On the Performance of Wireless Energy Harvesting Networks in a Boolean-Poisson Model

On the Performance of Wireless Energy Harvesting Networks in a Boolean-Poisson Model On the Performance of Wireess Energy Harvesting Networks in a Booean-Poisson Mode Han-Bae Kong, Ian Fint, Dusit Niyato, and Nicoas Privaut Schoo of Computer Engineering, Nanyang Technoogica University,

More information

Distributed average consensus: Beyond the realm of linearity

Distributed average consensus: Beyond the realm of linearity Distributed average consensus: Beyond the ream of inearity Usman A. Khan, Soummya Kar, and José M. F. Moura Department of Eectrica and Computer Engineering Carnegie Meon University 5 Forbes Ave, Pittsburgh,

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

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

HILBERT? What is HILBERT? Matlab Implementation of Adaptive 2D BEM. Dirk Praetorius. Features of HILBERT

HILBERT? What is HILBERT? Matlab Implementation of Adaptive 2D BEM. Dirk Praetorius. Features of HILBERT Söerhaus-Workshop 2009 October 16, 2009 What is HILBERT? HILBERT Matab Impementation of Adaptive 2D BEM joint work with M. Aurada, M. Ebner, S. Ferraz-Leite, P. Godenits, M. Karkuik, M. Mayr Hibert Is

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

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

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

Stochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract

Stochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract Stochastic Compement Anaysis of Muti-Server Threshod Queues with Hysteresis John C.S. Lui The Dept. of Computer Science & Engineering The Chinese University of Hong Kong Leana Goubchik Dept. of Computer

More information

Appendix for Stochastic Gradient Monomial Gamma Sampler

Appendix for Stochastic Gradient Monomial Gamma Sampler 3 4 5 6 7 8 9 3 4 5 6 7 8 9 3 4 5 6 7 8 9 3 3 3 33 34 35 36 37 38 39 4 4 4 43 44 45 46 47 48 49 5 5 5 53 54 Appendix for Stochastic Gradient Monomia Gamma Samper A The Main Theorem We provide the foowing

More information

Soft Clustering on Graphs

Soft Clustering on Graphs Soft Custering on Graphs Kai Yu 1, Shipeng Yu 2, Voker Tresp 1 1 Siemens AG, Corporate Technoogy 2 Institute for Computer Science, University of Munich kai.yu@siemens.com, voker.tresp@siemens.com spyu@dbs.informatik.uni-muenchen.de

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

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

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

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

A New Algorithm for the Weighted Sum Rate Maximization in MIMO Interference Networks

A New Algorithm for the Weighted Sum Rate Maximization in MIMO Interference Networks A New Agorithm for the Weighted Sum Rate Maximization in MIMO Interference Networks Xing Li, Seungi You 2, Lijun Chen, An Liu 3, Youjian Eugene Liu Abstract We propose a new agorithm to sove the non-convex

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

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

Efficient Generation of Random Bits from Finite State Markov Chains

Efficient Generation of Random Bits from Finite State Markov Chains Efficient Generation of Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown

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

Group Sparse Precoding for Cloud-RAN with Multiple User Antennas

Group Sparse Precoding for Cloud-RAN with Multiple User Antennas entropy Artice Group Sparse Precoding for Coud-RAN with Mutipe User Antennas Zhiyang Liu ID, Yingxin Zhao * ID, Hong Wu and Shuxue Ding Tianjin Key Laboratory of Optoeectronic Sensor and Sensing Networ

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

Lobontiu: System Dynamics for Engineering Students Website Chapter 3 1. z b z

Lobontiu: System Dynamics for Engineering Students Website Chapter 3 1. z b z Chapter W3 Mechanica Systems II Introduction This companion website chapter anayzes the foowing topics in connection to the printed-book Chapter 3: Lumped-parameter inertia fractions of basic compiant

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

Improving the Accuracy of Boolean Tomography by Exploiting Path Congestion Degrees

Improving the Accuracy of Boolean Tomography by Exploiting Path Congestion Degrees Improving the Accuracy of Booean Tomography by Expoiting Path Congestion Degrees Zhiyong Zhang, Gaoei Fei, Fucai Yu, Guangmin Hu Schoo of Communication and Information Engineering, University of Eectronic

More information

A Branch and Cut Algorithm to Design. LDPC Codes without Small Cycles in. Communication Systems

A Branch and Cut Algorithm to Design. LDPC Codes without Small Cycles in. Communication Systems A Branch and Cut Agorithm to Design LDPC Codes without Sma Cyces in Communication Systems arxiv:1709.09936v1 [cs.it] 28 Sep 2017 Banu Kabakuak 1, Z. Caner Taşkın 1, and Ai Emre Pusane 2 1 Department of

More information