Finite-State Markov Modeling of Flat Fading Channels
|
|
- Winifred Lillian Hodge
- 6 years ago
- Views:
Transcription
1 International Telecounications Syposiu ITS, Natal, Brazil Finite-State Markov Modeling of Flat Fading Channels Cecilio Pientel, Tiago Falk and Luciano Lisbôa Counications Research Group - CODEC Departent of Electronics and Systes Federal University of Pernabuco P.O. Box Recife - Brazil E.ail: cecilio@npd.ufpe.br Abstract The stochastic properties of the binary channel that describe the successes and the failures of the transission of a odulated signal over a tie correlated flat fading channel is considered for investigation. This analysis is eployed to develop K-th order Markov odels for such a burst channel. The order of the Markov odel that generates accurate analytical odels is estiated for a broad range of fading environents. The paraeterization and the accuracy of an iportant class of hidden Markov odels known as the Gilbert-Elliott channel are also investigated. Fading rates are identified in which the K-th order and the Gilbert-Elliott channel odel approxiate the fading channel with siilar accuracy. The latter odel is useful for approxiating slowly fading processes, since it provides a far ore copact paraeterization. I. INTRODUCTION In a typical obile counication channel the transitted signal undergoes attenuation and distortion caused by ultipath propagation and shadowing. The non-frequency selective (flat) fading channel iposes ultiplicative narrow-band coplex Gaussian noise (referred to as fading process) on the transitted signal. As a consequence, abrupt changes in the ean received signal level ay occur, and the autocorrelation function of the fading process ay lead to the occurrence of a burst of bit errors. The analytical analysis of a counication syste operating over such a correlated fading process is difficult and there are no analytical expressions for several statistics relevant to syste perforance evaluation. Finite state channel (FSC) odels have been widely accepted as an effective approach to characterize the correlation structure of the fading process [1]-[11]. An FSC is described by a deterinistic or probabilistic function of a first-order Markov chain, where each state ay be associated with a particular channel quality. The strategy adopted by any researchers to design FSC odels for fading channels consists in representing each state of a first-order Markov chain by a non-overlapping interval of the received instantaneous signal to noise ratio []-[7]. Criteria to partitioning the signal to noise ratio are discussed in [], [5], [7]. The odulation and deodulation schees are incorporated into the odel through the crossover probability of the binary syetric channel associated to each fading state. An inforation theoretic etric was proposed in [3] to validate the first-order odel. The liitations of this criterion and the applicability of the first-order assuption have been discussed in [7]. Other odel structures have also been proposed to represent the quantized signal to noise ratio, including, higher-order Markov This work received partial support fro the Brazilian National Council for Scientific and Technological Developent (CNPq) under Grant 3987/96-. odels [8], general Hidden Markov odels [11], and Gilbert- Elliott channels [1]. This paper concerns the developent of FSC odels for a discrete counication syste coposed by a odulator, a tie correlated flat fading channel, and a hard quantized deodulator. The FSC odel describes the successes and the failures of the sybol transitted over a fading channel, which is represented atheatically as a binary error sequence. We consider two classes of FSC odels coonly used to characterize fading channels: The Kth-order Markov odel and the Gilbert- Elliott channel () odel. We first describe a ethodology to estiate the paraeters of these odels directly fro the binary error sequence. A ethod recently proposed in [7] to judge odel accuracy is applied to identify the order of the Markov odel that satisfactorily approxiates the channel, for several fading regies. A siilar study evaluates the accuracy of the odel. The results presented here allow us to study coding perforance on correlated fading channels using the analytical techniques developed to analyze burst channels represented as specific FSC odels [1]-[15]. II. THE CHANNEL MODEL We consider a counication syste that eploys M-ary FSK odulation, a tie correlated flat Rician fading channel and non-coherent deodulation. The coplex envelope of the received signal at the input to the deodulator is corrupted by a ultiplicative Rician fading and by an additive white Gaussian noise with zero ean and autocorrelation function 1Ef N(t ~ + fi ) N ~? (t)g = N ffi(fi ). The coplex envelope of the fading process, G(t) ~ = G ~ I (t) + G ~ Q (t), is a coplex, wide-sense stationary, p Gaussian process with real constant ean, where = 1, and the quadrature coponents G ~ I (t) and G ~ Q (t) are utually independent Gaussian process with the sae covariance function, naed C(fi ). Although the analysis carried out here can be applied to a fading process with arbitrary covariance function, we adopted the Clarke s odel [16], [17] for C(fi ): C(fi )= 1 Ef[ ~ G(t + fi ) ][ ~ G? (t) ]g = ff g J (ßf D fi ); where J (x) is the zero-order Bessel function of the first kind, f D is the axiu Doppler frequency, and ff g is the variance of G(t). ~ For a fixed tie instant, the fading envelope A k =
2 International Telecounications Syposiu ITS, Natal, Brazil q ~G I (kt )+ G ~ Q (kt ) (where T is the sybol interval) has the Rician probability density function given by: p a A (a) = e ( +a )=ff ffg g I a ( ); (1) ffg where I (x) is the zero-order odified Bessel function of the first kind. When the in-phase process is zero-ean (K R =), the fading envelope follows the Rayleigh probability density function: p A (a) = a ff g exp a ff g : () At each signaling interval of length T, the deodulator fors the M decision variables and decides which signal was ore likely to have been transitted. We define a binary error process fe k g 1 k=1, where E k = indicates no sybol error at the kth interval, and E k = 1 indicates a sybol error. It can be shown that the probability of an error sequence of length n, e n = e 1 e :::e n, ay be expressed as [9]: P (e n ) = M1 ::: l 1=e 1 expf Es M1 l n=en ψ ny k=1 M1 l k (1) l k+e k l k +1 N K R 1 T F((K R +1)I + C? F) 1 1g det(i + N Es (1 + K R ) 1 C? ; F) (3) where C? is the coplex conjugate of the noralized n n covariance atrix of G(t) ~ (the (i; j)th entry of C? is J (ßf D (i j)t ), F is a diagonal atrix defined as F = diag( l1 l ;::: ; l n 1+1 l n+1 ), E s is the energy of the transitted sybol, K R = =ffg is the Rician factor, 1 is a colun vector of ones, and the superscript [ ] T indicates the transpose of a atrix. We will call this discrete fading odel fro the odulator input to the deodulator output the discrete channel with Clarke s autocorrelation () odel. Hereafter, we consider binary odulation (M =), so the odel has three paraeters K R, f D T, and E s =N. Equation (3) can be used to calculate the probability of any error event relevant to the analysis of the fading odel. For exaple, the probability the error bit is a 1 is:! Equation (3) will be eployed to paraeterize an FSC odel that accurately reflects the statistical description of the real error process. A brief description of FSC odels is given next. Consider fs k g 1 k= an N-state, first-order Markov chain with a finite state space N N = f; 1;::: ;N 1g. Let P be an N N transition probability atrix, whose (i; j) th entry is the transition probability p i;j = P (S k = j j S k1 = i), i; j N N. The FSC odel generates an error sybol according to the following probabilistic echanis. At the k th tie interval, the chain akes a transition fro state S k1 = i to S k = j with probability p i;j and generates an output (error) sybol e k N (independent of i), with probability b j;ek = P (E k = e k j S k = j). Conditioned to the state process, Q the error process is n eoryless, that is, P (e n j s n )= P (e k=1 k j s k ). We are assuing that the distribution of the initial state is the stationary distribution Π =[ß ;ß 1 ;:::;ß N1 ] T. The probability of an error sequence generated by the FSC odel, conditioned to the initial state, is: Hence P (e n j s ) = P (e n ) = = N1 s = s nn n N s nnn n k=1 ß s P (e n j s n ;s ) P (s n j s ) ny b sk ;e k p sk1 ;s k : ny s nnn n k=1 b sk ;e k p sk1 ;s k : (7) Equation (7) can be rewritten in a atrix for. Define two N N atrices, P() and P(1), where P = P() + P(1). The (i; j)th entry of the atrix P(e k ), e k f; 1g, isp (E k = e k ;S k = j j S k1 = i) = b j;ek p i;j, which is the probability that the output sybol is e k when the chain akes a transition fro state i to j. Equation (7) has a atrix for given by: P (e n ) = Π T ψ ny k=1 P(e k )! 1: (8) An FSC odel is copletely specified by the atrices P() and P(1). We define in the next section soe properties of FSC odels and discuss the evaluation of its paraeters. P (1) = 1+K R +K R + Es N e K R N Es +K R + Es and the probability of two consecutive ones (errors) is: P (11) = (1 + K R ) +K R + Es N ρ Es N e N ; () K Es R N +K R +(ρ+1) N Es ; where ρ is the correlation coefficient of two consecutive saples of the fading process ~ G(t): (5) ρ = J (ßf D T ): (6) III. PARAMETERIZATION OF SPECIFIC FSC MODELS We consider two classes of FSC odels: Kth-order Markov odels and the odel. Following the ideas introduced in [9], the paraeters of each FSC odel will be expressed as functions of the probabilities of binary sequences generated by the odel. Then, we apply (3) to estiate these probabilities and to paraeterize FSC odels that approxiates the correlated fading odel. A. Kth-order Markov Models A discrete stochastic process fe n g 1 n=1 is a Markov process of Kth-order if it obeys the relation: P (e n j e 1 e e n1 ) = P (e n j e nk e n1 ): (9)
3 International Telecounications Syposiu ITS, Natal, Brazil A first-order binary Markov odel is an FSC odel with space state f; 1g. An error sybol is produced when the chain transitions to state 1. Otherwise, if the chain transition is to state, a correct sybol is produced. Therefore, b ; = 1 and b 1;1 = 1. Using (7) for error sequences of length 1 and, we get, p i;j = P (ij)=p (i), i; j f; 1g. The stationary vector is Π = [P () P (1)] T, and the atrices P() and P(1) for the first-order Markov odel are: P() = P () P () P (1) P (1) 3 5 ; P(1) = P (1) P () P (11) P (1) 3 5 : In general, the Kth-order Markov odel can be represented as a function of a first-order Markov chain [18]. Each state of the Kth-order odel is represented by a binary string of length K. Given two states u = u 1 u u K and v = v 1 v v K, we say that u and v overlap progressively if u u 3 u K = v 1 v v K1.Ifuand v overlap progressively, then, there is a transition fro u to v with probability P (u 1 v 1 v v k )=P (u). Otherwise, the state transition probability is zero. Given a state v = v 1 v v K, b v;ek = v K. For exaple, the atrices P(), P(1) and Π for the second-order Markov odel are: P() = P(1) = 6 6 P () P () P (1) P (1) P (1) P () P (11) P (1) P (1) P (1) P (11) P (11) P (11) P (1) P (111) P (11) ; Π =[P () P (1) P (1) P (11)] T : Clearly, the nuber of states grows exponentially with the order K. B. Gilbert-Elliott Channel The is a two-state FSC odel coposed of state, which produces errors with sall probability, b ;1 = g, and state 1, where errors occur with higher probability, b 1;1 = b, where g<<b. The transition probabilities of the Markov chain are p ;1 = Q and p1; = q. The atrices P(), P(1), where P() + P(1) = P, for the odel are given by: P() =» (1 Q)(1 g) Q (1 b) q (1 g) (1 q)(1 b) P(1) =» (1 Q) g Qb qg (1 q) b ; ; (1) : (11) We define next the notation required in this subsection. Consider ff any binary sequence of finite length, Q( ff ;i) = P (E n = ff ;S n+1 = i). Let ffi be an epty sequence, i.e, a sequence of length zero that possesses the properties ffiff = ffffiand P (ffi) =1. Let ffl and ffi be binary sybols. If i is a particular state, i? indicates the other state of the Markov chain, that is, if i =, then i? =1. The paraeterization of the Gilbert-Elliott channel is based on the following lea. Lea 1: The probability of any sequence ff generated by the Gilbert-Elliott channel satisfies the following recurrence equation: where P (fffflffi) =c(ffl; ffi)p (ffffl) +d(ffl; ffi)p (ff); (1) c(ffl; ffi) = d(ffl; ffi) = b i;ffl (p i;i Λb iλ ;ffi + p i;i b i;ffi ) b i;ffl b b b i;ffl b Λb i Λ ;ffi + p iλ ;ib i;ffi ); (13) b i;ffl b b i;ffl b Λb i Λ ;ffi + p iλ ;ib i;ffi ) b b i;ffl (p i;i Λb iλ ;ffi + p i;i b i;ffi ): (1) b i;ffl b Proof: The probability of any sequence generated by a odel satisfies the relations: P (ff) =Q(ff;i Λ )+Q(ff;i): (15) P (ffffl) =Q(ff;i Λ )b + Q(ff;i)b i;ffl : (16) Hence, Q(ff;i) and Q(ff;i Λ ) are expressed as: Q(ff;i)= b i Λ ;ffl b i;ffl b b i;ffl P (ff) + 1 P (ffffl); (17) b i;ffl b Q(ff;i Λ )= P (ff) P (ffffl): (18) b i;ffl b b i;ffl b The following equation also holds for the odel: P (fffflffi) = Q(ff;i Λ )b [p iλ ;i Λb i Λ ;ffi + p iλ ;ib i;ffi ] + Q(ff;i)b i;ffl [p i;i Λb iλ ;ffi + p i;i b i;ffi ]: (19) Substituting (17) into (18) and rearranging the ters, yields: P (fffflffi) = f b i;fflb b i;ffl b Λb i Λ ;ffi + p iλ ;ib i;ffi ) + f b b i;ffl (p i;i Λb iλ ;ffi + p i;i b i;ffi )gp (ff) b i;ffl b b i;ffl (p i;i Λb iλ ;ffi + p i;i b i;ffi ) b i;ffl b b b i;ffl b Λb i Λ ;ffi + p iλ ;ib i;ffi )gp (ffffl) = c(ffl; ffi)p (ffffl) + d(ffl; ffi)p (ff): Equation (1) allows us to express c(ffl; ffi) and d(ffl; ffi), and consequently, b, g, q e Q as functions of the probabilities of error 1
4 International Telecounications Syposiu ITS, Natal, Brazil sequences. Substituting ff = ffi and ff = ffl in (1) yields, respectively: P (fflffi) = c(ffl; ffi)p (ffl) +d(ffl; ffi); () P (fflfflffi) = c(ffl; ffi)p (fflffl) +d(ffl; ffi)p (ffl): (1) Solving this linear syste, we obtain: and c(ffl; ffi) = d(ffl; ffi) = P (fflfflffi) P (fflffi)p (ffl) ; () P (fflffl) P (ffl) P (fflffi)p (fflffl) P (fflfflffi)p (ffl) : (3) P (fflffl) P (ffl) easure to judge if a particular odel approxiates better the fading channel when copared to other candidates. The criteria coonly used to ake this decision include the iniization of a distance easure between the probability of error sequences generated by the odel and by the fading channel (e.g. variational, noralized divergence), the inforation theoretic etric[3], and the coparison of certain statistics of the odels, such as, autocorrelation function, and packet error rate [7]. Motivated by the results presented in [7], we copare next the autocorrelation function (ACF) of the fading odel with the ACF of FSC odels. The ACF of a binary stationary process fe k g 1 k=1 is given by: R[] =EfE i E i+ g = P (E i =1;E i+ =1); (33) The following proposition expresses the paraeters of the odel in ters of c(ffl; ffi) and d(ffl; ffi), or consequently, in ters of the probability of error sequences of length, at ost, 3. Proposition 1: If P (1) 6= P () P (1), the paraeters of the Gilbert-Elliott channel are uniquely deterined by the four probabilities P ();P();P();P(111). The paraeters b and g are the roots of the quadratic equation: [1 +c(1; 1) + c(; )]x +[1 c(1; 1) c(; ) + d(1; 1) d(; )]x d(1; 1) = ; () and the paraeters Q and q are given by: c(; )b c(1; 1)(1 b) +(g b) Q = ; g b c(; )g c(1; 1)(1 g) +(b g) q = : b g Proof: Fro (13) and (1), we have: (5) c(; ) = (1 g)(1 Q) +(1 b)(1 q); (6) c(1; 1) = g(1 Q) +b(1 q); (7) d(; ) = (1 q Q)(1 g)(1 b); (8) d(1; 1) = (1 q Q)gb; (9) Fro (6) and (7), and fro (8) and (9), we get, respectively: 1 c(; ) c(1; 1) = μ; (3) d(; ) gb( 1)=1 b g; (31) d(1; 1) where μ =1 q Q. Cobining (9) and (31) results in the quadratic equation: μb +(μ + d(; ) d(1; 1))b + d(1; 1) = ; (3) where the sae equation holds for g. So, substituting (3) into (3) we conclude that b and g are the roots of (). Once we have deterined b and g, we use (6) and (7) to obtain (5). IV. MODEL EVALUATION This section evaluates the accuracy in which the FSC odels described in the previous section approxiate the correlated fading channel. In general, it is difficult to define a unique where Efg denotes the expected value of a rando variable. A closed-for expression for the ACF of the odel is given by (5), where the correlation coefficient ρ given by (6) is replaced by ρ() =J (ßf D T ). Then, it follows fro (5) that for the special case of Rayleigh fading (K R =): R[] = 1 ( + Es N ) ρ() Es N : (3) The ACF of an FSC odel described by the atrices P() and P(1) is expressed as [13]: R[] = Π T P(1)P 1 P(1) 1; (35) for 1. The ACF over twenty values of of the and the FSC odels are copared in Fig. 1. The paraeters of the are K R =, E s =N = 15 db, and f D T =.1 (a), f D T =. (b), f D T =.1 (c). Markov odels of order up to 6 have been considered. It is observed in Fig. 1(a) that there is a significant gain in accuracy when the order of the Markov odel is increased fro K = (eoryless) to K = 1, a little gain is obtained for K =and no further gain is observed for K = 3. Also, the ACF s of the second-order Markov and the odels are very alike. The curves indicate that the first-order Markov odel approxiates satisfactorily the fading channel for f D T =.1. It is worth entioning that we could have chosen either the second-order or the odel to approxiate the odel, since the ACF s of these three odels can barely be distinguished in Fig. 1(a). However, we want to obtain as siple an analytical odel as possible at an acceptable coplexity level. This tradeoff between accuracy and coplexity akes this decision soewhat arbitrary. When the fading rate gets slower the order of the Markov odel increases, as expected. For exaple, we observe (curves not shown) that the second-order Markov is satisfactory for f D T =:5. However, we notice that the ACF of the third-order Markov odel is a bit closer to that of the odel, but this strictness ay not copensate the doubling of the nuber of states. Again, the ACF s of the third-order and the are very siilar. When f D T < :3, the ACF of the odel diverges fro the ACF of the odel. This fact is illustrated in Fig. 1(b), where the curves of the forth and the fifth-order Markov odels approxiate better the ACF of the odel than that of
5 International Telecounications Syposiu ITS, Natal, Brazil R[] R[] R[] TABLE I ORDER OF THE MARKOV MODEL THAT APPROIMATES THE RAYLEIGH FADING CHANNEL FOR SEVERAL VALUES OF f D T. f D T K (E s =N =15dB) K E s =N =5dB) > 6 > K= K= the odel. These values of K can be considered as satisfactory approxiations of the odel for f D T = :. These conclusions hold for greater saple separations. In fact, the ACF s of the Kth-order Markov and the odels atches perfectly over an interval of length K. The curves deonstrate that the ACF criterion is reasonably accurate at indicating the order of the Markov odel that approxiates the fading odel. Markov odels ay not be practical for very slowly fading channels since the nuber of states grows exponentially with K and large data sizes are necessary to paraeterize the odel. Fig. 1(c) illustrates that the odel with non-observable states appears to be useful for approxiating very slowly varying fading, since it provides a far ore copact paraeterization. Fig. displays a siilar coparison for the case E s =N =5dB, f D T =:. It is observed that the ACF of the odel decreases ore rapidly with when copared to Fig. 1 (b), indicating a potential to reduce the order of the Markov approxiation. In order to verify the order K indicated by the ACF ethod using a different perspective, we calculate the variational distance between the n-diensional target easure P (e n ) given by (3) and the easure obtained by the Kth-order Markov odel, naely, P (K) (e n ), which is calculated using (8). The atrices P() and P(1) are described in Section III. The variational distance is defined as: d v (P (e n ) ;P (K) (e n )) = e n jp (e n ) P (K) (en )j: Figure 3 reports the variational distance versus the order K for several values of f D T, for E s =N =15dB (a), E s =N =5dB (b). Note that a lower distance value indicates a ore accurate odel. We say that the order of the Markov chain is K, when the distance converge to approxiately a constant value (roughly zero) for K K. The orders indicated by the convergence of the variational distance, for the range of fading environents investigated, are consistent with those obtained by the ACF ethod. The choice of value K, as entioned before, is soewhat arbitrary and Table I suarizes the order indicated by Fig. 3. We notice that, for slow and ediu rate fading, the increase of the signal to noise ratio fro 15 to 5 db reduces the order of the Markov odel K by 1. V. CONCLUSIONS We have developed FSC odels that characterize the error sequence of a counication syste operating over a fading (a) K= K= K=3 K= K=5 K= (b) K= K= K=3 K= K=5 K= (c) Fig. 1. Coparison of the autocorrelation functions of the fading odel, the Kth-order Markov odel (K = ; 1; ; 6), and the odel. The odel is Rayleigh fading (K R =), with E s=n =15dB, and f D T =.1 (a), f D T =. (b), f D T =.1 (c).
6 R[] International Telecounications Syposiu ITS, Natal, Brazil K= K= K=3 K= Fig.. Coparison of the autocorrelation functions of the fading odel, the Kth-order Markov odel (K = ; 1; ; 6), and the odel. The odel is Rayleigh fading (K R = )with E s=n = 5dB, f D T =.. variational distance variational distance f D T = K (a) f D T = K (b) Fig. 3. Variational distance versus the order K having f D T as a paraeter. Rayleigh fading (K R =), E s=n =15dB (a), E s=n =5dB (b). channel. Markov odels of order up to 6 have been proposed as an approxiation to the odel for a broad range of fading environents. We have used two criteria to estiate the order of the Markov process: The autocorrelation function, and the variational distance. Both criteria lead to a siilar conclusion that the Kth-order Markov odel is a good approxiation to the odel. This analysis reinforces the results in [7] regarding the effectiveness of ACF criterion to estiate the order of Markov odels. It is observed that the first-order approxiation is satisfactory for values of f D T around.1. For fast and ediu fading rates (f D T > :3), the Kth-order (for judiciously selected K) is as accurate as the odel. For slower fading rates (f D T < :) Markov odels of order greater than 6 are required. REFERENCES [1] F. Swarts and H. C. Ferreira, Markov characterization of digital fading obile VHF channels, IEEE Transactions on Vehicular Technology, Vol. 3, pp , Nov [] H. Wang and N. Moayeri, Finite-State Markov channel - A useful odel for radio counication channels, IEEE Transactions on Vehicular Technology, vol., pp , Feb [3] H. Wang and P. Chang, On verifyng the first-order Markovian assuption for a Rayleigh fading channel odel, IEEE Transactions on Vehicular Technology, vol. 5, pp , May [] M. Zorzi, R. Rao, and L. B. Milstein, ARQ error control for fading obile radio channels, IEEE Transactions on Vehicular Technology, vol. 6, pp. 5-55, May [5] Q. Zhang and S. Kassa, Finite-State Markov odel for Rayleigh fading channels, IEEE Transactions on Counications, vol. 7, pp , Nov [6] F. Babich and G. Lobardi, A Markov odel for the obile propagation channel, IEEE Transactions on Vehicular Technology, vol. 9, pp , Jan.. [7] C. Tan and N. C. Beaulieu, On first-order Markov Modeling for the Rayleigh Fading Channel, IEEE Transactions on Counications, vol. 8, pp. 3-, Dec.. [8] F. Babich, O. Kelly, and G. Lobardi Generalized Markov Modeling for Flat Fading, IEEE Transactions on Counications, vol. 8, pp , Apr.. [9] C. Pientel and I. F. Blake, Modeling burst channels using partitioned Fritchan s Markov odels, IEEE Transactions on Vehicular Technology, Vol. 7, No. 3, pp , Aug [1] L. Wilhelsson e L. B. Milstein, On the effect of iperfect interleaving for the Gilbert-Elliott channel, IEEE Transactions on Counications, Vol. 7, pp , May [11] H. Turin and R. van Nobelen, Hidden Markov Modeling of Flat Fading Channels, IEEE Journal on Selected Areas in Counications, vol. 16, pp , Dec [1] M. Zorzi, Soe results on error control for burst-error channels under delay constraints, IEEE Transactions on Vehicular Technology, Vol. 5, pp.1-, Jan. 1. [13] C. Pientel and I. F. Blake, Enueration of Markov chains and burst error statistics for finite state odels, IEEE Transactions on Vehicular Technology, Vol. 8, pp. 15-8, Mar [1] C. Pientel and I. F. Blake, Concatenated coding perforance for FSK odulation on tie-correlated Rician fading channels, IEEE Transactions on Counications, vol. 6, pp , Dec [15] G. Shara, A. Hassan, and A. Dholakia, Perforance evaluation of burst-error correcting codes on a Gilbert-Elliott channel, IEEE Transactions on Counications, vol. 6, pp , Jul [16] R. H. Clarke, A statistical theory of obile-radio reception, Bell Syste Tech. Journal, vol. 7, pp , [17] M. Gans, A power-spectral theory of propagation in the obile radio environent, IEEE Transactions on Vehicular Technology, vol. 1, pp. 7-38, Feb [18] T. W. Anderson and L. A. Goodan, Statistical Inference about Markov Chains, Annals of Matheatical Statistics, vol. 8, pp , Mar
Non-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationPACKET-BASED MARKOV MODELING OF REED-SOLOMON BLOCK CODED CORRELATED FADING CHANNELS
PACKET-BASED MARKOV MODELING OF REED-SOLOMON BLOCK CODED CORRELATED FADING CHANNELS Cecilio Pimentel Department of Electronics and Systems Federal University of Pernambuco Recife, PE, 50711-970, Brazil
More informationImpact of Imperfect Channel State Information on ARQ Schemes over Rayleigh Fading Channels
This full text paper was peer reviewed at the direction of IEEE Counications Society subject atter experts for publication in the IEEE ICC 9 proceedings Ipact of Iperfect Channel State Inforation on ARQ
More informationVulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links
Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Tie-Varying Jaing Links Jun Kurihara KDDI R&D Laboratories, Inc 2 5 Ohara, Fujiino, Saitaa, 356 8502 Japan Eail: kurihara@kddilabsjp
More informationConvolutional Codes. Lecture Notes 8: Trellis Codes. Example: K=3,M=2, rate 1/2 code. Figure 95: Convolutional Encoder
Convolutional Codes Lecture Notes 8: Trellis Codes In this lecture we discuss construction of signals via a trellis. That is, signals are constructed by labeling the branches of an infinite trellis with
More informationThe Transactional Nature of Quantum Information
The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.
More informationGeneralized Markov Modeling for Flat Fading
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 48, NO. 4, APRIL 2000 547 Generalized Markov Modeling for Flat Fading Fulvio Babich, Member, IEEE, Owen E. Kelly, Member, IEEE, and Giancarlo Lombardi, Member,
More informationSPECTRUM sensing is a core concept of cognitive radio
World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationExtension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels
Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
More informationDetection and Estimation Theory
ESE 54 Detection and Estiation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electronic Systes and Signals Research Laboratory Electrical and Systes Engineering Washington University 11 Urbauer
More informationMulti-Scale/Multi-Resolution: Wavelet Transform
Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the
More informationA remark on a success rate model for DPA and CPA
A reark on a success rate odel for DPA and CPA A. Wieers, BSI Version 0.5 andreas.wieers@bsi.bund.de Septeber 5, 2018 Abstract The success rate is the ost coon evaluation etric for easuring the perforance
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationProc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES
Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationStatistical Logic Cell Delay Analysis Using a Current-based Model
Statistical Logic Cell Delay Analysis Using a Current-based Model Hanif Fatei Shahin Nazarian Massoud Pedra Dept. of EE-Systes, University of Southern California, Los Angeles, CA 90089 {fatei, shahin,
More informationData-Driven Imaging in Anisotropic Media
18 th World Conference on Non destructive Testing, 16- April 1, Durban, South Africa Data-Driven Iaging in Anisotropic Media Arno VOLKER 1 and Alan HUNTER 1 TNO Stieltjesweg 1, 6 AD, Delft, The Netherlands
More informationMulti-Dimensional Hegselmann-Krause Dynamics
Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationCS Lecture 13. More Maximum Likelihood
CS 6347 Lecture 13 More Maxiu Likelihood Recap Last tie: Introduction to axiu likelihood estiation MLE for Bayesian networks Optial CPTs correspond to epirical counts Today: MLE for CRFs 2 Maxiu Likelihood
More informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationUpper bound on false alarm rate for landmine detection and classification using syntactic pattern recognition
Upper bound on false alar rate for landine detection and classification using syntactic pattern recognition Ahed O. Nasif, Brian L. Mark, Kenneth J. Hintz, and Nathalia Peixoto Dept. of Electrical and
More informationTEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES
TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,
More informationIN modern society that various systems have become more
Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016 Lessons 7 14 Dec 2016 Outline Artificial Neural networks Notation...2 1. Introduction...3... 3 The Artificial
More informationSupport recovery in compressed sensing: An estimation theoretic approach
Support recovery in copressed sensing: An estiation theoretic approach Ain Karbasi, Ali Horati, Soheil Mohajer, Martin Vetterli School of Coputer and Counication Sciences École Polytechnique Fédérale de
More informationDesign of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding
IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED PAPER) 1 Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding Lai Wei, Student Meber, IEEE, David G. M. Mitchell, Meber, IEEE, Thoas
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationare equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are,
Page of 8 Suppleentary Materials: A ultiple testing procedure for ulti-diensional pairwise coparisons with application to gene expression studies Anjana Grandhi, Wenge Guo, Shyaal D. Peddada S Notations
More informationRESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS
BIT Nuerical Matheatics 43: 459 466, 2003. 2003 Kluwer Acadeic Publishers. Printed in The Netherlands 459 RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS V. SIMONCINI Dipartiento di
More informationMANY papers and books are devoted to modeling fading
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 16, NO. 9, DECEMBER 1998 1809 Hidden Markov Modeling of Flat Fading Channels William Turin, Senior Member, IEEE, Robert van Nobelen Abstract Hidden
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationA Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay
A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer
More informationPower-Controlled Feedback and Training for Two-way MIMO Channels
1 Power-Controlled Feedback and Training for Two-way MIMO Channels Vaneet Aggarwal, and Ashutosh Sabharwal, Senior Meber, IEEE arxiv:0901188v3 [csit] 9 Jan 010 Abstract Most counication systes use soe
More informationAn Adaptive UKF Algorithm for the State and Parameter Estimations of a Mobile Robot
Vol. 34, No. 1 ACTA AUTOMATICA SINICA January, 2008 An Adaptive UKF Algorith for the State and Paraeter Estiations of a Mobile Robot SONG Qi 1, 2 HAN Jian-Da 1 Abstract For iproving the estiation accuracy
More informationThe linear sampling method and the MUSIC algorithm
INSTITUTE OF PHYSICS PUBLISHING INVERSE PROBLEMS Inverse Probles 17 (2001) 591 595 www.iop.org/journals/ip PII: S0266-5611(01)16989-3 The linear sapling ethod and the MUSIC algorith Margaret Cheney Departent
More informationUsing EM To Estimate A Probablity Density With A Mixture Of Gaussians
Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationAn Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control
An Extension to the Tactical Planning Model for a Job Shop: Continuous-Tie Control Chee Chong. Teo, Rohit Bhatnagar, and Stephen C. Graves Singapore-MIT Alliance, Nanyang Technological Univ., and Massachusetts
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationUsing a De-Convolution Window for Operating Modal Analysis
Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationLower Bounds for Quantized Matrix Completion
Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationOptimal Jamming Over Additive Noise: Vector Source-Channel Case
Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper
More informationUpper and Lower Bounds on the Capacity of Wireless Optical Intensity Channels
ISIT7, Nice, France, June 4 June 9, 7 Upper and Lower Bounds on the Capacity of Wireless Optical Intensity Channels Ahed A. Farid and Steve Hranilovic Dept. Electrical and Coputer Engineering McMaster
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationMSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE
Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL
More informationASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical
IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul
More informationCompressive Sensing Over Networks
Forty-Eighth Annual Allerton Conference Allerton House, UIUC, Illinois, USA Septeber 29 - October, 200 Copressive Sensing Over Networks Soheil Feizi MIT Eail: sfeizi@it.edu Muriel Médard MIT Eail: edard@it.edu
More informationIntelligent Systems: Reasoning and Recognition. Artificial Neural Networks
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley MOSIG M1 Winter Seester 2018 Lesson 7 1 March 2018 Outline Artificial Neural Networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationAn RIP-based approach to Σ quantization for compressed sensing
An RIP-based approach to Σ quantization for copressed sensing Joe-Mei Feng and Felix Kraher October, 203 Abstract In this paper, we provide new approach to estiating the error of reconstruction fro Σ quantized
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More informationCompression and Predictive Distributions for Large Alphabet i.i.d and Markov models
2014 IEEE International Syposiu on Inforation Theory Copression and Predictive Distributions for Large Alphabet i.i.d and Markov odels Xiao Yang Departent of Statistics Yale University New Haven, CT, 06511
More informationTracking using CONDENSATION: Conditional Density Propagation
Tracking using CONDENSATION: Conditional Density Propagation Goal Model-based visual tracking in dense clutter at near video frae rates M. Isard and A. Blake, CONDENSATION Conditional density propagation
More informationExperimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis
City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna
More informationOn Conditions for Linearity of Optimal Estimation
On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationOn the Design of MIMO-NOMA Downlink and Uplink Transmission
On the Design of MIMO-NOMA Downlink and Uplink Transission Zhiguo Ding, Meber, IEEE, Robert Schober, Fellow, IEEE, and H. Vincent Poor, Fellow, IEEE Abstract In this paper, a novel MIMO-NOMA fraework for
More informationEstimating Parameters for a Gaussian pdf
Pattern Recognition and achine Learning Jaes L. Crowley ENSIAG 3 IS First Seester 00/0 Lesson 5 7 Noveber 00 Contents Estiating Paraeters for a Gaussian pdf Notation... The Pattern Recognition Proble...3
More informationFixed-to-Variable Length Distribution Matching
Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de
More informationA Model for the Selection of Internet Service Providers
ISSN 0146-4116, Autoatic Control and Coputer Sciences, 2008, Vol. 42, No. 5, pp. 249 254. Allerton Press, Inc., 2008. Original Russian Text I.M. Aliev, 2008, published in Avtoatika i Vychislitel naya Tekhnika,
More informationA Note on the Applied Use of MDL Approximations
A Note on the Applied Use of MDL Approxiations Daniel J. Navarro Departent of Psychology Ohio State University Abstract An applied proble is discussed in which two nested psychological odels of retention
More informationEffective joint probabilistic data association using maximum a posteriori estimates of target states
Effective joint probabilistic data association using axiu a posteriori estiates of target states 1 Viji Paul Panakkal, 2 Rajbabu Velurugan 1 Central Research Laboratory, Bharat Electronics Ltd., Bangalore,
More informationSEISMIC FRAGILITY ANALYSIS
9 th ASCE Specialty Conference on Probabilistic Mechanics and Structural Reliability PMC24 SEISMIC FRAGILITY ANALYSIS C. Kafali, Student M. ASCE Cornell University, Ithaca, NY 483 ck22@cornell.edu M. Grigoriu,
More informationEstimation of ADC Nonlinearities from the Measurement in Input Voltage Intervals
Estiation of ADC Nonlinearities fro the Measureent in Input Voltage Intervals M. Godla, L. Michaeli, 3 J. Šaliga, 4 R. Palenčár,,3 Deptartent of Electronics and Multiedia Counications, FEI TU of Košice,
More informationAn Algorithm for Quantization of Discrete Probability Distributions
An Algorith for Quantization of Discrete Probability Distributions Yuriy A. Reznik Qualco Inc., San Diego, CA Eail: yreznik@ieee.org Abstract We study the proble of quantization of discrete probability
More informationRateless Codes for MIMO Channels
Rateless Codes for MIMO Channels Marya Modir Shanechi Dept EECS, MIT Cabridge, MA Eail: shanechi@itedu Uri Erez Tel Aviv University Raat Aviv, Israel Eail: uri@engtauacil Gregory W Wornell Dept EECS, MIT
More informationarxiv: v1 [stat.ot] 7 Jul 2010
Hotelling s test for highly correlated data P. Bubeliny e-ail: bubeliny@karlin.ff.cuni.cz Charles University, Faculty of Matheatics and Physics, KPMS, Sokolovska 83, Prague, Czech Republic, 8675. arxiv:007.094v
More informationStudy on Markov Alternative Renewal Reward. Process for VLSI Cell Partitioning
Int. Journal of Math. Analysis, Vol. 7, 2013, no. 40, 1949-1960 HIKARI Ltd, www.-hikari.co http://dx.doi.org/10.12988/ia.2013.36142 Study on Markov Alternative Renewal Reward Process for VLSI Cell Partitioning
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationA general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax:
A general forulation of the cross-nested logit odel Michel Bierlaire, EPFL Conference paper STRC 2001 Session: Choices A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics,
More informationSharp Time Data Tradeoffs for Linear Inverse Problems
Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used
More informationA VARIABLE STEP-SIZE FREQUENCY-DOMAIN ADAPTIVE FILTERING ALGORITHM FOR STEREOPHONIC ACOUSTIC ECHO CANCELLATION
18th European Signal Processing Conference EUSIPCO-2010 Aalborg, Denark, August 23-27, 2010 A VARIABLE STEP-SIZE FREQUENCY-DOMAIN ADAPTIVE FILTERING ALGORITHM FOR STEREOPHONIC ACOUSTIC ECHO CANCELLATION
More informationLONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES
Journal of Marine Science and Technology, Vol 19, No 5, pp 509-513 (2011) 509 LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Ming-Tao Chou* Key words: fuzzy tie series, fuzzy forecasting,
More informationSupplementary Material for Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion
Suppleentary Material for Fast and Provable Algoriths for Spectrally Sparse Signal Reconstruction via Low-Ran Hanel Matrix Copletion Jian-Feng Cai Tianing Wang Ke Wei March 1, 017 Abstract We establish
More informationEfficient dynamic events discrimination technique for fiber distributed Brillouin sensors
Efficient dynaic events discriination technique for fiber distributed rillouin sensors Carlos A. Galindez,* Francisco J. Madruga, and Jose M. Lopez-Higuera Photonics Engineering Group, Universidad de Cantabria,Edif.
More informationModified Systematic Sampling in the Presence of Linear Trend
Modified Systeatic Sapling in the Presence of Linear Trend Zaheen Khan, and Javid Shabbir Keywords: Abstract A new systeatic sapling design called Modified Systeatic Sapling (MSS, proposed by ] is ore
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationREDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION
ISSN 139 14X INFORMATION TECHNOLOGY AND CONTROL, 008, Vol.37, No.3 REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION Riantas Barauskas, Vidantas Riavičius Departent of Syste Analysis, Kaunas
More informationChapter 1: Basics of Vibrations for Simple Mechanical Systems
Chapter 1: Basics of Vibrations for Siple Mechanical Systes Introduction: The fundaentals of Sound and Vibrations are part of the broader field of echanics, with strong connections to classical echanics,
More informationAn Improved Particle Filter with Applications in Ballistic Target Tracking
Sensors & ransducers Vol. 72 Issue 6 June 204 pp. 96-20 Sensors & ransducers 204 by IFSA Publishing S. L. http://www.sensorsportal.co An Iproved Particle Filter with Applications in Ballistic arget racing
More informationInternational Scientific and Technological Conference EXTREME ROBOTICS October 8-9, 2015, Saint-Petersburg, Russia
International Scientific and Technological Conference EXTREME ROBOTICS October 8-9, 215, Saint-Petersburg, Russia LEARNING MOBILE ROBOT BASED ON ADAPTIVE CONTROLLED MARKOV CHAINS V.Ya. Vilisov University
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More informationAntenna Saturation Effects on MIMO Capacity
Antenna Saturation Effects on MIMO Capacity T S Pollock, T D Abhayapala, and R A Kennedy National ICT Australia Research School of Inforation Sciences and Engineering The Australian National University,
More informationBoosting with log-loss
Boosting with log-loss Marco Cusuano-Towner Septeber 2, 202 The proble Suppose we have data exaples {x i, y i ) i =... } for a two-class proble with y i {, }. Let F x) be the predictor function with the
More informationGenetic Quantum Algorithm and its Application to Combinatorial Optimization Problem
Genetic Quantu Algorith and its Application to Cobinatorial Optiization Proble Kuk-Hyun Han Dept. of Electrical Engineering, KAIST, 373-, Kusong-dong Yusong-gu Taejon, 305-70, Republic of Korea khhan@vivaldi.kaist.ac.kr
More informationSymbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm
Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat
More informationMultiscale Entropy Analysis: A New Method to Detect Determinism in a Time. Series. A. Sarkar and P. Barat. Variable Energy Cyclotron Centre
Multiscale Entropy Analysis: A New Method to Detect Deterinis in a Tie Series A. Sarkar and P. Barat Variable Energy Cyclotron Centre /AF Bidhan Nagar, Kolkata 700064, India PACS nubers: 05.45.Tp, 89.75.-k,
More informationBootstrapping Dependent Data
Bootstrapping Dependent Data One of the key issues confronting bootstrap resapling approxiations is how to deal with dependent data. Consider a sequence fx t g n t= of dependent rando variables. Clearly
More informationA Smoothed Boosting Algorithm Using Probabilistic Output Codes
A Soothed Boosting Algorith Using Probabilistic Output Codes Rong Jin rongjin@cse.su.edu Dept. of Coputer Science and Engineering, Michigan State University, MI 48824, USA Jian Zhang jian.zhang@cs.cu.edu
More informationIterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel
1 Iterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel Rai Cohen, Graduate Student eber, IEEE, and Yuval Cassuto, Senior eber, IEEE arxiv:1510.05311v2 [cs.it] 24 ay 2016 Abstract In
More informationTesting equality of variances for multiple univariate normal populations
University of Wollongong Research Online Centre for Statistical & Survey Methodology Working Paper Series Faculty of Engineering and Inforation Sciences 0 esting equality of variances for ultiple univariate
More informationAnisotropic reference media and the possible linearized approximations for phase velocities of qs waves in weakly anisotropic media
INSTITUTE OF PHYSICS PUBLISHING JOURNAL OF PHYSICS D: APPLIED PHYSICS J. Phys. D: Appl. Phys. 5 00 007 04 PII: S00-770867-6 Anisotropic reference edia and the possible linearized approxiations for phase
More information