1

On Symmetric Alpha-Stable Noise after Short-Time Fourier Transformation Francois-Xavier Socheleau*, Dominique Pastor, Mathieu Duret

Abstract—Statistical properties of real-valued symmetric αstable noise after short-time Fourier transformation are derived. Circularity, stationarity and dependence between the real and imaginary components are studied as a function of the STFT parameters and the stability index α. Index Terms—Alpha-stable, heavy-tailed distributions, shorttime Fourier transform.

I. I NTRODUCTION YMMETRIC alpha-stable distributions (SαS) are commonly employed to model impulsive perturbations of various physical origins, including underwater acoustic noise of snapping shrimp [1], man-made audio noise, as well as different types of electromagnetic phenomena [2]. Theoretical rationals for SαS models often result from its leptokurtic nature and are also provided by the generalized central limit theorem, which extends the central limit theorem to variables of infinite variance. For numerous signal processing applications, the discrete short-time Fourier transform (STFT) is widely used to develop tools dedicated to time-frequency analysis, such as the spectrogram, as well as those designed for heavy-tailed background noise [3]. In a statistical signal processing framework, knowledge of the distribution of the STFT coefficients is often required so as to optimize detection and estimation methods [4]. For instance, the STFT is a common sparse transform for locally harmonic signals and can be used to improve robustness of noise scale parameter estimation when observations do not result from noise only, but from the random presence of signals in independent and additive noise [5]. In this paper, we derive the characteristic function of independent and identically distributed (i.i.d.) real-valued SαS noise after STFT and study the properties of circularity, stationarity and dependence between the real and imaginary components as a function of the STFT and the SαS distribution parameters. This paper is organized as follows. Section II is devoted to the introduction of SαS distribution. Statistical properties of the STFT of SαS noise are derived in Section III, followed by conclusion in Section IV.

S

Copyright (c) 2012 IEEE. Personal use of this material is permitted. However, permission to use this material for any other purposes must be obtained from the IEEE by sending a request to [email protected]. F.-X. Socheleau and M. Duret are with ENSTA Bretagne, UMR CNRS 6285 Lab-STICC, Ueb, 2 rue Francois Verny, 29806 Brest Cedex 9, France (e-mail: [email protected]; [email protected]). D. Pastor is with the Institut Telecom, Telecom Bretagne, UMR CNRS 3192 Lab-STICC, Ueb, Technopˆole Brest Iroise-CS 83818, 29238 Brest Cedex, France (e-mail: [email protected]).

Notation: Throughout this paper, uppercase letters denote random variables, e.g. X, and uppercase boldface letters denote random vectors, e.g., X. The superscripts T stands for transposition. N (m, v) designates the distribution of a Gaussian random variable with mean m and variance v, and S(α, σ) the distribution of a SαS distribution with index of stability α and scale parameter σ. The least common multiple of two integers a and b is denoted by lcm(a, b) and the greatest common divisor by gcd(a, b). The uniform norm of a real∆ valued function f (x) is denoted kf (x)k∞ = supx∈R |f (x)|. The notation a ≡ b (mod n) is used when the number a is equivalent (congruent) to the number b modulo n. Finally, the d symbol = denotes equality in distribution and sgn the sign function. II. S YMMETRIC A LPHA -S TABLE D ISTRIBUTIONS The theory of SαS distributions is detailed in numerous references, see [6], [7]. Only definitions and properties relevant for our analysis are recalled in this section. Definition 1 ([6]) A random variable X is stable if for any positive constants a and b, and for some positive c and some d∈R d (1) aX1 + bX2 = cX + d, where X1 and X2 are independent copies of X. A random variable is symmetric stable if it is stable and symmetrically d distributed around 0, e.g. X = −X. Property 1 ([6]) The characteristic function of a symmetric stable random variable X can be expressed as ΦX (u) = exp (−|σu|α ) , −∞ < u < +∞

(2)

with 0 < α ≤ 2, and σ > 0. The distribution of X is denoted by S(α, σ), where the index of stability α characterizes the decay rate of the distribution tails and the scale parameter σ measures dispersion or spread. One consequence of SαS heavy tails is that not all moments exist. More precisely, for 0 < α < 2, E {|X|p } is finite only for 0 < p < α. With the exception of the Gaussian case (α = 2), SαS random variables have infinite variance. Also, note that closed-form expression of SαS probability density function are only available for Cauchy (α = 1) and Gaussian (α = 2) random variables. Property 2 ([7]) Any SαS random variable X can be decomposed as X = A1/2 G, where G and A are mutually

