FULL-DIVERSITY SPREADING CODES FOR MULTICARRIER CDMA SYSTEMS Wei Jiang and Daoben Li School of Information Engineering, Beijing University of Posts and Telecommunications Beijing 100876, China Email: [email protected]

ABSTRACT The paper proposes a method to construct full-diversity spreading codes for the multicarrier CDMA (MC-CDMA) systems based on evaluation of the maximum-likelihood multi-user detection (ML-MUD) performance in the frequency selective fading channels. The codes are constructed by offsetting the phase of conventional orthogonal codes and can achieve the maximum diversity gain with ML-MUD even for full-loaded systems. Simulation results show that the performance of single-user detectors can also be improved by the proposed method. I. INTRODUCTION The spreading codes are very important for the performance of the Multicarrier Code Division Multiple Access (MC-CDMA) [1]–[3] systems. Much research work on the choice of spreading codes has been performed, such as [4]–[6]. In [5], four kinds of codes, which are the Walsh codes, the Gold codes, the Orthogonal Gold codes, and the Zadoff-Chu codes [7], [8], are compared for their crest factor, dynamic range, and bit-error performance. When comparing the bit-error performance, a criterion based on frequency correlation function is proposed in [5]. But the analysis is only based on AWGN channel, and is only for asynchronous uplink of MC-CDMA systems. We consider downlink fading channels in this paper. Based on analysis of the Maximum-Likelihood Multiuser Detection (ML-MUD), a criterion for evaluating the spreading codes is proposed, which regards the minimum Hamming distance and the minimum product distance of the spread signal. Furthermore, a new kind of codes, fulldiversity codes, is introduced. They are constructed by phase offsetting of conventional orthogonal codes. Unlike Walsh codes, diversity gain can be maintained even when the system is in full user load. Numerical results show that this kind of codes significantly outperform traditional codes in downlink frequency selective channel. The paper is organized as follows. Section II introduces the system model. The followed section presents the analysis on the performance of ML-MUD for the downlink of the MC-CDMA systems. Meanwhile, the criterion for spreading codes evaluation is given. The full-diversity code

is introduced in section IV. And section V presents the simulation results. Finally, a conclusion is drawn in section VI. II. SYSTEM MODEL The downlink of the MC-CDMA systems is considered in this paper. Suppose the spreading factor is N , which means that each symbol of one user is spread onto N orthogonal subcarriers. Assume there are K active users. The symbols of user k is spread by code ck (0 < k ≤ K), which is a column vector of length N . The set of the spreading codes is represented as a matrix: C = [c1 c2 · · · cK ]. The data symbols are represented as x = [x1 x2 · · · xK ]T , where xk is the symbol of user k. BPSK modulation is used for √ √ all users, i.e., xk ∈ { εb , − εb }, where εb is the energy of a single bit on average. The downlink channel is supposed to be frequencyselective Rayleigh fading. And the Doppler spread is small enough so that the inter-carrier interference can be ignored. Independent fading on the subcarriers is assumed, which is an approximation when the bandwidth is far larger than the channel coherent bandwidth and the interleaving is deep enough. Denote the fading channel as H = diag([h1 h2 · · · hN ]), where hl is the complex fading coefficient on the lth subcarrier. For simplicity of the  analysis, 2 we normalize the channel fading, i.e., E |hl | = 1, 0 < l ≤ N . Let y = [y1 y2 · · · yN ]T be the received vector of symbols after the FFT operation, and w = [w1 w2 · · · wN ]T be the additive complex Gaussian noise on the subcarriers, where wl is assumed to be independent and identically Gaussian distributed with mean zero and variance N0 . Then, we have y = HCx + w. (1) Ideal channel estimation is assumed in this paper, i.e., H is supposed to be known at the receiver. III. PERFORMANCE OF MAXIMUM-LIKELIHOOD MULTI-USER DETECTION The Maximum-Likelihood Multi-User Detection (MLMUD) minimizes the Euclidean distance between the re-

1 of 6

ceived signal and the candidate signal. That is, 2

ˆ = arg min ky − HCxk . x

