Linear and Nonlinear Iterative Multiuser Detection
|
|
- Linda Banks
- 5 years ago
- Views:
Transcription
1 1 Linear and Nonlinear Iterative Multiuser Detection Alex Grant and Lars Rasmussen University of South Australia October 2011
2 Outline 1 Introduction 2 System Model 3 Multiuser Detection 4 Interference Cancellation 5 Linear Methods 6 Nonlinear Methods 7 Numerical Results 2
3 Outline 1 Introduction 2 System Model 3 Multiuser Detection 4 Interference Cancellation 5 Linear Methods 6 Nonlinear Methods 7 Numerical Results 3
4 System Model s 1[j] a 1 Data Source b 1[i] C 1 π 1 x 1[j] s 1[j] y 1[i] s 2[j] a 2 Data Source b 2[i] C 2 π 2 x 2[j] r[j] s 2[j] y 2[i] Multiuser Receiver n s K[j] a K Data Source b K[i] C K π K x K[j] Noise s K[j] y K[i] BPSK data x [j] { 1, 1} { Spreading s [i] 1/ N, +1/ N AWGN E { n[i]n t [i] } = σ 2 I } N 4
5 System Model s 1[j] a 1 Data Source b 1[i] C 1 π 1 x 1[j] s 1[j] y 1[i] s 2[j] a 2 Data Source b 2[i] C 2 π 2 x 2[j] r[j] s 2[j] y 2[i] Multiuser Receiver n s K[j] a K Data Source b K[i] C K π K x K[j] Noise s K[j] y K[i] K r[i] = s [i]a x [i] + n[i] =1 = S[i]Ax[i] + n[i] 5
6 System Model s 1[j] a 1 Data Source b 1[i] C 1 π 1 x 1[j] s 1[j] y 1[i] s 2[j] a 2 Data Source b 2[i] C 2 π 2 x 2[j] r[j] s 2[j] y 2[i] Multiuser Receiver n s K[j] a K Data Source b K[i] C K π K x K[j] Noise s K[j] y K[i] y[i] = S t [i]r[i] = S t [i]s[i]ax[i] + S t [i]n[i] = R[i]Ax[i] + z[i] 6
7 Matched Filter Ouput y[i] = S t [i]r[i] = S t [i]s[i]ax[i] + S t [i]n[i] = R[i]Ax[i] + z[i] Matched filter output is a sufficient statistic R[i] = S t [i]s[i] is the correlation matrix z[i] is colored Gaussian noise, E { z[i]z t [i] } = σ 2 R[i] Assume unit norm modulation, R ii = 1 and R ij 1, i j. 7
8 Outline 1 Introduction 2 System Model 3 Multiuser Detection 4 Interference Cancellation 5 Linear Methods 6 Nonlinear Methods 7 Numerical Results 8
9 Optimal Joint Detection Minimum error probability optimal multiuser detector ˆx MAP = arg max x { 1,1} K Pr(x r) = arg max x { 1,1} K p(r x)pr(x). Equiprobable data - maximum-lielihood detector, ˆx ML = arg max p(r x) x { 1,1} K = arg max x { 1,1} K exp = arg max x { 1,1} K exp Complexity O ( 2 K) ( 12 r SAx 2 ) ( 12 (y RAx) R 1 (y RAx) t ). 9
10 Optimal Joint Detection W. van Etten. Maximum lielihood receiver for multiple channel transmission systems. IEEE Trans. Commun., 24(2): , February K. S. Schneider. Optimum detection of code division multiplexed signals. IEEE Trans. Aerosp. Electron. Systems, 15: , January R. Kohno, M. Hatori, and H. Imai. Cancellation techniques of co-channel interference in asynchronous spread spectrum multiple access systems. Electronics and Commun., 66-A:20 29, S. Verdú. Minimum probability of error for asynchronous Gaussian multiple access channels. IEEE Trans. Inform. Theory, 32(1):85 96, January
11 Decorrelator Suppose correlation matrix R = S t S is invertible ˆx = ( S t S ) 1 S t r = R 1 y = Ax + R 1 z, E { R 1 zz t R 1} = σ 2 R 1 y consists of correlated data RAx and correlated noise R, ˆx consists of independent data Ax and correlated noise R 1. Multiple-access interference elimination vs. noise enhancement ML when relaxing x { 1, 1} K to x R K. ML for unnown A (estimates Ax rather than x). R. Lupas and S. Verdú. Linear multiuser detectors for synchronous code division multiple access channels. IEEE Trans. Inform. Theory, 35(1): , January
12 Minimum Mean Squared Error Estimation Let x and y be random vectors with x = E {x} ȳ = E {y} G xy = (Cov {y, y}) 1 Cov {y, x} LMMSE estimate of x given y is x + G t xy (y ȳ). For jointly Gaussian x, y linear estimate in fact minimizes mean squared error. H. V. Poor. An Introduction to Signal Detection and Estimation. Springer-Verlag,
13 Linear Minimum Mean Square Error Detectors Chip-level (considering x, r) or symbol-level (considering x, y) ˆx r = E {x} + G t xr (r r) ˆx y = E {x} + G t xy (y ȳ). Independent data with E {x} = x and Cov {x, x} = I diag ( x x t) = V results in ˆx r = x + VAS t ( SAVAS t + σ 2 I ) 1 (r SA x) ˆx y = x + VAR ( RAVAR + σ 2 R ) 1 (y RA x) = x + A 1 ( R + σ 2 (AVA) 1) 1 (y RA x). Zero mean data results in ˆx r = AS t ( SA 2 S t + σ 2 I ) 1 r ˆx y = A 1 ( R + σ 2 A 2) 1 y. 13
14 Linear Minimum Mean Square Error Detectors Z. Xie, R. T. Short, and C. K. Rushforth. A family of suboptimum detectors for coherent multiuser communications. IEEE J. Select. Areas Commun., 8(4): , May P. B. Rapajic and B. S. Vucetic. Adaptive receiver structures for asynchronous CDMA systems. IEEE J. Select. Areas Commun., 12(4): , May U. Madhow and M. L. Honig. MMSE interference suppression for direct sequence spread spectrum CDMA. IEEE Trans. Commun., 42(12): , December
15 Outline 1 Introduction 2 System Model 3 Multiuser Detection 4 Interference Cancellation 5 Linear Methods 6 Nonlinear Methods 7 Numerical Results 15
16 Interference Cancellation Matched filter output for user y = s t r = a x + s t s j a j x j + n j = a x + R j a j x j j }{{} multiple-access interference User could subtract an estimate of the MAI +z Estimate will not be perfect leaving residual MAI. This motivates an iterative cancellation approach 16
17 Iterative Interference Cancellation Let estimate of user at iteration n be ˆx (n) ˆx (n+1) = a 1 st = a 1 r s j a j ˆx (n) j j y R j a j ˆx (n) j j. chip-rate symbol-rate Choosing initial estimate ˆx (0) = 0 yields ˆx (1) = a 1 y. If ˆx (n) = x cancellation is perfect, ˆx (n+1) = x + z a 17
18 Parallel Cancellation ˆx (n+1) = A 1 (y (R I) Aˆx (n)). y 1 R 1 a 1 ˆx (1) 1 R 1 a 1 y j R j a j ˆx (1) j R j a j y a 1 ˆx (1) a 1 ˆx (2) y y K R K a K ˆx (1) K R K a K Stage 0 Stage 1 18
19 Serial Cancellation Cancel estimates as soon as they are available ˆx (n+1) 1 K = a 1 st r s j a j ˆx (n+1) j = a 1 j=1 1 y j=1 R j a j ˆx (n+1) j j=+1 K j=+1 Let R = L + L t + I where L is strictly triangular s j a j ˆx (n) j R j a j ˆx (n) j ˆx (n+1) = A 1 (y LAˆx (n+1) L t Aˆx (n)).. 19
20 Serial Cancellation ˆx (n+1) = A 1 (y LAˆx (n+1) L t Aˆx (n)). R 1 a 1 ˆx (1) 1 R 1 a 1 ˆx (2) 1 R j a j ˆx (1) j R j a j ˆx (2) j y a 1 ˆx (1) a 1 ˆx (2) y y K R K a K ˆx (1) K R K a K Stage 0 Stage 1 20
21 Implementation via Residual Error Update Chip-level parallel interference canceller K ˆx (n+1) = a 1 st r s j a j ˆx (n) j = ˆx (n) = ˆx (n) + a 1 st j=1 r + a 1 st η(n) Residual error, or noise hypothesis η (n) = r K j=1 K j=1 s j a j ˆx (n) j + s a ˆx (n) s j a j ˆx (n) j Perfect cancellation, residual is thermal noise, η (n) = n.. 21
22 Implementation via Residual Error Update Can do same thing for serial cancellation ˆx (n+1) = ˆx (n) + a 1 st η(n), Residual error seen by user after iteration n. η (n) 1 = r j=1 s j a j ˆx (n+1) j K j= s j a j ˆx (n) j 22
23 Implementation via Residual Error Update Can write iteration in terms of an update to residual error ( ) η (n) = s a ˆx (n 1) ˆx (n) = s s t η(n 1). ˆx (n 1) ˆx (n) η (n 1) η (n) s t s Interference cancellation module. K η (n) = η (n 1) + η (n) j, (Parallel) j=1 { η (n 1) K + η (n) K = 1 η (n) = η (n) 1 + η(n+1) 1 > 1. (Serial) 23
24 Modular Parallel Cancellation η (n 1) ˆx (n 1) 1 ˆx (n) 1 ˆx (n+1) 1 η (n) 1 η (n) η (n+1) 1 η (n+1) ˆx (n 1) 2 ˆx (n) 2 η (n) 2 ˆx (n+1) 2 η (n+1) 2 ˆx (n 1) 3 ˆx (n) 3 η (n) 3 ˆx (n+1) 3 η (n+1) 3 ˆx (n 1) 4 ˆx (n) 4 η (n) 4 ˆx (n+1) 4 η (n+1) 4 24
25 Modular Serial Cancellation η (n 1) 1 ˆx (n 1) 1 ˆx (n) 1 ˆx (n+1) 1 η (n) 1 η (n) 1 η (n+1) 1 η (n+1) 1 ˆx (n 1) 2 η (n 1) 2 ˆx (n) 2 η (n) 2 η (n) 2 ˆx (n+1) 2 η (n+1) 2 ˆx (n 1) 3 η (n 1) 3 ˆx (n) 3 η (n) 3 η (n) 3 ˆx (n+1) 3 η (n+1) 3 ˆx (n 1) 4 ˆx (n) 4 η (n) 4 η (n 1) 4 η (n) 4 ˆx (n+1) 4 η (n+1) 4 25
26 Tentative Decision Functions Transmitted symbols discrete { 1, +1} Estimates ˆx (n) could be any real number. What if ˆx (n) 1? Non-linear tentative decision function ζ : R [ 1, +1] ˆx (n 1) ζ ˆx (n) η (n 1) η (n) s t s 26
27 Tentative Decision Functions tanh(x) -0.5 clip(x) -1 sgn(x) 27
28 Outline 1 Introduction 2 System Model 3 Multiuser Detection 4 Interference Cancellation 5 Linear Methods 6 Nonlinear Methods 7 Numerical Results 28
29 Linear Methods Both decorrelator and LMMSE require K K matrix inversion Complexity scales O ( K 3) There are many lower complexity approaches for solving linear systems Series expansions Iterative matrix inversion Gradient descent These can all be implemented as interference cancellation 29
30 Direct Solution Methods Output of decorrelator or LMMSE can be written M = R for the decorrelator, ˆx = arg min x R K Mx y 2 2 M = RA for the normalized decorrelator, M = R + σ 2 A 2 for LMMSE. Solution to the unconstrained optimization problem is Mˆx = y. 30
31 Direct Solution Gaussian elimination followed by bac-substitution. Symmetric M - equivalent to Cholesy factorization M = FF t followed by forward and bacward substitution, Fz = y F tˆx = z forward substitution bacward substitution Cholesy factorization is O ( K 3 /3 ), Each substitution step is O ( K 2 /2 ). If M ij = 0 for i j > b, Cholesy decomposition is O ( K(b 2 + 3b) ) and substitution steps are O (Kb) 31
32 Series Expansions Find coefficients c n such that M 1 = n c n M n. y M M M c 0 c 1 c 2 With K terms this is O ( K 3). Truncate series to n K. 32
33 Series Expansions S. Moshavi, E. G. Kanterais, and D. L. Schilling. Multistage linear receivers for DS-CDMA systems. Int. J. Wireless Inform. Networs, 3:1 17, January D. Guo, L. K. Rasmussen, S. Sun,, and T. J. Lim. A matrix-algebraic approach to linear parallel interference cancellation in CDMA. IEEE Trans. Commun., 41(1): , Jan R. R. Müller and S. Verdú. Design and analysis of low-complexity interference mitigation on vector channels. IEEE J. Select. Areas Commun., 19: , August D. Guo, S. Verdú, and L. K. Rasmussen. Asymptotic normality of linear multiuser receiver outputs. IEEE Trans. Inform. Theory, 48(12): , December
34 Cayley Hamilton - Finite Series Theorem (Cayley Hamilton) K p M (M) = ( 1) K n c K n M n = 0 n=0 Can write any power of M as a linear combination of M n, n = 0, 1,..., K. M 1 = 1 ( 1) K det(m) K ( 1) K n c K n M n 1 n=1 K-stage multistage implementation. Computation of c n is as complex as matrix inversion There exists coefficients such that a finite power series implements matrix inversion exactly. 34
35 Taylor Series Taylor series (I + X) 1 = ( X) n, n=0 Convergent if spectral radius satisfies ρ (X) < 1 Setting X = M I, M 1 = ( 1) n (M I) n, n=0 Convergent if ρ (M) < 2. 35
36 Taylor Series First order truncation results in the approximate decorrelator Higher-order truncation ˆx (1) = (2I R)y = y (R I)y }{{} Interference Estimate ˆx (n) = y + (I R)y + (I R) 2 y + + (I R) n y = y (R I)ˆx (n 1) This is parallel interference cancellation: ˆx (n) = y }{{} User matched filter output R ˆx (n 1) }{{} Interference estimate from previous stage. 36
37 Taylor Series: Decorrelator ˆx (n 1) 1 R1 ˆx (n 1) j Rj ˆx (n) y ˆx (n 1) K RK 37
38 Taylor Series: LMMSE ˆx (n 1) 1 σ 2 a R1 ˆx (n 1) j σ 2 a 2 j + Rj ˆx (n 1) σ 2 a 2 ˆx (n) y ˆx (n 1) K σ 2 a 2 K + RK 38
39 Taylor Series: Interference Cancellation Module ˆx (n 1) α ˆx (n) 1 α 1 η (n 1) 1/α η (n) s t s Decorrelator α = 1 and LMMSE, α = 1 σ 2 /a 2 39
40 Taylor Series Infinte series rather than finite series. Convergent only if ρ (M) < 2. Easy computation of series cofficients. LMMSE only marginally more complex than decorrelator. 40
41 Taylor Series S. Verdú. Multiuser Detection. Cambridge University Press, Cambridge, N. B. Mandayam and S. Verdú. Analysis of an approximate decorrelating detector. Wireless Personal Commun., 6:97 111, June S. Moshavi, E. G. Kanterais, and D. L. Schilling. Multistage linear receivers for DS-CDMA systems. Int. J. Wireless Inform. Networs, 3:1 17, January
42 Iterative Solution Methods Let M = M 1 M 2. Then (M 1 M 2 )ˆx = y, Fixed point equation, Motivates iteration of the form Require: M 1ˆx = y + M 2ˆx. M 1 x (n+1) = y + M 2 x (n). 1 Easy to solve M 1 x = z. E.g. M 1 triangular or diagonal. 2 Choose M 1 and M 2 so iteration converges quicly. 42
43 Iterative Solution Methods Let e (n) = ˆx x (n) e (n) = (M 1 1 M 2) n e (0) (M 1 1 M 2) n e (0). Theorem A necessary and sufficient condition for convergence of in any norm is ρ (M 1 1 M 2) < 1. 43
44 Jacobi Iteration Choose M 1 = ωd M 2 = ωd M. Theorem With x (0) = y, iteration becomes x (n+1) = D 1 ω ( y (M ωd)x (n)). Taylor series expansion of (ωd + M) 1. Multistage parallel interference cancellation. The Jacobi implementation of the decorrelator with M 1 = ωi is convergent for any ω > 0 such that ρ (R) < 2ω. 44
45 Jacobi Iteration: LMMSE Theorem For ω = 1, the LMMSE Jacobi iteration is x (n+1) = ( I + A 2 σ 2) 1 ( y (R I)x (n)). Per-user signal-to-noise ratio scaling each iteration. The Jacobi iterative implementation of the LMMSE filter is convergent if and only if ( (I ρ J = ρ + A 2 σ 2) ) 1 (I R) < 1 45
46 Jacobi Iteration: LMMSE Theorem The Jacobi iterative implementation of the LMMSE filter is convergent if ρ (R I) < 1 + γ 1 max where γ max = max A 2 /σ2. The iteration is not convergent if where γ min = min A 2 /σ2. ρ (R I) > 1 + γ 1 min 46
47 Gauss-Seidel Iteration Choose M 1 = 1 ω D + L M 2 = 1 ω ω D Lt Results in the following iteration (with x (0) = y) ( ) ( ) 1 1 ω ω D + L x (n+1) = y + ω D Lt x (n). Theorem Successive cancellation Gauss-Seidel iteration is convergent for symmetric positive definite M and ω (0, 2). 47
48 Descent Algorithms For symmetric positive definite M, define x M 1 2 = M 1 2 x 2 = x t M 1 x, Define f (x) = 1 2 Mx y. Least-squares minimization M 1 2 is solution to ˆx = arg min f(x). x R K Note ( f(x) (x), f(x),..., f(x) ) t = Mx y. x 1 x 2 x K Gradient is equal to the error vector e = Mx y, and unique stationary point is Mx = y. 48
49 Descent Algorithms Descent algorithms tae the form x (n+1) = x (n) + t n d (n) Direction d (n) chosen to reduce objective function Step size t n chosen each iteration to minimize objective function in the direction of d (n). 49
50 Steepest Descent Search direction is negative gradient of objective function, d (n) = (x (n) ), resulting in ˆx (n+1) = ˆx (n+1) t n (ˆx (n) ) (1) = t n y (t n M I)ˆx (n), (2) where the optimal step size is t n = e(n) 2 M 1 2 e (n) 2. (3) Jacobi and Gauss-Seidel are steepest descent algorithms with suboptimal t n. 50
51 Steepest Descent Theorem The error norm of the steepest descent algorithm with optimal step size decreases geometrically with rate at least ( 1 λ ) min λ max where λ min and λ max are the smallest and largest eigenvalues of M. 51
52 Conjugate Gradient Better approach: new search direction orthogonal to all previous directions (d (n+1), Md (j) ) = 0, j = 0, 1,..., n. Choose a linear combination of current error vector (steepest descent) and previous direction, where the combining coefficient β n ensures orthogonality. d (0) = e (0) d (n+1) = e (n+1) + β n d (n) β n = (e(n+1), Md (n) ) (d (n), Md (n) ). where 52
53 Conjugate Gradient Theorem The error norm for the conjugate gradient algorithm decreases geometrically with rate at least ( κ 1 κ + 1 ) where κ = λ max /λ min is the condition number of M. 53
54 Conjugate Gradient Efficient implementation: Only two extra inner products and one extra vector addition compared to parallel cancellation. x x d M h (, ) t β d δ 0 δ 0 (, ) δ 1 e e 54
55 Outline 1 Introduction 2 System Model 3 Multiuser Detection 4 Interference Cancellation 5 Linear Methods 6 Nonlinear Methods 7 Numerical Results 55
56 Constrained Optimization Linear detectors were solutions to unconstrained optimization Ignores discrete alphabet of x. ˆx = arg min 1 2 Mx y M 1 2. Idea: Introduce manageable constraints to approximate discrete alphabet. min f(x) g i (x) 0 subject to i = 1, 2,..., m 56
57 Constrained Optimization Use barrier functions to replace constrained probem with equivalent unconstrained problem min f(x) + m I (g i (x)) i=1 }{{} penalty function where the ideal barrier function I is defined as { 0 u 0 I(u) = u > 0. 57
58 Constrained Optimization Approximate I( ) by differentiable approximation b(u) I(u) Define penalty function ϕ(x) = m b(g i (x)) (4) i=1 New optimization problem min f(x) + ϕ(x), 58
59 Gradient Descent Gradient descent Setting t n = 1 ˆx (n+1) = t n y (t n M I)ˆx (n) t n ϕ (ˆx (n)). ˆx (n+1) + ϕ (ˆx (n)) = y (M I)ˆx (n). Supposing ξ(x) = x + ϕ (x) has inverse function ζ = ξ 1, ( ˆx (n+1) = ζ y (M I)ˆx (n)), Nonlinear parallel interference cancellation! 59
60 Nonlinear Iteration Theorem The non-linear iteration ˆx (n+1) = ζ (y (M I)ˆx (n)) is a gradient method for numerical solution of min 1 2 Mx y M ϕ(x) where ϕ satisfies ζ 1 (x) = ϕ (x) + x. If ϕ is convex, then the iteration is convergent to the unique point ˆx satisfying Mˆx + ϕ (ˆx) = y. 60
61 Tentative Decision Functions tanh clip sgn
62 Outline 1 Introduction 2 System Model 3 Multiuser Detection 4 Interference Cancellation 5 Linear Methods 6 Nonlinear Methods 7 Numerical Results 62
63 Parallel cancellation decorrelator, K = 8, E b /N 0 = 7 db linear 10 1 Decorrelator Bit Error Rate sgn cliptanh System load K/N 63
64 Parallel cancellation, K = 8, N = 32, E b /N 0 = 7 db linear Bit Error Rate 10 2 Decorrelator sgn tanh clip Iteration 64
65 Parallel, K = 8, N = 32, 8 iterations Bit Error Rate Decorrelator linear sgn clip tanh E b /N 0 (db) 65
66 Serial, K = 8, N = 16, E b /N 0 = 10 db Bit Error Rate 10 2 linear Decorrelator sgn tanh 10 3 LMMSE clip Iteration 66
67 Serial, K = 8, N = 16, 8 iterations Bit Error Rate linear tanh clip Decorrelator E b /N 0 (db) 67
68 Descent algorithms, K = 8, N = 16, E b /N 0 = 10 db 10 1 Bit Error Rate 10 2 Serial Cancel Decorrelator Conjugate Gradient Gradient Decent Iteration 68
69 Descent, LMMSE, K = 8, N = 16, E b /N 0 = 10 db Bit Error Rate 10 2 LMMSE Conjugate Gradient Serial Cancel Gradient Decent Iteration 69
70 Decorrelator & LMMSE, K = 8, N = 16, E b /N 0 = 10 db Conjugate Gradient Bit Error Rate 10 2 Decorrelator Linear Serial Cancellation Clip Serial Cancellation LMMSE Iteration 70
71 For more information... A. Grant and L. Rasmussen, Iterative Techniques, Chapter 3 in Advances in Multiuser Detection, Wiley,
ADVANCES IN MULTIUSER DETECTION
ADVANCES IN MULTIUSER DETECTION Michael Honig Northwestern University A JOHN WILEY & SONS, INC., PUBLICATION CHAPTER 3 ITERATIVE TECHNIQUES ALEX GRANT AND LARS RASMUSSEN 4 ITERATIVE TECHNIQUES 3.1 INTRODUCTION
More informationThese outputs can be written in a more convenient form: with y(i) = Hc m (i) n(i) y(i) = (y(i); ; y K (i)) T ; c m (i) = (c m (i); ; c m K(i)) T and n
Binary Codes for synchronous DS-CDMA Stefan Bruck, Ulrich Sorger Institute for Network- and Signal Theory Darmstadt University of Technology Merckstr. 25, 6428 Darmstadt, Germany Tel.: 49 65 629, Fax:
More informationApproximate Minimum Bit-Error Rate Multiuser Detection
Approximate Minimum Bit-Error Rate Multiuser Detection Chen-Chu Yeh, Renato R. opes, and John R. Barry School of Electrical and Computer Engineering Georgia Institute of Technology, Atlanta, Georgia 30332-0250
More informationDesign of MMSE Multiuser Detectors using Random Matrix Techniques
Design of MMSE Multiuser Detectors using Random Matrix Techniques Linbo Li and Antonia M Tulino and Sergio Verdú Department of Electrical Engineering Princeton University Princeton, New Jersey 08544 Email:
More informationA Matrix-Algebraic Approach to Linear Parallel Interference Cancellation in CDMA
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 48, NO. 1, JANUARY 2000 1 A Matrix-Algebraic Approach to Linear Parallel Interference Cancellation in CDMA Dongning Guo, Lars K. Rasmussen, Sumei Sun and Teng
More informationInterleave Division Multiple Access. Li Ping, Department of Electronic Engineering City University of Hong Kong
Interleave Division Multiple Access Li Ping, Department of Electronic Engineering City University of Hong Kong 1 Outline! Introduction! IDMA! Chip-by-chip multiuser detection! Analysis and optimization!
More informationELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications
ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March
More informationConvergence of Linear Interference Cancellation Multiuser Receivers
Convergence of Linear Interference Cancellation Multiuser Receivers Alex Grant and Christian Schlegel Abstract We consider the convergence in norm of several iterative implementations of linear multiuser
More informationANALYSIS OF A PARTIAL DECORRELATOR IN A MULTI-CELL DS/CDMA SYSTEM
ANAYSIS OF A PARTIA DECORREATOR IN A MUTI-CE DS/CDMA SYSTEM Mohammad Saquib ECE Department, SU Baton Rouge, A 70803-590 e-mail: saquib@winlab.rutgers.edu Roy Yates WINAB, Rutgers University Piscataway
More informationOptimal Sequences, Power Control and User Capacity of Synchronous CDMA Systems with Linear MMSE Multiuser Receivers
Optimal Sequences, Power Control and User Capacity of Synchronous CDMA Systems with Linear MMSE Multiuser Receivers Pramod Viswanath, Venkat Anantharam and David.C. Tse {pvi, ananth, dtse}@eecs.berkeley.edu
More informationBayesian Data Fusion for Asynchronous DS-CDMA Sensor Networks in Rayleigh Fading
Bayesian Data Fusion for Asynchronous DS-CDMA Sensor Networs in Rayleigh Fading Justin S. Dyer 1 Department of EECE Kansas State University Manhattan, KS 66506 E-mail: jdyer@su.edu Balasubramaniam Natarajan
More informationChapter 7 Iterative Techniques in Matrix Algebra
Chapter 7 Iterative Techniques in Matrix Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128B Numerical Analysis Vector Norms Definition
More informationPerformance Analysis of Spread Spectrum CDMA systems
1 Performance Analysis of Spread Spectrum CDMA systems 16:33:546 Wireless Communication Technologies Spring 5 Instructor: Dr. Narayan Mandayam Summary by Liang Xiao lxiao@winlab.rutgers.edu WINLAB, Department
More informationInteractions of Information Theory and Estimation in Single- and Multi-user Communications
Interactions of Information Theory and Estimation in Single- and Multi-user Communications Dongning Guo Department of Electrical Engineering Princeton University March 8, 2004 p 1 Dongning Guo Communications
More informationMulti User Detection I
January 12, 2005 Outline Overview Multiple Access Communication Motivation: What is MU Detection? Overview of DS/CDMA systems Concept and Codes used in CDMA CDMA Channels Models Synchronous and Asynchronous
More informationOn the Optimum Asymptotic Multiuser Efficiency of Randomly Spread CDMA
On the Optimum Asymptotic Multiuser Efficiency of Randomly Spread CDMA Ralf R. Müller Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) Lehrstuhl für Digitale Übertragung 13 December 2014 1. Introduction
More informationMultiuser Detection. Summary for EECS Graduate Seminar in Communications. Benjamin Vigoda
Multiuser Detection Summary for 6.975 EECS Graduate Seminar in Communications Benjamin Vigoda The multiuser detection problem applies when we are sending data on the uplink channel from a handset to a
More informationNumerical Methods - Numerical Linear Algebra
Numerical Methods - Numerical Linear Algebra Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Numerical Linear Algebra I 2013 1 / 62 Outline 1 Motivation 2 Solving Linear
More informationLecture Note 7: Iterative methods for solving linear systems. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 7: Iterative methods for solving linear systems Xiaoqun Zhang Shanghai Jiao Tong University Last updated: December 24, 2014 1.1 Review on linear algebra Norms of vectors and matrices vector
More informationConstrained Detection for Multiple-Input Multiple-Output Channels
Constrained Detection for Multiple-Input Multiple-Output Channels Tao Cui, Chintha Tellambura and Yue Wu Department of Electrical and Computer Engineering University of Alberta Edmonton, AB, Canada T6G
More informationDecision Feedback Multiuser Detection: A Systematic Approach
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 1, JANUARY 1999 219 Decision Feedback Multiuser Detection: A Systematic Approach Mahesh K. Varanasi, Senior Member, IEEE Abstract A systematic approach
More informationMulti-Branch MMSE Decision Feedback Detection Algorithms. with Error Propagation Mitigation for MIMO Systems
Multi-Branch MMSE Decision Feedback Detection Algorithms with Error Propagation Mitigation for MIMO Systems Rodrigo C. de Lamare Communications Research Group, University of York, UK in collaboration with
More informationEM Channel Estimation and Data Detection for MIMO-CDMA Systems over Slow-Fading Channels
EM Channel Estimation and Data Detection for MIMO-CDMA Systems over Slow-Fading Channels Ayman Assra 1, Walaa Hamouda 1, and Amr Youssef 1 Department of Electrical and Computer Engineering Concordia Institute
More informationDecoupling of CDMA Multiuser Detection via the Replica Method
Decoupling of CDMA Multiuser Detection via the Replica Method Dongning Guo and Sergio Verdú Dept. of Electrical Engineering Princeton University Princeton, NJ 08544, USA email: {dguo,verdu}@princeton.edu
More information6. Iterative Methods for Linear Systems. The stepwise approach to the solution...
6 Iterative Methods for Linear Systems The stepwise approach to the solution Miriam Mehl: 6 Iterative Methods for Linear Systems The stepwise approach to the solution, January 18, 2013 1 61 Large Sparse
More informationExploiting Sparsity for Wireless Communications
Exploiting Sparsity for Wireless Communications Georgios B. Giannakis Dept. of ECE, Univ. of Minnesota http://spincom.ece.umn.edu Acknowledgements: D. Angelosante, J.-A. Bazerque, H. Zhu; and NSF grants
More informationOptimal Sequences and Sum Capacity of Synchronous CDMA Systems
Optimal Sequences and Sum Capacity of Synchronous CDMA Systems Pramod Viswanath and Venkat Anantharam {pvi, ananth}@eecs.berkeley.edu EECS Department, U C Berkeley CA 9470 Abstract The sum capacity of
More informationConstrained Maximum-Likelihood Detection in CDMA
142 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 49, NO. 1, JANUARY 2001 Constrained Maximum-Likelihood Detection in CDMA Peng Hui Tan, Student Member, IEEE, Lars K. Rasmussen, Member, IEEE, and Teng J. Lim,
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 informationVasil Khalidov & Miles Hansard. C.M. Bishop s PRML: Chapter 5; Neural Networks
C.M. Bishop s PRML: Chapter 5; Neural Networks Introduction The aim is, as before, to find useful decompositions of the target variable; t(x) = y(x, w) + ɛ(x) (3.7) t(x n ) and x n are the observations,
More informationShannon meets Wiener II: On MMSE estimation in successive decoding schemes
Shannon meets Wiener II: On MMSE estimation in successive decoding schemes G. David Forney, Jr. MIT Cambridge, MA 0239 USA forneyd@comcast.net Abstract We continue to discuss why MMSE estimation arises
More informationStabilization and Acceleration of Algebraic Multigrid Method
Stabilization and Acceleration of Algebraic Multigrid Method Recursive Projection Algorithm A. Jemcov J.P. Maruszewski Fluent Inc. October 24, 2006 Outline 1 Need for Algorithm Stabilization and Acceleration
More informationBlind Successive Interference Cancellation for DS-CDMA Systems
276 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL 50, NO 2, FEBRUARY 2002 Blind Successive Interference Cancellation for DS-CDMA Systems Dragan Samardzija, Narayan Mandayam, Senior Member, IEEE, and Ivan Seskar,
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationMath Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012.
Math 5620 - Introduction to Numerical Analysis - Class Notes Fernando Guevara Vasquez Version 1990. Date: January 17, 2012. 3 Contents 1. Disclaimer 4 Chapter 1. Iterative methods for solving linear systems
More informationLecture 18 Classical Iterative Methods
Lecture 18 Classical Iterative Methods MIT 18.335J / 6.337J Introduction to Numerical Methods Per-Olof Persson November 14, 2006 1 Iterative Methods for Linear Systems Direct methods for solving Ax = b,
More informationThe Conjugate Gradient Method for Solving Linear Systems of Equations
The Conjugate Gradient Method for Solving Linear Systems of Equations Mike Rambo Mentor: Hans de Moor May 2016 Department of Mathematics, Saint Mary s College of California Contents 1 Introduction 2 2
More informationNotes on Some Methods for Solving Linear Systems
Notes on Some Methods for Solving Linear Systems Dianne P. O Leary, 1983 and 1999 and 2007 September 25, 2007 When the matrix A is symmetric and positive definite, we have a whole new class of algorithms
More informationLECTURE 18. Lecture outline Gaussian channels: parallel colored noise inter-symbol interference general case: multiple inputs and outputs
LECTURE 18 Last time: White Gaussian noise Bandlimited WGN Additive White Gaussian Noise (AWGN) channel Capacity of AWGN channel Application: DS-CDMA systems Spreading Coding theorem Lecture outline Gaussian
More informationPOWER ALLOCATION AND OPTIMAL TX/RX STRUCTURES FOR MIMO SYSTEMS
POWER ALLOCATION AND OPTIMAL TX/RX STRUCTURES FOR MIMO SYSTEMS R. Cendrillon, O. Rousseaux and M. Moonen SCD/ESAT, Katholiee Universiteit Leuven, Belgium {raphael.cendrillon, olivier.rousseaux, marc.moonen}@esat.uleuven.ac.be
More informationMultiuser Detection. Ateet Kapur Student Member, IEEE and Mahesh K. Varanasi Senior Member, IEEE
ACCEPTED FOR PUBLICATIONS IEEE TRANS. INFO. THEORY 1 Multiuser Detection for Overloaded CDMA Systems Ateet Kapur Student Member, IEEE and Mahesh K. Varanasi Senior Member, IEEE Abstract Multiuser detection
More informationDirect-Sequence Spread-Spectrum
Chapter 3 Direct-Sequence Spread-Spectrum In this chapter we consider direct-sequence spread-spectrum systems. Unlike frequency-hopping, a direct-sequence signal occupies the entire bandwidth continuously.
More informationGame Theoretic Approach to Power Control in Cellular CDMA
Game Theoretic Approach to Power Control in Cellular CDMA Sarma Gunturi Texas Instruments(India) Bangalore - 56 7, INDIA Email : gssarma@ticom Fernando Paganini Electrical Engineering Department University
More informationIntroduction to Applied Linear Algebra with MATLAB
Sigam Series in Applied Mathematics Volume 7 Rizwan Butt Introduction to Applied Linear Algebra with MATLAB Heldermann Verlag Contents Number Systems and Errors 1 1.1 Introduction 1 1.2 Number Representation
More informationCHAPTER 11. A Revision. 1. The Computers and Numbers therein
CHAPTER A Revision. The Computers and Numbers therein Traditional computer science begins with a finite alphabet. By stringing elements of the alphabet one after another, one obtains strings. A set of
More information9.1 Preconditioned Krylov Subspace Methods
Chapter 9 PRECONDITIONING 9.1 Preconditioned Krylov Subspace Methods 9.2 Preconditioned Conjugate Gradient 9.3 Preconditioned Generalized Minimal Residual 9.4 Relaxation Method Preconditioners 9.5 Incomplete
More information8 Numerical methods for unconstrained problems
8 Numerical methods for unconstrained problems Optimization is one of the important fields in numerical computation, beside solving differential equations and linear systems. We can see that these fields
More informationSNR i = 2E b 6N 3. Where
Correlation Properties Of Binary Sequences Generated By The Logistic Map-Application To DS-CDMA *ZOUHAIR BEN JEMAA, **SAFYA BELGHITH *EPFL DSC LANOS ELE 5, 05 LAUSANNE **LABORATOIRE SYSCOM ENIT, 002 TUNIS
More informationOptimal Binary/Quaternary Adaptive Signature Design for Code-Division Multiplexing
Globecom 0 - Wireless Communications Symposium Optimal Binary/Quaternary Adaptive Signature Design for Code-Division Multiplexing ili Wei, Member, IEEE and Wen Chen, Senior Member, IEEE Department of Electronic
More informationAdaptive interference suppression algorithms for DS-UWB systems
Adaptive interference suppression algorithms for DS-UWB systems This thesis is submitted in partial fulfilment of the requirements for Doctor of Philosophy (Ph.D.) Sheng Li Communications Research Group
More informationPerformance of Reduced-Rank Linear Interference Suppression
1928 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 5, JULY 2001 Performance of Reduced-Rank Linear Interference Suppression Michael L. Honig, Fellow, IEEE, Weimin Xiao, Member, IEEE Abstract The
More informationIterative techniques in matrix algebra
Iterative techniques in matrix algebra Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan September 12, 2015 Outline 1 Norms of vectors and matrices 2 Eigenvalues and
More information1 Number Systems and Errors 1
Contents 1 Number Systems and Errors 1 1.1 Introduction................................ 1 1.2 Number Representation and Base of Numbers............. 1 1.2.1 Normalized Floating-point Representation...........
More informationOn the Shamai-Laroia Approximation for the Information Rate of the ISI Channel
On the Shamai-Laroia Approximation for the Information Rate of the ISI Channel Yair Carmon and Shlomo Shamai (Shitz) Department of Electrical Engineering, Technion - Israel Institute of Technology 2014
More informationIterative Methods for Smooth Objective Functions
Optimization Iterative Methods for Smooth Objective Functions Quadratic Objective Functions Stationary Iterative Methods (first/second order) Steepest Descent Method Landweber/Projected Landweber Methods
More informationOptimum Signature Sequence Sets for. Asynchronous CDMA Systems. Abstract
Optimum Signature Sequence Sets for Asynchronous CDMA Systems Sennur Ulukus AT&T Labs{Research ulukus@research.att.com Abstract Roy D.Yates WINLAB, Rutgers University ryates@winlab.rutgers.edu In this
More informationMULTICARRIER code-division multiple access (MC-
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 2, FEBRUARY 2005 479 Spectral Efficiency of Multicarrier CDMA Antonia M. Tulino, Member, IEEE, Linbo Li, and Sergio Verdú, Fellow, IEEE Abstract We
More informationMultistage Nonlinear Blind Interference Cancellation for DS-CDMA Systems
Multistage Nonlinear Blind Interference Cancellation for DS-CDMA Systems Dragan Samardzija Bell Labs, Lucent Technologies, 791 Holmdel-Keyport Road, Holmdel, NJ 07733, USA dragan@lucent.com Narayan Mandayam,
More informationDecision-Point Signal to Noise Ratio (SNR)
Decision-Point Signal to Noise Ratio (SNR) Receiver Decision ^ SNR E E e y z Matched Filter Bound error signal at input to decision device Performance upper-bound on ISI channels Achieved on memoryless
More informationNational University of Singapore. Ralf R. Müller
Ê ÔÐ Å Ø Ó Ò Ï Ö Ð ÓÑÑÙÒ Ø ÓÒ Ì National University of Singapore March 006 Ralf R. Müller Professor for Wireless Networks Norwegian University of Science & Technology mueller@iet.ntnu.no Ê ÔÐ Å Ø Ó Ò ÅÙÐØ
More informationBindel, Fall 2016 Matrix Computations (CS 6210) Notes for
1 Iteration basics Notes for 2016-11-07 An iterative solver for Ax = b is produces a sequence of approximations x (k) x. We always stop after finitely many steps, based on some convergence criterion, e.g.
More informationMMSE Decision Feedback Equalization of Pulse Position Modulated Signals
SE Decision Feedback Equalization of Pulse Position odulated Signals AG Klein and CR Johnson, Jr School of Electrical and Computer Engineering Cornell University, Ithaca, NY 4853 email: agk5@cornelledu
More informationBLIND CHIP-RATE EQUALISATION FOR DS-CDMA DOWNLINK RECEIVER
BLIND CHIP-RATE EQUALISATION FOR DS-CDMA DOWNLINK RECEIVER S Weiss, M Hadef, M Konrad School of Electronics & Computer Science University of Southampton Southampton, UK fsweiss,mhadefg@ecssotonacuk M Rupp
More informationLinear Methods for Regression. Lijun Zhang
Linear Methods for Regression Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Introduction Linear Regression Models and Least Squares Subset Selection Shrinkage Methods Methods Using Derived
More informationSimultaneous SDR Optimality via a Joint Matrix Decomp.
Simultaneous SDR Optimality via a Joint Matrix Decomposition Joint work with: Yuval Kochman, MIT Uri Erez, Tel Aviv Uni. May 26, 2011 Model: Source Multicasting over MIMO Channels z 1 H 1 y 1 Rx1 ŝ 1 s
More informationMinimum Mean Squared Error Interference Alignment
Minimum Mean Squared Error Interference Alignment David A. Schmidt, Changxin Shi, Randall A. Berry, Michael L. Honig and Wolfgang Utschick Associate Institute for Signal Processing Technische Universität
More informationEstimation of the Optimum Rotational Parameter for the Fractional Fourier Transform Using Domain Decomposition
Estimation of the Optimum Rotational Parameter for the Fractional Fourier Transform Using Domain Decomposition Seema Sud 1 1 The Aerospace Corporation, 4851 Stonecroft Blvd. Chantilly, VA 20151 Abstract
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More informationJACOBI S ITERATION METHOD
ITERATION METHODS These are methods which compute a sequence of progressively accurate iterates to approximate the solution of Ax = b. We need such methods for solving many large linear systems. Sometimes
More informationApplications of Lattices in Telecommunications
Applications of Lattices in Telecommunications Dept of Electrical and Computer Systems Engineering Monash University amin.sakzad@monash.edu Oct. 2013 1 Sphere Decoder Algorithm Rotated Signal Constellations
More informationConjugate Gradient Method
Conjugate Gradient Method direct and indirect methods positive definite linear systems Krylov sequence spectral analysis of Krylov sequence preconditioning Prof. S. Boyd, EE364b, Stanford University Three
More informationPower Control in Multi-Carrier CDMA Systems
A Game-Theoretic Approach to Energy-Efficient ower Control in Multi-Carrier CDMA Systems Farhad Meshkati, Student Member, IEEE, Mung Chiang, Member, IEEE, H. Vincent oor, Fellow, IEEE, and Stuart C. Schwartz,
More informationRandom Matrices and Wireless Communications
Random Matrices and Wireless Communications Jamie Evans Centre for Ultra-Broadband Information Networks (CUBIN) Department of Electrical and Electronic Engineering University of Melbourne 3.5 1 3 0.8 2.5
More informationNoncooperative Optimization of Space-Time Signals in Ad hoc Networks
Noncooperative Optimization of Space-Time Signals in Ad hoc Networks Ronald A. Iltis and Duong Hoang Dept. of Electrical and Computer Engineering University of California Santa Barbara, CA 93106 {iltis,hoang}@ece.ucsb.edu
More informationIterative Methods for Solving A x = b
Iterative Methods for Solving A x = b A good (free) online source for iterative methods for solving A x = b is given in the description of a set of iterative solvers called templates found at netlib: http
More information17 Solution of Nonlinear Systems
17 Solution of Nonlinear Systems We now discuss the solution of systems of nonlinear equations. An important ingredient will be the multivariate Taylor theorem. Theorem 17.1 Let D = {x 1, x 2,..., x m
More informationSuppose that the approximate solutions of Eq. (1) satisfy the condition (3). Then (1) if η = 0 in the algorithm Trust Region, then lim inf.
Maria Cameron 1. Trust Region Methods At every iteration the trust region methods generate a model m k (p), choose a trust region, and solve the constraint optimization problem of finding the minimum of
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 10, OCTOBER
TRANSACTIONS ON INFORMATION THEORY, VOL 49, NO 10, OCTOBER 2003 1 Algebraic Properties of Space Time Block Codes in Intersymbol Interference Multiple-Access Channels Suhas N Diggavi, Member,, Naofal Al-Dhahir,
More informationVERY LARGE-SCALE MULTIUSER DETECTION (VLSMUD)
AFRL-IF-RS-TR-2006-295 Final Technical Report September 2006 VERY LARGE-SCALE MULTIUSER DETECTION (VLSMUD) Princeton University APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED. STINFO FINAL REPORT
More informationARock: an algorithmic framework for asynchronous parallel coordinate updates
ARock: an algorithmic framework for asynchronous parallel coordinate updates Zhimin Peng, Yangyang Xu, Ming Yan, Wotao Yin ( UCLA Math, U.Waterloo DCO) UCLA CAM Report 15-37 ShanghaiTech SSDS 15 June 25,
More informationAdvanced 3 G and 4 G Wireless Communication Prof. Aditya K Jagannathan Department of Electrical Engineering Indian Institute of Technology, Kanpur
Advanced 3 G and 4 G Wireless Communication Prof. Aditya K Jagannathan Department of Electrical Engineering Indian Institute of Technology, Kanpur Lecture - 19 Multi-User CDMA Uplink and Asynchronous CDMA
More informationWritten Examination
Division of Scientific Computing Department of Information Technology Uppsala University Optimization Written Examination 202-2-20 Time: 4:00-9:00 Allowed Tools: Pocket Calculator, one A4 paper with notes
More informationComputation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems
Computation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems Department of Electrical Engineering, College of Engineering, Basrah University Basrah Iraq,
More informationRADIO SYSTEMS ETIN15. Lecture no: Equalization. Ove Edfors, Department of Electrical and Information Technology
RADIO SYSTEMS ETIN15 Lecture no: 8 Equalization Ove Edfors, Department of Electrical and Information Technology Ove.Edfors@eit.lth.se Contents Inter-symbol interference Linear equalizers Decision-feedback
More informationIterative Methods. Splitting Methods
Iterative Methods Splitting Methods 1 Direct Methods Solving Ax = b using direct methods. Gaussian elimination (using LU decomposition) Variants of LU, including Crout and Doolittle Other decomposition
More informationDense LU factorization and its error analysis
Dense LU factorization and its error analysis Laura Grigori INRIA and LJLL, UPMC February 2016 Plan Basis of floating point arithmetic and stability analysis Notation, results, proofs taken from [N.J.Higham,
More informationcomputing the jointly optimum powers that is decoupled from the computation of the optimum (MSIR or MSIR-DF) receivers. In particular, a distributed,
A Stochastic Algorithm for the Joint Optimization of Power Control and Multiuser Receivers Λ Deepak Das, and Mahesh K. Varanasi Dept. of Electrical and Computer Engineering University of Colorado Boulder,
More informationMinimum Feedback Rates for Multi-Carrier Transmission With Correlated Frequency Selective Fading
Minimum Feedback Rates for Multi-Carrier Transmission With Correlated Frequency Selective Fading Yakun Sun and Michael L. Honig Department of ECE orthwestern University Evanston, IL 60208 Abstract We consider
More informationComputational Economics and Finance
Computational Economics and Finance Part II: Linear Equations Spring 2016 Outline Back Substitution, LU and other decomposi- Direct methods: tions Error analysis and condition numbers Iterative methods:
More informationThe interference-reduced energy loading for multi-code HSDPA systems
Gurcan et al. EURASIP Journal on Wireless Communications and Networing 2012, 2012:127 RESEARC Open Access The interference-reduced energy loading for multi-code SDPA systems Mustafa K Gurcan *, Irina Ma
More informationDiversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver
Diversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver Michael R. Souryal and Huiqing You National Institute of Standards and Technology Advanced Network Technologies Division Gaithersburg,
More informationNumerical methods, midterm test I (2018/19 autumn, group A) Solutions
Numerical methods, midterm test I (2018/19 autumn, group A Solutions x Problem 1 (6p We are going to approximate the limit 3/2 x lim x 1 x 1 by substituting x = 099 into the fraction in the present form
More informationOutput MAI Distributions of Linear MMSE Multiuser Receivers in DS-CDMA Systems
1128 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 3, MARCH 2001 Output MAI Distributions of Linear MMSE Multiuser Receivers in DS-CDMA Systems Junshan Zhang, Member, IEEE, Edwin K. P. Chong, Senior
More informationMath 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March 22, 2018
1 Linear Systems Math 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March, 018 Consider the system 4x y + z = 7 4x 8y + z = 1 x + y + 5z = 15. We then obtain x = 1 4 (7 + y z)
More informationA Computationally Efficient Block Transmission Scheme Based on Approximated Cholesky Factors
A Computationally Efficient Block Transmission Scheme Based on Approximated Cholesky Factors C. Vincent Sinn Telecommunications Laboratory University of Sydney, Australia cvsinn@ee.usyd.edu.au Daniel Bielefeld
More informationIntroduction to Scientific Computing
(Lecture 5: Linear system of equations / Matrix Splitting) Bojana Rosić, Thilo Moshagen Institute of Scientific Computing Motivation Let us resolve the problem scheme by using Kirchhoff s laws: the algebraic
More informationLINEAR AND ADAPTIVE LINEAR MULTIUSER DETECTION IN CDMA SYSTEMS
A project reported submitted in partial fulfillment of the requirements of the course EEL6503: Spread Spectrum and CDMA, Fall 00 Submitted by Arun Avudainaygam LINEAR AND ADAPIVE LINEAR MULIUSER DEECION
More informationELEC546 Review of Information Theory
ELEC546 Review of Information Theory Vincent Lau 1/1/004 1 Review of Information Theory Entropy: Measure of uncertainty of a random variable X. The entropy of X, H(X), is given by: If X is a discrete random
More informationEE6604 Personal & Mobile Communications. Week 13. Multi-antenna Techniques
EE6604 Personal & Mobile Communications Week 13 Multi-antenna Techniques 1 Diversity Methods Diversity combats fading by providing the receiver with multiple uncorrelated replicas of the same information
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 21: Sensitivity of Eigenvalues and Eigenvectors; Conjugate Gradient Method Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis
More information