2

independent, with G ∼ N (0, 2σ 2 ) and A a right-skewed αstable random variable, whose characteristic function is given in [7]. X is also classified as sub-Gaussian and is said to be subordinated to G. III. S TATISTICAL PROPERTIES OF THE STFT S YMMETRIC A LPHA - STABLE NOISE

OF

uT Rm,k u

A. STFT Let {X(m)}m∈N be a SαS random process with i.i.d. elements satisfying for all m in N, X(m) ∼ S(α, σ). Given a discrete analysis window w(m) of length M , the STFT of X(m) is defined as T ∆  r i , , Xn,k X n,k = Xn,k r Xn,k

i Xn,k

From (6) and (8), we obtain α/2 ! X 1 w2 (m − nD)uT Rm,k u . ΦX n,k (u) = exp − 2 m (9) The expression of ΦX n,k (u) derives from



= ∆

=

nD+M−1 X

X(m)w(m − nD) cos(ωk m),

m=nD nD+M−1 X



m=nD

X(m)w(m − nD) sin(ωk m), (3)

where K > 0 is the length of the discrete Fourier transform (DFT), D > 0 is the hop size between successive DFTs, and ∆ ωk = 2πk/K, 0 ≤ k ≤ K −1. K/M corresponds to the factor of zero-padding. The indexes n and k refer to the discrete time and frequency locations, respectively. For the sake of readability, the summation range over m is sometimes omitted. When not specified, it is equal to {nD, · · · , nD + M − 1}. Proposition 1 The joint characteristic function of X n,k can be expressed as α   √ (4) ΦX n,k (u) = exp − uT uσ × sn,k (u) , P



m

|w(m − nD) sin(ωk m − θ(u))|α , u =

1 θ(u) = − sgn(u20 − u21 ) arccos 2 ∆

=

(b)



−2u0 u1 uT u





π . 4

(5) T

fm,k = X(m). [cos(ωk m), − sin(ωk m)] . Proof: Let X Using the independence of the X(m)’s, we have   ∆ ΦX n,k (u) = E exp iuT X n,k Y = ΦX (6) e m,k (w(m − nD)u) . m

From Prop. 2, X(m) is sub-Gaussian and can be expressed as fm,k satisfies X fm,k = X(m) = A1/2 (m)G(m). Therefore, X 1/2 e e A (m)Gm,k , where Gm,k is a degenerate zero-mean Gaussian vector with covariance matrix   cos2 (ωk m) − 12 sin(2ωk m) . (7) Rm,k = 2σ 2 sin2 (ωk m) − 21 sin(2ωk m) fm,k Using [7], [1, Eq. (8)], the characteristic function of X can then be expressed as α/2 ! 1 T ΦX . (8) e m,k (u) = exp − u Rm,k u 2

σ 2 u20 + u21 + (u20 − u21 ) cos(2ωk m)  −2u0 u1 sin(2ωk m) 2σ 2 uT u sin2 (ωk m − θ(u)) ,

=

where (a) is a straightforward expansion of uT Rm,k u and (b) is based on the following trigonometric identities: ∀ a, b, x ∈ √ 2 + b2 sin(x + φ), where φ = R, a sin x +  b cos x = a  sgn(b) arccos √a2a+b2 and 1 + sin(2x) = 2 sin2 (x + π4 ). C. Stationarity and circularity Due to the i.i.d. nature of the X(m)’s and the periodicities of trigonometric functions, the STFT output is expected to satisfy specific properties related to stationarity and circularity. Hereafter, we detail such properties in the SαS case. Corollary 1 X n,k is cyclo-stationary in n such that ΦX n,k (u) = ΦX n+P,k (u), where

B. Joint characteristic function

where sn,k (u) = [u0 , u1 ]T and

(a)

P =



lcm(2kD,K) , 2kD

1,

(10)

if k > 0 if k = 0.

(11)

Proof: By a change of variable, sn,k (u) can be written PM−1 as sn,k (u) = m=0 |w(m)|α | sin(ωk (m + nD) − θ(u))|α . Moreover, since | sin(·)| is π-periodic and by noticing that P is the smallest integer such that ωk DP ≡ 0 (mod π), we conclude that ΦX n,k (u) = ΦX n+P,k (u). Corollary 2 For all analysis window w(·) and all strictly positive integers M and ℓ, X n,k is stationary in n when K is even and when the hop size D satisfies D=ℓ

K . 2

(12)