(2)

x

Supposing xi is sent, the pairwise error probability between xi and another symbol vector xt is   Pi,t = P ky − HCxi k2 > ky − HCxt k2 . (3) Define



di,t = C (xi − xt ) ,

l=1

Then by substituting (1), (4) and (6) into (3), we get  h i  Pi,t = P 2Re (Hdi,t )H w > 4γN0 . (7) h i Given the channel state H, 2Re (Hdi,t )H w in (7) is a Gaussian random variable with mean zero and variance 8γN02 . So we have p  Pi,t = Q 2γ . (8)

2  ∆ |dli,t | Let γ¯cl = E γcl = 4N . Because γcl is a chi-square 0 distributed random variable with two degrees of freedom, the characteristic function of γ can be expressed [9] as:

ψ (jυ) =

l=1

1 . 1 − jυ¯ γcl

(9)

Suppose γ¯cl ∈ {0, γ¯1 , γ¯2 , · · · , γ¯M }, γ¯l > 0, 1 < M ≤ N for ∆ 1 < l ≤ N , and Lm = {l|¯ γcl = γ¯m , 0 < l ≤ N } . Then, the PDF of γ can be obtained by inverse Fourier transform of (9) after applying partial fraction decomposition: p(γ) =

Lm M X X

m=1 l=1

where, am,l =

0

=

am,l γ Lm −l

γ

e− γ¯m , Lm −l+1

(Lm − l)!¯ γm

(10)

M X Lm X

am,l



m=1 l=1  LX m −l

(4)

which is the difference on the chips generated by spreading xi and xt . Denote the lth element of di,t as dli,t . And define l 2 h d l i,t ∆ (5) γcl = , 4N0 and 2 ∆ kHdi,t k γ= 4N0 (6) N X = γcl .

N Y

From (8) and (10), the average pairwise error probability can be obtained [10] as Z ∞ p  P¯i,t = Q 2γ P (γ) dγ

×

where µl = mated as

q

(1 − µl ) 2

Lm − l + k k

k=0

γ ¯l 1+¯ γl .

Lm −l+1

(12)



(1 + µl ) 2

,

When γ¯l ≫ 0, (12) can be approxi-

P¯i,t ≈



2Li,t − 1 Li,t

=



2Li,t − 1 Li,t

where ∆

Li,t =

Y M

1

