Performance Analysis of Spread Spectrum CDMA systems
|
|
- Madlyn Carr
- 5 years ago
- Views:
Transcription
1 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 of Electrical Engineering, Rutgers University I. INTRODUCTION In this lecture, we present the mathematical analysis on the average bit error rate for multi-users in a single channel of the spread spectrum, Code Division Multiple Access (SS-CDMA) mobile radio system. We present expressions of BER performance of CDMA systems for a wide range of interference conditions for both synchronous case and asynchronous case, including Gaussian approximations (GA), Improved Gaussian Approximation (IGA), and Simple Improved Gaussian Approximation (SIGA). After the discussion for the single user detection, we discuss the key idea of the multiuser detection in the CDMA systems for high speed data transmission. The rest of the paper is organized as follows: In section II, we present the multiuser CDMA system model. In section III, we discuss the single user detection for the CDMA systems. In section IV, we present in detail the probability of error of the synchronous case with the single user detection for the CDMA systems. In section V, we discuss the probability of error of the asynchronous case with the single user detection for the CDMA systems, including GA, IGA and SIGA algorithms. Finally, in section VI, we discuss the multiuser detection for the CDMA systems. II. MULTIUSER CDMA SYSTEM MODEL In this report, we assume that the spread spectrum, Code Division Multiple Access (SS- CDMA) systems utilize BPSK modulation and the transmitted waveform from the -th user is
2 given by s (t) = P c (t)b (t) cos (ω c t + θ ), = 1,...K (1) where P is the transmission power of user, θ is the carrier phase offset of user relative to reference user, b (t) is the data sequence for user and c (t) is the spreading or chip sequence for user given by where c (n) and b (n) c (t) = Σ n= c (n) p Tc (t nt c ) () b (t) = Σ n= c (n) p T (t nt ) (3) are both { 1, +1}, T c is the chip period of the pseudo noise (PN) sequence c (n), T is bit period that satisfy T = NT c. We assume AWGN channel for the transmission of K users and the system model is shown in Fig. (1). We can get the expression of the received signal at the BS as r(t) = Σ K =1 P c (t τ )b (t τ ) cos (ω c t + φ ) + n(t) (4) where τ [, T ) is the delay of the -th user to user, and φ [, π) is the received carrier offset of user given by φ = θ ω c τ (5) s1() t s ( ) t s K (t)... r(t) + receiver n(t) Fig. 1. System Model in our Analysis
3 3 r(t) T z 1 c(t)cos( 1 t) c Fig.. MF receiver for single user detection b ( t) 1 () b 1 T b ( t) ( 1) b () b Fig. 3. For the asynchronous case. III. SINGLE USER DETECTION In this section, we study the single user detection and focus on user 1. Assume the receiver is synchronous to user 1, then without loss of generality, we can assume that τ 1 =,ρ 1 =. The structure of the matched filter (MF) receiver that is optimal for single user environment is illustrated as the figure below,
4 4 The output of the MF receiver z 1 shown in Fig. () is given by z 1 = = n 1 = T =1 T c 1 (t) cos(ω c t)r(t)dt T P / c 1 (t)c (t τ )b (t τ ) cos(φ )dt + n 1 (6) n(t)c 1 (t) cos(ω c t)dt (7) By introducing the continues time partial cross correlation functions, we can simplify the expression of z 1 as P1 z 1 = T P b() 1 + [b( 1) R,1 (τ ) + b () ˆR,1 (τ )] cos(φ ) + n 1 (8) where the continues time partial cross correlation functions are R,1 (τ) = ˆR,1 (τ) = τ T τ c (t τ)c 1 (t)dt, τ T (9) c (t τ)c 1 (t)dt, τ T (1) IV. SYNCHRONOUS CASE For the case of synchronous users, we get φ = and τ = for any. In this case, each interference contributes to only one term, i.e., P1 z 1 = T P b() 1 + b() R,1 (τ ) + n 1 (11) where R,1 = c T c 1 T N where n 1 N(, N T 4 ), c is the spreading code vector of length N for user, and c 1 is the spreading code vector for user 1. When users are orthogonal, i.e., c T c 1 = δ i, we obtain P1 z 1 = T b() 1 + n 1 (13) Thus the bit error rate in this case is given by Eb P b,1 = Q( ) (14) N (1)
5 5 We can see that it is the same as that of the single user case on AWGN channel. Because of the orthogonality restriction on c, it is possible only for K N. On the other hand, in the case where the orthogonality is not satisfied, say, users use random codes {c } K =1 that are random binary vectors, we can use the following two steps to calculate the probability of error, Step 1. : Fix codes and bits of other users, and then find conditioned probability of error P b,1 ({R,1 }, {b () }); Step. : Find the averaged probability of error P b,1 by averaging over {R,1 } and {b () }. In step 1, we have P b,1 ({R,1 }, {b () }) = P r(z 1 < b () 1 = 1) = Q( P 1 T + K Eb = Q( + N And in step, we get P b,1 = E [Q( Eb () {b }{R,1 + } N N T 4 P b() Eb, Eb, R,1 b () N b () N ) R,1 T ) (15) R,1 )] (16) T We can see that the expression above is not convenient for analysis, unless some approximation is introduced. A. Gaussian Approximation (GA) Now we use Gaussian approximation to analyze the BER performance of the synchronous case. We assume equal power for each user, i.e., P = P for all, and a very large K. Let I 1 present the interferences from all the other users, i.e., I 1 = K P b() R,1. The main idea of this approach is to approximate I 1 as Gaussian variable, with mean and variance as P E[I 1 ] = E[b() ]E[R,1 ] = (17) V ar[i 1 ] = P E[b () ] V ar[r,1 ] (18)
6 6 Consider R,1 = c T T c 1, we can easily obtain N We get a very useful approximation of P b,1 by when K is large. P b,1 = Q( Q( V ar[r,1 ] = ( T N ) N = T N (19) V ar[i 1 ] = P T (K 1) N () N T P T 4 + P T N (K 1) ) (1) P T ) = Q( P T (K 1) N N K 1 ) () V. ASYNCHRONOUS CASE For the case of asynchronous users, the output of the MF receiver of user 1 is given by P1 z 1 = T P b() 1 + T I,1(b, τ, φ ) + n 1 (3) where I,1 (b, τ, φ ) = 1 T [b( 1) R,1 (τ ) + b () R (τ )] cos(φ ) (4) Assume for any, P = P, then Eq.(3) can be simplified by b = [b ( 1) b () ] (5) where z 1 = I 1 (b, τ, φ) = P T [b() 1 + I 1 (b, τ, φ)] + n 1 (6) I 1, (b, τ, φ ) (7) b = (b, b 3,..., b K ) (8) τ = (τ,..., τ K ), φ = (φ,..., φ K ) (9)
7 7 b1, Tb = NTc User 1 C1,i C1,i+1 C1,i+ C1,i+N-1 k T k C User k Ck, 1 C k k, k Ck, left bit bk,-1 right bit bk, Fig. 4. Timing of PN sequence in the case of asynchronous 1, For fixed b, τ, φ, we can get the conditioned probability of error when user 1 transmits b () 1 = Otherwise, if user 1 transmits b () 1 = +1, P b, 1 = P r(z 1 > b () 1 = 1) P = P r{ T [ 1 + I 1(b, τ, φ)] + n 1 > } Eb = Q( (1 I 1 (b, τ, φ)) (3) N P b, 1 = E b,τ,φ [Q( Eb N (1 I 1 (b, τ, φ))] (31) P b,1 = P r(z 1 < b () 1 = +1) P = P r{ T [1 + I 1(b, τ, φ)] + n 1 > } Eb = Q( (1 + I 1 (b, τ, φ)) (3) N P b,1 = E b,τ,φ [Q( Eb N (1 + I 1 (b, τ, φ))] (33)
8 8 We can see that the error probability P b, 1 and P b,+1 are difficult to compute. However, there exists good bounds to approximate it. A. Gaussian Approximations (GA) In the Gaussian approximations, we model I 1 (b, τ, φ) as Gaussian variable. b (m) and b (n) i assumed to be independent for any i, m n. For any i l, we assume τ i and τ l are independent and uniformly distributed in [, T ). φ i and φ l are independent for any i l, and are distributed uniformly in [, π). Then we can get E[I 1 (b, τ, φ)] = (34) V ar[i 1 (b, τ, φ)] = are σ,1 (35) V ar[z 1 b () 1 = 1] = N T/4 + P T σ,1 (36) Thus, the probability of error is P/T P b,1 = Q( ) (37) (N T/4) + P T K σ,1 Eb 1 = Q( ( N 1 + E b K )) (38) N σ,1 Interference from user k to user 1, I k,1 = T The delay of user k to relative to user 1 as Pk b k (t τ k )c k (t τ k )c 1 (t) cos(ω c t + φ k ) cos(ω c t)dt (39) τ k = ν k T c + k, k T c (4) Pk I k,1 = T c cos(φ k){x k + (1 k )y k + (1 k )u k + k v k } (41) T c T c T c
9 9 x k,y k,u k and v k have distribution conditioned on A and B as follows, p xk (l) = A l+a p yk (l) = B l+b A, l = A, A +,..., A, A (4) B, l = B, B +,..., B, B (43) p uk (l) = 1/, l = 1, +1 (44) p vk (l) = 1/, l = 1, +1 (45) where A and B are defined as follows, A is the number of integers in [, N ] for which c 1,l+i c 1,l+i+1 = 1 (46) In another word, A measures for a given code the number of successive no transitions from +1 to 1 in the code c 1. Similarly, B is the number of integers in [, N ] for which c 1,l+i c 1,l+i+1 = 1 (47) In another word, A measures for a given code the number of successive transitions from +1 to 1 in the code c 1. A and B are disoint and span the set of total possible signature sequences of length N where there are a total of N 1 possible chip level transitions, that is to say, For random signature sequence, statistic of A + B = N 1 (48) σ,1 = 1 T E[cos (φ )]E[(b ( 1) R,1 (τ ) + b () ˆR,1 (τ )) ] (49) For random signature sequence, it is possible to model b ( 1) R,1 (τ ) + b () ˆR,1 (τ ) = N x l (5) l=1 Uniform ( T x l =, T ) w.p. 1 N N Bernoulli ( T, T, 1) w.p. 1 N N (51)
10 1 The mean and variance of x l are given by Then we can get E[x l ] = (5) V ar[x l ] = 1 3 ( T N ) + 1 ( T N ) = 3 ( T N ) (53) σ,1 = 1 3N Thus for the high SNR area, we get a good approximation of the probability as It is better than Q( N K 1 (54) Eb 1 K 1 P b,1 = Q( ( )) (55) N 1 + E b 3N N 3N Q( K 1 ) (56) )the synchronous case. Problems with analytical expressions derived here. When K is not large or users have disparate powers, the Gaussian approximation above is not appropriate. Fortunately, there are other methods to solve the question. B. Improved Gaussian Approximation (IGA) In the situation where the Gaussian Approximation is not appropriate, we can utilize a more in-depth analysis called improved Gaussian Approximation (IGA), which defines the interference terms I k conditioned on the particular operating condition of each user. Thus each I k becomes Gaussian for large K. Let ψ as the variance of the multiple access interference for a specific operating condition, ψ = V ar[i 1 (φ, τ, P, c 1,..., c K ) φ, τ, P, c 1,..., c K ] (57) = V ar[i 1 ( ) φ, { k }, {P k }, B] (58) P T P b,1 = E[Q( ψ )] P T = Q( ψ )f ψ(ψ)dψ (59)
11 11 It is possible to show that where ψ = = k= T c P k cos φ k ( N + (B + 1)[( k T c ) k T c ]) (6) z k (61) k= z k = T c P ku k v k (6) u k = (1 + cos(φ k )) (63) v k = N + (B + 1)(( k T c ) k T c ) (64) Using this method, we can approximate the probability of error for the case in which the power levels of the interfering users are constant but unequal and the case in which the power levels of the interfering users are independent and identically distributed random variables. C. Simple Improved Gaussian Approximation (SIGA) A simple improved Gaussian approximation (SIGA) method is based on the Taylor series for a continues function f(x) as f(x) = f(u) + (x u)f (u) + 1 (x u) f (u) +... (65) If x is a random variable and E[x] = u,, then If derivatives are expressed as difference f(x) = f(u) + (x u)[ If we neglect the higher order terms, E[f(x)] = f(u) + σ f (u) +... (66) f(u + h) f(u h) ] + 1 h (x f(u + h) f(u) + f(u h) u) ( ) +... h (67) E[f(x)] =. f(u) + σ + h) f(u) + f(u h) [f(u ] (68) h It was shown that h = 3σ is a good choice for generality of approximation, which yields, E[f(x)] = 3 f(u) f(u + 3σ) f(u 3σ) (69)
12 1 Therefore, we can get the average probability of error by P Tb P e = E[Q( )] (7) ψ P 3 Q( Tb ) + 1 µ ψ 6 Q( P Tb (µ ψ + 3σ ψ ) ) Q( P Tb (µ ψ 3σ ψ ) ) (71) The figures below illustrate the average bit error rates (BER) for single-cell CDMA systems using the different analytical algorithms discussed above. For the figure shown, the processing gain, N, is 31 chips per bit. In Fig. (5), K = [K/] users have power level P 1 /4, while K 1 = K K 1 have power level P 1. In Fig.(6), the interferer power levels obey a log-normal distribution with standard deviation of 5dB [7]. Fig. 5. BER for a desired user vs. K with fixed power levels for all K users. [7] Common like single user detection Gaussian Interference. We can see that single user detection cannot work very well under the high rate services, because N = W R T b T c decrease with R.
13 13 Fig. 6. BER vs. K with i.i.d power levels of the interference users. [7] VI. MULTIUSER DETECTION Interference signals in spread spectrum multiple access need not be treated as noise. If the spreading code of the interference signal is known, then that signal can be detected and subtracted out. Multiuser detection deals with the demodulation of mutually interfering digital signals, which exploits the structure of the multiaccess interference. This technique is applicable to multiaccess techniques such as asynchronous CDMA (where interuser interference occurs by design) and TDMA (where interuser interference occurs due to nonideal effects such as channel distortion and out-of-cell interference). Sergio Verdu s work in 198s [8] pioneered the receiver design technology of multiuser detection.
14 14 A. The Matched Filter in the CDMA Channel This section are focusing on the probability of error for synchronous uses. The received signal due to k users is y(t) = A k b k S k (t) + σn(t), (7) k=1 where S k (t) is the signature waveform assign to user k. Without loss of generality, S k (t) is normalized as S k = T S k(t)dt = 1. (73) A k is the received amplitude of the kth user and A k >. Note that A k is the energy of the received signal due to the normalized S k (t). b k { 1, 1} is the bit transmitted by the kth user with period T. n(t) is the white Gaussian noise with zero mean and unity power spectrum density. The output of the match filter for the kth user is y k = T where ρ,k = y(t)s k (t)dt (74) = A k b k + k A b ρ,k + n k (75) n k = σ T T S (t)s k (t)dt (76) n(t)s k (t)dt (77) Note that the noise component n k N(, σ ). If the signature are orthogonal, the cross correlation ρ,k = so that the probability of error for the kth user is ρ c k(σ) = Q where the superscript c denotes the probability of error when a conventional receiver is used. The probability of error is the same as the one in the single user case. If the signature are not orthogonal, the statistics are not Gaussian anymore. Consider k = users. Let ρ 1, = ρ and the received signal by the matched filter for user 1 is then y 1 = A 1 b 1 + A b ρ + n 1 (79) ( Ak σ ) (78)
15 15 The probability of error of user 1 is P c 1 (σ) = P { ˆb 1 b 1 } (8) = P [b 1 = +1]P [y 1 < b 1 = +1] + P [b 1 = 1]P [y 1 > b 1 = 1] (81) according to the decision rule for the conventional matched filter. Since y 1 is conditioned on b as well, it is not Gaussian. Hence, we have P [y 1 > b 1 = 1] = P [y 1 > b 1 = 1, b = +1]P [b = +1] (8) + P [y 1 > b 1 = 1, b = 1]P [b = 1] (83) = P [n 1 > A 1 A ρ]p [b = +1] + P [n 1 > A 1 + A ρ]p [b = 1] (84) = 1 ( ) Q A1 A ρ + 1 ( ) σ Q A1 + A ρ (85) σ = 1 ( ) Q A1 A ρ + 1 ( ) σ Q A1 + A ρ (86) σ The first equality follows from the fact that b 1 and b are independent. By symmetry, P [y 1 < b 1 = +1] = P [y 1 > b 1 = 1]. Therefore, the probability of error of user 1 is P1 c (σ) = 1 ( ) Q A1 A ρ + 1 ( ) σ Q A1 + A ρ σ Interchanging the roles of user 1 and, we have P c (σ) = 1 ( ) Q A A 1 ρ + 1 ( ) σ Q A + A 1 ρ σ Let us consider user 1. Since Q(x) is a monotonically decreasing function, ( ) P1 c A1 A ρ (σ) Q σ This bound is smaller than 1/ provided A /A 1 < 1/ ρ, i.e., the interferer is not dominant. Note as σ, (87) is dominated by the term with the smallest argument and hence the upper bound is an excellent approximation (for all but low SNRs). Therefore, BER of conventional ( ) receiver behaves like a single user system with a reduced SNR, A1 A ρ. However, if relative amplitude of interferer is stronger, i.e., A /A 1 > 1/ ρ, then the conventional receiver exhibits highly anomalous behavior, as known as the near-far problem. For σ (87) (88) (89)
16 16 example, BER is not monotonic in σ anymore, a property which is usually expected of any detector. For equation (87), since A 1 A ρ <, we have lim σ P c 1 (σ) = 1 and lim σ P c 1 (σ) = 1 which shows that BER is not monotonic. This anomalous behavior follows from the fact that the polarity of the output of the match filter for user 1 is governed by b other than by b 1. In fact, σ > is actually good in detection in the sense that P c 1 (σ) < 1/. (9) REFERENCES [1] N. Mandayam, Wireless Communication Technologies, Lecture notes, Spring 5, Rutgers University. [] M. Pursley, D. Sarwate, and W. Stark, Error probability for direct-sequence spread-spectrum multiple-access communications part I: upper and lower bounds, IEEE Trans. Comm., vol. 3, pp , May 198. [3] E. Geraniotis, M. Pursley, Error probability for direct-sequence spread-spectrum multiple-access communications part II: approximations, IEEE Trans. Comm., vol. 3, pp , May 198. [4] J. Lehnert, M. Pursley, Error probabilities for binary direct-sequence spread-spectrum multiple-access communications with random signature sequences, IEEE Trans. Comm., vol. 35, pp , Jan [5] R. Morrow, J. Lehnert, Bit-to-bit error dependence in slotted DS/SSMA packet systems with random signature sequences, IEEE Trans. Comm., vol. 37, pp , Oct [6] J. Holtzman, A simple, accurate method to calculate spread-spectrum multiple-access error probabilities, IEEE Trans. Comm., vol. 4, pp , Mar [7] T. Rappaport, Wireless Communications: Principles & Practice, Prentice-Hall, NJ, [8] S. Verdú, Optimum Multi-User Signal Detection, Ph.D. Thesis, Dept. of Electrical and Computer Engineering, University of Illinois, Aug [9] S. Verdú, Multiuser Detection, Cambridge University Press, NY, 1998.
Wireless Communication Technologies 16:332:559 (Advanced Topics in Communications) Lecture #17 and #18 (April 1, April 3, 2002)
Wireless Communication echnologies Lecture 7 & 8 Wireless Communication echnologies 6:33:559 (Advanced opics in Communications) Lecture #7 and #8 (April, April 3, ) Instructor rof. arayan Mandayam Summarized
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 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 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 informationOVER the past decades, CDMA systems have primarily
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 56, NO., JANUARY 8 Closed-Form BER Results for Multiple-Chip-Rate CDMA Systems Based on the Simplified Improved Gaussian Approximation MinChul Ju, Hyung-Myung
More informationThe Performance of Quaternary Amplitude Modulation with Quaternary Spreading in the Presence of Interfering Signals
Clemson University TigerPrints All Theses Theses 1-015 The Performance of Quaternary Amplitude Modulation with Quaternary Spreading in the Presence of Interfering Signals Allison Manhard Clemson University,
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 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 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 informationECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture)
ECE 564/645 - Digital Communications, Spring 018 Homework # Due: March 19 (In Lecture) 1. Consider a binary communication system over a 1-dimensional vector channel where message m 1 is sent by signaling
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 informationMultiuser Capacity Analysis of WDM in Nonlinear Fiber Optics
Multiuser Capacity Analysis of WDM in Nonlinear Fiber Optics Mohammad H. Taghavi N., George C. Papen, and Paul H. Siegel Dept. of ECE, UCSD, La Jolla, CA 92093 Email: {mtaghavi, gpapen, psiegel}@ucsd.edu
More informationADAPTIVE DETECTION FOR A PERMUTATION-BASED MULTIPLE-ACCESS SYSTEM ON TIME-VARYING MULTIPATH CHANNELS WITH UNKNOWN DELAYS AND COEFFICIENTS
ADAPTIVE DETECTION FOR A PERMUTATION-BASED MULTIPLE-ACCESS SYSTEM ON TIME-VARYING MULTIPATH CHANNELS WITH UNKNOWN DELAYS AND COEFFICIENTS Martial COULON and Daniel ROVIRAS University of Toulouse INP-ENSEEIHT
More informationLPI AND BER PERFORMANCE OF A CHAOTIC CDMA SYSTEM USING DIFFERENT DETECTION STRUCTURES
LPI AND BER PERFORMANCE OF A CHAOTIC CDMA SYSTEM USING DIFFERENT DETECTION STRUCTURES Jin Yu Berkeley Varitronics Systems Metuchen, NJ, 08840 Hanyu Li and Yu-Dong Yao Stevens Institute of Technology Hoboken,
More informationTRANSMISSION OF VECTOR QUANTIZATION OVER A FREQUENCY-SELECTIVE RAYLEIGH FADING CDMA CHANNEL
TRANSMISSION OF VECTOR QUANTIZATION OVER A FREQUENCY-SELECTIVE RAYLEIGH FADING CDMA CHANNEL A Thesis Submitted to the College of Graduate Studies and Research in Partial Fulfillment of the Requirements
More informationOnamethodtoimprove correlation properties of orthogonal polyphase spreading sequences
Regular paper Onamethodtoimprove correlation properties of orthogonal polyphase spreading sequences Beata J. Wysocki and Tadeusz A. Wysocki Abstract In this paper, we propose a simple but efficient method
More informationSINR, Power Efficiency, and Theoretical System Capacity of Parallel Interference Cancellation
1 SINR, Power Efficiency, and Theoretical System Capacity of Parallel Interference Cancellation D. Richard Brown III and C. Richard Johnson Jr. This research was supported in part by NSF grants ECS-9528363,
More informationPerformance of Coherent Binary Phase-Shift Keying (BPSK) with Costas-Loop Tracking in the Presence of Interference
TMO Progress Report 4-139 November 15, 1999 Performance of Coherent Binary Phase-Shift Keying (BPSK) with Costas-Loop Tracking in the Presence of Interference M. K. Simon 1 The bit-error probability performance
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 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 informationEE4512 Analog and Digital Communications Chapter 4. Chapter 4 Receiver Design
Chapter 4 Receiver Design Chapter 4 Receiver Design Probability of Bit Error Pages 124-149 149 Probability of Bit Error The low pass filtered and sampled PAM signal results in an expression for the probability
More informationLecture 7: Wireless Channels and Diversity Advanced Digital Communications (EQ2410) 1
Wireless : Wireless Advanced Digital Communications (EQ2410) 1 Thursday, Feb. 11, 2016 10:00-12:00, B24 1 Textbook: U. Madhow, Fundamentals of Digital Communications, 2008 1 / 15 Wireless Lecture 1-6 Equalization
More informationSquare Root Raised Cosine Filter
Wireless Information Transmission System Lab. Square Root Raised Cosine Filter Institute of Communications Engineering National Sun Yat-sen University Introduction We consider the problem of signal design
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 informationSignal Design for Band-Limited Channels
Wireless Information Transmission System Lab. Signal Design for Band-Limited Channels Institute of Communications Engineering National Sun Yat-sen University Introduction We consider the problem of signal
More informationCHAPTER 14. Based on the info about the scattering function we know that the multipath spread is T m =1ms, and the Doppler spread is B d =0.2 Hz.
CHAPTER 4 Problem 4. : Based on the info about the scattering function we know that the multipath spread is T m =ms, and the Doppler spread is B d =. Hz. (a) (i) T m = 3 sec (ii) B d =. Hz (iii) ( t) c
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 informationDigital Band-pass Modulation PROF. MICHAEL TSAI 2011/11/10
Digital Band-pass Modulation PROF. MICHAEL TSAI 211/11/1 Band-pass Signal Representation a t g t General form: 2πf c t + φ t g t = a t cos 2πf c t + φ t Envelope Phase Envelope is always non-negative,
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 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 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 informationCell throughput analysis of the Proportional Fair scheduler in the single cell environment
Cell throughput analysis of the Proportional Fair scheduler in the single cell environment Jin-Ghoo Choi and Seawoong Bahk IEEE Trans on Vehicular Tech, Mar 2007 *** Presented by: Anh H. Nguyen February
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 informationthat efficiently utilizes the total available channel bandwidth W.
Signal Design for Band-Limited Channels Wireless Information Transmission System Lab. Institute of Communications Engineering g National Sun Yat-sen University Introduction We consider the problem of signal
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 informationThis examination consists of 11 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS
THE UNIVERSITY OF BRITISH COLUMBIA Department of Electrical and Computer Engineering EECE 564 Detection and Estimation of Signals in Noise Final Examination 6 December 2006 This examination consists of
More informationLinear and Nonlinear Iterative Multiuser Detection
1 Linear and Nonlinear Iterative Multiuser Detection Alex Grant and Lars Rasmussen University of South Australia October 2011 Outline 1 Introduction 2 System Model 3 Multiuser Detection 4 Interference
More informationA First Course in Digital Communications
A First Course in Digital Communications Ha H. Nguyen and E. Shwedyk February 9 A First Course in Digital Communications 1/46 Introduction There are benefits to be gained when M-ary (M = 4 signaling methods
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 informationThis examination consists of 10 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS
THE UNIVERSITY OF BRITISH COLUMBIA Department of Electrical and Computer Engineering EECE 564 Detection and Estimation of Signals in Noise Final Examination 08 December 2009 This examination consists of
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 informationCommunication Theory Summary of Important Definitions and Results
Signal and system theory Convolution of signals x(t) h(t) = y(t): Fourier Transform: Communication Theory Summary of Important Definitions and Results X(ω) = X(ω) = y(t) = X(ω) = j x(t) e jωt dt, 0 Properties
More informationEE456 Digital Communications
EE456 Digital Communications Professor Ha Nguyen September 5 EE456 Digital Communications Block Diagram of Binary Communication Systems m ( t { b k } b k = s( t b = s ( t k m ˆ ( t { bˆ } k r( t Bits in
More informationCHIRP spread spectrum (CSS) is a spread spectrum technique
Bit-Error-Rate Performance Analysis of an Overlap-based CSS System Taeung Yoon, Dahae Chong, Sangho Ahn, and Seokho Yoon Abstract In a chirp spread spectrum (CSS system, the overlap technique is used for
More informationCoding theory: Applications
INF 244 a) Textbook: Lin and Costello b) Lectures (Tu+Th 12.15-14) covering roughly Chapters 1,9-12, and 14-18 c) Weekly exercises: For your convenience d) Mandatory problem: Programming project (counts
More informationECE Information theory Final (Fall 2008)
ECE 776 - Information theory Final (Fall 2008) Q.1. (1 point) Consider the following bursty transmission scheme for a Gaussian channel with noise power N and average power constraint P (i.e., 1/n X n i=1
More informationResearch Article An Iterative Soft Bit Error Rate Estimation of Any Digital Communication Systems Using a Nonparametric Probability Density Function
Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and etworking Volume 9, Article ID 59, 9 pages doi:.55/9/59 Research Article An Iterative Soft Bit Error Rate Estimation of Any
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 informationModulation & Coding for the Gaussian Channel
Modulation & Coding for the Gaussian Channel Trivandrum School on Communication, Coding & Networking January 27 30, 2017 Lakshmi Prasad Natarajan Dept. of Electrical Engineering Indian Institute of Technology
More informationA Systematic Description of Source Significance Information
A Systematic Description of Source Significance Information Norbert Goertz Institute for Digital Communications School of Engineering and Electronics The University of Edinburgh Mayfield Rd., Edinburgh
More informationData Detection for Controlled ISI. h(nt) = 1 for n=0,1 and zero otherwise.
Data Detection for Controlled ISI *Symbol by symbol suboptimum detection For the duobinary signal pulse h(nt) = 1 for n=0,1 and zero otherwise. The samples at the output of the receiving filter(demodulator)
More informationChapter 2 Signal Processing at Receivers: Detection Theory
Chapter Signal Processing at Receivers: Detection Theory As an application of the statistical hypothesis testing, signal detection plays a key role in signal processing at receivers of wireless communication
More informationMODULATION AND CODING FOR QUANTIZED CHANNELS. Xiaoying Shao and Harm S. Cronie
MODULATION AND CODING FOR QUANTIZED CHANNELS Xiaoying Shao and Harm S. Cronie x.shao@ewi.utwente.nl, h.s.cronie@ewi.utwente.nl University of Twente, Faculty of EEMCS, Signals and Systems Group P.O. box
More informationLecture 1: The Multiple Access Channel. Copyright G. Caire 12
Lecture 1: The Multiple Access Channel Copyright G. Caire 12 Outline Two-user MAC. The Gaussian case. The K-user case. Polymatroid structure and resource allocation problems. Copyright G. Caire 13 Two-user
More informationUpper Bounds for the Average Error Probability of a Time-Hopping Wideband System
Upper Bounds for the Average Error Probability of a Time-Hopping Wideband System Aravind Kailas UMTS Systems Performance Team QUALCOMM Inc San Diego, CA 911 Email: akailas@qualcommcom John A Gubner Department
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 informationEffect of Multipath Propagation on the Noise Performance of Zero Crossing Digital Phase Locked Loop
International Journal of Electronics and Communication Engineering. ISSN 0974-2166 Volume 9, Number 2 (2016), pp. 97-104 International Research Publication House http://www.irphouse.com Effect of Multipath
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 informationPrinciples of Communications
Principles of Communications Chapter V: Representation and Transmission of Baseband Digital Signal Yongchao Wang Email: ychwang@mail.xidian.edu.cn Xidian University State Key Lab. on ISN November 18, 2012
More informationDetermining the Optimal Decision Delay Parameter for a Linear Equalizer
International Journal of Automation and Computing 1 (2005) 20-24 Determining the Optimal Decision Delay Parameter for a Linear Equalizer Eng Siong Chng School of Computer Engineering, Nanyang Technological
More informationInformation Theory for Wireless Communications, Part II:
Information Theory for Wireless Communications, Part II: Lecture 5: Multiuser Gaussian MIMO Multiple-Access Channel Instructor: Dr Saif K Mohammed Scribe: Johannes Lindblom In this lecture, we give the
More informationUTA EE5362 PhD Diagnosis Exam (Spring 2011)
EE5362 Spring 2 PhD Diagnosis Exam ID: UTA EE5362 PhD Diagnosis Exam (Spring 2) Instructions: Verify that your exam contains pages (including the cover shee. Some space is provided for you to show your
More informationBit Error Rate Estimation for a Joint Detection Receiver in the Downlink of UMTS/TDD
in Proc. IST obile & Wireless Comm. Summit 003, Aveiro (Portugal), June. 003, pp. 56 60. Bit Error Rate Estimation for a Joint Detection Receiver in the Downlink of UTS/TDD K. Kopsa, G. atz, H. Artés,
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 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 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 informationIterative Equalization using Improved Block DFE for Synchronous CDMA Systems
Iterative Equalization using Improved Bloc DFE for Synchronous CDMA Systems Sang-Yic Leong, Kah-ing Lee, and Yahong Rosa Zheng Abstract Iterative equalization using optimal multiuser detector and trellis-based
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 informationBASICS OF DETECTION AND ESTIMATION THEORY
BASICS OF DETECTION AND ESTIMATION THEORY 83050E/158 In this chapter we discuss how the transmitted symbols are detected optimally from a noisy received signal (observation). Based on these results, optimal
More informationDigital Transmission Methods S
Digital ransmission ethods S-7.5 Second Exercise Session Hypothesis esting Decision aking Gram-Schmidt method Detection.K.K. Communication Laboratory 5//6 Konstantinos.koufos@tkk.fi Exercise We assume
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 informationGenetic Algorithm Applied to Multipath Multiuser Channel Estimation in DS/CDMA Systems
6 EEE Ninth nternational Symposium on Spread Spectrum Techniques and Applications Genetic Algorithm Applied to Multipath Multiuser Channel Estimation in DS/CDMA Systems Fernando Ciriaco and Taufik Abrão
More informationGenetic Algorithm Assisted Multiuser Detection for Asynchronous Multicarrier CDMA Hua Wei and Lajos Hanzo 1
Genetic Algorithm Assisted ultiuser Detection for Asynchronous ulticarrier CDA Hua Wei and Lajos Hanzo 1 Dept. of ECS, University of Southampton, SO17 1BJ, UK. Tel: +44-23-859-3125, Fax: +44-23-859-458
More informationEE 574 Detection and Estimation Theory Lecture Presentation 8
Lecture Presentation 8 Aykut HOCANIN Dept. of Electrical and Electronic Engineering 1/14 Chapter 3: Representation of Random Processes 3.2 Deterministic Functions:Orthogonal Representations For a finite-energy
More informationResidual Versus Suppressed-Carrier Coherent Communications
TDA Progress Report -7 November 5, 996 Residual Versus Suppressed-Carrier Coherent Communications M. K. Simon and S. Million Communications and Systems Research Section This article addresses the issue
More informationVirtual Array Processing for Active Radar and Sonar Sensing
SCHARF AND PEZESHKI: VIRTUAL ARRAY PROCESSING FOR ACTIVE SENSING Virtual Array Processing for Active Radar and Sonar Sensing Louis L. Scharf and Ali Pezeshki Abstract In this paper, we describe how an
More informationa) Find the compact (i.e. smallest) basis set required to ensure sufficient statistics.
Digital Modulation and Coding Tutorial-1 1. Consider the signal set shown below in Fig.1 a) Find the compact (i.e. smallest) basis set required to ensure sufficient statistics. b) What is the minimum Euclidean
More informationEVALUATION OF PACKET ERROR RATE IN WIRELESS NETWORKS
EVALUATION OF PACKET ERROR RATE IN WIRELESS NETWORKS Ramin Khalili, Kavé Salamatian LIP6-CNRS, Université Pierre et Marie Curie. Paris, France. Ramin.khalili, kave.salamatian@lip6.fr Abstract Bit Error
More informationECE6604 PERSONAL & MOBILE COMMUNICATIONS. Week 3. Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process
1 ECE6604 PERSONAL & MOBILE COMMUNICATIONS Week 3 Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process 2 Multipath-Fading Mechanism local scatterers mobile subscriber base station
More informationConstellation Shaping for Communication Channels with Quantized Outputs
Constellation Shaping for Communication Channels with Quantized Outputs Chandana Nannapaneni, Matthew C. Valenti, and Xingyu Xiang Lane Department of Computer Science and Electrical Engineering West Virginia
More informationEstimation of the Capacity of Multipath Infrared Channels
Estimation of the Capacity of Multipath Infrared Channels Jeffrey B. Carruthers Department of Electrical and Computer Engineering Boston University jbc@bu.edu Sachin Padma Department of Electrical and
More informationCooperative Diversity in CDMA over Nakagami m Fading Channels
Cooperative Diversity in CDMA over Nakagami m Fading Channels Ali Moftah Ali Mehemed A Thesis in The Department of Electrical and Computer Engineering Presented in Partial Fulfillment of the Requirements
More informationEfficient OOK/DS-CDMA Detection Threshold Selection
2013 American Control Conference ACC) Washington, DC, USA, June 17-19, 2013 Efficient OOK/DS-CDMA Detection Threshold Selection Dimitrios Katselis, Carlo Fischione and Håan Hjalmarsson Abstract A major
More informationEs e j4φ +4N n. 16 KE s /N 0. σ 2ˆφ4 1 γ s. p(φ e )= exp 1 ( 2πσ φ b cos N 2 φ e 0
Problem 6.15 : he received signal-plus-noise vector at the output of the matched filter may be represented as (see (5-2-63) for example) : r n = E s e j(θn φ) + N n where θ n =0,π/2,π,3π/2 for QPSK, and
More informationParameter Estimation
1 / 44 Parameter Estimation Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay October 25, 2012 Motivation System Model used to Derive
More informationSummary: SER formulation. Binary antipodal constellation. Generic binary constellation. Constellation gain. 2D constellations
TUTORIAL ON DIGITAL MODULATIONS Part 8a: Error probability A [2011-01-07] 07] Roberto Garello, Politecnico di Torino Free download (for personal use only) at: www.tlc.polito.it/garello 1 Part 8a: Error
More informationLarge Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences
Large Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences Guang Gong 1 Fei Huo 1 and Yang Yang 2,3 1 Department of Electrical and Computer Engineering University of
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 informations o (t) = S(f)H(f; t)e j2πft df,
Sample Problems for Midterm. The sample problems for the fourth and fifth quizzes as well as Example on Slide 8-37 and Example on Slides 8-39 4) will also be a key part of the second midterm.. For a causal)
More informationNon Orthogonal Multiple Access for 5G and beyond
Non Orthogonal Multiple Access for 5G and beyond DIET- Sapienza University of Rome mai.le.it@ieee.org November 23, 2018 Outline 1 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density
More informationExpectation propagation for signal detection in flat-fading channels
Expectation propagation for signal detection in flat-fading channels Yuan Qi MIT Media Lab Cambridge, MA, 02139 USA yuanqi@media.mit.edu Thomas Minka CMU Statistics Department Pittsburgh, PA 15213 USA
More informationResearch Article Multigroup Synchronization in 1D-Bernoulli Chaotic Collaborative CDMA
Hindawi Wireless Communications and Mobile Computing Volume 2017, Article ID 7561757, 7 pages https://doiorg/101155/2017/7561757 Research Article Multigroup Synchronization in 1D-Bernoulli Chaotic Collaborative
More informationA Novel Blind Multiuser Detection Algorithm Based on Support Vector Machines
A Novel Blind Multiuser Detection Algorithm Based on Support Vector Machines Yan Zhu, Limin Xiao, Shidong Zhou and Jing Wang Department of Electronic Engineering Tsinghua University Beijing, China 100084
More informationPerformance of DS-CDMA Systems With Optimal Hard-Decision Parallel Interference Cancellation
2918 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 11, NOVEMBER 2003 Performance of DS-CDMA Systems With Optimal Hard-Decision Parallel Interference Cancellation Remco van der Hofstad Marten J.
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationData-aided and blind synchronization
PHYDYAS Review Meeting 2009-03-02 Data-aided and blind synchronization Mario Tanda Università di Napoli Federico II Dipartimento di Ingegneria Biomedica, Elettronicae delle Telecomunicazioni Via Claudio
More informationBinary De Bruijn sequences for DS-CDMA systems: analysis and results
RESEARCH Open Access Binary sequences for DS-CDMA systems: analysis and results Susanna Spinsante *, Stefano Andrenacci and Ennio Gambi Abstract Code division multiple access (CDMA) using direct sequence
More informationPerformance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels
Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Jilei Hou, Paul H. Siegel and Laurence B. Milstein Department of Electrical and Computer Engineering
More informationApproximate BER for OFDM Systems Impaired by a Gain Mismatch of a TI-ADC Realization
Approximate BER for OFDM Systems Impaired by a Gain Mismatch of a TI-ADC Realization Vo-Trung-Dung Huynh, ele oels, Heidi Steendam Department of Telecommunications annformation Processing, Ghent University
More informationElectronics and Communication Exercise 1
Electronics and Communication Exercise 1 1. For matrices of same dimension M, N and scalar c, which one of these properties DOES NOT ALWAYS hold? (A) (M T ) T = M (C) (M + N) T = M T + N T (B) (cm)+ =
More information