Proof: Corollary 2 is obtained by simply noticing that for D = ℓK 2 , we have P = 1. Let X zn,k be defined as   − sin z ∆ cos z z X n,k = X n,k . (13) sin z cos z d

By definition, X n,k is circular if X zn,k = X n,k , for all z ∈ R. As shown in the following corollary, the properties of circularity and stationarity are closely related. Corollary 3 A sufficient condition for strict stationarity in n d is circularity. In other words, if X n,k is circular then X n,k = X n+ℓ,k , for all ℓ in N.

3

(a)

(b)

(c)

Fig. 1. Illustration of the rotational symmetry and near-circularity of X n,k , (α = 0.5, σ = 1, k = 1). (a) and (b), boxcar window, with K = 8 and K = 127, respectively. (c) Hanning window, with K = 8.

Proof: It can be shown that the characteristic function of X zn,k is expressed as  √ α  ΦX zn,k (u) = exp − uT uσ × szn,k (u) , (14) where

szn,k (u) =

M−1 X m=0

|w(m) sin(ωk (m + nD) + z − θ(u))|α . (15)

Therefore, ΦX n+l,k (u) = ΦX zn,k (u), for z = ωk Dℓ. Assuming that X n,k is circular, we have ΦX n,k (u) = ΦX zn,k (u), for all z in R, which concludes the proof. Note that the converse of Corollary 3 is not true. In numerous applications, detection/estimation algorithms rely on the assumption that the input data are both stationary and circular. According to (14) and (15), circularity is obtained if and only if szn,k (u) = sn,k (u), for all real z. In the general case, this equality does not hold, so that X n,k is not circular. However, by carefully choosing the STFT parameters, a rotational symmetry of the distribution of X n,k can be obtained, leading, in some cases, to an approximate circularity and therefore to an approximate stationarity. 1) The boxcar window: √ Let us consider the boxcar window defined as w(m) = 1/PM , m ∈ {0, · · · , M − 1}. In that M−1 case, sn,k (u) = M 1α/2 m=0 | sin(ωk (m + nD) − θ(u))|α . By noticing that | sin(ωk (m + nD) − θ(u))|α is a periodic function of m, with a period Pz = lcm(2k, K)/(2k), if M is chosen to be a multiple of Pz , we obtain sn,k (u) = szn,k (u), ∀ z ≡ 0 (mod π/Pz ).

(16)

This leads us to the following corollary. Corollary 4 For a boxcar analysis window of length M = ℓ× Pz , with ℓ ∈ N+ and Pz = lcm(2k, K)/(2k), X n,k presents a rotational symmetry of order Pz , so that d

X n,k = X zn,k , ∀ z ≡ 0 (mod π/Pz ).

(17)

Note that this result holds for all 0 < α ≤ 2, n ∈ N and D ∈ N+ .1 Figure 1-(a) illustrates this rotational symmetry for α = 0.5, M = K = 8, and for the frequency indexes k = 1, leading to Pz = 4. 1 In

the specific Gaussian case (α = 2), it can be shown that the STFT parameters described in Corollary 4 lead actually to a strictly circular vector X n,k .

TABLE I I NDEX OF “ALMOST- PERIODICITY ”: z+π/P kszn,k (u) − sn,k z (u)k∞ /kszn,k (u)k∞ , FOR α = 0.5, k = 1, n = 0.

K=M=17 K=M=31 K=M=61 K=M=127

Box. 0 0 0 0

Hann. 3.1 10−2 1.3 10−2 5.2 10−3 2.1 10−3

Gauss. 1.9 10−2 8.1 10−3 3.1 10−3 1.1 10−3

Black. 2.9 10−2 1.2 10−2 4.5 10−3 1.6 10−3

Circularity is strictly obtained when Pz = +∞. However, in practice, circularity is a reasonable assumption when Pz is large, leading to a near-isotropic distribution. By definition, Pz is bounded by 1 ≤ Pz ≤ K and depends both on the frequency index k and the length K of the DFT. Choosing a large value K does not guarantee that Pz is large for all k. For instance, if we set K = 2N and k = K/4, we have Pz = 2, for all integer N ≥ 2. In fact, Pz is maximal and equal to K when 2k and K are coprime. This can be verified by expressing Pz as Pz =

lcm(2k, K) K = , 2k gcd(2k, K)

(18)