γm ) m=1 (4¯  Y N

M X

l=1,¯ γcl 6=0

Lm

1 , 4¯ γcl

Lm

(13)

(14)

m=1

is the Hamming distance between the chip sequences generated by spreading xi and xt . As in [11], define  1  N 2 Li,t Y ∆ l  (15) d2i,t =  di,t l=1,dli,t 6=0

as the product distance between the sequences. Then (13) becomes !−Li,t   d2i,t 2L − 1 i,t P¯i,t ≈ . (16) Li,t N0 Furthermore, the symbol error probability for high SNR (signal-to-noise ratio) may be upper-bounded by use of a union bound:    2 −Lmin  2Lmin − 1 dmin K Ps ≤ 2 − 1 , (17) Lmin N0 where



Lmin = min Li,t

(18)

(xi ,xt )

(−j¯ γm )Lm −l+1 (l − 1)!   Lm 1 l−1 d υ − j¯γm ψ (jυ) × dυ l−1

k

is the minimum Hamming distance between the chip sequences of any pair of symbol vectors, and ∆

d2min =

(11) .

υ= jγ¯1

m

min

(xi ,xt ):Li,t =Lmin

d2i,t

(19)

is the minimum product distance between the sequences with Hamming distance Lmin . 2 of 6

7

30

6

25

5

20

Walsh Zadoff−Chu PO−Walsh PO−Zadoff−Chu

d 2min

35

L min

8

4

15

3

10 Walsh Zadoff−Chu PO−Walsh PO−Zadoff−Chu

2

1

1

2

3

5

4 5 Number of Users

6

7

0

8

1

2

3

6

7

8

(b) d2min normalized by εb

(a) Lmin Fig. 1.

4 5 Number of Users

Comparison of Lmin and d2min for different spreading codes.

The bound in (17) is not tight enough, especially when the number of active users K is large. However, two key parameters for the performance of the spreading codes of MC-CDMA systems in frequency selective fading channels can be found, which are the minimum Hamming distance Lmin and the minimum product distance d2min . Lmin is more important than d2min , as it is the order of diversity and determines the slope of the BER-SNR curve. This finding is similar to the design of error correcting codes in fading channels [11], [12]. The criterion of evaluating the performance of the spreading codes can be got straightforward. Firstly, the larger Lmin , the better performance; Secondly, for spreading codes with the same Lmin , the one with the largest d2min is the best. This criterion can serve as a guideline for searching and designing the spreading codes. IV. FULL-DIVERSITY CODES As has been pointed out in the last section, the minimum Hamming distance is critical for the performance of the spreading codes for MC-CDMA systems in frequency selective fading downlink channels. Let us first check the Lmin and d2min of traditional spreading codes, such as Walsh codes, Zadoff-Chu Codes. The variation of Lmin and d2min with the number of users is plotted in Fig. 1. As can be seen, the Lmin ’s of Walsh codes reduces to one when the system is in full user load. It means that the error probability only decreases inversely with the increase of SNR, though there is still some gain compared to pure OFDM due to the increase of d2min . Obviously, as the Walsh codes have their chips confined in the same set {1, −1}, the sequence generated by differ-

ent symbol vectors may be same on some chips. According to definition (4) and (14), this makes Lmin smaller than the code length N . Especially when K = N , there are pairs of sequences that are different only in one chip, which limits the overall performance. To achieve full diversity, i.e., Lmin = N , we can assign different symbol sets for different spreading codes. A intuitive way is to offset the phase of a set of binary orthogonal codes. For example, based on a set of Walsh codes C = [c1 c2 · · · cK ], let ′

ck = ejπ

k−1 K

ck , 1 ≤ k ≤ K,

(20) ′

then we get a set of full-diversity codes: C = ′ ′ ′ [c1 c2 · · · cK ]. We call it Phase-Offset Walsh (PO-Walsh) ′ codes. The parameter Lmin and d2min of C are also plotted in Fig. 1. We can see that Lmin keeps constant when the load varies. And full diversity can always be achieved, even when the system is in full user load. Note that d2min of the PO-Walsh codes decreases from 0.5εb to 0.3827εb when the number of users grows from one to eight. So there is about 1dB gap to the theoretical eight-order diversity performance, as will be verified by the simulation result in the next section. The purpose of phase offsetting is to assign a signature phase to each user, so that the chip sequences of different users do not compensate for each other. This make different data vector generate different symbols on each subcarrier, so full diversity is obtained. We choose the user-specific phases to be uniformly distributed over the space on the signal constellation in order to make d2min as large as possible. Furthermore, phase offsetting doesn’t disturb the orthogonality of the codes.

3 of 6

0

0

10

10

−1

−1

10

10

−2

−2

10

10

−3

−3

BER

10

BER

10

−4

−4

10

10 Theoretical, L=1 Theoretical, L=2 Theoretical, L=8 Walsh Zadoff−Chu PO−Walsh PO−Zadoff−Chu

−5

10

−6

10

−7

10

0

5

−5

Theoretical, L=1 Theoretical, L=8 Walsh Zadoff−Chu PO−Walsh PO−Zadoff−Chu

10

−6

10

−7

10

15 E / N (dB) b

20

25

10

30

0

0

5

10

15 E / N (dB) b

20

25

30

0

Fig. 2. Performance of the full loaded downlink MC-CDMA system with ML-MUD. The theoretical curves are for BPSK signal with MRC diversity of order L. (N = 8)

Fig. 3. Performance of the full loaded downlink MC-CDMA system with MMSEC. The theoretical curves are for BPSK signal with MRC diversity of order L. (N = 8)

The method of phase offsetting can also be applied to other conventional codes, such as the orthogonal Gold codes, the Zadoff-Chu codes [7], [8]. Note that when the Zadoff-Chu codes are used as the base codes, the case is a little different from the Walsh codes. As the ZadoffChu codes are complex valued, offsetting the phase can not guarantee Lmin = N , especially when the load of users is high. However, according to Fig. 1(a), Lmin can also be increased by phase offsetting compared to the traditional Zadoff-Chu codes. So performance improvement can also be expected for maximum-likelihood detector, as will be shown in the next section. Only BPSK modulation is considered above. When highorder modulation, such as M-PSK, M-QAM, is adopted in the MC-CDMA system, the method of phase offsetting can also be applied. For example, to construct PO-Walsh code for 8-PSK modulation, (20) should be changed to:

2 shows the average bit error rate (BER) versus the signalto-noise ratio (SNR) for the original codes and the phaseoffset codes. The PO-Walsh codes outperform the Walsh codes significantly for ML-MUD, and perform closely to the theoretical result for BPSK modulation in Rayleigh fading channel with eight orders of diversity. The gap to the theoretical performance is about 1dB , as is predicted in the previous section. The performance of Phase-Offset Zadoff-Chu (POZadoff-Chu) codes is close to PO-Walsh codes. This can be explained by Fig. 1. The parameter Lmin for PO-ZadoffChu codes is less than that of PO-Walsh codes, but the parameter d2min for the PO-Zadoff-Chu codes is larger, which compensate for the reduction of diversity order. So the parameter d2min plays a more important role when the diversity order is high enough. Also note that the traditional Zadoff-Chu codes is better than the Walsh codes. In the downlink of the full-loaded MC-CDMA system, the former can achieve two-order diversity while the latter have only have one-order diversity, which verifies the result shown in Fig. 1(a). And the Walsh codes, though have Lmin = 1, can still have significant gain compared to the theoretical result without diversity. This is because d2min grows from 0.5εb to 32εb , as is shown in Fig. 1(b). Due to the complexity and the availability of the information of active users, ML-MUD is unlikely to the used for downlink receiver in practice. As has been pointed out in [13], MMSEC (Minimum Mean Square Error Combining) is more favorable when the system is in high load. The MMSEC receiver equalizes the signal on the subcarriers with an one-tap equalizer denoted by: G =



k−1

ck = ejπ 4K ck , 1 ≤ k ≤ K,

(21)

so that full diversity can be obtained. However, the gain achieved by this method may shrink because the distance of the signal points in the constellation is too small and little space is left for the phase offsetting for different codes, which makes the parameter d2min very small. V. SIMULATION RESULTS The performance of different spreading codes for the downlink of the full-loaded MC-CDMA system is evaluated by Monte Carlo simulation. The channel is assumed to be slow frequency-selective Rayleigh fading, and the fading on different subcarriers is assumed to be independent. Fig.

4 of 6

−2

0

10

10 Walsh, ML−MUD PO−Walsh, ML−MUD Walsh, MMSEC PO−Walsh, MMSEC

−1

10

−3

−2

BER

10

BER

10

−4

−3

10

−4

10

Walsh, MMSEC PO−Walsh, MMSEC Walsh, MRC PO−Walsh, MRC Walsh, EGC PO−Walsh, EGC

10

−5

10

−5

10

−6

1

2

3

4 5 Number of Users

6

7

10

8

Fig. 4. Performance of the downlink MC-CDMA system with different number of users, N = 8, SN R = 12 dB

0

10

20

30 40 Number of Users

50

60

70

Fig. 5. Performance of the downlink MC-CDMA system with different number of users, N = 64, SN R = 10 dB

h∗

0

l diag([g1 g2 · · · gN ]), where gl = |hl |2 +N , 1 ≤ l ≤ N . The 0 output of the equalizer is despread with the user-specific spreading code, so the soft decision value for user k is:

10

x ˆk = cH k Gy, 1 ≤ k ≤ K.

10

−1

10

−2

(22)

−3

10 BER

The comparison of MMSEC performance for different codes is shown in Fig. 3. Obviously, the PO-Walsh codes outperform the Walsh codes in a similar way. But for the Zadoff-Chu codes, the gap between the phase-offset codes and the original codes is not so large. Fig. 4 shows the BER versus the active users’ number of the downlink channel using Walsh codes and PO-Walsh codes. It can be seen that for ML-MUD, the BER of the PO-Walsh codes almost keeps constant for different K . In contrast, the BER of the Walsh codes increases quickly with the increase of the user number. In other words, the PO-Walsh codes can support much more users when the BER of the link is constrained to be below a certain level. The case is similar for the MMSEC receiver. Fig. 5 plots the similar results for the codes with spreading factor 64. In this case, the MMSEC, MRC (Maximum Ratio Combining), and EGC (Equal Gain Combining) receivers are simulated. The advantage of PO-Walsh code is obvious for any kind of receivers. Note that the MMSEC receiver is less sensitive to the number of users, and outperforms the other two when the system is in high load. On the other hand, the MRC receiver performs the best when there are only a few users. The performance of the PO-Walsh codes with N = 4 applied to 8-PSK modulated MC-CDMA downlink channel is illustrated in Fig. 6. The PO-Walsh codes are created as (21), and the cases for 2 and 4 active users are simulated. The parameters Lmin and d2min of the PO-Walsh codes,

−4

10

Theoretical, L=1 Theoretical, L=2 Theoretical, L=4 Walsh, K=2 PO−Walsh, K=2 Walsh, K=4 PO−Walsh, K=4

−5

10

−6

10

−7

10

0

5

10

15 Eb/ N0 (dB)

20

25

30

Fig. 6. Performance of the downlink MC-CDMA system with 8-PSK modulation and ML-MUD. The theoretical curves are for BPSK signal with MRC diversity of order L. (N = 4)

as well as the Walsh codes, are summarized in table I. It’s shown that the PO-Walsh codes can also achieve full-order diversity. Though, the gain compared to the Walsh codes is not as large as in the BPSK case. This is because the d2min gets too small, as is explained in the last section. VI. CONCLUSION In this paper, we evaluate the performance of the MLMUD receiver for the downlink MC-CDMA system in frequency-selective fading channels, and propose a criterion for the designing of the spreading codes. We find that in order to maximize the diversity gain of the MCCDMA system, the minimum Hamming distance of the spreading codes should be maximized. Besides, the codes

5 of 6

TABLE I Lmin

AND

d2min

OF THE SPREADING CODES WITH

The authors would also like to thank the anonymous reviewers for their helpful comments that improved the manuscript.

8-PSK

MODULATION

R EFERENCES

d2min (εb )

Lmin

Spreading codes (N = 4)

K=2

K=4

K=2

K=4

Walsh

2

1

1.7573

7.0294

PO-Walsh

4

4

0.3362

0.1312

with large minimum product distance can still improve the performance of the system. This result is similar to the design guideline for the error correcting codes in the fading channels [11], [12]. Based on the criterion proposed, we introduce a method to maximize the diversity order of the spreading codes, which is to offset the phase of the conventional orthogonal codes in different degrees. By this way, even full diversity order can be obtained when the system is in full user load. Simulation of the MC-CDMA system in independent fading channels shows that the full-diversity codes outperform traditional orthogonal codes both for multi-user detection and single-user detection. The phase offset codes can be utilized to improve the diversity order in downlink channel only. In the case of the uplink channel, the signal of different users undergoes independent channel fading, so the performance cannot be derived as in section III, and the phase-offsetting is useless. In fact, the full diversity can always be realized in the uplink if the ML-MUD is used. This method can also be thought of as a full-diversity multiplexing technology in OFDM systems, in which the application of the maximum-likelihood detection is more practical. ACKNOWLEDGEMENT The research is supported by National Natural Science Foundation of China (NSFC) under grant no. 90604035.

[1] N. Yee, J. P. Linnartz, and G. Fettweis, “Multi-carrier CDMA in indoor wireless radio networks,” in IEEE international symposium on Personal, Indoor and Mobile Radio Communications (PIMRC ’93), Yokohama, Japan, 1993, pp. 109–113. [2] K. Fazel and L. Papke, “On the performance of convolutionally coded CDMA-OFDM for mobile communication system,” in IEEE international symposium on Personal, Indoor and Mobile Radio Communications (PIMRC ’93), Yokohama, Japan, 1993, pp. 468– 472. [3] A. Chouly, A. Brajal, and S. Jourdan, “Orthogonal multicarrier techniques applied to direct sequence spread spectrum CDMA systems,” in Proceeding of IEEE Global Telecommunications Conference, vol. 3, Houston, USA, 1993, pp. 1723–1728. [4] V. Aue and G. P. Fettweis, “Multi-carrier spread spectrum modulation with reduced dynamic range,” in IEEE 46th Vehicular Technology Conference, vol. 2, 1996, pp. 914–917. [5] B. M. Popovic, “Spreading sequences for multicarrier CDMA systems,” IEEE Transactions on Communications, vol. 47, no. 6, pp. 918–926, 1999. [6] B. Natarajan, C. R. Nassar, S. Shattil, M. Michelini, and Z. Wu, “High-performance MC-CDMA via carrier interferometry codes,” IEEE Transactions on Vehicular Technology, vol. 50, no. 6, pp. 1344–1353, 2001. [7] D. Chu, “Polyphase codes with good periodic correlation properties,” IEEE Transactions on Information Theory, vol. 18, no. 4, pp. 531–532, 1972. [8] R. Frank, “Comments on ’polyphase codes with good periodic correlation properties’ by Chu, David C,” IEEE Transactions on Information Theory , vol. 19, no. 2, pp. 244–244, 1973. [9] A. Papoulis, Probability, Random Variables, and Stochastic Processes, 3rd ed., New York: McGraw Hill, 1991. [10] J. G. Proakis, Digital Communications, 4th ed., New York: McGraw Hill, 2001. [11] C.-E. W. Sundberg and N. Seshadri, “Coded modulation for fading channels: An overview,” European Transactionns on Telecommunications, vol. 4, no. 3, pp. 309–323, 1993. [12] D. Divsalar and M. K. Simon, “The design of trellis coded MPSK for fading channels: Performance criteria,” IEEE Transactions on Communications , vol. 36, no. 9, pp. 1004–1012, 1988. [13] N. Yee and J. P. Linnartz, “Wiener filtering of multi-carrier CDMA in Rayleigh fading channel,” in IEEE international symposium on Personal, Indoor and Mobile Radio Communications (PIMRC ’94), vol. 4, 1994, pp. 1344–1347.

6 of 6

FULL-DIVERSITY SPREADING CODES FOR ... -

spreading codes for the multicarrier CDMA (MC-CDMA) systems based on ..... is similar to the design of error correcting codes in fading channels [11], [12].

187KB Sizes 0 Downloads 400 Views

Recommend Documents

FULL-DIVERSITY SPREADING CODES FOR ... -
show that the performance of single-user detectors can also be improved by the ... sis on the performance of ML-MUD for the downlink ..... So performance improvement can also .... application of the maximum-likelihood detection is more.

Orthogonal complex spreading method for multichannel and ...
Sep 2, 2004 - CSEM/Pro Telecom, et al., “FMAiFRAMEs Multiple. Access A Harmonized Concept for UMTS/IMT*2000;. FMA2*Wideband CDMA”, Homepage: ...

Orthogonal complex spreading method for multichannel and ...
Sep 2, 2004 - CSEM/Pro Telecom, et al., “FMAiFRAMEs Multiple. Access A Harmonized ... Sequence WM'nl by a ?rst data Xnl of a mh block and. (51) Int. Cl.

Nba2k17 Codes For Ps3 327 ^ Nba2k17 Codes Without Human ...
NBA 2k17 Locker Codes 2017, Unlimited VC Glitch Free ... Generator Nba2k17 Vc Generator Android Live Free Game Generator Codes online, Free Game ...

Sub-band Spreading Technique for Adaptive ... - IEEE Xplore
Abstract: We propose a sub-band spreading technique for adap- tive modulation (AM) in orthogonal frequency division multiplex- ing (OFDM) systems in order to ...

Almost Tight Bounds for Rumour Spreading with Conductance
May 28, 2010 - If a network has conductance φ and n nodes, then, with high probability, PUSH-PULL ...... Near-perfect load balancing by randomized rounding.

Almost Tight Bounds for Rumour Spreading with ... | Semantic Scholar
May 28, 2010 - The result is almost tight because Ω(log n/φ) is a lower bound2 — in particular, the bound is .... probability that i calls j in any given round. They show ...... new node (that is, to the center of the large star), will be O(φ).

Collaborative spreading for the downlink of overloaded ...
of codewords from a collaborative code, where T is a ..... Comparison of different downlink CDMA schemes using Walsh–Hadamard sequences, N = 64 and G ...

Almost Tight Bounds for Rumour Spreading with ... - Semantic Scholar
May 28, 2010 - Algorithms, Theory. Keywords. Conductance ... is an important example, and their relationship with rumour spreading. In particular we observe ...

Almost Tight Bounds for Rumour Spreading with ...
May 28, 2010 - been shown in different settings [1,6,7,10,18] that O(log n) rounds are sufficient ... In most social networks' graph models the ratio between the maximum and the minimum degree can ...... the part S with the largest cardinality.

Collaborative space-time spreading scheme for higher than unity rate ...
A novel scheme referred to as collaborative space-time spreading is proposed to provide a higher than unity rate with spatial diversity gain for the downlink of a CDMA system operating in a fading channel. This is achieved by performing collaborative

Almost Tight Bounds for Rumour Spreading with Conductance
May 28, 2010 - which the protocol is slow (see [3] for more details), while the problem .... the point of view of this paper the existence of non uniform problem is ...

Almost Tight Bounds for Rumour Spreading with Conductance
May 28, 2010 - G.3 [Mathematics of Computing]: Probability and Statistics. ... as synonyms throughout the paper), refers to the following distributed algorithm.

