Space-time Linear Dispersion Using Coordinate Interleaving
|
|
- Sibyl Elliott
- 5 years ago
- Views:
Transcription
1 Space-time Linear Dispersion Using Coorinate Interleaving Jinsong Wu an Steven D Blostein Department of Electrical an Computer Engineering Queen s University, Kingston, Ontario, Canaa, K7L3N6 wujs@ieeeorg an stevenblostein@ueensuca Abstract This paper proposes a general coorinateinterleaving metho for block-base space-time coes or linear ispersion coes, calle space-time coorinate interleaving linear ispersion coes ST-CI, which enables not only symbollevel iversity but also coorinate-level iversity for high rate block-base space-time coe esign This paper analyzes the upper boun iversity orer an provies the analysis results of the upper boun statistical iversity orer an average iversity orer for ST-CI systems Compare with conventional ST- systems, ST-CI systems may show either almost ouble average iversity orer or extra coing avantage in time varying channels With trivial extra complexity over ST- systems, ST-CI systems maintain the iversity performance in uasi-static block faing channels, an significantly improve the iversity performance in rapi faing channels I INTRODUCTION To support high reliability of space-time multiple input multiple output MIMO transmission, space-time coing STC may be applie to improve system performance an achieve high capacity potential Space-time trellis coes 1] have great iversity an coing gain but exponential ecoing complexity, which motivates the esign of low complexity STC Due to their attractive complexity, a number of block-base STC have been propose 2], 3] Recently, Hassibi an Hochwal have constructe a class of high-rate block-base STC known as linear ispersion coes 4], which support arbitrary numbers of transmit an receive antenna channels We treat as a general framework of complex space-time block coe esign A problem in most existing esign criteria of block-base space-time coes, incluing, is that they o not efficiently exploit aitional iversity potential in the real an image parts of coorinates of source ata constellation symbols A techniue to utilize the iversity potential of real an image parts of coorinates is calle coorinate interleaving or component interleaving CI, which was first propose for single stream communications systems 5], 6] Recently, CI has been applie to multiple antenna systems 7] 9] However, current existing approaches to using CI in blockbase space-time coes are low-rate esigns using orthogonal space-time block coes or their variation 7] 9] This paper proposes coorinate-interleaving as a general principle for high-rate block-base space-time coe esign, ie, space-time coorinate interleaving linear ispersion coes ST-CI This paper etermines the the upper boun iversity orer, statistical iversity orer an average iversity orer of ST-CI ST-CI maintains the same iversity orer as conventional ST- However, ST-CI may show either almost ouble average iversity orer or extra coing avantage over conventional ST- in time varying channels Compare with conventional ST-, ST-CI maintains the iversity performance in uasi-static block faing channels, an notably improves the iversity performance in rapi faing channels The following notation is use:re ] an Im ] enote the real an image parts, respectively, T matrix transpose, H matrix transpose conjugate, A] a,b enote the a, b entry element of matrix A, Kronecker prouct, I K enotes K K ientity matrix, an C m n enotes a complex matrix with imensions m n II PROPOSED SYSTEMS A MIMO system moel for in time varying channels In freuency-flat, time non-selective Rayleigh faing channels whose coefficients may vary per channel symbol time slot or channel use, a multi-antenna communication system is assume with transmit an N R receive antennas Assume that an uncorrelate ata seuence has been moulate using complex-value source ata symbols chosen from an arbitrary, eg D-PSK or D-QAM, constellation Each coewor of size T is transmitte uring every T time channel uses from transmit antennas 1 Component matrices in system euations: We now introuce several component matrices uring the k-th space-time coewor transmission The receive signal vector x k ] T x k,1,, x k,t, where x k,t CNR 1, t 1, T is the receive vector corresponing to the t-th row of the k-th coewor, S k The system channel matrix is H k H k,1 0 0 H k,t
2 where C N R ], t 1, T with entries H k,t h m,n k,t, m 1,,, n 1,, N R, is m,n a complex Gaussian MIMO channel matrix with zero-mean, unit variance entries corresponing to the t-th row of the k-th coewor, S k, an 0 enotes a zero matrix of size N R The complex Gaussian noise vector is v k ] T v k,1,, v k,t, where v k,t CNR 1, t H k,t 1, T is a complex Gaussian noise vector with zero mean, unit variance entries corresponing to the t-th row of the k-th coewor, S k corre- The encoe complex symbol vector s k spons to the k-th coewor, S k, where s k vec S k 1 2 System moel euation: The system euation for the transmission of the k-th matrix coewor is expresse as x k ρ H k sk +vk 2 where ρ is the signal-to-noise ratio SNR at each receive antenna, an inepenent of B Proceure of space-time inter- coorinate interleaving We propose a new space-time encoing proceure using inter- CI I-CI, calle space-time coorinate interleaving linear ispersion coes ST-CI as follows: Consier a pair of source ata symbol vectors s 1 with the same s 1 1,, s1 Q an s 2 s 2 1,, s2 Q number, Q of source ata symbol symbols, where s i Re s i + jim s i, i 1, 2, an 1,, Q The transmitter first coorinate-interleaves ] s 1 an s 2 into s CI1 T s CI1 1,, s CI1 Q an s CI2 s CI2 1,, s CI2 Q, where an s CI1 s CI2 Re Re s 1 s 2 + jim + jim s 2 s Then, s CI1 an s CI2 are encoe into two coewors of size T, S CI1 an SCI2, respectively Then the transmitter successively sens S CI1 an SCI2 uring two interleave perios such that channels are less correlate We remark that 1 using ifferent permutations, other methos of spacetime inter- CI than 3 an 4 are also possible; 2 The encoing matrices for S CI1 an SCI2 nee not be the same C ST-CI system structure The propose ST-CI system structure is shown in Figure 1 The system structure basically consists of three layers : 1 mapping from ata bits to constellation points, 2 inter- coorinate interleaving, an 3 coing Using the propose layere structure, the only aitional complexity compare with a conventional ST- system is the coorinate interleaving operation Thus, ST-CI system is computationally efficient The motivation of ST-CI is to rener the faing more inepenent of each coorinate of the source ata signals Note that ue to the superposition effects of signals from multiple transmit antennas at the spacetime MIMO receivers, existing esigns cannot guarantee faing inepenence of each coorinate of the source ata signals Compare with ST-, ST-CI introuces coorinate faing iversity at the cost of more ecoing elay using a pair of coewors of the same size III DIVERSITY ANALYSIS Su an Liu 10] recently analyze the iversity of spacetime moulation over time-correlate Rayleigh faing channels A moifie strategy can be use to investigate the iversity of ST-CI systems Consier a ST-CI block C, which consists of two ST- coewors of size T, S k, where k 1, 2 The communication moel for one ST-CI block C can be rewritten as where Y ρ MH + Z, 5 1 the noise vector is Z, Y 1 2 the receive signal vector Y ] ], Y 2 T T, where Y k Y k k 1,, Yk N, Y n R ] ] x k,1,, x k,t, k 1, 2, n,1 n,1 3 M is the channel symbol matrix corresponing to the block C, M iag M 1, M 2, where M 1 an M 2 are the matrices corresponing to the coewor S 1 an S2, respectively, M k I NR iag ] iag S k,, 1,m M k 1 S k,, Mk, M k ] T,m ] m, k 1, 2, an m 1,,, H 1 4 the channel vector H ] ], H 2 T T, where H k an h km,n h T k1,1,, ht k,1,, ht k1,n R,, h T k,n R, h k,1 m,n,, h k,t m,n A irectional pair, enote as X Y, means that a system etects X as Y Consier the irection pair of matrices M an
3 M corresponing to two ifferent ST- blocks C an C The upper boun pairwise error probability 11] is Pr M M 2r 1 r r a1 1 r ρ γ a 6 H, where r is the rank of M M R H M M an R H E H H] H is the correlation matrix of vector H, R H is of size 2 N R T 2 N R T, γ a, a 1,, r are the non-zero eigenvalues of H Λ M M R H M M Then the rank an prouct criteria are 1 Rank criterion: The minimum rank of Λ over all irection pairs of ifferent matrices M an M shoul be as large as possible 2 Prouct criterion: the minimum value of the prouct r γ a over all irection pairs of ifferent M an M a1 shoul be maximize To maximize the rank of Λ, we nee to maximize the ranks of both R H an M M Denote Ω k M k M k, where k 1, 2 Assume that all the possible M k an M k are containe in a set M k, ie, M k, M k M k, where k 1, 2 Then the iversity orer of the ST-CI, r, is r min rank Λ, M M, M M, M M 7 When M situations, M, there are three istinct categories of 1 M 1 M 1 an M 2 M 2, 2 M 1 M 1 an M 2 M 2, 3 M 1 M 1 an M 2 M 2 Note that when R H is full rank, 1 in the above Situations 1 an 2, the upper boun of rankλ is N R T, 2 in the above Situation 3, the upper boun of rankλ is 2N R T Thus ST-CI oes not further increase the iversity orer over ST- in terms of the conventional efinition 7 However, ST-CI oes increase r over ST- for the above-mentione thir situation, which is not the conventional iversity orer of the STC an may significantly impact system performance It is necessary to introuce a new concept to uantify this effect as follows, Definition 1: Statistical iversity orer, r s, is the rank of Λ achieve with a certain probability α, mathematically written as rank Λ r s, Pr M M, M, M α 8 M, Then, we have the following theorem Theorem 1: A ST-CI is constructe through coorinate interleaving across a pair of component coewors Both component encoers are able to generate ifferent coewors for ifferent input seuences The iversity orers of the component s are r 1 an r 2, respectively Suppose that R H is full rank The coebook sizes of the two component s are the same value, N a 1 The iversity orer of this ST-CI, r, is min r 1, r2 2 Assuming that all irectional pairs M an M are eually probable, the statistical iversity orer of this ST-CI, r s, is r 1 + r 2 with probability Na Na 2 2 α Na Na Na + N 2 2 a 2 The proof of Theorem 1 is omitte ue to space limitations A problem of the above iscussion is that the analysis is purely base on pairwise error probability However, system performance is normally expresse as average error probability AEP We further introuce a iversity concept base on AEP Definition 2: Denote AEP of the communications system with the coewor block set M at average receive SNR ρ as AEP M, ρ Assume that AEP M, ρ is ifferentiable at ρ Denote fρ log 10 AEP M, ρ an gρ log 10 ρ The average iversity orer, r a, at the average signal-tonoise ratio SNR of each receive antenna, ρ, is efine as a ifferential r a fρ gρ 9 Note that AEP cannot be generally erive Thus we propose an analysis of the iversity performance of CI-ST base on the error union boun EUB, an upper boun on the average error probability, is an average of the pairwise error probabilities between all irection pairs of coewors Due to space limitations, the EUB base analysis is not provie in etail The result of this analysis is that the average iversity orer of CI-ST can be approximate as either min r 1, r2 or r 1 + r 2, the choice of which epens on the value of SNR ρ an the coebook size N a In the case of r a min r 1, r2, the merit of CI appears as an extra coing avantage
4 Note that except for the trivial extra computational loa of coorinate interleaving, for the same size of encoing matrices, the complexity per coewor of the ST- CI system is almost the same as that of conventional systems However, the upper boun achievable average iversity orer of a ST-CI system is almost twice that of conventional block-base space-time coe BSTC systems if the two component s in the ST-CI have similar iversity features It is worth mentioning that using nonlinear sphere or ML ecoing, the conventional BSTC systems nee much higher complexity to reach an average iversity orer comparable to ST-CI We remark the scope of this approach is not limite to Other block-base space-time coe esigns may also be improve using the propose space-time inter- coorinate interleaving approach Further, the pair of coewors use in ST-CI coul be viewe as a single specially esigne coewor of size 2T Thus ST-CI systems coul be viewe as extensions of systems using ifferent esign criteria A Simulation setup IV PERFORMANCE Perfect channel knowlege amplitue an phase is assume at the receiver but not at the transmitter Assume the number of receive antennas is eual to the number of transmit antennas Channel symbols are estimate using MMSE estimation Data symbols use QPSK moulation in all simulations The signal-to-noise-ratio SNR reporte in all figures is the average symbol SNR per receive antenna The matrix channel is assume to be constant over ifferent integer numbers of channel uses or symbol time slots, an ii between blocks We enote this interval as the channel change interval CCI Three space-time block coes, Coe A, Coe B, an Coe C, are use as component coing matrices of ST-CI systems in the simulations Coe A is chosen from E 31 of 4], a class of rate-one suare of arbitrary size propose by Hassibi an Hochwal Coe B is chosen from Design A of full iversity full rate FDFR coes propose by Ma an Giannakis 12] Coe C is a non-rate-one high rate coe for the configuration of 4,T 6,Q 12, propose by Hassibi an Hochwal 4] B Performance comparison The performance comparison of coe A is shown in Figures 2, 3 an 4 The performance comparison of coe B is shown in Figure 5 The performance comparison of coe C is shown in Figure 6 In block faing channels, ie, when the 4 4 MIMO channels are constant over the pair of ST- coewors an coe A is use, ST-CI obtains the same performance as that of ST- as shown in Figure 3 However, as shown in Figures 2, 4 5, an 6, ST-CI significantly outperforms ST- at high SNRs in rapi faing channels Thus, the ST-CI proceure may be applie to both rate-one an slightly lower rate coes Observing Figures 2 an 5, the performances of coe A an coe B are similar in rapi faing channels Thus, even though coe A is not esigne uner a iversity criterion, coe A appears to possess goo iversity properties V CONCLUSION This paper has propose a general space-time inter- coorinate interleaving proceure, ST-CI, which may be applie to either rate-one information lossless or slightly lower rate block-base space-time coing systems This enables not only symbol-level iversity but also coorinatelevel iversity The upper boun iversity orer of ST-CI is analyze, an the analysis results of the upper boun statistical iversity orer an average iversity orer of ST- CI are provie Compare with conventional ST-, ST-CI show either much higher average iversity orer or extra coing avantage in time varying channels Compare with conventional block-base STCs, ST-CI maintains iversity performance in uasi-static block faing channels, an significantly improves the iversity performance in the high SNR regions of rapi faing channels This work was supporte by the Natural Sciences an Engineering Research Council of Canaa Grant an Communications an Information Technology Ontario REFERENCES 1] VTarokh, NSeshari, an ACalerbank, Space-time coes for high ata rate wireless communications: performance criterion an coe construction, IEEE TransInformTheory, vol 44, pp , Mar ] SAlamouti, A simple transmitter iversity scheme for wireless communications, IEEE JSelectAreas Commun, pp , Oct ] VTarokh, HJafarkhani, an ARCalerbank, Space-time block coe from orthogonal esigns 3, IEEE TransInformTheory, vol 45, pp , July ] B Hassibi an B M Hochwal, High-rate coes that are linear in space an time, IEEE TransInformTheory, vol 48, no 7, pp , July ] KBoulle an JCBelfiore, Moulation schemes esigne for the Rayleigh channel, in Proc CISS 1992, 1992, pp ] BDJelicic an SRoy, Cutoff rates for coorinate interleave QAM over Rayleigh faing channels, IEEE TransCommun, vol 44, no 10, pp , Oct ] Y-H Kim an MKaveh, Coorinate-interleave space-time coing with rotate constellation, in Proc IEEE VTC, vol 1, Apr 2003, pp ] MZAKhan an BSRajan, Space-time block coes from co-orinate interleave orthogonal esigns, in Proc IEEE ISIT 2002, 2002, pp ] MZAKhan, BSRajan, an M H Lee, Rectangular co-orinate interleave orthogonal esigns, in Proc IEEE Globecom 2003, vol 4, Dec 2003, pp ] W Su, ZSafar, an KJRLiu, Diversity analysis of space-time moulation over time-correlate Rayleigh-faing channels, IEEE TransInformTheory, vol 50, no 8, pp , Aug ] SSiwamogsatham, MPFitz, an JHGrimm, A new view of performance analysis of transmit iversity schemes in correlate Rayleigh faing, IEEE TransInformTheory, vol 48, no 4, pp , Apr ] X Ma an GBGiannakis, Full-iversity full-rate complex-fiel spacetime coing, IEEE Transon SigProc, vol 51, no 11, pp , Nov 2003
5 Input Data Bits Digital Moulation Constellation Mapping 2 ST-Inter- coorinate interleaving ST- Encoing ST- Encoing Transmitte first Transmitte secon Multiple transmit antennas Performance comparision ST I CI vs ST 2, N R 2, T 2, Q 4, CCI 1 ST ST I CI Channel Output Data Bits Digital De-Moulation Constellation De-Mapping 2 ST-Inter- coorinate einterleaving ST- Decoing ST- Decoing Receive first Receive secon Multiple receive antennas SNR B Fig 1 Space-time inter- coorinate interleaving system structure Fig 4 performance comparison of ST-CI vs using coe A, CCI 1, 2, N R 2, T 2, Q 4 Performance comparision ST I CI vs ST 4, T 4, Q 16, CCI 1 Performance comparision ST I CI vs ST 4, T 4, Q 16, CCI 1 ST ST I CI ST ST I CI SNR B Fig 2 performance comparison of ST-CI vs using coe A, CCI 1, 4, T 4, Q 16 Performance comparision ST I CI vs ST 4, T 4, Q 16, CCI 8 ST ST I CI SNR B Fig 5 performance comparison of ST-CI vs using coe B, CCI 1, 4, T 4, Q 16 Performance comparision ST I CI vs ST 4, T 6, Q 12, CCI 1 ST ST I CI SNR B SNR B Fig 3 performance comparison of ST-CI vs using coe A, CCI 8, 4, T 4, Q 16 Fig 6 performance comparison of ST-CI vs using coe C, CCI 1, 4, T 6, Q 12
Capacity Analysis of MIMO Systems with Unknown Channel State Information
Capacity Analysis of MIMO Systems with Unknown Channel State Information Jun Zheng an Bhaskar D. Rao Dept. of Electrical an Computer Engineering University of California at San Diego e-mail: juzheng@ucs.eu,
More informationAn Analytical Expression of the Probability of Error for Relaying with Decode-and-forward
An Analytical Expression of the Probability of Error for Relaying with Decoe-an-forwar Alexanre Graell i Amat an Ingmar Lan Department of Electronics, Institut TELECOM-TELECOM Bretagne, Brest, France Email:
More information6 Wave equation in spherical polar coordinates
6 Wave equation in spherical polar coorinates We now look at solving problems involving the Laplacian in spherical polar coorinates. The angular epenence of the solutions will be escribe by spherical harmonics.
More informationOn the Relationship Between Mutual Information and Bit Error Probability for Some Linear Dispersion Codes
9 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO., JANUARY 29 On the Relationship Between Mutual Information an Bit Error Probability for Some Linear Dispersion Coes Xianglan Jin, Jae-Dong Yang,
More information19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control
19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationThroughput Optimal Control of Cooperative Relay Networks
hroughput Optimal Control of Cooperative Relay Networks Emun Yeh Dept. of Electrical Engineering Yale University New Haven, C 06520, USA E-mail: emun.yeh@yale.eu Ranall Berry Dept. of Electrical an Computer
More information. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences.
S 63 Lecture 8 2/2/26 Lecturer Lillian Lee Scribes Peter Babinski, Davi Lin Basic Language Moeling Approach I. Special ase of LM-base Approach a. Recap of Formulas an Terms b. Fixing θ? c. About that Multinomial
More information'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21
Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting
More informationSYNCHRONOUS SEQUENTIAL CIRCUITS
CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents
More informationMulti-edge Optimization of Low-Density Parity-Check Codes for Joint Source-Channel Coding
Multi-ege Optimization of Low-Density Parity-Check Coes for Joint Source-Channel Coing H. V. Beltrão Neto an W. Henkel Jacobs University Bremen Campus Ring 1 D-28759 Bremen, Germany Email: {h.beltrao,
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationLecture 12: November 6, 2013
Information an Coing Theory Autumn 204 Lecturer: Mahur Tulsiani Lecture 2: November 6, 203 Scribe: Davi Kim Recall: We were looking at coes of the form C : F k q F n q, where q is prime, k is the message
More informationQubit channels that achieve capacity with two states
Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
More informationTDD Linear Precoding Methods for Next Generation Mobile Communication Systems
MEE10:118 Master s Thesis Electrical Engineering with emphasis on Raio Communications TDD Linear Precoing Methos for Next Generation Mobile Communication Systems Author: Yuan Ding Email: ingyuan.hit@gmail.com
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationDiagonalization of Matrices Dr. E. Jacobs
Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is
More informationLeaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes
Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationLaplacian Cooperative Attitude Control of Multiple Rigid Bodies
Laplacian Cooperative Attitue Control of Multiple Rigi Boies Dimos V. Dimarogonas, Panagiotis Tsiotras an Kostas J. Kyriakopoulos Abstract Motivate by the fact that linear controllers can stabilize the
More informationMaximum Achievable Diversity for MIMO-OFDM Systems with Arbitrary. Spatial Correlation
Maximum Achievable Diversity for MIMO-OFDM Systems with Arbitrary Spatial Correlation Ahmed K Sadek, Weifeng Su, and K J Ray Liu Department of Electrical and Computer Engineering, and Institute for Systems
More informationNon-Coherent Capacity and Reliability of Sparse Multipath Channels in the Wideband Regime
Non-Coherent Capacity an Reliability of Sparse Multipath Channels in the Wieban Regime Gautham Hariharan an Abar M Sayee Department of Electrical an Computer Engineering University of Wisconsin-Maison
More informationTIME-DELAY ESTIMATION USING FARROW-BASED FRACTIONAL-DELAY FIR FILTERS: FILTER APPROXIMATION VS. ESTIMATION ERRORS
TIME-DEAY ESTIMATION USING FARROW-BASED FRACTIONA-DEAY FIR FITERS: FITER APPROXIMATION VS. ESTIMATION ERRORS Mattias Olsson, Håkan Johansson, an Per öwenborg Div. of Electronic Systems, Dept. of Electrical
More informationCOUPLING REQUIREMENTS FOR WELL POSED AND STABLE MULTI-PHYSICS PROBLEMS
VI International Conference on Computational Methos for Couple Problems in Science an Engineering COUPLED PROBLEMS 15 B. Schrefler, E. Oñate an M. Paparakakis(Es) COUPLING REQUIREMENTS FOR WELL POSED AND
More informationImproving Estimation Accuracy in Nonrandomized Response Questioning Methods by Multiple Answers
International Journal of Statistics an Probability; Vol 6, No 5; September 207 ISSN 927-7032 E-ISSN 927-7040 Publishe by Canaian Center of Science an Eucation Improving Estimation Accuracy in Nonranomize
More informationOptimal CDMA Signatures: A Finite-Step Approach
Optimal CDMA Signatures: A Finite-Step Approach Joel A. Tropp Inst. for Comp. Engr. an Sci. (ICES) 1 University Station C000 Austin, TX 7871 jtropp@ices.utexas.eu Inerjit. S. Dhillon Dept. of Comp. Sci.
More informationChapter 2 Lagrangian Modeling
Chapter 2 Lagrangian Moeling The basic laws of physics are use to moel every system whether it is electrical, mechanical, hyraulic, or any other energy omain. In mechanics, Newton s laws of motion provie
More informationRank, Trace, Determinant, Transpose an Inverse of a Matrix Let A be an n n square matrix: A = a11 a1 a1n a1 a an a n1 a n a nn nn where is the jth col
Review of Linear Algebra { E18 Hanout Vectors an Their Inner Proucts Let X an Y be two vectors: an Their inner prouct is ene as X =[x1; ;x n ] T Y =[y1; ;y n ] T (X; Y ) = X T Y = x k y k k=1 where T an
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationERROR-detecting codes and error-correcting codes work
1 Convolutional-Coe-Specific CRC Coe Design Chung-Yu Lou, Stuent Member, IEEE, Babak Daneshra, Member, IEEE, an Richar D. Wesel, Senior Member, IEEE arxiv:1506.02990v1 [cs.it] 9 Jun 2015 Abstract Cyclic
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationAPPPHYS 217 Thursday 8 April 2010
APPPHYS 7 Thursay 8 April A&M example 6: The ouble integrator Consier the motion of a point particle in D with the applie force as a control input This is simply Newton s equation F ma with F u : t q q
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationRobustness and Perturbations of Minimal Bases
Robustness an Perturbations of Minimal Bases Paul Van Dooren an Froilán M Dopico December 9, 2016 Abstract Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important
More informationarxiv:cs/ v1 [cs.it] 11 Sep 2006
0 High Date-Rate Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks arxiv:cs/0609054v1 [cs.it] 11 Sep 2006 Zhihang Yi and Il-Min Kim Department of Electrical and Computer Engineering
More informationThis module is part of the. Memobust Handbook. on Methodology of Modern Business Statistics
This moule is part of the Memobust Hanbook on Methoology of Moern Business Statistics 26 March 2014 Metho: Balance Sampling for Multi-Way Stratification Contents General section... 3 1. Summary... 3 2.
More informationA Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential
Avances in Applie Mathematics an Mechanics Av. Appl. Math. Mech. Vol. 1 No. 4 pp. 573-580 DOI: 10.4208/aamm.09-m0946 August 2009 A Note on Exact Solutions to Linear Differential Equations by the Matrix
More informationCHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold
CHAPTER 1 : DIFFERENTIABLE MANIFOLDS 1.1 The efinition of a ifferentiable manifol Let M be a topological space. This means that we have a family Ω of open sets efine on M. These satisfy (1), M Ω (2) the
More informationEuler equations for multiple integrals
Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................
More information1 Heisenberg Representation
1 Heisenberg Representation What we have been ealing with so far is calle the Schröinger representation. In this representation, operators are constants an all the time epenence is carrie by the states.
More informationLecture 1b. Differential operators and orthogonal coordinates. Partial derivatives. Divergence and divergence theorem. Gradient. A y. + A y y dy. 1b.
b. Partial erivatives Lecture b Differential operators an orthogonal coorinates Recall from our calculus courses that the erivative of a function can be efine as f ()=lim 0 or using the central ifference
More informationRelative Entropy and Score Function: New Information Estimation Relationships through Arbitrary Additive Perturbation
Relative Entropy an Score Function: New Information Estimation Relationships through Arbitrary Aitive Perturbation Dongning Guo Department of Electrical Engineering & Computer Science Northwestern University
More informationError Floors in LDPC Codes: Fast Simulation, Bounds and Hardware Emulation
Error Floors in LDPC Coes: Fast Simulation, Bouns an Harware Emulation Pamela Lee, Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Borivoje Nikolic, an Martin J. Wainwright EECS Department University of
More informationA check digit system over a group of arbitrary order
2013 8th International Conference on Communications an Networking in China (CHINACOM) A check igit system over a group of arbitrary orer Yanling Chen Chair of Communication Systems Ruhr University Bochum
More informationMASSIVE multiple-input multiple-output (MIMO) has
IEEE SIGNAL PROCESSING LETTERS, VOL. 4, NO. 1, DECEMBER 017 1847 Spectral Efficiency uner Energy Constraint for Mixe-ADC MRC Massive MIMO Hessam Pirzaeh, Stuent Member, IEEE, an A. Lee Swinlehurst, Fellow,
More informationImplicit Differentiation
Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationFunction Spaces. 1 Hilbert Spaces
Function Spaces A function space is a set of functions F that has some structure. Often a nonparametric regression function or classifier is chosen to lie in some function space, where the assume structure
More informationClosed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device
Close an Open Loop Optimal Control of Buffer an Energy of a Wireless Device V. S. Borkar School of Technology an Computer Science TIFR, umbai, Inia. borkar@tifr.res.in A. A. Kherani B. J. Prabhu INRIA
More informationensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y
Ph195a lecture notes, 1/3/01 Density operators for spin- 1 ensembles So far in our iscussion of spin- 1 systems, we have restricte our attention to the case of pure states an Hamiltonian evolution. Toay
More informationThe Press-Schechter mass function
The Press-Schechter mass function To state the obvious: It is important to relate our theories to what we can observe. We have looke at linear perturbation theory, an we have consiere a simple moel for
More informationAdaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems
ACSTSK Adaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems Professor Sheng Chen Electronics and Computer Science University of Southampton Southampton SO7 BJ, UK E-mail: sqc@ecs.soton.ac.uk
More informationOn combinatorial approaches to compressed sensing
On combinatorial approaches to compresse sensing Abolreza Abolhosseini Moghaam an Hayer Raha Department of Electrical an Computer Engineering, Michigan State University, East Lansing, MI, U.S. Emails:{abolhos,raha}@msu.eu
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Friday, May 25, 2018 09:00-11:30, Kansliet 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Wednesday, June 1, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationTEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE
TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS Yannick DEVILLE Université Paul Sabatier Laboratoire Acoustique, Métrologie, Instrumentation Bât. 3RB2, 8 Route e Narbonne,
More informationTechnion - Computer Science Department - M.Sc. Thesis MSC Constrained Codes for Two-Dimensional Channels.
Technion - Computer Science Department - M.Sc. Thesis MSC-2006- - 2006 Constraine Coes for Two-Dimensional Channels Keren Censor Technion - Computer Science Department - M.Sc. Thesis MSC-2006- - 2006 Technion
More informationHomework 3 - Solutions
Homework 3 - Solutions The Transpose an Partial Transpose. 1 Let { 1, 2,, } be an orthonormal basis for C. The transpose map efine with respect to this basis is a superoperator Γ that acts on an operator
More informationLinear and quadratic approximation
Linear an quaratic approximation November 11, 2013 Definition: Suppose f is a function that is ifferentiable on an interval I containing the point a. The linear approximation to f at a is the linear function
More informationMath Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors
Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+
More informationWe G Model Reduction Approaches for Solution of Wave Equations for Multiple Frequencies
We G15 5 Moel Reuction Approaches for Solution of Wave Equations for Multiple Frequencies M.Y. Zaslavsky (Schlumberger-Doll Research Center), R.F. Remis* (Delft University) & V.L. Druskin (Schlumberger-Doll
More informationPrecoder Design for Space-Time Coded Systems Over Correlated Rayleigh Fading Channels Using Convex Optimization
84 IEEE TRASACTIOS O SIGAL PROCESSIG, VOL. 57, O. 2, FEBRUARY 29 [4] A. Belouchrani, K. Abe-Meraim, M. G. Amin, an A. M. Zoubir, Joint anti-iagonalization for blin source separation, in Proc. IEEE Int.
More informationu!i = a T u = 0. Then S satisfies
Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace
More informationECE 422 Power System Operations & Planning 7 Transient Stability
ECE 4 Power System Operations & Planning 7 Transient Stability Spring 5 Instructor: Kai Sun References Saaat s Chapter.5 ~. EPRI Tutorial s Chapter 7 Kunur s Chapter 3 Transient Stability The ability of
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationLecture 5: Antenna Diversity and MIMO Capacity Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
: Antenna Diversity and Theoretical Foundations of Wireless Communications Wednesday, May 4, 206 9:00-2:00, Conference Room SIP Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationNonlinear Schrödinger equation with a white-noise potential: Phase-space approach to spread and singularity
Physica D 212 (2005) 195 204 www.elsevier.com/locate/phys Nonlinear Schröinger equation with a white-noise potential: Phase-space approach to sprea an singularity Albert C. Fannjiang Department of Mathematics,
More informationLecture 7 MIMO Communica2ons
Wireless Communications Lecture 7 MIMO Communica2ons Prof. Chun-Hung Liu Dept. of Electrical and Computer Engineering National Chiao Tung University Fall 2014 1 Outline MIMO Communications (Chapter 10
More informationA PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks
A PAC-Bayesian Approach to Spectrally-Normalize Margin Bouns for Neural Networks Behnam Neyshabur, Srinah Bhojanapalli, Davi McAllester, Nathan Srebro Toyota Technological Institute at Chicago {bneyshabur,
More informationDecoding Delay and Outage Performance Analysis of Full-Duplex Decode-Forward Relaying: Backward or Sliding Window Decoding
Decoing Delay an Outage Performance Analysis of Full-Duplex Decoe-Forwar Relaying: Backwar or Sliing Winow Decoing Ahma Abu Al Haija Member IEEE an Chintha Tellambura Fellow IEEE Abstract High reliability
More informationOn the minimum distance of elliptic curve codes
On the minimum istance of elliptic curve coes Jiyou Li Department of Mathematics Shanghai Jiao Tong University Shanghai PRChina Email: lijiyou@sjtueucn Daqing Wan Department of Mathematics University of
More informationA Novel Decoupled Iterative Method for Deep-Submicron MOSFET RF Circuit Simulation
A Novel ecouple Iterative Metho for eep-submicron MOSFET RF Circuit Simulation CHUAN-SHENG WANG an YIMING LI epartment of Mathematics, National Tsing Hua University, National Nano evice Laboratories, an
More informationAPPROXIMATE SOLUTION FOR TRANSIENT HEAT TRANSFER IN STATIC TURBULENT HE II. B. Baudouy. CEA/Saclay, DSM/DAPNIA/STCM Gif-sur-Yvette Cedex, France
APPROXIMAE SOLUION FOR RANSIEN HEA RANSFER IN SAIC URBULEN HE II B. Bauouy CEA/Saclay, DSM/DAPNIA/SCM 91191 Gif-sur-Yvette Ceex, France ABSRAC Analytical solution in one imension of the heat iffusion equation
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationPredictive control of synchronous generator: a multiciterial optimization approach
Preictive control of synchronous generator: a multiciterial optimization approach Marián Mrosko, Eva Miklovičová, Ján Murgaš Abstract The paper eals with the preictive control esign for nonlinear systems.
More informationVIRTUAL STRUCTURE BASED SPACECRAFT FORMATION CONTROL WITH FORMATION FEEDBACK
AIAA Guiance, Navigation, an Control Conference an Exhibit 5-8 August, Monterey, California AIAA -9 VIRTUAL STRUCTURE BASED SPACECRAT ORMATION CONTROL WITH ORMATION EEDBACK Wei Ren Ranal W. Bear Department
More informationStopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Codes
Stopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Coes Kaiann Fu an Achilleas Anastasopoulos Electrical Engineering an Computer Science Dept. University of Michigan, Ann Arbor, MI
More informationarxiv: v1 [physics.class-ph] 20 Dec 2017
arxiv:1712.07328v1 [physics.class-ph] 20 Dec 2017 Demystifying the constancy of the Ermakov-Lewis invariant for a time epenent oscillator T. Pamanabhan IUCAA, Post Bag 4, Ganeshkhin, Pune - 411 007, Inia.
More informationDelay Limited Capacity of Ad hoc Networks: Asymptotically Optimal Transmission and Relaying Strategy
Delay Limite Capacity of A hoc Networks: Asymptotically Optimal Transmission an Relaying Strategy Eugene Perevalov Lehigh University Bethlehem, PA 85 Email: eup2@lehigh.eu Rick Blum Lehigh University Bethlehem,
More informationVectors in two dimensions
Vectors in two imensions Until now, we have been working in one imension only The main reason for this is to become familiar with the main physical ieas like Newton s secon law, without the aitional complication
More informationMultilevel Coding for the Full-Duplex Decode-Compress-Forward Relay Channel
entropy Article Multilevel Coing for the Full-Duplex Decoe-Compress-Forwar Relay Channel Ahme Attia Abotabl an Aria Nosratinia Department of Electrical & Computer Engineering, The University of Texas at
More informationA New Minimum Description Length
A New Minimum Description Length Soosan Beheshti, Munther A. Dahleh Laboratory for Information an Decision Systems Massachusetts Institute of Technology soosan@mit.eu,ahleh@lis.mit.eu Abstract The minimum
More informationSecure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel
Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 074 pritamm@umd.edu
More informationConcentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection and System Identification
Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection an System Ientification Borhan M Sananaji, Tyrone L Vincent, an Michael B Wakin Abstract In this paper,
More informationDesign A Robust Power System Stabilizer on SMIB Using Lyapunov Theory
Design A Robust Power System Stabilizer on SMIB Using Lyapunov Theory Yin Li, Stuent Member, IEEE, Lingling Fan, Senior Member, IEEE Abstract This paper proposes a robust power system stabilizer (PSS)
More informationMulti-View Clustering via Canonical Correlation Analysis
Technical Report TTI-TR-2008-5 Multi-View Clustering via Canonical Correlation Analysis Kamalika Chauhuri UC San Diego Sham M. Kakae Toyota Technological Institute at Chicago ABSTRACT Clustering ata in
More informationEfficient (nonrandom) construction and decoding for non-adaptive group testing
Efficient nonranom construction an ecoing for non-aaptive group testing arxiv:1804.03819v4 [cs.it] 8 Oct 2018 Thach V. Bui, Minoru Kuribayashi, Tetsuya Kojima, Roghayyeh Haghvirinezha, an Isao Echizen
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More informationTraining-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks
Training-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks J Harshan Dept of ECE, Indian Institute of Science Bangalore 56001, India Email: harshan@eceiiscernetin B Sundar Rajan
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationGeneralizing Kronecker Graphs in order to Model Searchable Networks
Generalizing Kronecker Graphs in orer to Moel Searchable Networks Elizabeth Boine, Babak Hassibi, Aam Wierman California Institute of Technology Pasaena, CA 925 Email: {eaboine, hassibi, aamw}@caltecheu
More informationWitten s Proof of Morse Inequalities
Witten s Proof of Morse Inequalities by Igor Prokhorenkov Let M be a smooth, compact, oriente manifol with imension n. A Morse function is a smooth function f : M R such that all of its critical points
More informationmodel considered before, but the prey obey logistic growth in the absence of predators. In
5.2. First Orer Systems of Differential Equations. Phase Portraits an Linearity. Section Objective(s): Moifie Preator-Prey Moel. Graphical Representations of Solutions. Phase Portraits. Vector Fiels an
More informationIPMSM Inductances Calculation Using FEA
X International Symposium on Inustrial Electronics INDEL 24, Banja Luka, November 68, 24 IPMSM Inuctances Calculation Using FEA Dejan G. Jerkan, Marko A. Gecić an Darko P. Marčetić Department for Power,
More informationPermanent vs. Determinant
Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an
More informationProblem Sheet 2: Eigenvalues and eigenvectors and their use in solving linear ODEs
Problem Sheet 2: Eigenvalues an eigenvectors an their use in solving linear ODEs If you fin any typos/errors in this problem sheet please email jk28@icacuk The material in this problem sheet is not examinable
More information