with gcd(2k, K) = 1, iff 2k and K are coprime. As consequence of (18), it can be shown that for a boxcar window, with a zero-padding factor set to 1, Pz = K, ∀ 0 < k ≤ K − 1 iff the DFT length K is chosen to be a prime number. Choosing this set of parameters, with K prime, also implies that the X n,k are identically distributed across frequencies.2 In addition, if K is chosen to be sufficiently large, the characteristic function becomes near-isotropic and the approximation of circularity and therefore of stationarity then becomes reasonable. This is illustrated in Figure 1-(b), where the characteristic function of X n,k is plotted for α = 0.5 with M = K = 127. 2) The other windows: So far, we have shown that a rotational symmetry can be obtained with a boxcar window, thanks to the periodicity described by (16). This periodicity is not strictly satisfied for common windows such as Hanning, Gauss, Blackman, etc. However, as shown in Table I, for most windows, szn,k (u) is almost-periodic and satisfies [8] z+π/Pz

kszn,k (u) − sn,k

(u)k∞ ≤ ǫ,

(19)

2 The last implication results from the fact when K = M = P , with K z prime, sn,k (u) = sn,k′ (u), for all k and k ′ in {1, · · · , K − 1}

4

where ǫ << kszn,k (u)k∞ . This “almost-periodicity”implies that ΦX n,k (u) presents an “almost” rotational symmetry of order Pz . This “almost” symmetry is visible when the characteristic function is plotted as in Figure 1-(c).

0.6

0.5

0.4

0.3

r i Corollary 5 Xn,k and Xn,k are SαS random variables, r i whose distributions are Xn,k ∼ S(α, σr ) and Xn,k ∼ S(α, σi ), respectively, with !1/α X σr = σ (20) |w(m − nD) cos(ωk m)|α m

σi

=

σ

m

r Xn,k

|w(m − nD) sin(ωk m)|α

!1/α

Dp

D. Marginal characteristic functions and dependence

X

Boxcar Hanning Gauss Blackman

K = 17 0.2

K = 127 0.1

0 1

Fig. 2.

1.1

1.2

1.3

1.4

1.5

α

1.6

1.7

1.8

1.9

2

p-distance as a function of the stability index α, (p = 1, M = K).

. (21)

i Xn,k

and are identically distributed when their respective scale factors are equal. Based on our previous discussion in Section III-C, it can be shown that strict equality between σr and σi is obtained for all 0 < α ≤ 2, when X n,k presents a rotational symmetry of order Pz , with Pz even.3 Also, note that the “almost” symmetry of Section III-C, with Pz even, leads to an “almost” equality between σr and σi . This is also the case when K is large and prime. For numerous sets of STFT parameters, the difference between σr and σi can be assumed to be negligible for practical applications. r i Although Xn,k and Xn,k can be identically distributed, they are not independent in the general case. A case of independence is obtained for k = K/4, ∀ α. In this case, the correlation matrix Rn,k is diagonal and has only one nonzero entry at any n, so that the joint characteristic function reduces to the product of its marginal characteristic functions. Independence also occurs when X(n) is Gaussian distributed, with STFT parameters similar to those leading to (16). i r can be and Xn,k The level of dependence between Xn,k quantitatively assess by computing the p-distance measure [9]. o o n n p i p r < +∞. Let Vp Suppose that E |Xn,k | + E |Xn,k | denote the p-distance covariance defined by   ∆ r i , ΦXn,k = Vp ΦXn,k 2 Z (22) r i (u0 )ΦXn,k (u1 ) ΦX n,k (u) − ΦXn,k γ du, |u0 |1+p |u1 |1+p 2 R

where γ is some suitable constant (see [9, Lemma 1]). The p-distance measure is expressed as  1/2   p r i V ΦXn,k , ΦXn,k    Dp =   ,   r  p p r r i i , ΦXn,k V ΦXn,k , ΦXn,k V ΦXn,k

(23)     r r i i > 0 and Dp = 0 , ΦXn,k Vp ΦXn,k , ΦXn,k if Vp ΦXn,k otherwise. According to [9], this measure equals zero only if the real and the imaginary components are independent. 3 Note that in the specific Gaussian case (α = 2), P is not required to be z even.