Spreading of a granular droplet
fitted curve and the experimental data shows a deviation to a parabola of ... 4, solid line), we recover a non monotonic curve ... [7] M.Y. Louge, Phys. Fluids 13 ...

On Rumour Spreading with Skepticism and Denial
Shanghai Jiao Tong University, China. Email: [email protected]. Abstract. This report studies the rumour spreading process with denial and skepticism.

Spreading 1 to 5.pdf
including by vendors of blocking software and by politicians who often. paraphrase it to say ... statistic, lawmakers still bring it out every year in a push for more online ... instance of unwanted sex talk (including from other teenagers), or. sex

Rumour spreading and graph conductance
Oct 12, 2009 - (we will come to this later) by both endpoints. Again, slightly simplifying a more complex picture for the sake of clarity, the main flow of the proof ...

Chapter Codes for VH.pdf
Wine Country Riders WCR. Yakima Valley YVC. Jr. BCH JrBCH. Revised March 2014. Page 1 of 1. Chapter Codes for VH.pdf. Chapter Codes for VH.pdf. Open.

Symmetric Dialog Codes for Confidential ...
Department of Computer Science and Engineering. Ohio State University. Columbus, OH, 43210. Email: [email protected]. Lifeng Sang. Core Security.

Purchasing Commodity Codes - Updated Listing for Administrative ...
Retrying... Purchasing Commodity Codes - Updated Listing for Administrative Staff Use.pdf. Purchasing Commodity Codes - Updated Listing for Administrative Staff Use.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying Purchasing Commodity Co

Optimal codes for human beings
Oct 3, 2006 - forming that word, and the computer deduces the word. ... the next button iterate over all words whose code starts with the sequence of digits we have just .... easier for him to select a word from the list by pressing next than to deci

Symmetric Dialog Codes for Confidential ...
Email: [email protected]. Lifeng Sang ... ficient randomized coding scheme that uses cooperative jamming ... Design coding functions f and φ such that:.

Beechland spreading gospel through reaching internationals.pdf ...
“Most churches aren't really singing that loud. But the ... Baptist Convention short-term missions ... Love explained that, although, Brazilians can learn Spanish fast because ... Beechland spreading gospel through reaching internationals.pdf.