An Analytical Expression of the Probability of Error for Relaying with Decode-and-forward
|
|
- Loren Martin
- 5 years ago
- Views:
Transcription
1 An Analytical Expression of the Probability of Error for Relaying with Decoe-an-forwar Alexanre Graell i Amat an Ingmar Lan Department of Electronics, Institut TELECOM-TELECOM Bretagne, Brest, France alexanre.graell@telecom-bretagne.eu Institute for Telecommunications Research, University of South Australia, Aelaie, Australia ingmar.lan@unisa.eu.au Abstract For a three-noe relay network that employs binary linear coes an the ecoe-an-forwar strategy, we erive analytic upper an lower bouns for the probability of error at the estination. The bouns are base on union-boun techniques an the input-output weight enumerator of the encoer. As an application, we use this boun to optimise the ecoer at the estination. Our approach is verifie by simulation results. I. INTRODUCTION In a three-noe relay network, a source communicates to a estination over a wireless channel, assiste by a cooperating relay (see Fig. 1). Such relay channels were introuce by van er Meulen [1], an their capacities were stuie in etail by Cover an El Gamal []. Among the various cooperation schemes propose an investigate [3, 4], ecoe-an-forwar is one of the most practical. In this scheme, the relay ecoes the ata transmitte by the source, an forwars the estimate to the estination. The error rate of ecoe-an-forwar in uncoe systems has been analize in [5, 6]. For this analysis an also for the ecoing algorithms at the estination, the source-to-relay-toestination channel may be moelle as an equivalent onehop link with an equivalent signal-to-noise ratio (SNR) [7, 8]. The value of this equivalent SNR has been investigate in [7, 9]. The ecoing threshols of coe systems with iterative ecoing at the estination has been analyse with EXIT charts [8, 10]. Publishe results for coe systems have some major shortcomings. First, ecoing errors at the relay introuce memory in the virtual source-to-relay-to-estination channel (in contrast to the often applie assumption); there are no analytical methos available to analyse how this affects the probability of error at the estination. Secon, error floors with respect to the source-to-estination SNR have been observe [11], but no theoretical explanations are available. An thir, current methos to etermine the equivalent SNR for coe systems o not consier that the source-to-relay-to-estination channel has memory. In the present paper we evelop novel analytical bouns for the probability of error, taking into account ecoing errors at the relay. The upper boun is base on a union boun approach This work has been supporte in parts by the Australian Research Council uner the ARC Discovery Grant DP an by NEWCOM++. s γ sr x s ch s-r y sr γ s ch s- r x r ch r- y s y r Fig. 1. Relay network consisting of source s, relay r an estination, an the three channels (ch) in between. an the lower boun on the ominant term, both uner the mil an reasonable assumption that the SNR of the sourceto-relay is not too low. As an example application of these bouns, we optimise the equivalent SNR such that the error rate is minimise. The outline of the paper is as follows. In Section III we efine the system moel, the relaying strategy, an the ecoing strategy at the estination. Section IV eals with the boun on the probability of error. Section V escribes the optimization of the relay-to-estination SNR assume by the estination. Numerical results are presente in Section VI. Conclusions an an outlook to future work are provie in Section VII II. NOTATION Throughout the paper, we write vectors in bolface letters, an the i-th element of a vector a as a i. The Hamming weight of a vector a is enote by w(a), an the Hamming istance between two vectors a an b is enote by (a, b); for convenience we may simply speak of weight an istance. The support of a vector a is enote by S(a) = {i : a i 0}, an its complement by S c (a) = {i : a i = 0}. Notice that S(a) = w(a). The BPSK moulate symbol of a bit x i {0, 1} is written as x i { 1, +1}, an we use the BPSK mapping 0 +1 an 1 1. The signal-to-noise ratio of an AWGN channel is enote by γ = E s /N 0, where E s is the receive signal energy an N 0 is the single-sie noise power ensity. We use the complementary error function erfc(z) = / π e s s. z
2 III. SYSTEM MODEL We consier the wireless relay channel epicte in Fig. 1: source s communicates with estination with the help of relay r, which uses the ecoe-an-forwar strategy. The source-to-estination channel, the source-to-relay channel an the relay-to-estination channel are moelle as binary input AWGN channels with signal-to-noise ratio (SNR) γ s, γ sr an, respectively, an BPSK moulation. The source employs a binary linear coe C {0, 1} N of length N an rate R; an an encoer E mapping user ata u {0, 1} K to coewors x s C. The user ata is assume to be uniformly istribute, an thus also the coewors. A coewor x s C is transmitte over a wireless channel. Due to the broacast nature of the wireless channel both the estination an the relay receive a noisy observation of x s, enote by y s an y sr, respectively. The relay ecoes y sr an generates the estimate x r C of the transmitte coewor x s. It then cooperates with the source by forwaring x r to the estination. We assume that the source an the relay transmit through orthogonal channels. Note that the relay may not be able to ecoe y sr correctly, an therefore x r an x s may iffer. Base on the two noisy observations y s an y r, the estination estimates the coewor x s that was transmitte by the source; this estimate is enote by ˆx s. A true maximum-likelihoo (ML) estimation woul take into account that the relay may make erroneous ecisions an the corresponing statistics. Inee, the relay introuces errors with memory an thus this shoul be consiere by the estination. As this is by far too complex for practical implementations, we use the following ecoer (cf. [8, 9, 11]). The source-to-estination SNR γ s is assume to be known by the estination (Assumption 1). The observation y r is assume to be the output of a (virtual) memoryless AWGN channel with input x s an SNR (Assumption ). Assumption 1 an are commonly use, though not explicitly state [7 9]. Base on this moel, the estination computes the L- values L s,i = 4γ s y s,i, L r,i = 4γ ry r,i, (1) i = 1,,...,N, where y i enotes the i-th element of vector y. For the analysis in Section IV, we will nee the conitional istributions of these L-values. Given x s,i = ±1, where x s,i {±1} enotes the BPSK moulate symbol of the bit x s,i {0, 1} (see above), L s,i has mean ±4γ s an variance 8γ s. Similarly, given x r,i = ±1, L r,i has mean ±4 an variance 8 /. Using above L-values, the ecoing rule is N ˆx s = argmax x i (L s,i + L r,i ), () x C i=1 Note that this ecoing rule is optimal if Assumption 1 an Assumption hol. While Assumption 1 is reasonable, Assumption cannot be true as ecoe-an-forwar introuces errors with memory. If the estination has some knowlege of the source-to-relay channel, it can exploit this information by properly weighing the relaye information by γ r. In general, the optimum value of for above ecoer is a function of all three SNRs γ sr,, an γ s. In the remainer of this paper, we analyse the probability of error at the ecoer an the effect of the value of. IV. A BOUND ON THE ERROR PROBABILITY The error events at the relay an at the estination are efine by e r := {x r x s }, e := {ˆx s x s }, (3) respectively. The complement of e r is enote by ē r. We also efine the bit error event at the estination by e b := {ˆx s,i x s,i for any i}. (4) For the analysis we assume without loss of generality that the all-zero coewor was transmitte, i.e. x s = 0. The error event e can then equivalently be written as { } e (L s,i +L r,i ) < 0 for any x C, x 0, (5) i S(x) where S(x) enotes the support of x (see above). Let A w, be the input-output weight enumerator (IOWE) of encoer E, giving the number of coewors of weight generate by input weight w; let further A = K i=1 A w, be the weight enumerator (WE) of encoer E, giving the number of coewors of weight. Also, enote by min the minimum istance of coe C. A. A boun on the frame error probability The probability of error at the estination can be written as p(e) = p(e e r )p(e r ) + p(e ē r )p(ē r ), (6) where we istinguish between the two cases where the relay makes an error an where it oes not. Using the union boun, the probability of error at the relay can be upper boune by p(e r ) 1 N ( ) A erfc γsr. (7) = min The probability of no error at the relay is upper-boune by p(ē r ) 1. We will now analyse the two conitional probabilities of error in (6). Consier first the case that no error occurs at the relay, i.e. the term p(e ē r ). The relay network of Fig. 1 is then equivalent to a system where x s is transmitte over two inepenent parallel channels with SNR γ s an. Let b be a nonzero coewor of C with support S(b) (as efine above). Splitting up the error event in (5) an taking the union boun, we obtain the upper boun p(e ē r ) = p(e x s = 0,x r = 0) p (L s,i + L r,i ) < 0 x s = 0,x r = 0 b C i S(b) = 1 N A erfc (γ s + γ r. (8) = min γ s + γ r
3 The last line is obtaine by the following consierations: Given x s = 0 an x r = 0, L s,i an L r,i have positive mean values. Therefore, i S(b) (L s,i+l r,i ) is Gaussian with mean 4(γ s + ) an variance 8(γ s + /) (see Section III); notice that = S(b). Consier now the case that an error occurs at the relay, i.e. the term p(e e r ). This probability can be written as p(e e r ) = p(e e r,x s = 0) = = p(e x s = 0,x r = a)p(x r = a e r,x s = 0) (9) a C a =0 (Notice that p(x r = 0 e r,x s = 0) = 0 an thus a = 0 may as well be inclue in the summation.) The computation of (9) is cumbersome. To simplify the computation, we make the following assumption: whenever the relay makes an error, it ecoes to a coewor that has minimum istance to the transmitte coewor (Assumption 3). Notice that this assumption is justifie if γ sr is high, which is require for the ecoe-an-forwar scheme to be useful. Define C min = {x C : w(x) = min } the set of minimum weight coewors. Then, assuming x s = 0 as before, we have x r = 0 (if the relay ecoes correctly) or x r C min (if the relay makes an error). Corresponingly, (9) can be re-written as p(e e r,x s = 0) = = p(e x s = 0,x r = a)p(x r = a e r,x s = 0) = p(e x s = 0,x r = a), (10) for any a C min. Here we use that p(e x s = 0,x r = a) takes the same value for all a C min, as the coe is linear; an that p(x r = a e r,x s = 0) = 1 by Assumption 3. Similar to the case of no error at the relay, we split up the error event in (5) an take the union boun: p(e x s = 0,x r = a) p (L s,i + L r,i ) < 0 x s = 0,x r = a, (11) b C i S(b) }{{} p (ˆx s = b x s = 0,x r = a) for any a C min. Each term in the sum enotes a pairwise error probability p ( ), namely the probability that the estination ecies for b instea of 0 if x s = 0 an x r = a were transmitte. We will now write these probabilities using the complementary error function by etermining the mean an the variance of the sum of the L-values, similar to the (8). Since x s = 0, all values L s,i have positive mean. Since x r = a, the values L r,i have positive mean for i S(b) S c (a), an they have negative mean for i S(b) S(a); S c (a) enotes the complement set of S(a). Using the mean values of these L-values (see Section III) an the number of terms in each set, the mean value of the overall sum can be written as S(b) 4γ s + S(b) S c (a) 4γ r S(b) S(a) 4γ r = S(b) 4(γ s + γ r ) S(b) S(a) 4γ r = 4(γ s + γ r) 8w(a b)γ r, (1) where a b enotes the element-wise prouct of the two vectors; notice that S(b) S(a) = w(a b). The variance of the overall sum is 8(γ s +γ r /), as in the case where the relay ecoes error free. Using this mean an variance, the pairwise error probability can be written as p (ˆx s = b x s = 0,x r = a) = = 1 erfc (γ s + γ r ) w(a b)γ r (γ. (13) s + γ r For a = 0, we obtain the terms of the sum in (8). For w(a b) = 0, the argument in (13) is maximum, an thus the error probability is minimum. On the other han, with increasing w(a b) (increasing overlap of a an b), the argument ecreases an thus the error probability increases. The overlap between a an b is maximum when b = a. In this case we have that w(a b) = min. If b ( a, however, ) the maximum value of w(a b) is given by min min, ; we call this value w m (b). Corresponingly, the pairwise error probability can be upper boune by p (ˆx s = b x s = 0,x r = a) 1 erfc (γ s + ) w m (b)γ r (γ, (14) s + γ r where w m(b) = min if b = a, an w m(b) = w m (b) otherwise. Finally, using (14), (11) an (10) in (9), p(e e r ) can be upper boune by p(e e r ) p (ˆx s = b x s = 0,x r = a) b C b C 1 erfc (γ s + ) w m(b)γ r (γ = s + γ r = 1 erfc min (γ s γ r ) ( min γ s + γ r ) N A erfc (γ s + γ r ) w m(b)γ r = min (γ, (15) s + γ r
4 where A = A 1 for = min, an A = A otherwise; notice that the first term correspons to the case where b = a. This completes the computation of an upper boun on the probability of error in (6). The corresponing lower boun is obtaine by consiering only the terms with minimum istance (with the corresponing multiplicities) in (7), (8) an (15). B. A boun on the bit error probability The bit error probability p(e b ) can be boune in a similar way to the frame error probability. We first write it as p(e b ) = p(e b e r )p(e r ) + p(e b ē r )p(ē r ). (16) We then use the upper boun on p(e r ) as given in (7), p(ē r ) 1, an p(e b ē r ) 1 N erfc (γ s + γ r ) γ s + γ, (17) r A (b) = min with the bit multiplicity A (b) = K w=1 w K A w,. Assuming again that the relay ecoes on a coewor at minimum istance (Assumption 3), we have p(e b e r ) = p(e b e r,x s = 0) = = p(e b x s = 0,x r = a)p(x r = a e r,x s = 0) = 1 A p(e b x s = 0,x r = a). (18) Note that in contrast to the frame error probability, the probability p(e b x s = 0,x r = a) epens on a an not only on its weight w(a), as several input weights may lea to a coewor of minimum weight. However, we can consier the worst case, which is given by the maximum weight of information wors that generate a coewor of minimum weight. We enote the corresponing bit multiplicity by A (b),max min. Then, using the same approach as for the frame error probability, we obtain the upper boun p(e b e r ) = 1 p(e b x s = 0,x r = a) A a C min 1 A(b),max min + 1 N A (b) = min erfc min (γ s γ r ) ( min γ s + γ r ) + erfc (γ s + ) w m(b)γ r (γ, (19) s + γ r where A (b) = A (b) A(b),max min for = min, an A (b) = A (b) otherwise. Note that by using A (b),max min, this upper boun oes not epen on a. V. OPTIMIZATION OF Since a true ML ecoer is far too complex, a common approach in the literature is to moel the source-to-relayto-estination channel as a virtual memoryless channel with SNR γ eq, where γ eq epens on γ sr an [7, 9]. At the estination is then set to γ eq. In general, however, is also a function of γ s. Moreover, ue to ecoing at the relay, the noise on this virtual channel is not linear, not Gaussian, an not memoryless. Therefore the ecoer is suboptimal, an the performance epens on the value chosen for γ r. In this paper, we propose to optimize γ r as a function of the triplet (γ s, γ sr, ). Notice that in the ecoing rule (), the value of γ r is use to trae-off the reliability of the sourceto-estination channel, epening on γ s, to the reliability of the virtual source-to-relay-to-estination channel, epening on γ sr an. We use the lower boun on the error probability, erive above, to perform this optimization. In particular, for each triplet (γ s, γ sr, ), we etermine numerically the value of which minimizes the lower boun on the error probability; we enote this optimum value by γ opt. VI. NUMERICAL RESULTS In this Section, we evaluate the tightness of the boun on the error probability erive in Section IV by comparing the bouns to simulation results. For the examples in this Section, we have chosen a rate-1/ 4-states convolutional encoer with generator polynomials (1, 5/7) in octal form, an we use the information wor length K = 64. We consier two ifferent scenarios. In Scenario 1, the SNRs γ sr an are fixe, an γ s varies. In Scenario, γ sr an vary with γ s as: γ sr = γ s g sr, = γ s g r, (0) where the gains g sr = ( s / sr ) α an g r = ( s / r ) α are ue to shorter istances [1]. The values s, sr an r enote the istances between source an estination, source an relay, an relay an estination, respectively; usually α 6; here we assume α =. In Fig. we plot the bouns on the frame error rate (ashe curves with empty markers) together with the simulation results (soli curves with soli markers) for Scenario 1 as a function of γs b (in B), where γb s = γ s/r enotes the SNR per information bit. We assume the SNRs γsr b = γr b = 5 B. When two ashe curves with the same markers are plotte, the lower curves correspon to the lower boun, while the upper curves correspon to the upper boun. Several values for γ r are consiere. In all cases the bouns match very well with the simulation results. For high γs b the simulation results are on the upper bouns. Due to the use of the union boun, the upper boun iverges for low SNRs. On the other han the lower boun gives also a goo approximation of the performance. Note that for γsr b = 5 B, the probability of error at the relay is p(e r ) , an thus not negligible. Very goo matching is also observe for higher error probabilities at the relay.
5 γ' r=γr γ' r=γeq γ' r=3b γ' r=γeq γ' r=γopt 10 - γ' r=γopt FER BER s/ sr=3/, s/ r= s/ sr=3, s/ r=3/ γ b s Fig.. FER bouns (ashe curves with empty markers) an simulation results (soli curves with soli markers) for the relay network in Fig. 1. Scenario 1 with γsr b = 5 B an γr b = 5 B. The worst performance is obtaine if we set =, as no information about the source-to-relay channel is exploite. Slightly better results are achieve if we moel the source-to-relay-to-estination channel as a virtual memoryless AWGN channel with SNR γ eq. However, performance can significantly be improve if other values for are use. For instance, if we set = 3 B a gain of 1 B is achieve at FER=10 5. The optimization of γ r using the proceure escribe in Section V yiels the best results. A gain of.4 B is achieve at FER=10 5 with respect to the curve with γ r = γ eq. We remark that the optimal value γ opt of γ r ecreases with increasing values of γ s. In Fig. 3 we plot the lower bouns on the bit error rate (ashe curves with empty markers) together with the simulation results (soli curves with soli markers) for Scenario as a function of γs b. Two cases are consiere: in case 1, the relay is closer to the source than to the estination, an therefore we use s / sr = 3 an s / r = 3/; in case, the relay is closer to the estination than to the source, an therefore we use s / sr = 3/ an s / r = 3. For both cases, the curve for γ r = γ eq an the one for = are inistinguishable, therefore only one is plotte. Inee, it turns out that γ eq is very close to. For both cases the bouns are tight. Note that the lower boun is also tight when the probability of error at the relay p(e r ) is high. For instance, for γs b = 0 B an case, we have p(e r) 5 10, an the lower boun preicts still well the actual performance. For case 1, γ opt is almost ientical to γ eq an, thereby no ifference is observe in the plotte curves. On the other han for case the optimization of accoring to the proceure escribe in the previous Section yiels a gain of aroun 0.5 B. For other values of s / sr an s / r, we observe a similar behaviour. VII. CONCLUSIONS AND FUTURE WORK In the present paper we have evelope a new analytical metho to upper an lower boun the error rate of relaying γ b s Fig. 3. BER bouns (ashe curves with empty markers) an simulation results (soli curves with soli markers) for the relay network in Fig. 1. Scenario, case 1 (relay closer to source) an case (relay closer to estination). with ecoe-an-forwar. The bouns are base on unionboun approaches an the weight enumerators of the coe. As an application we have consiere the optimisation of the equivalent SNR of the source-to-relay-to-estination link at the estination. In future work we will exten our bouning approach to schemes with re-encoing at the relay, which leas to istribute turbo-like coes, an to scenarios with multiple users an network coing at the relay. REFERENCES [1] E. C. van er Meulen, Three-terminal communication channels, Av. Appl. Prob., vol. 3, pp , [] T. Cover an A. El Gamal, Capacity theorems for the relay channel, IEEE Trans. Inform. Theory, vol. 5, no. 5, pp , [3] J. N. Laneman, D. N. C. Tse, an G. W. Wornell, Cooperative iversity in wireless networks: Efficient protocols an outage behavior, IEEE Trans. Inform. Theory, vol. 50, pp , Dec [4] G. Kramer, I. Marić, an R. D. Yates, Cooperative communications, FNT in Networking, vol. 1, no. 3-4, pp , 006. [5] A. Ribeiro, X. Cai, an G. Giannakis, Symbol error probabilities for general cooperative links, IEEE Trans. Wireless Commun., vol. 4, no. 3, pp , 005. [6] P. Anghel an M. Kaveh, Exact symbol error probability of a cooperative network in a rayleigh-faing environment, IEEE Trans. Wireless Commun., vol. 3, no. 5, pp , 004. [7] T. Wang, A. Cano, G. Giannakis, an J. Laneman, High-performance cooperative emoulation with ecoe-an-forwar relays, IEEE Trans. Commun., Jan [8] S. Yang an R. Koetter, Network coing over a noisy relay : a belief propagation approach, in Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp , 007. [9] H. Sneessens an L. Vanenorpe, Soft ecoe an forwar improves cooperative communications, Proc. IEEE Int. Workshop on Comput. Avances in Multi-Sensor Aaptive Processing, Jan [10] C. Hausl, F. Schreckenbach, an I. Oikonomiis, Iterative network an channel ecoing on a tanner graph, Proc. 44th Annual Allerton Conf. on Commun., Control, an Computing, Jan [11] G. Zeitler, R. Koetter, G. Bauch, an J. Wimer, Design of network coing functions in multihop relay networks, Proc. Int. Symp. on Turbo Coes an Rel. Topics (ISTC), 008. [1] M. D. Yacoub, Founations of Mobile Raio Engineering. CRC Press, 1993.
Time-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationSpace-time Linear Dispersion Using Coordinate Interleaving
Space-time Linear Dispersion Using Coorinate Interleaving Jinsong Wu an Steven D Blostein Department of Electrical an Computer Engineering Queen s University, Kingston, Ontario, Canaa, K7L3N6 Email: wujs@ieeeorg
More informationMulti-edge Optimization of Low-Density Parity-Check Codes for Joint Source-Channel Coding
Multi-ege Optimization of Low-Density Parity-Check Coes for Joint Source-Channel Coing H. V. Beltrão Neto an W. Henkel Jacobs University Bremen Campus Ring 1 D-28759 Bremen, Germany Email: {h.beltrao,
More informationError Floors in LDPC Codes: Fast Simulation, Bounds and Hardware Emulation
Error Floors in LDPC Coes: Fast Simulation, Bouns an Harware Emulation Pamela Lee, Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Borivoje Nikolic, an Martin J. Wainwright EECS Department University of
More informationLeaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes
Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,
More informationThroughput Optimal Control of Cooperative Relay Networks
hroughput Optimal Control of Cooperative Relay Networks Emun Yeh Dept. of Electrical Engineering Yale University New Haven, C 06520, USA E-mail: emun.yeh@yale.eu Ranall Berry Dept. of Electrical an Computer
More informationCapacity Analysis of MIMO Systems with Unknown Channel State Information
Capacity Analysis of MIMO Systems with Unknown Channel State Information Jun Zheng an Bhaskar D. Rao Dept. of Electrical an Computer Engineering University of California at San Diego e-mail: juzheng@ucs.eu,
More information7.5 Performance of Convolutional Codes General Comments
7.5 Performance of Convolutional Coes 7.5-1 7.5.1 General Comments Convolutional coes expan the banwith for a fixe information rate, or lower the information rate for a fixe banwith. We hope for some error
More informationStopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Codes
Stopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Coes Kaiann Fu an Achilleas Anastasopoulos Electrical Engineering an Computer Science Dept. University of Michigan, Ann Arbor, MI
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationCapacity-approaching codes
Chapter 3 Capacity-approaching coes We have previously iscusse coes on graphs an the sum-prouct ecoing algorithm in general terms. In this chapter we will give a brief overview of some particular classes
More informationSYNCHRONOUS SEQUENTIAL CIRCUITS
CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents
More informationCapacity-approaching codes
Chapter 3 Capacity-approaching coes We have previously iscusse coes on graphs an the sum-prouct ecoing algorithm in general terms. In this chapter we will give a brief overview of some particular classes
More informationMultilevel Coding for the Full-Duplex Decode-Compress-Forward Relay Channel
entropy Article Multilevel Coing for the Full-Duplex Decoe-Compress-Forwar Relay Channel Ahme Attia Abotabl an Aria Nosratinia Department of Electrical & Computer Engineering, The University of Texas at
More informationERROR-detecting codes and error-correcting codes work
1 Convolutional-Coe-Specific CRC Coe Design Chung-Yu Lou, Stuent Member, IEEE, Babak Daneshra, Member, IEEE, an Richar D. Wesel, Senior Member, IEEE arxiv:1506.02990v1 [cs.it] 9 Jun 2015 Abstract Cyclic
More informationThe total derivative. Chapter Lagrangian and Eulerian approaches
Chapter 5 The total erivative 51 Lagrangian an Eulerian approaches The representation of a flui through scalar or vector fiels means that each physical quantity uner consieration is escribe as a function
More informationQubit channels that achieve capacity with two states
Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March
More informationRelative Entropy and Score Function: New Information Estimation Relationships through Arbitrary Additive Perturbation
Relative Entropy an Score Function: New Information Estimation Relationships through Arbitrary Aitive Perturbation Dongning Guo Department of Electrical Engineering & Computer Science Northwestern University
More informationClosed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device
Close an Open Loop Optimal Control of Buffer an Energy of a Wireless Device V. S. Borkar School of Technology an Computer Science TIFR, umbai, Inia. borkar@tifr.res.in A. A. Kherani B. J. Prabhu INRIA
More informationBalancing Expected and Worst-Case Utility in Contracting Models with Asymmetric Information and Pooling
Balancing Expecte an Worst-Case Utility in Contracting Moels with Asymmetric Information an Pooling R.B.O. erkkamp & W. van en Heuvel & A.P.M. Wagelmans Econometric Institute Report EI2018-01 9th January
More informationCan Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes?
Can Puncture Rate-1/2 Turbo Coes Achieve a Loer Error Floor than their Rate-1/3 Parent Coes? Ioannis Chatzigeorgiou, Miguel R. D. Rorigues, Ian J. Wassell Digital Technology Group, Computer Laboratory
More informationAnalytic Scaling Formulas for Crossed Laser Acceleration in Vacuum
October 6, 4 ARDB Note Analytic Scaling Formulas for Crosse Laser Acceleration in Vacuum Robert J. Noble Stanfor Linear Accelerator Center, Stanfor University 575 San Hill Roa, Menlo Park, California 945
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More informationOn the Relationship Between Mutual Information and Bit Error Probability for Some Linear Dispersion Codes
9 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO., JANUARY 29 On the Relationship Between Mutual Information an Bit Error Probability for Some Linear Dispersion Coes Xianglan Jin, Jae-Dong Yang,
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationA New Minimum Description Length
A New Minimum Description Length Soosan Beheshti, Munther A. Dahleh Laboratory for Information an Decision Systems Massachusetts Institute of Technology soosan@mit.eu,ahleh@lis.mit.eu Abstract The minimum
More informationFading Correlations for Wireless Coo Communications: Diversity and Coding. Qian, Shen; He, Jiguang; Juntti, Mar Author(s) Matsumoto, Tad
JAIST Reposi https://space.j Title Faing Correlations for Wireless Coo Communications: Diversity Coing Qian, Shen; He, Jiguang; Juntti, Mar Authors Matsumoto, Ta Citation IEEE Access, 5: 800-806 Issue
More informationA Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying
A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying Ahmad Abu Al Haija, and Mai Vu, Department of Electrical and Computer Engineering McGill University Montreal, QC H3A A7 Emails: ahmadabualhaija@mailmcgillca,
More informationFading Correlations for Wireless Cooperative Communications: Diversity and Coding Gains
This article has been accepte for publication in a future issue of this journal, but has not been fully eite. Content may change prior to final publication. Citation information: DOI 0.09/ACCESS.207.2699785,
More informationTEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE
TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS Yannick DEVILLE Université Paul Sabatier Laboratoire Acoustique, Métrologie, Instrumentation Bât. 3RB2, 8 Route e Narbonne,
More informationOn Characterizing the Delay-Performance of Wireless Scheduling Algorithms
On Characterizing the Delay-Performance of Wireless Scheuling Algorithms Xiaojun Lin Center for Wireless Systems an Applications School of Electrical an Computer Engineering, Purue University West Lafayette,
More informationLinear and quadratic approximation
Linear an quaratic approximation November 11, 2013 Definition: Suppose f is a function that is ifferentiable on an interval I containing the point a. The linear approximation to f at a is the linear function
More informationOptimization of Geometries by Energy Minimization
Optimization of Geometries by Energy Minimization by Tracy P. Hamilton Department of Chemistry University of Alabama at Birmingham Birmingham, AL 3594-140 hamilton@uab.eu Copyright Tracy P. Hamilton, 1997.
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationthere is no special reason why the value of y should be fixed at y = 0.3. Any y such that
25. More on bivariate functions: partial erivatives integrals Although we sai that the graph of photosynthesis versus temperature in Lecture 16 is like a hill, in the real worl hills are three-imensional
More informationOn the Broadcast Capacity of Multihop Wireless Networks: Interplay of Power, Density and Interference
On the Broacast Capacity of Multihop Wireless Networks: Interplay of Power, Density an Interference Alireza Keshavarz-Haa Ruolf Riei Department of Electrical an Computer Engineering an Department of Statistics
More informationTechnion - Computer Science Department - M.Sc. Thesis MSC Constrained Codes for Two-Dimensional Channels.
Technion - Computer Science Department - M.Sc. Thesis MSC-2006- - 2006 Constraine Coes for Two-Dimensional Channels Keren Censor Technion - Computer Science Department - M.Sc. Thesis MSC-2006- - 2006 Technion
More informationARITHMETIC coding (AC) [1] is an effective method for
IEEE TRANSACTIONS ON COMMUNICATIONS SUBMISSION) 1 Hamming Distance Spectrum of DAC Coes for Equiprobable Binary Sources Yong Fang, Member, IEEE, Vlaimir Stankovic, Senior Member, IEEE, Samuel Cheng, Member,
More informationOptimal Cooperative Spectrum Sensing in Cognitive Sensor Networks
Optimal Cooperative Spectrum Sensing in Cognitive Sensor Networks Hai Ngoc Pham, an Zhang, Paal E. Engelsta,,3, Tor Skeie,, Frank Eliassen, Department of Informatics, University of Oslo, Norway Simula
More informationAsymptotic Comparison of ML and MAP Detectors for Multidimensional Constellations
PREPRINT, MARCH 4, 08. Asymptotic Comparison of ML an MAP Detectors for Multiimensional Constellations Alex Alvarao, Senior Member, IEEE, Erik Agrell, Senior Member, IEEE, an Frerik Brännström, Member,
More informationNew Bounds for Distributed Storage Systems with Secure Repair
New Bouns for Distribute Storage Systems with Secure Repair Ravi Tanon 1 an Soheil Mohajer 1 Discovery Analytics Center & Department of Computer Science, Virginia Tech, Blacksburg, VA Department of Electrical
More informationLyapunov Functions. V. J. Venkataramanan and Xiaojun Lin. Center for Wireless Systems and Applications. School of Electrical and Computer Engineering,
On the Queue-Overflow Probability of Wireless Systems : A New Approach Combining Large Deviations with Lyapunov Functions V. J. Venkataramanan an Xiaojun Lin Center for Wireless Systems an Applications
More informationDelay Limited Capacity of Ad hoc Networks: Asymptotically Optimal Transmission and Relaying Strategy
Delay Limite Capacity of A hoc Networks: Asymptotically Optimal Transmission an Relaying Strategy Eugene Perevalov Lehigh University Bethlehem, PA 85 Email: eup2@lehigh.eu Rick Blum Lehigh University Bethlehem,
More informationTopic 7: Convergence of Random Variables
Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information
More informationAsymptotic Distortion Performance of Source-Channel Diversity Schemes over Relay Channels
Asymptotic istortion Performance of Source-Channel iversity Schemes over Relay Channels Karim G. Seddik 1, Andres Kwasinski 2, and K. J. Ray Liu 1 1 epartment of Electrical and Computer Engineering, 2
More informationDecoding Delay and Outage Performance Analysis of Full-Duplex Decode-Forward Relaying: Backward or Sliding Window Decoding
Decoing Delay an Outage Performance Analysis of Full-Duplex Decoe-Forwar Relaying: Backwar or Sliing Winow Decoing Ahma Abu Al Haija Member IEEE an Chintha Tellambura Fellow IEEE Abstract High reliability
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationEquilibrium in Queues Under Unknown Service Times and Service Value
University of Pennsylvania ScholarlyCommons Finance Papers Wharton Faculty Research 1-2014 Equilibrium in Queues Uner Unknown Service Times an Service Value Laurens Debo Senthil K. Veeraraghavan University
More informationAsymptotic Comparison of ML and MAP Detectors for Multidimensional Constellations
This article has been accepte for publication in a future issue of this journal, but has not been fully eite. Content may change prior to final publication. Citation information: DOI 0.09/TIT.07.775, IEEE
More information05 The Continuum Limit and the Wave Equation
Utah State University DigitalCommons@USU Founations of Wave Phenomena Physics, Department of 1-1-2004 05 The Continuum Limit an the Wave Equation Charles G. Torre Department of Physics, Utah State University,
More informationChapter 4. Electrostatics of Macroscopic Media
Chapter 4. Electrostatics of Macroscopic Meia 4.1 Multipole Expansion Approximate potentials at large istances 3 x' x' (x') x x' x x Fig 4.1 We consier the potential in the far-fiel region (see Fig. 4.1
More informationThermal conductivity of graded composites: Numerical simulations and an effective medium approximation
JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University
More informationNode Density and Delay in Large-Scale Wireless Networks with Unreliable Links
Noe Density an Delay in Large-Scale Wireless Networks with Unreliable Links Shizhen Zhao, Xinbing Wang Department of Electronic Engineering Shanghai Jiao Tong University, China Email: {shizhenzhao,xwang}@sjtu.eu.cn
More informationSwitching Time Optimization in Discretized Hybrid Dynamical Systems
Switching Time Optimization in Discretize Hybri Dynamical Systems Kathrin Flaßkamp, To Murphey, an Sina Ober-Blöbaum Abstract Switching time optimization (STO) arises in systems that have a finite set
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationLecture 2: Correlated Topic Model
Probabilistic Moels for Unsupervise Learning Spring 203 Lecture 2: Correlate Topic Moel Inference for Correlate Topic Moel Yuan Yuan First of all, let us make some claims about the parameters an variables
More informationNon-Coherent Capacity and Reliability of Sparse Multipath Channels in the Wideband Regime
Non-Coherent Capacity an Reliability of Sparse Multipath Channels in the Wieban Regime Gautham Hariharan an Abar M Sayee Department of Electrical an Computer Engineering University of Wisconsin-Maison
More informationImplicit Differentiation
Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,
More informationAnalysis on a Localized Pruning Method for Connected Dominating Sets
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 23, 1073-1086 (2007) Analysis on a Localize Pruning Metho for Connecte Dominating Sets JOHN SUM 1, JIE WU 2 AND KEVIN HO 3 1 Department of Information Management
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationBER Performance Analysis of Cooperative DaF Relay Networks and a New Optimal DaF Strategy
144 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 1, NO. 4, APRIL 11 BER Performance Analysis of Cooperative DaF Relay Networks and a New Optimal DaF Strategy George A. Ropokis, Athanasios A. Rontogiannis,
More informationEuler equations for multiple integrals
Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................
More informationHyperbolic Moment Equations Using Quadrature-Based Projection Methods
Hyperbolic Moment Equations Using Quarature-Base Projection Methos J. Koellermeier an M. Torrilhon Department of Mathematics, RWTH Aachen University, Aachen, Germany Abstract. Kinetic equations like the
More informationA. Exclusive KL View of the MLE
A. Exclusive KL View of the MLE Lets assume a change-of-variable moel p Z z on the ranom variable Z R m, such as the one use in Dinh et al. 2017: z 0 p 0 z 0 an z = ψz 0, where ψ is an invertible function
More informationAll s Well That Ends Well: Supplementary Proofs
All s Well That Ens Well: Guarantee Resolution of Simultaneous Rigi Boy Impact 1:1 All s Well That Ens Well: Supplementary Proofs This ocument complements the paper All s Well That Ens Well: Guarantee
More informationA Course in Machine Learning
A Course in Machine Learning Hal Daumé III 12 EFFICIENT LEARNING So far, our focus has been on moels of learning an basic algorithms for those moels. We have not place much emphasis on how to learn quickly.
More informationAPPROXIMATE SOLUTION FOR TRANSIENT HEAT TRANSFER IN STATIC TURBULENT HE II. B. Baudouy. CEA/Saclay, DSM/DAPNIA/STCM Gif-sur-Yvette Cedex, France
APPROXIMAE SOLUION FOR RANSIEN HEA RANSFER IN SAIC URBULEN HE II B. Bauouy CEA/Saclay, DSM/DAPNIA/SCM 91191 Gif-sur-Yvette Ceex, France ABSRAC Analytical solution in one imension of the heat iffusion equation
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationTMA 4195 Matematisk modellering Exam Tuesday December 16, :00 13:00 Problems and solution with additional comments
Problem F U L W D g m 3 2 s 2 0 0 0 0 2 kg 0 0 0 0 0 0 Table : Dimension matrix TMA 495 Matematisk moellering Exam Tuesay December 6, 2008 09:00 3:00 Problems an solution with aitional comments The necessary
More informationNonlinear Adaptive Ship Course Tracking Control Based on Backstepping and Nussbaum Gain
Nonlinear Aaptive Ship Course Tracking Control Base on Backstepping an Nussbaum Gain Jialu Du, Chen Guo Abstract A nonlinear aaptive controller combining aaptive Backstepping algorithm with Nussbaum gain
More informationGeneralization of the persistent random walk to dimensions greater than 1
PHYSICAL REVIEW E VOLUME 58, NUMBER 6 DECEMBER 1998 Generalization of the persistent ranom walk to imensions greater than 1 Marián Boguñá, Josep M. Porrà, an Jaume Masoliver Departament e Física Fonamental,
More informationSome vector algebra and the generalized chain rule Ross Bannister Data Assimilation Research Centre, University of Reading, UK Last updated 10/06/10
Some vector algebra an the generalize chain rule Ross Bannister Data Assimilation Research Centre University of Reaing UK Last upate 10/06/10 1. Introuction an notation As we shall see in these notes the
More informationQuantum mechanical approaches to the virial
Quantum mechanical approaches to the virial S.LeBohec Department of Physics an Astronomy, University of Utah, Salt Lae City, UT 84112, USA Date: June 30 th 2015 In this note, we approach the virial from
More informationExperimental Robustness Study of a Second-Order Sliding Mode Controller
Experimental Robustness Stuy of a Secon-Orer Sliing Moe Controller Anré Blom, Bram e Jager Einhoven University of Technology Department of Mechanical Engineering P.O. Box 513, 5600 MB Einhoven, The Netherlans
More informationA PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks
A PAC-Bayesian Approach to Spectrally-Normalize Margin Bouns for Neural Networks Behnam Neyshabur, Srinah Bhojanapalli, Davi McAllester, Nathan Srebro Toyota Technological Institute at Chicago {bneyshabur,
More informationBandwidth expansion in joint source- channel coding and twisted modulation
Banwith expansion in joint source- channel coing an twiste moulation Pål Aners Floor Tor A Ramsta Outline. Introuction to nonlinear mappings. Banwith expansion an Twiste moulation. Some history. Optimum
More informationAn Approach for Design of Multi-element USBL Systems
An Approach for Design of Multi-element USBL Systems MIKHAIL ARKHIPOV Department of Postgrauate Stuies Technological University of the Mixteca Carretera a Acatlima Km. 2.5 Huajuapan e Leon Oaxaca 69000
More informationMASSIVE multiple-input multiple-output (MIMO) has
IEEE SIGNAL PROCESSING LETTERS, VOL. 4, NO. 1, DECEMBER 017 1847 Spectral Efficiency uner Energy Constraint for Mixe-ADC MRC Massive MIMO Hessam Pirzaeh, Stuent Member, IEEE, an A. Lee Swinlehurst, Fellow,
More informationMonte Carlo Methods with Reduced Error
Monte Carlo Methos with Reuce Error As has been shown, the probable error in Monte Carlo algorithms when no information about the smoothness of the function is use is Dξ r N = c N. It is important for
More informationPHYS 414 Problem Set 2: Turtles all the way down
PHYS 414 Problem Set 2: Turtles all the way own This problem set explores the common structure of ynamical theories in statistical physics as you pass from one length an time scale to another. Brownian
More informationImproving Estimation Accuracy in Nonrandomized Response Questioning Methods by Multiple Answers
International Journal of Statistics an Probability; Vol 6, No 5; September 207 ISSN 927-7032 E-ISSN 927-7040 Publishe by Canaian Center of Science an Eucation Improving Estimation Accuracy in Nonranomize
More informationON THE OPTIMALITY SYSTEM FOR A 1 D EULER FLOW PROBLEM
ON THE OPTIMALITY SYSTEM FOR A D EULER FLOW PROBLEM Eugene M. Cliff Matthias Heinkenschloss y Ajit R. Shenoy z Interisciplinary Center for Applie Mathematics Virginia Tech Blacksburg, Virginia 46 Abstract
More informationarxiv:hep-th/ v1 3 Feb 1993
NBI-HE-9-89 PAR LPTHE 9-49 FTUAM 9-44 November 99 Matrix moel calculations beyon the spherical limit arxiv:hep-th/93004v 3 Feb 993 J. Ambjørn The Niels Bohr Institute Blegamsvej 7, DK-00 Copenhagen Ø,
More informationHow to Minimize Maximum Regret in Repeated Decision-Making
How to Minimize Maximum Regret in Repeate Decision-Making Karl H. Schlag July 3 2003 Economics Department, European University Institute, Via ella Piazzuola 43, 033 Florence, Italy, Tel: 0039-0-4689, email:
More informationPerformance of Eigenvalue-based Signal Detectors with Known and Unknown Noise Level
Performance of Eigenvalue-base Signal Detectors with Known an Unknown oise Level Boaz aler Weizmann Institute of Science, Israel boaz.naler@weizmann.ac.il Feerico Penna Politecnico i Torino, Italy feerico.penna@polito.it
More informationEntanglement is not very useful for estimating multiple phases
PHYSICAL REVIEW A 70, 032310 (2004) Entanglement is not very useful for estimating multiple phases Manuel A. Ballester* Department of Mathematics, University of Utrecht, Box 80010, 3508 TA Utrecht, The
More informationensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y
Ph195a lecture notes, 1/3/01 Density operators for spin- 1 ensembles So far in our iscussion of spin- 1 systems, we have restricte our attention to the case of pure states an Hamiltonian evolution. Toay
More informationA Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential
Avances in Applie Mathematics an Mechanics Av. Appl. Math. Mech. Vol. 1 No. 4 pp. 573-580 DOI: 10.4208/aamm.09-m0946 August 2009 A Note on Exact Solutions to Linear Differential Equations by the Matrix
More informationEstimation of the Maximum Domination Value in Multi-Dimensional Data Sets
Proceeings of the 4th East-European Conference on Avances in Databases an Information Systems ADBIS) 200 Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets Eleftherios Tiakas, Apostolos.
More informationEfficiently Decodable Non-Adaptive Threshold Group Testing
Efficiently Decoable Non-Aaptive Threshol Group Testing arxiv:72759v3 [csit] 3 Jan 28 Thach V Bui, Minoru Kuribayashi, Mahi Cheraghchi, an Isao Echizen SOKENDAI The Grauate University for Avance Stuies),
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationTutorial on Maximum Likelyhood Estimation: Parametric Density Estimation
Tutorial on Maximum Likelyhoo Estimation: Parametric Density Estimation Suhir B Kylasa 03/13/2014 1 Motivation Suppose one wishes to etermine just how biase an unfair coin is. Call the probability of tossing
More informationREAL ANALYSIS I HOMEWORK 5
REAL ANALYSIS I HOMEWORK 5 CİHAN BAHRAN The questions are from Stein an Shakarchi s text, Chapter 3. 1. Suppose ϕ is an integrable function on R with R ϕ(x)x = 1. Let K δ(x) = δ ϕ(x/δ), δ > 0. (a) Prove
More informationHybrid Fusion for Biometrics: Combining Score-level and Decision-level Fusion
Hybri Fusion for Biometrics: Combining Score-level an Decision-level Fusion Qian Tao Raymon Velhuis Signals an Systems Group, University of Twente Postbus 217, 7500AE Enschee, the Netherlans {q.tao,r.n.j.velhuis}@ewi.utwente.nl
More informationText S1: Simulation models and detailed method for early warning signal calculation
1 Text S1: Simulation moels an etaile metho for early warning signal calculation Steven J. Lae, Thilo Gross Max Planck Institute for the Physics of Complex Systems, Nöthnitzer Str. 38, 01187 Dresen, Germany
More informationGeneralizing Kronecker Graphs in order to Model Searchable Networks
Generalizing Kronecker Graphs in orer to Moel Searchable Networks Elizabeth Boine, Babak Hassibi, Aam Wierman California Institute of Technology Pasaena, CA 925 Email: {eaboine, hassibi, aamw}@caltecheu
More informationMaximum a Posteriori Decoding of Turbo Codes
Maxiu a Posteriori Decoing of Turbo Coes by Bernar Slar Introuction The process of turbo-coe ecoing starts with the foration of a posteriori probabilities (APPs) for each ata bit, which is followe by choosing
More informationIntroduction to the Vlasov-Poisson system
Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its
More information. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences.
S 63 Lecture 8 2/2/26 Lecturer Lillian Lee Scribes Peter Babinski, Davi Lin Basic Language Moeling Approach I. Special ase of LM-base Approach a. Recap of Formulas an Terms b. Fixing θ? c. About that Multinomial
More information