Figure 2 shows the p-distance as a function of the stability index α for different analysis windows and DFT lengths. While we have shown that circularity, stationarity, and idenr i tical distributions between Xn,k and Xn,k can be assumed in many scenarios, numerical results indicate that it is not the case for independence, especially for small values of α. Figure 2 also highlights the impact of the analysis window, which becomes significant for small values of K as α gets closer to 2 and almost negligible for large value of K. This can be explained by the fact that the property of dependence becomes strongly interlinked with the one of circularity as α tends to 2. We recall that in the Gaussian case, circularity r i . implies independence between Xn,k and Xn,k IV. C ONCLUSIONS In the general case, we have shown that STFT coefficients of i.i.d real-valued SαS noise are cyclo-stationary, non circular, and have non i.i.d real and imaginary components. However, with specific STFT parameters, based on the boxcar window for instance and/or on large DFTs of prime sizes, it is possible to obtain “almost” circularity and stationarity. Dependence between the real and the imaginary components can only be achieved in the Gaussian case or for a normalized frequency of 1/4. R EFERENCES [1] A. Mahmood, M. Chitre, and M. Armand, “PSK Communication with Passband Additive Symmetric α-Stable Noise ,” IEEE Trans. Commun, vol. 99, 2012. [2] C. Nikias and M. Shao, Signal Processing With Alpha-Stable Distributions and Applications, Wiley, New-York, 1995. [3] A.M. Zoubir, V. Koivunen, Y. Chakhchoukh, and M. Muma, “Robust Etimation in Signal Processing: A Tutorial-Style Treatment of Fundamental Concepts,” IEEE Signal Process. Mag., vol. 29, no. 4, pp. 61–80, 2012. [4] F. Millioz and N. Martin, “Circularity of the STFT and Spectral Kurtosis for Time-Frequency Segmentation in Gaussian Environment,” IEEE Trans. Signal Process., vol. 59, no. 2, pp. 515–524, 2012. [5] D. Pastor and F.-X. Socheleau, “Robust Estimation of Noise Standard Deviation in Presence of Signals with Unknown Distributions and Occurrences,” IEEE Trans. Signal Process., vol. 60, no. 4, Apr. 2012. [6] J. P. Nolan, Stable Distributions - Models for Heavy Tailed Data, Birkhauser, Boston, 2012, In progress, Chapter 1 online at academic2.american.edu/∼jpnolan. [7] G. Samorodnitsky and M. S. Taqqu, Stable Non-Gaussian Random Processes. Stochastic Models With Infinite Variance, Chapman & Hall, New-York, 1994. [8] H. Bohr, Almost-periodic functions, Chelsea, 1947. [9] G. J. Szkely, M. L. Rizzo, and N. K. Bakirov, “Measuring and Testing Dependence by Correlation of Distances,” The Annals of Statistics, vol. 35, no. 6, pp. 27692794, 2007.

On Symmetric Alpha-Stable Noise after Short-Time ...

large, leading to a near-isotropic distribution. By definition,. Pz is bounded by 1 ≤ Pz ≤ K and depends both on the frequency index k and the length K of the DFT. Choosing a large value K does not guarantee that Pz is large for all k. For instance, if we set K = 2N and k = K/4, we have. Pz = 2, for all integer N ≥ 2. In fact, Pz ...

286KB Sizes 0 Downloads 219 Views

Recommend Documents

On Distributing Symmetric Streaming ... - Research at Google
¶Department of Computer Science, Dartmouth College. This work was done while visiting Google, Inc., New York, NY. financial companies such as Bloomberg, ...

On Distributing Symmetric Streaming Computations
Sep 14, 2009 - Google's MapReduce and Apache's Hadoop address these problems ... In theory, the data stream model facilitates the study of algorithms that ...

On Distributing Symmetric Streaming Computations
using distributed computation has numerous challenges in- ... by these systems. We show that in principle, mud algo- ... algorithm can also be computed by a mud algorithm, with comparable space ... algorithms. Distributed systems such as.

SYMMETRIES ON ALMOST SYMMETRIC NUMERICAL ...
Frobenius number of H, and we call g(H) the genus of H. We say that an integer x ... will denote by PF(H) the set of pseudo-Frobenius numbers of H, and its ...

Large Vocabulary Noise Robustness on Aurora4 - International ...
While porting models to noisy environments, the distortion of pa- rameters augments the confusability of models, and therefore cre- ates decoding errors.

On the Existence of Symmetric Mixed Strategy Equilibria
Mar 20, 2005 - In this note we show that symmetric games satisfying these ... mixed strategies over A, i. e. the set of all regular probability measures on A.

Linear Operators on the Real Symmetric Matrices ...
Dec 13, 2006 - Keywords: exponential operator, inertia, linear preserver, positive semi-definite ... Graduate Programme Applied Algorithmic Mathematics, Centre for ... moment structure and an application to the modelling of financial data.

On the growth problem for skew and symmetric ...
Abstract. C. Koukouvinos, M. Mitrouli and Jennifer Seberry, in “Growth in Gaussian elimi- nation for weighing matrices, W(n, n − 1)”, Linear Algebra and its Appl., 306 (2000),. 189-202, conjectured that the growth factor for Gaussian eliminatio

Symmetries on almost symmetric numerical semigroups
semigroups by symmetry of pseudo-Frobenius numbers. We give a ... This set is called the Apéry set of h in H. By definition, Ap(H, n) = {0 = w(0),w(1),...,w(n − 1)}, ...

On Apéry Sets of Symmetric Numerical Semigroups
In this paper, we give some results on Apéry sets of Symmetric. Numerical Semigroups with e(S)=2. Also, we rewrite the definitions n(S) and H(S) by means of ...

Universal functors on symmetric quotient stacks of ...
divisor E inside A[2] and i : E ↩→ A[2] is the inclusion then, for any integer k, the functor: Hk := i∗(q. ∗. ( ) ⊗ Oq(k)) : D(A) ... If ϖ : [En/An] → [En/Sn] is the double cover induced by the alternating subgroup An < Sn, then ..... fo

on the minimal fourier degree of symmetric boolean ...
2. AMIR SHPILKA, AVISHAY TAL of course other areas of math and physics), a partial list includes learning theory, hardness of approximation, pseudo-randomness, social choice theory, coding theory, cryptography, additive combinatorics and more. A typi

Variations on the retraction algorithm for symmetric ...
With block methods get. 1) basic triangular shape. 2) super long columns. 3) short columns which don't fit into rank k correction or vanish. x x x x x x. x x x x x x x. x x x x x x x x. x x x x x x x x x r r r. x x x x x x x x x x r r.

The automorphism group of Cayley graphs on symmetric groups ...
May 25, 2012 - Among the Cayley graphs of the symmetric group generated by a set ... of the Cayley graph generated by an asymmetric transposition tree is R(Sn) .... If π ∈ Sn is a permutation and i and j lie in different cycles of π, then.

Influence of photosensor noise on accuracy of cost-effective Shack ...
troiding accuracy for the cost-effective CMOS-based wavefront sensors were ... has 5.00µm pixels with the pixel fill factor of 50%, quantum efficiency of 60%,.

Hyperspectral image noise reduction based on rank-1 tensor ieee.pdf
Try one of the apps below to open or edit this item. Hyperspectral image noise reduction based on rank-1 tensor ieee.pdf. Hyperspectral image noise reduction ...

Minimizing Noise on Dual GSM Channels Using Adaptive Filters - IJRIT
threshold, transmitter power , synchronization scheme, error correction, processing gain, even the number of sun spots, all have effect on evaluating jamming. 2.

Highly Noise Robust Text-Dependent Speaker Recognition Based on ...
conditions and non-stationary color noise conditions (factory, chop- per and babble noises), which are also the typical conditions where conventional spectral subtraction techniques perform poorly. Index Terms: Robust speaker recognition, hypothesize

Limited Modal Information and Noise Effect on Damage ...
R Normally distributed random number. ABSTRACT .... numerical performance; nonetheless, it could be a good start for tutorial purposes. The reader is ... averages over a sufficiently large sample of the input data [11], [12]. This algorithm is ...

Large Vocabulary Noise Robustness on Aurora4
rigazio, nguyen, kryze, jcj @research.panasonic.com. ABSTRACT ..... phone and discovered that some signals were originally recorded with very narrow band ...

Influence of photosensor noise on accuracy of cost ... - mikhailkonnik
That is especially true for the low-light conditions4 and/or the case of cost-effective wavefront sensors.5 Using widely available fast and inexpensive CMOS sensors, it would be possible to build low-cost adaptive optics systems for small telescopes,

Influence of photosensor noise on accuracy of cost ... - mikhailkonnik
developed high-level model.18 The model consists of the photon shot noise, the photo response non-uniformity .... affects the accuracy of a wavefront sensor only in low light conditions and to some extent on intermediate-level of light. Then the ....

Large Vocabulary Noise Robustness on Aurora4
Large Vocabulary Speech Recognition (LVCSR) in presence of noise. ... structure of the tree and the filter coefficients define the wavelet ba- sis onto which the ...

Minimizing Noise on Dual GSM Channels Using Adaptive Filters - IJRIT
Jamming makes itself known at the physical layer of the network, more commonly known as the MAC (Media Access Control) layer[4]. The increased noise floor ...