PERIODIC TIME SPREAD PULSE SIGNALS WITH PERFECT AUTOCORRELATION

Size: px
Start display at page:

Download "PERIODIC TIME SPREAD PULSE SIGNALS WITH PERFECT AUTOCORRELATION"

Transcription

1 PERIODIC TIME SPREAD PULSE SIGNALS WITH PERFECT AUTOCORRELATION A. V. Titov 1 and G. J. Kazmierczak 2 1 Electro Technical University LETI in St. Petersburg, Russia 2 Cybersecurity Consultant, Princeton, New Jersey, United States of America alvastitov@gmail.com ABSTRACT This paper considers periodic single pulse signals (PSPS) of pulse duration T and time repetition NT, where N (N>1) are positive integers. This paper examines a new previously unknown property of these signals that have perfect periodic autocorrelation on the interval NT. It is shown that PSPS can be represented as the linear composition of several orthogonal periodic pulse signals with zero cross correlation, and once represented as such, these signals can be transformed into periodic time spread pulse signals where the pulses are spread over the entire interval NT. These transformed signals have the same energy and autocorrelation properties as the corresponding original PSPS. The results of this study advance the theory of pulse signals and can be applied to any electronic periodic pulse signal systems including radar, radio navigation, communication and telemetric systems. Keywords: periodic single pulse signals, orthogonal signals, perfect periodic autocorrelation function, cross correlation function, radar, radio navigation and communication systems. INTRODUCTION Periodic single pulse signals (PSPS), sometimes called pulse train signals [1], with rectangular pulse duration of T and time repetition NT (Figure-1a), can be represented in the following manner: S NT (t) = N S (1) NT (t), (1) where N (N > 1) are positive integers, T is the duration of a signal pulse, and NT is the period of repetition. Signals S (1) NT (t) are periodic unit pulse signals, i.e. periodic rectangle single pulse signals of duration T with the amplitude of each pulse equal to 1 and with a period of repetition NT. For signals S NT (t) (1), the amplitude N of each pulse, i.e. the amplitude of the pulse signals, is related with the time repetition NT (Figure. 1a). This relation was made in order to simplify subsequent calculations. These types of periodic single pulse signals (1) (Figure-1a) are well known and widely used in electronic systems. Many electronic telemetric, communication and radar systems utilize these signals as the properties of PSPS are well understood in time and frequency domains. The main property of PSPS in the time domain is its perfect periodic autocorrelation function (ACF) R NT (τ) which has only one maximum (without any side lobes) on time interval NT (Figure. 1b). The perfect ACF of PSPS combined with the simplicity of generation and processing the signals makes PSPS so attractive for use in radar, telemetric and communication systems for synchronization, time delay measurements, etc. purposes. The primary disadvantage of PSPS is a large peak factor, since the entire signal energy is concentrated in the narrow time interval duration of T. Another disadvantage of PSPS is the high probability of signals detection and estimation of its parameters. As a result of signal detection, an adversary can destroy the proper functioning of a system by different types of organized jamming and parameter estimation may enable unauthorized access [2]. In this paper we examine a new previously unknown property of PSPS. This property is related with the representation of PSPS as a linear composition of orthogonal, i.e. not correlated, periodic pulse signals with zero cross correlation. It is shown that after this representation, it is possible to transform periodic single pulse signals S NT (t) into periodic time spread pulse signals S NT (t) where the energy of one PSPS pulse is spread over the entire time interval NT (Figure. 1c). Both periodic signals S NT (t) and S NT (t) (Figure. 1a and Figure. 1c) have the same energy and the same perfect ACF on interval NT (Figure-1b). Figure-1. Signals S NT (t) and S NT (t). 8854

2 We decided to call the periodic pulse signals S NT (t) (Figure. 1c) periodic time spread pulse signals (PTSPS) as an analogy to spread spectrum signals for frequency hopping signals and leaner frequency modulated (LFM) signals [2]. By transforming PSPS into periodic time spread pulse signals (PTSPS), it is possible to mitigate the disadvantages of PSPS mentioned above, though generation and processing of PTSPS becomes more complicated compared to PSPS. Magnitude: p 1 =N 1, p 2 =N 1 (N 2-1), p 3 =N 1 N 2 (N 3-1). REPRESENTATION OF PSPS AS A COMPOSITION OF PERIODIC ORTHOGONAL PULSE SIGNALS WITH ZERO CROSS CORRELATION We will show that for any N (N > 1) (1), which are not prime numbers N p, i.e. N N p (N p = 2, 3, 5, 7, 11, etc.), PSPS can be represented as a composition of periodic orthogonal pulse signals with zero cross correlation. Any N (N > 1) (1), which is not a prime number N p (N N p ), can be represented as the product N = N 1 N 2 N n = N i, (2) where i = 1, 2, 3,, n, and N i are positive integers. Notice that value of i in (2) is not related with the value of N i at all, and it is only related with the order of product values (2). For instance, the number N = 30 can be represented as products: 1) N = 2 3 5, 2) N = and 3) N = 5 2 3; and the N 1 values are different in all of these three cases. The N 1 values are N 1 = 2, N 1 = 3, and N 1 = 5 for case 1, case 2, and case 3 respectively. After presenting N as a product (2), periodic single pulse signals (1) can be represented as the composition of n independent, i.e. non-correlated, periodic pulse signals with zero cross correlation: S NT (t) = N S (1) NT (t) = P Ni (t), (3) i where i = 1, 2, 3,, n, and where P Ni (t) are periodic pulse signals of duration T with zero cross correlation between them. The characteristics of periodic pulse signals P Ni (t) are defined, as will be shown below, by the values of N i (2). Consider the following examples: Figure-2.Signals S NT (t) and S NT (t) for N=4. Example 2: N=10, N=N 1 N 2 N n =ПN i =2 5=10, where N 1 =2, N 2 =5 and n=2. For this example, periodic pulse signals P N1 (t) (i=1) and P N2 (t) (i=2) are plotted in Figure-3a and Figure- 3b respectively and the periodic single pulse signal S NT (t) = P N1 (t)+p N2 (t) is represented in Figure-3c. Example 1: N=4, N=N=N 1 N 2... N n =П N i =2 2=4, where N 1 =2, N 2 =2 and n=2. Periodic pulse signals P N1 (t) (i=1) and P N2 (t) (i=2) for example 1 are plotted in Figure-2a and Figure-2b respectively and the periodic single pulse signal S NT (t) = P N1 (t)+p N2 (t) is represented in Figure-2c. In Figures 2, 3, 4, and 5, we have the following values of T 1, T 2, T 3, p 1, p 2, and p 3 ; Time duration: T 1 =N 1 T, T 2 =(N 1 N 2 ) T, T 3 =(N 1 N 2 N 3 ) T, (4) 8855

3 Figure-3. Signals S NT (t) and S NT (t) for N=10. Example 3: N=10, N=N 1 N 2 N n =П N i =5 2=10, where N 1 =5, N 2 =2and n=2. For this example, periodic pulse signals P N1 (t) (i=1) and P N2 (t) (i=2) are plotted in Figure-4a and Figure- 4b respectively and periodic single pulse signal S NT (t) = P N1 (t) + P N2 (t) is represented in Figure-4c. Figure-5. Signals S NT (t) and S NT (t) for N=18. Example4: N=18;N=N 1 N 2 N n =ПN i =2 3 3=18, where N 1 =2, N 2 =3, N 3 =3 and n=3. For this example, periodic pulse signals P N1 (t) (i = 1), P N2 (t) (i = 2) and P N3 (t) (i = 3) are plotted in Figure-5a, Figure-5b and Figure-5c respectively and periodic single pulse signal S NT (t) = P N1 (t) + P N2 (t) + P N3 (t) is shown in Figure-5d. The number of periodic pulse signals P Ni (t) in the representations above is defined by the number of factors in (2), i.e. by value of n. Figure-2c, Figure-3c and Figure- 4c show that periodic single pulse signals S NT (t) (1), (3) for N = 4 (n = 2) and for N = 10 (n = 2) are the sum of two periodic pulse signals P N1 (t) and P N2 (t). Figure. 5d shows that periodic single pulse signals S NT (t) (1), (3) for N = 18 (n = 3) are the sum of three periodic pulse signals P N1 (t), P N2 (t) and P N3 (t). Observe (Figure-2, Figure-3, Figure-4 and Figure-5) that all periodic pulse signals P Ni (t) for the same value of N are orthogonal, i.e. non-correlated, signals with zero cross correlation. It is easy to show that cross correlation functions of all periodic pulse signals P Ni (t) for N = 4, N = 10, and N = 18 (Figure. 2, Figure. 3, Figure. 4 and Figure. 5) are zero for all values of τ on interval NT: NT R p(ij) (τ) = P Ni (t) P Nj (t-τ) dt = 0 (5) 0 Figure-4. Signals S NT (t) and S NT (t) for N=

4 where i = 1, 2, 3,, n; j = 1, 2, 3,, n; and i j. Similar properties of periodic single pulse signals S NT (t) (1), (2) and (3) exist for all N which are non-prime numbers N p, i.e. N N p, where N p = 2, 3, 5, 7, 11, etc. In the general case, the two main rules for representing periodic single pulse signals S NT (t) (1) of pulse duration T and with period of repetition NT (N > 1, N N p ) as the sum of n periodic orthogonal pulse signals P Ni (t) (3) are: Rule 1: for i = 1, P Ni (t) = P N1 (t) = S N1T (t), where S N1T (t) are periodic single pulse signals of duration T with period of repetition of N 1 T and a amplitude of N 1, i.e. p 1 = N 1 and T 1 = N 1 T (Figure-2a, Figure-3a, Figure-4a and Figure-5a). Rule 2: for i > 1, i = 2, 3, 4,, n, P Ni (t) are periodic pulse signals with period of repetition T i, where T i =(N 1 N 2 N 3 N i ) T. Each period of repetition of duration T i consists of N i pulses divided by time intervals T (i-1), where T (i-1) =(N 1 N 2 N 3 N i-1 ) T. The first pulse p i of the N i pulses has a positive value p i =(N 1 N 2 N 3 N (i-1) ) (N i -1), and the remaining N i -1 pulses have negative values equal to -(p 1 + p p (i-1) )=- (N 1 N 2 N 3 N (i-1) ) (Figure. 2b, Figure-3b, Figure-4b, and Figures 5b and 5c). Thus, periodic single pulse signals S NT (t) (1) duration of T with period of repetition NT ((N > 1, N N p ) can be represented as linear composition, i.e. the sum, of n orthogonal periodic pulse signals P Ni (t) (3), where N=П N i and i=1, 2, 3,, n (Figure-2c, Figure-3c, Figure-4c, and Figure-5d). And all of these orthogonal periodic pulse signals P Ni (t) (3) have zero cross correlation. Occasionally it is more convenient to represent periodic pulse signals as numeric sequences such as: S NT (t) S N, where S N ={s i }=(s 1,s 2,, s N ) and P Ni (t) P Ni [3]. Applying this representation to Figure-2, where n=2 and N = N 1 N 2 =2 2=4, we obtain: N=4 i = 1 P N1 = (p 1, 0, p 1, 0, p 1, 0,p 1, 0) i = 2 P N2 = (p 2, 0, -p 1, 0, p 2, 0,-p 1, 0) S N = (N,0, 0, 0, N, 0, 0, 0), where S N = P N1 + P N2, p 1 = N 1, p 2 = N 1 (N 2-1) and N = N 1 N 2, i.e. p 1 = 2, p 2 = 2 and S N = (4,0,0,0,4,0,0,0) (Figure. 2c). Applying this representation to Figure. 3, where n=2 and N = N 1 N 2 = 2 5 = 10, we obtain: N=10 i = 1 P N1 = (p 1, 0, p 1, 0, p 1, 0,p 1, 0,p 1,0) i = 2 P N2 = (p 2, 0, -p 1, 0, -p 1, 0,-p 1, 0, -p 1, 0) S N = (N,0, 0, 0, 0, 0, 0, 0, 0, 0), (6) (7) where S N = P N1 + P N2, p 1 = N 1, p 2 = N 1 (N 2-1) and N = N 1 N 2, i.e. p 1 = 2, p 2 = 8 and S N = (10,0,0,0,0, 0,0,0,0,0) (Figure. 3c). Applying this representation to Figure. 4, where n=2 and N = N 1 N 2 = 5 2 = 10, we obtain: N=10 i = 1 P N1 = (p 1, 0, 0, 0, 0, p 1, 0, 0, 0, 0) i = 2 P N2 = (p 2, 0, 0, 0, 0, -p 1,0, 0, 0, 0) S N = (N,0, 0, 0, 0,0, 0, 0, 0, 0), where, S N = P N1 +P N2, p 1 = N 1, p 2 = N 1 (N 2-1) and N = N 1 N 2, i.e. p 1 = 5, p 2 = 5 and S N = (10,0,0,0,0, 0,0,0,0,0) (Figure-4c). Applying this representation to Figure. 5, where n=3 and N = N 1 N 2 N 3 =2 3 3=18, we obtain: N=18 i = 1 P N1 = (p 1,0,p 1, 0,p 1, 0, p 1, 0,p 1, 0,p 1, 0, p 1, 0,p 1, 0,p 1, 0) i = 2 P N2 = (p 2, 0,-p 1, 0,-p 1, 0, p 2, 0,-p 1, 0,-p 1, 0, p 2, 0,-p 1, 0,-p 1, 0) i = 3 P N3 = (p 3,0,0,0,0,0, -(p 1 +p 2 ), 0, 0, 0, 0, 0, -(p 1 +p 2 ), 0, 0, 0, 0, 0) S N = (N,0, 0, 0, 0,0, 0, 0,0, 0, 0, 0, 0, 0, 0, 0, 0, 0), where S N = P N1 + P N2 + P N1, p 1 = N 1, p 2 = N 1 (N 2-1), p 3 = N 1 N 2 (N 3-1) and (p 1 + p 2 ) = N 1 N 2, i.e. p 1 = 2, p 2 = 4, p 3 = 12, and S N = (18,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0) (Figure-5c). From (6), (7), (8) and (9) we observe that the total energy of all sequences P Ni is the same as the energy of sequences S N, i.e. (P Ni ) 2 = (S N ) 2. PERIODIC TIME SPREAD PULSE SIGNALS WITH PERFECT AUTOCORRELATION PSPS S NT (t) (1) have perfect autocorrelation function R NT (τ) with the one main lobe equal to N 2 T (where N 2 T is the energy of PSPS on time interval NT) and no side lobes on the entire time interval NT (Figure. 1b). Because PSPS S NT (t) (1) can be represented as the sum of orthogonal pulse signals P Ni (t) (3) with zero cross correlation, autocorrelation function of S NT (t) can be represented as the autocorrelation function of the sum of orthogonal pulse signals P Ni (t). But, as it is well known, the autocorrelation function of the sum of orthogonal pulse signals with zero cross correlation is the sum of the autocorrelation functions of these signals [3], i.e. the sum of the autocorrelation functions of orthogonal pulse signals P Ni (t) NT (8) (9) 8857

5 R NT (τ) = R pi (τ) = P Ni (t) P Nj (t-τ) dt = 0, (10) ii 0 where i=1,2,3,,n; j=1,2,3,,n; and i=j; and where the difference in the integrals between (5) and (10) is that i j (cross correlation) in (5), but i=j (autocorrelation) in (10). From Figure-2, Figure-3, Figure-4, and Figure-5, we observe that the autocorrelation functions of each of the orthogonal pulse signals P Ni (t) are not perfect. We obtain perfect periodic autocorrelation functions for the sum of the signals P Ni (t) only after the summation procedure (10). The sum of periodic autocorrelation functions Rpi(τ) (10) is the same as the perfect autocorrelation function R NT (τ) with the one main lobe equal to N 2 T and zero side lobes on the entire time interval NT (Figure-1b). As an example, in Figure-6 depicts the autocorrelation functions of signals Rpi (τ) (Figure-6a, Figure-6b) and the sum of these ACF RNT (τ) = Rpi (τ) (Figure-6c) for case 2) N = 10, N = N 1 N 2 = 5 2, and n = 2 (Figure-4). A similar property of autocorrelation functions will exist for any value of N (N>1, N Np). 1) N=4 N=N=N 1 N 2 N n =П N i =2 2=4, where N 1 =2, N 2 =2, n=2 and sequence P N1 (6) has a cyclic shift = 1 (equivalent to the time shift of P N1 (t) on τ = T, Figure. 2). i = 1 P N1 ( =1)= (0,p 1, 0, p 1, 0, p 1, 0,p 1 ) i = 2 P N2 = (p 2, 0,-p 1, 0, p 2, 0,-p 1,0) S N = (p 2, p 1,-p 1, p 1, p 2, p 1,-p 1, p 1 ), (11) where S N =P N1 ( =1)+P N2, p 1 =N 1, p 2 =N 1 (N 2-1), and N=N 1 N 2 ; i.e. p 1 =2, p 2 =2 and S N = (2,2,-2,2,2,2,- 2,2). The periodic signal S NT (t) is represented in Figure. 2d. 2) N=10 N=N 1 N 2... N n = П N i = 2 5 = 10, where N 1 = 2, N 2 =5, n=2 and sequence P N1 (7) has a cyclic shift =1 (equivalent to time shift of P N1 (t) on τ = T, Figure. 3). i = 1 P N1 ( =1)= (0,p 1, 0, p 1, 0, p 1, 0, p 1, 0, p 1 ) i = 2 P N2 = (p 2, 0,-p 1, 0,-p 1, 0,-p 1,0,-p 1, 0) (12) S N =(p 2,p 1,-p 1,p 1,-p 1,p 1,-p 1,p 1,-p 1, p 1 ), where S N = P N1 ( = 1) + P N2, p 1 = N 1, p 2 = N 1 (N 2-1) and N = N 1 N 2 ; i.e. p 1 = 2, p 2 = 8 and S N = (8,2,-2,2,- 2,2,-2,2,-2,2). Periodic signal S NT (t) is shown in Figure. 3d. 3) N=10 N=N 1 N 2... N n = П N i = 5 2 = 10, where N 1 = 5, N 2 = 2, n = 2 and sequence P N2 (8) has cyclic shift = 2 (equivalent to the time shift of P N2 (t) on τ= 2T, Figure. 4). i = 1 P N1 = (p 1,0, 0, 0, 0,p 1, 0, 0, 0, 0) i = 2 P N2 ( =2) = (0, 0,p 2,0, 0, 0, 0,-p 1, 0, 0) S N = (p 1,0, p 2, 0, 0,p 1,0,-p 1, 0,0), (13) Figure-6.Autocorrelation functions R p1 (τ), R p2 (τ), and R NT (τ) for N=10. Recall another property of periodic orthogonal signals with zero cross correlation, whereby the periodic autocorrelation functions of orthogonal signals with zero cross correlation are unaffected by changes of the mutual (relative) time delay (cyclic shift) between orthogonal signals. This is a very important property of periodic signals. When combined with the previous properties of periodic single pulses signals, this property leads to the formation of new types of signals S NT (t) (PTSPS) from S NT (t) (PSPS) that have the same energy and the same perfect periodic autocorrelation functions as PSPS (Figure-2d, Figure-3d, Figure-4d, and Figure-5e). Applying this property to our examples above (6), (7), (8) and (9), we obtain: wheres N = P N1 + P N2 ( = 2),p 1 = N 1,p 2 = N 1 (N 2-1)andN = N 1 N 2 ;i.e.p 1 = 5,p 2 = 5and S N = (5,0,5,0,0,5,0,-5,0,0). Periodic signal S NT (t) is shown in Figure. 4d. 4) N=18 N = N 1 N 2 N n = П N i = = 18, where N 1 = 2, N 2 = 3, N 3 = 3, n = 3 and sequence P N1 (9) has a cyclic shift = 1 (equivalent to a time shift of P N1 (t) on τ = T, Figure. 5), 8858

6 i = 1 P N1 ( =1)= (0,p 1, 0,p 1,0,p 1, 0, p 1, 0,p 1, 0,p 1, 0, p 1, 0,p 1, 0,p 1 ) i = 2 P N2 = (p 2, 0,-p 1, 0,-p 1, 0, p 2,0,-p 1, 0,-p 1, 0, p 2, 0,-p 1, 0,-p 1, 0) i = 3 P N3 = (p 3, 0, 0, 0, 0, 0, -(p 1 +p 2 ), 0, 0, 0, 0, 0, -(p+p 2 ),0, 0, 0, 0,0) S N = (p 2 +p 3,p 1,-p 1,p 1,-p 1,p 1, -p 1, p 1,-p 1,p 1,-p 1,p 1, -p 1, p 1,-p 1,p 1,-p 1,p 1 ), (14) where S N = P N1 ( = 1) + P N2 + P N3, p 1 = N 1, p 2 = N 1 (N 2-1), p 3 = N 1 N 2 (N 3-1), and (p 1 + p 2 ) = N 1 N 2 ; i.e. p 1 = 2, p 2 = 4,p 3 = 12 and S N = (16,2,-2,2,-2,2, -2,2,-2,2,-2,2, -2,2,-2,2,-2,2). 5) N=18 N=N 1 N 2 N n = П N i = = 18, where N 1 = 2, N 2 = 3, N 3 = 3, n = 3 and sequence P N1 (9) has cyclic shift = 1 (equivalent to a time shift of P N1 (t) τ = T, Figure. 5) and negative polarity, i = 1 -P N1 ( =1)= (0,-p 1, 0,-p 1,0,-p 1, 0, -p 1,0,-p 1, 0,-p 1, 0, -p 1, 0,-p 1, 0,-p 1 ) i = 2 P N2 = (p 2, 0,-p 1, 0,-p 1, 0, p 2, 0,-p 1, 0,-p 1, 0, p 2, 0,-p 1, 0,-p 1, 0) i = 3 P N3 = (p 3, 0, 0, 0,0,0, -(p 1 +p 2 ),0, 0, 0, 0, 0, -(p+p 2 ),0, 0, 0, 0, 0) S N = (p 2 +p 3,-p 1,-p 1,-p 1,-p 1,-p 1, -p 1,-p 1,-p 1,-p 1,-p 1,-p 1, -p 1,-p 1,-p 1,-p 1,-p 1,-p 1 ), (15) Where S N = -P N1 ( = 1) + P N2 + P N3, p 1 = N 1,p 2 = N 1 (N 2-1), p 3 = N 1 N 2 (N 3-1), and (p 1 +p 2 ) = N 1 N 2 ; i.e. p 1 = 2, p 2 = 4, p 3 = 12 and S N = (16,-2,-2,-2,-2,-2,,-2,-2,-2,-2,-2) = ((N-2),-2,-2,,-2). Periodic signal S NT (t) is represented in Figure-5e. Notice that signal S NT (t)(15) was found in [4] using a completely different approach.from(11), (12), (13), (14), and (15), it is easy to calculate that for the same N the energy of S N is the same as the energy of S N (6), (7), (8) and (9). It is also easy to show that for the same N, sequences S N and S N, despite their differences, have the same perfect ACF on interval N. Thus, it has been shown that the primary features of periodic time spread signals S NT (t) (PTSPS) (11), (12), (13), (14) and (15) are: a) The energy of signals S NT (t) (PTSPS) on time interval NT are the same as energy of the corresponding single pulse periodic signals S NT (t) (PSPS), i.e. N 2 T (Figure. 1a, Figure. 1c). b) Signals S NT (t) (PTSPS) and the corresponding signals S NT (t) (PSPS) both have the same perfect periodic ACF on time interval NT, i.e. on the period of repetition interval NT (Figure. 1b). The examples (11), (12), (13), (14) and (15) above were used only to show the procedure of transforming PSPS into PTSPS. Observe that there are different ways, i.e. different combinations of multipliers, to represent N as the multiplication of two, three and more integers (2). For some N, for instance for N = 4 (11), there is only one way to represent N, i.e. the one combination N = 2 2. For other N, for instance for N = 10 (12), (13), there are only two ways to represent N, i.e. two different combinations N = 2 5 and N = 5 2. And for other N there are more than two ways to represent N, i.e. more than two different combinations. For instance, for N = 18 there are seven ways, i.e. seven different combinations, N = 2 3 3, N = 3 2 3, N = 3 3 2, N = 3 6, N = 6 3, N = 2 9 and N = 9 2. Each different combination of multipliers for the same N corresponds to a different combination of periodic orthogonal functions P i (t) (3) and subsequently different PTSPS (11), (12), (13), (14), and (15). For N = 18, the samples with only one combination from all nine combinations above were presented, namely N = (9), (14) and (15). The number of different combinations of factors for N, which are not prime numbers, depends of number of factors n (2) and also depends from various combinations of these factors. For instance, for N consisting of three different factors N = A B C, there are 12 different combinations of multipliers: N = A B C, N = A C B, N = B A C, N = B C A, N = C A B, N = C B A, N = A (B C), N = (B C) A, N = B (A C), N = (A C) B, N = C (A B), and N = (A B) C. The total number of factors for N which are not prime numbers N p, i.e. N N p, can be found as [5]: N=b α c β d ɣ r y, (16) where b, c, d,, and r are prime numbers (factors), while α, β, ɣ,, and y are positive integers. The full set of different combinations of factors can be found using the general rules of combinatorics [6]. It is necessary to take into account the signs (plus or minus) of P i (t) (14), (15), and number of cyclic shifts of P i (t) (12), (13). Changes of signs (plus or minus) and changes of the number of cyclic shifts of P i (t) lead to formation of the different types of PTSPS for the same value of N. The Appendix provide examples for N = 12 with numerical calculations in order to show how many different combinations of PTSPS it is possible to obtain during the transformation of PSPS into PTSPS. In [4] it was shown that periodic sequences S (2) NT = ((N-2), -2, -2,, -2) (15) and corresponding signals S (2) NT (t) (Figure. 5e) with perfect periodic ACF on time interval NT exist for all values of N (N > 2), including prime numbers N p. 8859

7 This feature leads to construction of some additional sequences with perfect ACF for the same N. All of the previous examples (11), (12), (13), (14), (15) and the examples in the Appendix (cases 1-7) used P Ni (t) =P N1 (t)=s N1T (t) (i = 1) (Rule 1, above), where S N1T (t) are periodic single pulse signals of duration T, with value N 1 and period of repetition N 1 T, i.e. p 1 =N 1 and T 1 = N 1 T. If we used P (2) N1 = S (2) N1T [4] instead of P N1 = S N1T, then we obtain additional sequences with perfect periodic ACF. Some examples using P (2) N1 = S (2) N1T for N = 12 are provided in the Appendix (cases 8 and 9 corresponding to cases 4 and 7). We analyse a variety of sequences for N = 12 as examples from the Appendix: 1. S 1 N =(5, 1,-1, 1,-1, 1,-1, 1,-1, 1,-1, 1), 2. S 2 N =(4, 2, 1,-1, 1,-1,-2, 2,1,-1, 1,-1), 3. S 3 N =(2, 1, 1, 0, 1,-1,-2, 1,1, 0, 1,-1), 4. S 4 N =(2, 1, 0, 0,-1, 1, 0, 0,-1, 1, 0, 0), 5. S 5 N =(3, 1, 0,-1, 1, 0,-1, 1,0,-1, 1, 0), 6. S 6 N =(5,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1), 7. S 7 N =(1, 0, 0, 1, 0, 0, 1, 0, 0,-1, 0, 0), 8. S 8 N =(3, 1,-1,-1,-3, 1,-1,-1,-3, 1,-1,-1), 9. S 9 N = (2,2,-1,-1,-1,-1,-4, 2,-1,-1,-1,-1). (17) Notice that not all varieties of sequences for N = 12 are included in (17). In the samples in the Appendix (cases 1-7), all of the cyclic shifts of P Ni and changes of signs (pluses or minuses) (13), (15) were not used. At first glance, it is difficult to find the connections between the sequences (17) except their length, N=12. It is difficult because the sequences (17) are represented without coefficients a i (Appendix, cases 1-9) and, as result, the energy of the sequences are different. However, all of the sequences (17) and the periodic time spread pulse signals S NT (t) (PTSPS) corresponding to them have the same main properties: a) All of them were constructed using the same transformation procedure to convert PSPS into PTSPS for N=12. This transformation procedure was presented earlier in this paper. b) All of them have perfect periodic ACF on interval NT, i.e. they have ACF with the one main lobe and with zero side lobes on interval NT. Periodic signals with perfect periodic ACF are used in many telemetric, communication, radio navigation, and radar systems. Below we provide several examples of applications of the concepts presented in this paper in communication, radio navigation, and radar systems [1], [2]. As a first example, applications in communication systems utilize orthogonal signals to transmit information. All S N sequences can be used to make orthogonal matrices with size N x N (N > 2). For instance, for N = 6, M N=6 = M N=6 = , [ ] [ ] We observe that matrices M N of size N x N = 6 x 6 above are orthogonal matrices. These matrices can be used to create orthogonal signals to transmit information as used with orthogonal Walsh-Hadamard matrices in CDMA systems [2]. The second example application is related with coherent radars [1]. As mentioned in [4], coherent band pass signals with binary phase modulation corresponding to sequences S (2) N = ((N-2), -2, -2,, -2) in coherent radar application can provide high time delay (distance) resolution together with high Doppler frequency (speed) resolution. The same is true for signals S NT (t) which can provide high time delay (distance) resolution defined by T (T is the duration of a single pulse) together with high Doppler frequency (speed) resolution 1/NT (where NT is the duration of the entire periodic signal, which is the same as the period of repetition NT). CONCLUSIONS It has been shown that periodic single pulse signals S NT (t) (PSPS) of duration T with period of repetition NT (N > 1, N N p, where N p are prime numbers) can be represented as a linear composition of periodic orthogonal pulse signals. This study also formulates the main rules of the linear composition representation. It has been shown that after PSPS has been represented as a linear composition, these signals can be transformed into periodic time spread pulse signals S NT (t) (PTSPS) where the energy of the original single pulse, which was concentrated on a narrow interval T, is spread over the entire interval NT. During this transformation procedure the main property of PSPS, periodic perfect ACF on interval NT, does not change. This invariance means that the ACF of periodic time spread pulse signals (PTSPS) after transformation from PSPS is the same as the perfect periodic ACF for the original periodic single pulse signals (PSPS). The results of this study advance the theory of pulse signals and can be applied to any periodic pulse signals systems including radar, radio navigation, communication and telemetric systems. 8860

8 APPENDIX N=12 There are seven different combinations of multipliers for N=N 1 N 2 N n = ПN i = N=N 1 N 2 N 3 =2 2 3=12 2. N=N 1 N 2 N 3 =2 3 2=12 3. N=N 1 N 2 N 3 =3 2 2=12 4. N=N 1 N 2 =4 3=12 5. N=N 1 N 2 =3 4=12 6. N=N 1 N 2 =2 6=12 7. N=N 1 N 2 =6 2=12. The main rules of the transformation procedure (6), (7), (8) and (9) are: T 1 =N 1 T, T 2 = (N 1 N 2 ) T, T 3 = (N 1 N 2 N 3 ) T, p 1 = N 1, p 2 = N 1 (N 2-1), p 3 = N 1 N 2 (N 3-1), S NT (t) = P N1 (t)+p N2 (t) (Figure-2, Figure. 3, Figure. 4) and S NT (t) = P N1 (t) + P N2 (t) + P N3 (t) (Figure-5). 1. N=N 1 N 2 N 3 =2 2 3=12, N 1 =2, N 2 =2, N 3 =3, i = 1 P N1 = (2,0,2,0,2,0, 2,0,2,0,2,0) i = 2 P N2 = (2,0,-2,0,2,0, -2,0,2,0,-2,0) i = 3 P N3 = (8,0,0, 0,-4,0, 0,0,-4,0,0,0) S N = (12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0), where (9)S N =P N1 +P N2 +P N3, p 1 =N 1 =2,p 2 =N 1 (N 2-1)=2, p 3 =N 1 N 2 (N 3-1)=8, (p 1 +p 2 )=N 1 N 2 =4, S N = P N1 +P N2 +P N3, and S N =(10,2,-2,2,-2,2,-2,2,-2,2,-2,2) = a 1 (5,1,-1,1,-1,1, -1,1,-1,1, -1,1), where (14) S N =P N1 ( = 1)+P N2 +P N3 and coefficient a 1 =2. 2. N=N 1 N 2 N 3 =2 3 2=12, N 1 =2, N 2 =3, N 3 =2, i = 1 P N1 = (2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0) i = 2 P N2 = (4, 0,-2, 0,-2, 0, 4, 0,-2, 0,-2, 0) i = 3 P N3 = (6, 0, 0, 0, 0, 0, -6, 0, 0, 0, 0, 0) S N = (12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0), where (9) S N =P N1 +P N2 +P N1, p 1 =N 1 =2, p 2 =N 1 (N 2-1)=4, p 3 =N 1 N 2 (N 3-1)=6, (p 1 +p 2 ) = N 1 N 2 =6, and S N =(8,4,2,-2,2,-2, -4, 4,2,-2, 2,-2) = a 2 (4,2,1,-1,1,-1, - 2,2,1,-1,1,-1), where (14) S N = P N1 +P N2 ( =1)+P N3 and coefficient a 2 =2. 3. N=N 1 N 2 N 3 =3 2 2=12, N 1 =3, N 2 =2, N 3 =2, i = 1 P N1 =(3, 0, 0, 3, 0, 0, 3, 0, 0, 3, 0, 0) i = 2 P N2 =(3, 0, 0,-3, 0, 0, 3, 0, 0,-3, 0, 0) i = 3 P N3 =(6, 0, 0, 0, 0, 0, -6, 0, 0, 0, 0, 0) S N =(12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0), where (9) S N =P N1 +P N2 +P N1, p 1 =N 1 =3, p 2 =N 1 (N 2-1)=3, p 3 =N 1 N 2 (N 3-1) = 6, (p 1 +p 2 )=N 1 N 2 =6, S N =P N1 + P N2 + P N1, and S N =(6,3,3,0,3,-3, -6,3,3,0,3,- 3)=a 3 (2,1,1,0,1,-1, -2,1,1,0,1,-1), where (14) S N = P N1 ( = 1)+P N2 ( =2)+P N3 (14) and coefficient a 3 =3. 4. N=N 1 N 2 =4 3=12, N 1 =4, N 2 =3, i = 1 P N1 =(4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0) i = 2 P N2 =(8, 0, 0, 0,-4, 0, 0, 0,-4, 0, 0, 0) S N =(12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0), where (7), (8) S N =P N1 +P N2, p 1 =N 1 =4, p 2 =N 1 (N 2-1)=8, and S N =(8,4,0,0,-4,4, 0,0,-4,4,0,0) = a 4 (2,1,0,0,-1,1, 0,0,-1,1,0,0), where (12), (13) S N =P N1 ( =1)+P N2 and coefficient a 4 =4. 5. N=N 1 N 2 =3 4=12, N 1 =3, N 2 =4, i = 1 P N1 =(3, 0, 0, 3, 0, 0, 3, 0, 0, 3, 0, 0) i = 2 P N2 =(9, 0, 0,-3, 0, 0, -3, 0, 0,-3, 0, 0) S N =(12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0), where (7) S N =P N1 +P N2, p 1 =N 1 =3, p 2 =N 1 (N 2-1)=9, and S N =(9,3,0,-3,3,0,-3,3,0,-3,3,0) = a 5 (3,1,0,-1,1,0, -1,1,0,-1,1,0), where (12) S N = P N1 ( =1)+P N2 and coefficient a 5 =3. 6. N=N 1 N 2 =2 6=12, N 1 =2, N 2 =6, i = 1 P N1 =( 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0) i = 2 P N2 =(10, 0,-2, 0, -2, 0,-2, 0,-2, 0,-2, 0) S N =(12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0), where (7) S N =P N1 +P N2, p 1 =N 1 =2, p 2 =N 1 (N 2-1)=10, and S N = (10,-2,-2,2,-2,-2, -2,-2,-2,-2,-2,-2) = a 6 (5,-1,-1,-1,-1,-1, -1,-1,-1,-1,-1,-1), where (12) S N = -P N1 ( =1)+P N2 and coefficient a 6 =2. 7. N=N 1 N 2 =6 2=12, N 1 =6, N 2 =2, i = 1 P N1 =(6, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0) i = 2 P N2 =( 6, 0, 0, 0, 0, 0, -6, 0, 0, 0, 0, 0) S N =(12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0), where (8) S N =P N1 +P N2, p 1 =N 1 =6, p 2 =N 1 (N 2-1)=6, and S N = (6,0,0,6,0,0, 6,0,0,-6,0,0) = a 7 (1,0,0,1,0,0, 1,0,0,-1,0,0), where (13) S N = P N1 + P N2 ( =3) and coefficient a 7 =6. 8. N=N 1 N 2 =4 3=12, N 1 =4, N 2 =3, i = 1 P (2) N1 =(2,-2,-2,-2,2,-2,-2,-2,2,-2,-2,-2) i = 2 P N2 =( 8,0,0,0,-4,0, 0,0,-4,0,0,0) - S (2) N =(10,-2,-2,-2,-2,-2, -2,-2,-2,-2,-2,-2), where (8) S (2) N =P (2) N1 +P N2, P (2) N1 (t)=(s (2) N1T, S (2) N1T, S (2) N1T), p 1 = N 1 = 4, p 2 = N 1 (N 2-1)=8, S (2) N1T = ((N 1-2),-2,-2,-2) = (2,-2,-2,-2), ands N = (6,2,-2,-2,-6,2, -2,-2,-6,2,-2,-2) = a 8 (3,1,-1,-1,-3,1, -1,-1,-3,1,-1,-1), where (13) S N =P (2) N1 ( =1)+P N2 and coefficient a 8 =2. 9. N=N 1 N 2 =6 2=12, N 1 =6, N 2 =2, i = 1 P (2) N1 =(4,-2,-2,-2,-2,-2, 4,-2,-2,-2,-2,-2) i = 2 P N2 =( 6,0,0,0,0,0, -6,0,0,0,0,0) S (2) N =(10,-2,-2,-2,-2,-2, -2,-2,-2,-2,-2,-2), 8861

9 where (8) S (2) N =P (2) N1 +P N2, P (2) N1(t)=(S (2) N1T, S (2) N1T), p 1 = N 1 = 6, p 2 = N 1 (N 2-1) = 6, S (2) N1T =((N 1-2),-2,-2,-2,-2,-2)=(4,-2,-2,-2,-2,-2), and S N = (4,4,-2,-2,-2,-2,-8,4,-2,-2,-2,-2) =a 9 (2,2,-1,-1,-1,-1, -4,2,-1,-1,-1,-1), where (13) S N =P (2) N1 ( =1)+P N2 and coefficient a 9 =2. REFERENCES [1] Nadav Levanon, Eli Mozeson Radar Signals. John Wiley & Sons, Inc. USA. [2] Valery P. Ipatov Spread Spectrum and CDMA: Principles and Applications. John Wiley & Sons Ltd., England. [3] Pingzhi Fan and Michael Darnell Sequence Design for Communication Applications. Research Study Press Ltd., England. [4] A.V. Titov and G.J. Kazmierczak Periodic Non-Binary Sequences with Perfect Autocorrelation. International Journal of Engineering Technology and Computer Research (IJETCR). 5(3): [5] Hardy. G. H, Wright E. M An Introduction to Theory of Numbers. (Fifth ed.) Oxford University Press, USA. [6] Erickson M. J Introduction to Combinatorics. New York: Wiley. 8862

PERIODIC ORTHOGONAL BINARY SIGNALS WITH ZERO CROSS CORRELATION

PERIODIC ORTHOGONAL BINARY SIGNALS WITH ZERO CROSS CORRELATION PERIODIC ORTHOGONAL BINARY SIGNALS WITH ZERO CROSS CORRELATION A. V. Titov 1 and G. J. Kazmierczak 2 1 Electro Technical University LETI in St. Petersburg, Russia 2 Cybersecurity Consultant, Princeton,

More information

FPGA Implementation of Pseudo Noise Sequences based on Quadratic Residue Theory

FPGA Implementation of Pseudo Noise Sequences based on Quadratic Residue Theory FPGA Implementation of Pseudo Noise Sequences based on Quadratic Residue Theory A. Rajagopal Dept. of E&C, K.L. Sudha Dept.of E&C, Dundi Ajay Dept. of E&C, ABSTRACT Pseudo Noise (PN) sequences are defined

More information

Direct-Sequence Spread-Spectrum

Direct-Sequence Spread-Spectrum Chapter 3 Direct-Sequence Spread-Spectrum In this chapter we consider direct-sequence spread-spectrum systems. Unlike frequency-hopping, a direct-sequence signal occupies the entire bandwidth continuously.

More information

Correlator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi

Correlator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi Chapter 8 Correlator I. Basics D. Anish Roshi 8.1 Introduction A radio interferometer measures the mutual coherence function of the electric field due to a given source brightness distribution in the sky.

More information

u(t)u (t + τ) exp(j2πνt)dt 3.1 MAIN PROPERTIES OF THE AMBIGUITY FUNCTION

u(t)u (t + τ) exp(j2πνt)dt 3.1 MAIN PROPERTIES OF THE AMBIGUITY FUNCTION 3 AMBIGUITY FUNCTION The ambiguity function (AF) represents the time response of a filter matched to a given finite energy signal when the signal is received with a delay τ and a Doppler shift ν relative

More information

ANALYSIS OF A PARTIAL DECORRELATOR IN A MULTI-CELL DS/CDMA SYSTEM

ANALYSIS OF A PARTIAL DECORRELATOR IN A MULTI-CELL DS/CDMA SYSTEM ANAYSIS OF A PARTIA DECORREATOR IN A MUTI-CE DS/CDMA SYSTEM Mohammad Saquib ECE Department, SU Baton Rouge, A 70803-590 e-mail: saquib@winlab.rutgers.edu Roy Yates WINAB, Rutgers University Piscataway

More information

Stochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno

Stochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno Stochastic Processes M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno 1 Outline Stochastic (random) processes. Autocorrelation. Crosscorrelation. Spectral density function.

More information

MATRICES. a m,1 a m,n A =

MATRICES. a m,1 a m,n A = MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of

More information

Multi User Detection I

Multi User Detection I January 12, 2005 Outline Overview Multiple Access Communication Motivation: What is MU Detection? Overview of DS/CDMA systems Concept and Codes used in CDMA CDMA Channels Models Synchronous and Asynchronous

More information

Design of MMSE Multiuser Detectors using Random Matrix Techniques

Design of MMSE Multiuser Detectors using Random Matrix Techniques Design of MMSE Multiuser Detectors using Random Matrix Techniques Linbo Li and Antonia M Tulino and Sergio Verdú Department of Electrical Engineering Princeton University Princeton, New Jersey 08544 Email:

More information

Novel Waveform Design and Scheduling For High-Resolution Radar and Interleaving

Novel Waveform Design and Scheduling For High-Resolution Radar and Interleaving Novel Waveform Design and Scheduling For High-Resolution Radar and Interleaving Phase Phase Basic Signal Processing for Radar 101 x = α 1 s[n D 1 ] + α 2 s[n D 2 ] +... s signal h = filter if h = s * "matched

More information

Doppler Tolerance, Complementary Code Sets and Generalized Thue-Morse Sequences

Doppler Tolerance, Complementary Code Sets and Generalized Thue-Morse Sequences Doppler Tolerance, Complementary Code Sets and Generalized Thue-Morse Sequences Hieu D. Nguyen Department of Mathematics, Rowan University, Glassboro, NJ Gregory E. Coxson Naval Research Laboratory, Washington

More information

Topic 3. Design of Sequences with Low Correlation

Topic 3. Design of Sequences with Low Correlation Topic 3. Design of Sequences with Low Correlation M-sequences and Quadratic Residue Sequences 2 Multiple Trace Term Sequences and WG Sequences 3 Gold-pair, Kasami Sequences, and Interleaved Sequences 4

More information

2016 Spring: The Final Exam of Digital Communications

2016 Spring: The Final Exam of Digital Communications 2016 Spring: The Final Exam of Digital Communications The total number of points is 131. 1. Image of Transmitter Transmitter L 1 θ v 1 As shown in the figure above, a car is receiving a signal from a remote

More information

DOPPLER RESILIENT GOLAY COMPLEMENTARY PAIRS FOR RADAR

DOPPLER RESILIENT GOLAY COMPLEMENTARY PAIRS FOR RADAR DOPPLER RESILIENT GOLAY COMPLEMENTARY PAIRS FOR RADAR Ali Pezeshki 1, Robert Calderbank 1, Stephen D. Howard 2, and William Moran 3 1 Princeton University, Princeton, NJ 8544, USA 2 DSTO, Edinburgh 51,

More information

Research Article BER Analysis Using Beat Probability Method of 3D Optical CDMA Networks with Double Balanced Detection

Research Article BER Analysis Using Beat Probability Method of 3D Optical CDMA Networks with Double Balanced Detection Mathematical Problems in Engineering Volume 2015, Article ID 456829, 6 pages http://dxdoiorg/101155/2015/456829 Research Article BER Analysis Using Beat Probability Method of 3D Optical CDMA Networks with

More information

Power Spectral Density of Digital Modulation Schemes

Power Spectral Density of Digital Modulation Schemes Digital Communication, Continuation Course Power Spectral Density of Digital Modulation Schemes Mikael Olofsson Emil Björnson Department of Electrical Engineering ISY) Linköping University, SE-581 83 Linköping,

More information

Advanced 3G and 4G Wireless Communication Prof. Aditya K. Jagannatham Department of Electrical Engineering Indian Institute of Technology, Kanpur

Advanced 3G and 4G Wireless Communication Prof. Aditya K. Jagannatham Department of Electrical Engineering Indian Institute of Technology, Kanpur Advanced 3G and 4G Wireless Communication Prof. Aditya K. Jagannatham Department of Electrical Engineering Indian Institute of Technology, Kanpur Lecture - 12 Doppler Spectrum and Jakes Model Welcome to

More information

Large Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences

Large Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences Large Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences Guang Gong 1 Fei Huo 1 and Yang Yang 2,3 1 Department of Electrical and Computer Engineering University of

More information

Chapter 4. Matrices and Matrix Rings

Chapter 4. Matrices and Matrix Rings Chapter 4 Matrices and Matrix Rings We first consider matrices in full generality, i.e., over an arbitrary ring R. However, after the first few pages, it will be assumed that R is commutative. The topics,

More information

Carry Look Ahead Adders

Carry Look Ahead Adders Carry Look Ahead Adders Lesson Objectives: The objectives of this lesson are to learn about: 1. Carry Look Ahead Adder circuit. 2. Binary Parallel Adder/Subtractor circuit. 3. BCD adder circuit. 4. Binary

More information

LECTURE 16 AND 17. Digital signaling on frequency selective fading channels. Notes Prepared by: Abhishek Sood

LECTURE 16 AND 17. Digital signaling on frequency selective fading channels. Notes Prepared by: Abhishek Sood ECE559:WIRELESS COMMUNICATION TECHNOLOGIES LECTURE 16 AND 17 Digital signaling on frequency selective fading channels 1 OUTLINE Notes Prepared by: Abhishek Sood In section 2 we discuss the receiver design

More information

High Voltage DC Transmission Prof. Dr. S.N. Singh Department of Electrical Engineering Indian Institute of Technology, Kanpur

High Voltage DC Transmission Prof. Dr. S.N. Singh Department of Electrical Engineering Indian Institute of Technology, Kanpur High Voltage DC Transmission Prof. Dr. S.N. Singh Department of Electrical Engineering Indian Institute of Technology, Kanpur Module No. # 02 Lecture No. # 09 Analysis of Converter Circuit So, let us,

More information

Networks and Systems Prof V.G K. Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 10 Fourier Series (10)

Networks and Systems Prof V.G K. Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 10 Fourier Series (10) Networks and Systems Prof V.G K. Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 10 Fourier Series (10) What we have seen in the previous lectures, is first

More information

LIKELIHOOD RECEIVER FOR FH-MFSK MOBILE RADIO*

LIKELIHOOD RECEIVER FOR FH-MFSK MOBILE RADIO* LIKELIHOOD RECEIVER FOR FH-MFSK MOBILE RADIO* Item Type text; Proceedings Authors Viswanathan, R.; S.C. Gupta Publisher International Foundation for Telemetering Journal International Telemetering Conference

More information

Hadamard speckle contrast reduction

Hadamard speckle contrast reduction Published in OPTICS LETTERS 29, -3 (2004) Hadamard speckle contrast reduction Jahja I. Trisnadi Silicon Light Machines, 385 Moffett Park Drive, Sunnyvale, California 94089 The conditon for a diffuser to

More information

Review of Analog Signal Analysis

Review of Analog Signal Analysis Review of Analog Signal Analysis Chapter Intended Learning Outcomes: (i) Review of Fourier series which is used to analyze continuous-time periodic signals (ii) Review of Fourier transform which is used

More information

Hadamard Codes. A Hadamard matrix of order n is a matrix H n with elements 1 or 1 such that H n H t n = n I n. For example,

Hadamard Codes. A Hadamard matrix of order n is a matrix H n with elements 1 or 1 such that H n H t n = n I n. For example, Coding Theory Massoud Malek Hadamard Codes A Hadamard matrix of order n is a matrix H n with elements 1 or 1 such that H n H t n = n I n. For example, [ ] 1 1 1 1 1 1 1 1 1 1 H 1 = [1], H 2 =, H 1 1 4

More information

Numerical Analysis of Different Communication Signals Used in Passive Radar Systems

Numerical Analysis of Different Communication Signals Used in Passive Radar Systems BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume, No 4 Sofia 2 Numerical Analysis of Different Communication Signals Used in Passive Radar Systems Avgust Kabakchiev,2, Vladimir

More information

Random Residue Sequences and the Number Theoretic Hilbert Transform

Random Residue Sequences and the Number Theoretic Hilbert Transform Random Residue Sequences and the Number Theoretic Hilbert Transform Vamsi Sashank Kotagiri Oklahoma State University, Stillwater Abstract This paper presents random residue sequences derived from the number

More information

Performance Analysis of Spread Spectrum CDMA systems

Performance Analysis of Spread Spectrum CDMA systems 1 Performance Analysis of Spread Spectrum CDMA systems 16:33:546 Wireless Communication Technologies Spring 5 Instructor: Dr. Narayan Mandayam Summary by Liang Xiao lxiao@winlab.rutgers.edu WINLAB, Department

More information

Matched Filtering for Generalized Stationary Processes

Matched Filtering for Generalized Stationary Processes Matched Filtering for Generalized Stationary Processes to be submitted to IEEE Transactions on Information Theory Vadim Olshevsky and Lev Sakhnovich Department of Mathematics University of Connecticut

More information

Principles of Communications Lecture 8: Baseband Communication Systems. Chih-Wei Liu 劉志尉 National Chiao Tung University

Principles of Communications Lecture 8: Baseband Communication Systems. Chih-Wei Liu 劉志尉 National Chiao Tung University Principles of Communications Lecture 8: Baseband Communication Systems Chih-Wei Liu 劉志尉 National Chiao Tung University cwliu@twins.ee.nctu.edu.tw Outlines Introduction Line codes Effects of filtering Pulse

More information

Aperiodic correlation and the merit factor

Aperiodic correlation and the merit factor Aperiodic correlation and the merit factor Aina Johansen 02.11.2009 Correlation The periodic correlation between two binary sequences {x t } and {y t } of length n at shift τ is defined as n 1 θ x,y (τ)

More information

g(.) 1/ N 1/ N Decision Decision Device u u u u CP

g(.) 1/ N 1/ N Decision Decision Device u u u u CP Distributed Weak Signal Detection and Asymptotic Relative Eciency in Dependent Noise Hakan Delic Signal and Image Processing Laboratory (BUSI) Department of Electrical and Electronics Engineering Bogazici

More information

Onamethodtoimprove correlation properties of orthogonal polyphase spreading sequences

Onamethodtoimprove correlation properties of orthogonal polyphase spreading sequences Regular paper Onamethodtoimprove correlation properties of orthogonal polyphase spreading sequences Beata J. Wysocki and Tadeusz A. Wysocki Abstract In this paper, we propose a simple but efficient method

More information

Module 3: 3D Constitutive Equations Lecture 10: Constitutive Relations: Generally Anisotropy to Orthotropy. The Lecture Contains: Stress Symmetry

Module 3: 3D Constitutive Equations Lecture 10: Constitutive Relations: Generally Anisotropy to Orthotropy. The Lecture Contains: Stress Symmetry The Lecture Contains: Stress Symmetry Strain Symmetry Strain Energy Density Function Material Symmetry Symmetry with respect to a Plane Symmetry with respect to two Orthogonal Planes Homework References

More information

Digital Transmission Methods S

Digital Transmission Methods S Digital ransmission ethods S-7.5 Second Exercise Session Hypothesis esting Decision aking Gram-Schmidt method Detection.K.K. Communication Laboratory 5//6 Konstantinos.koufos@tkk.fi Exercise We assume

More information

Even Periodic and Odd Periodic Complementary Sequence Pairs from Generalized Boolean Functions

Even Periodic and Odd Periodic Complementary Sequence Pairs from Generalized Boolean Functions Even Periodic and Odd Periodic Complementary Sequence Pairs from Generalized Boolean Functions Yang Yang 1,2,3 Xiaohu Tang 1 and Guang Gong 2 1 Institute of Mobile Communications, Southwest Jiaotong University

More information

An Overview of Complex Hadamard Cubes

An Overview of Complex Hadamard Cubes Rose- Hulman Undergraduate Mathematics Journal An Overview of Complex Hadamard Cubes Ben Lantz a Michael Zowada b Volume 3, No. 2, Fall 202 Sponsored by Rose-Hulman Institute of Technology Department of

More information

New Polyphase Complementary Sequence Sets for Wireless Communication Systems

New Polyphase Complementary Sequence Sets for Wireless Communication Systems Vol.7 o. (04) pp.47-56 http://dx.doi.org/0.457/ijhit.04.7.. ew Polyphase Complementary Sequence Sets for Wireless Communication Systems Fanxin Zeng Xiaoping Zeng Zhenyu Zhang and Guixin Xuan Chongqing

More information

Differential Equations and Linear Algebra C. Henry Edwards David E. Penney Third Edition

Differential Equations and Linear Algebra C. Henry Edwards David E. Penney Third Edition Differential Equations and Linear Algebra C. Henry Edwards David E. Penney Third Edition Pearson Education Limited Edinburgh Gate Harlow Essex CM20 2JE England and Associated Companies throughout the world

More information

Section 4. Quantitative Aptitude

Section 4. Quantitative Aptitude Section 4 Quantitative Aptitude You will get 35 questions from Quantitative Aptitude in the SBI Clerical 2016 Prelims examination and 50 questions in the Mains examination. One new feature of the 2016

More information

ON THE CONSTRUCTION OF HADAMARD MATRICES. P.K. Manjhi 1, Arjun Kumar 2. Vinoba Bhave University Hazaribag, INDIA

ON THE CONSTRUCTION OF HADAMARD MATRICES. P.K. Manjhi 1, Arjun Kumar 2. Vinoba Bhave University Hazaribag, INDIA International Journal of Pure and Applied Mathematics Volume 120 No. 1 2018, 51-58 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v120i1.4

More information

Fourier Transform for Continuous Functions

Fourier Transform for Continuous Functions Fourier Transform for Continuous Functions Central goal: representing a signal by a set of orthogonal bases that are corresponding to frequencies or spectrum. Fourier series allows to find the spectrum

More information

Continuous Wave Data Analysis: Fully Coherent Methods

Continuous Wave Data Analysis: Fully Coherent Methods Continuous Wave Data Analysis: Fully Coherent Methods John T. Whelan School of Gravitational Waves, Warsaw, 3 July 5 Contents Signal Model. GWs from rotating neutron star............ Exercise: JKS decomposition............

More information

(Refer Slide Time: 01:30)

(Refer Slide Time: 01:30) Networks and Systems Prof V.G K.Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 11 Fourier Series (5) Continuing our discussion of Fourier series today, we will

More information

E303: Communication Systems

E303: Communication Systems E303: Communication Systems Professor A. Manikas Chair of Communications and Array Processing Imperial College London An Overview of Fundamentals: PN-codes/signals & Spread Spectrum (Part B) Prof. A. Manikas

More information

A Computationally Efficient Block Transmission Scheme Based on Approximated Cholesky Factors

A Computationally Efficient Block Transmission Scheme Based on Approximated Cholesky Factors A Computationally Efficient Block Transmission Scheme Based on Approximated Cholesky Factors C. Vincent Sinn Telecommunications Laboratory University of Sydney, Australia cvsinn@ee.usyd.edu.au Daniel Bielefeld

More information

Some V(12,t) vectors and designs from difference and quasi-difference matrices

Some V(12,t) vectors and designs from difference and quasi-difference matrices AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 4 (28), Pages 69 85 Some V(12,t) vectors and designs from difference and quasi-difference matrices R Julian R Abel School of Mathematics and Statistics University

More information

On A Special Case Of A Conjecture Of Ryser About Hadamard Circulant Matrices

On A Special Case Of A Conjecture Of Ryser About Hadamard Circulant Matrices Applied Mathematics E-Notes, 1(01), 18-188 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/amen/ On A Special Case Of A Conjecture Of Ryser About Hadamard Circulant Matrices

More information

ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES

ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most 64 are

More information

A UNIFIED APPROACH TO FOURIER-CLIFFORD-PROMETHEUS SEQUENCES, TRANSFORMS AND FILTER BANKS

A UNIFIED APPROACH TO FOURIER-CLIFFORD-PROMETHEUS SEQUENCES, TRANSFORMS AND FILTER BANKS A UNIFIED APPROACH TO FOURIER-CLIFFORD-PROMETHEUS SEQUENCES, TRANSFORMS AND FILTER BANKS Ekaterina L.-Rundblad, Valeriy Labunets, and Ilya Nikitin Ural State Technical University Ekaterinburg, Russia lab@rtf.ustu.ru

More information

The Performance of Quaternary Amplitude Modulation with Quaternary Spreading in the Presence of Interfering Signals

The Performance of Quaternary Amplitude Modulation with Quaternary Spreading in the Presence of Interfering Signals Clemson University TigerPrints All Theses Theses 1-015 The Performance of Quaternary Amplitude Modulation with Quaternary Spreading in the Presence of Interfering Signals Allison Manhard Clemson University,

More information

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 41 Pulse Code Modulation (PCM) So, if you remember we have been talking

More information

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Lecture - 6 Postulates of Quantum Mechanics II (Refer Slide Time: 00:07) In my last lecture,

More information

Intercarrier and Intersymbol Interference Analysis of OFDM Systems on Time-Varying channels

Intercarrier and Intersymbol Interference Analysis of OFDM Systems on Time-Varying channels Intercarrier and Intersymbol Interference Analysis of OFDM Systems on Time-Varying channels Van Duc Nguyen, Hans-Peter Kuchenbecker University of Hannover, Institut für Allgemeine Nachrichtentechnik Appelstr.

More information

Performances of Marcum s (S + N) N Integration Scheme with Fluctuating Targets

Performances of Marcum s (S + N) N Integration Scheme with Fluctuating Targets Performances of Marcum s S + N N Integration Scheme with Fluctuating Targets ALEXANDER SADOGURSK, Member, IEEE NADAV LEVANON, Life Fellow, IEEE Tel Aviv University The performances of Marcum s signal +

More information

arxiv: v1 [math.co] 21 Sep 2015

arxiv: v1 [math.co] 21 Sep 2015 Chocolate Numbers arxiv:1509.06093v1 [math.co] 21 Sep 2015 Caleb Ji, Tanya Khovanova, Robin Park, Angela Song September 22, 2015 Abstract In this paper, we consider a game played on a rectangular m n gridded

More information

SNR i = 2E b 6N 3. Where

SNR i = 2E b 6N 3. Where Correlation Properties Of Binary Sequences Generated By The Logistic Map-Application To DS-CDMA *ZOUHAIR BEN JEMAA, **SAFYA BELGHITH *EPFL DSC LANOS ELE 5, 05 LAUSANNE **LABORATOIRE SYSCOM ENIT, 002 TUNIS

More information

Low-complexity generation of scalable complete complementary sets of sequences

Low-complexity generation of scalable complete complementary sets of sequences University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 2006 Low-complexity generation of scalable complete complementary sets

More information

--------------------------------------------------------------------------------------------- Math 6023 Topics: Design and Graph Theory ---------------------------------------------------------------------------------------------

More information

Lüke and power residue sequence diffusers

Lüke and power residue sequence diffusers Lüke and power residue sequence diffusers Dadiotis, K, Angus, JAS and Cox, TJ http://dx.doi.org/10.1121/1.2885761 Title Authors Type URL Lüke and power residue sequence diffusers Dadiotis, K, Angus, JAS

More information

These outputs can be written in a more convenient form: with y(i) = Hc m (i) n(i) y(i) = (y(i); ; y K (i)) T ; c m (i) = (c m (i); ; c m K(i)) T and n

These outputs can be written in a more convenient form: with y(i) = Hc m (i) n(i) y(i) = (y(i); ; y K (i)) T ; c m (i) = (c m (i); ; c m K(i)) T and n Binary Codes for synchronous DS-CDMA Stefan Bruck, Ulrich Sorger Institute for Network- and Signal Theory Darmstadt University of Technology Merckstr. 25, 6428 Darmstadt, Germany Tel.: 49 65 629, Fax:

More information

Unitary Design of Radar Waveform Diversity Sets

Unitary Design of Radar Waveform Diversity Sets Unitary Design of Radar Waveform Diversity Sets Michael D. Zoltowski, ariq R. Qureshi, Robert Calderbank, and William Moran Abstract In this work, multiple radar waveforms are simultaneously transmitted,

More information

ECS455: Chapter 5 OFDM. ECS455: Chapter 5 OFDM. OFDM: Overview. OFDM Applications. Dr.Prapun Suksompong prapun.com/ecs455

ECS455: Chapter 5 OFDM. ECS455: Chapter 5 OFDM. OFDM: Overview. OFDM Applications. Dr.Prapun Suksompong prapun.com/ecs455 ECS455: Chapter 5 OFDM OFDM: Overview Let S = (S 1, S 2,, S ) contains the information symbols. S IFFT FFT Inverse fast Fourier transform Fast Fourier transform 1 Dr.Prapun Suksompong prapun.com/ecs455

More information

4.4 Microstrip dipole

4.4 Microstrip dipole 4.4 Microstrip dipole Basic theory Microstrip antennas are frequently used in today's wireless communication systems. Thanks to their low profile, they can be mounted to the walls of buildings, to the

More information

reality is complex process

reality is complex process ISS0080 Automation and Process Control Lecture 5 1 Process models the desire to describe reality Model of the process, model simplication, identication. model reality is complex process Replaces the original;

More information

Lemma 8: Suppose the N by N matrix A has the following block upper triangular form:

Lemma 8: Suppose the N by N matrix A has the following block upper triangular form: 17 4 Determinants and the Inverse of a Square Matrix In this section, we are going to use our knowledge of determinants and their properties to derive an explicit formula for the inverse of a square matrix

More information

This appendix provides a very basic introduction to linear algebra concepts.

This appendix provides a very basic introduction to linear algebra concepts. APPENDIX Basic Linear Algebra Concepts This appendix provides a very basic introduction to linear algebra concepts. Some of these concepts are intentionally presented here in a somewhat simplified (not

More information

Ch. 15 Wavelet-Based Compression

Ch. 15 Wavelet-Based Compression Ch. 15 Wavelet-Based Compression 1 Origins and Applications The Wavelet Transform (WT) is a signal processing tool that is replacing the Fourier Transform (FT) in many (but not all!) applications. WT theory

More information

Parallel Singular Value Decomposition. Jiaxing Tan

Parallel Singular Value Decomposition. Jiaxing Tan Parallel Singular Value Decomposition Jiaxing Tan Outline What is SVD? How to calculate SVD? How to parallelize SVD? Future Work What is SVD? Matrix Decomposition Eigen Decomposition A (non-zero) vector

More information

Quantum Mechanics-I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras. Lecture - 21 Square-Integrable Functions

Quantum Mechanics-I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras. Lecture - 21 Square-Integrable Functions Quantum Mechanics-I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Lecture - 21 Square-Integrable Functions (Refer Slide Time: 00:06) (Refer Slide Time: 00:14) We

More information

Optimum Time-Frequency Distribution for Detecting a Discrete-Time Chirp Signal in White Gaussian Noise. Abstract

Optimum Time-Frequency Distribution for Detecting a Discrete-Time Chirp Signal in White Gaussian Noise. Abstract Optimum Time-Frequency Distribution for Detecting A. Yasotharan 1103-1760 Main Street West Hamilton, Ontario, L8S 1H Canada yaso-yasotharan@hotmail.com T. Thayaparan Defence R & D Canada - Ottawa Department

More information

1 Introduction. 2 Calculation of the output signal

1 Introduction. 2 Calculation of the output signal (c) Peter Fischer, 2006-2013 Institute for Computer Engineering (ZITI), Heidelberg University, Germany email address: peter.fischer@ziti.uni-heidelberg.de In this text I will show how the period of the

More information

6.003: Signal Processing

6.003: Signal Processing 6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018

More information

WHITEPAPER: ACHIEVING THE CRAMER-RAO LOWER BOUND IN GPS TIME-OF-ARRIVAL ESTIMATION, A FREQUENCY DOMAIN WEIGHTED LEAST-SQUARES ESTIMATOR APPROACH

WHITEPAPER: ACHIEVING THE CRAMER-RAO LOWER BOUND IN GPS TIME-OF-ARRIVAL ESTIMATION, A FREQUENCY DOMAIN WEIGHTED LEAST-SQUARES ESTIMATOR APPROACH WHITEPAPER: ACHIEVING THE CRAMER-RAO LOWER BOUND IN GPS TIME-OF-ARRIVAL ESTIMATION, A FREQUENCY DOMAIN WEIGHTED LEAST-SQUARES ESTIMATOR APPROACH KENNETH M PESYNA, JR AND TODD E HUMPHREYS THE UNIVERSITY

More information

Virtual Array Processing for Active Radar and Sonar Sensing

Virtual Array Processing for Active Radar and Sonar Sensing SCHARF AND PEZESHKI: VIRTUAL ARRAY PROCESSING FOR ACTIVE SENSING Virtual Array Processing for Active Radar and Sonar Sensing Louis L. Scharf and Ali Pezeshki Abstract In this paper, we describe how an

More information

Non Orthogonal Multiple Access for 5G and beyond

Non Orthogonal Multiple Access for 5G and beyond Non Orthogonal Multiple Access for 5G and beyond DIET- Sapienza University of Rome mai.le.it@ieee.org November 23, 2018 Outline 1 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density

More information

Introduction to tensors and dyadics

Introduction to tensors and dyadics 1 Introduction to tensors and dyadics 1.1 Introduction Tensors play a fundamental role in theoretical physics. The reason for this is that physical laws written in tensor form are independent of the coordinate

More information

Analog Electronics 2 ICS905

Analog Electronics 2 ICS905 Analog Electronics 2 ICS905 G. Rodriguez-Guisantes Dépt. COMELEC http://perso.telecom-paristech.fr/ rodrigez/ens/cycle_master/ November 2016 2/ 67 Schedule Radio channel characteristics ; Analysis and

More information

Chapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005

Chapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005 Chapter 7 Error Control Coding Mikael Olofsson 2005 We have seen in Chapters 4 through 6 how digital modulation can be used to control error probabilities. This gives us a digital channel that in each

More information

Lecture 27 Frequency Response 2

Lecture 27 Frequency Response 2 Lecture 27 Frequency Response 2 Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/6/12 1 Application of Ideal Filters Suppose we can generate a square wave with a fundamental period

More information

MAT 1332: CALCULUS FOR LIFE SCIENCES. Contents. 1. Review: Linear Algebra II Vectors and matrices Definition. 1.2.

MAT 1332: CALCULUS FOR LIFE SCIENCES. Contents. 1. Review: Linear Algebra II Vectors and matrices Definition. 1.2. MAT 1332: CALCULUS FOR LIFE SCIENCES JING LI Contents 1 Review: Linear Algebra II Vectors and matrices 1 11 Definition 1 12 Operations 1 2 Linear Algebra III Inverses and Determinants 1 21 Inverse Matrices

More information

Lecture 19 Optical MEMS (1)

Lecture 19 Optical MEMS (1) EEL6935 Advanced MEMS (Spring 5) Instructor: Dr. Huikai Xie Lecture 19 Optical MEMS (1) Agenda: Optics Review EEL6935 Advanced MEMS 5 H. Xie 3/8/5 1 Optics Review Nature of Light Reflection and Refraction

More information

A construction of optimal sets of FH sequences

A construction of optimal sets of FH sequences AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 50 2011, Pages 37 44 A construction of optimal sets of FH sequences Bin Wen Department of Mathematics Changshu Institute of Technology Changshu 215500, Jiangsu

More information

Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation M A Hasan and C Negre Abstract We study Dickson bases for binary field representation Such representation

More information

9 Appendix. Determinants and Cramer s formula

9 Appendix. Determinants and Cramer s formula LINEAR ALGEBRA: THEORY Version: August 12, 2000 133 9 Appendix Determinants and Cramer s formula Here we the definition of the determinant in the general case and summarize some features Then we show how

More information

2-D SENSOR POSITION PERTURBATION ANALYSIS: EQUIVALENCE TO AWGN ON ARRAY OUTPUTS. Volkan Cevher, James H. McClellan

2-D SENSOR POSITION PERTURBATION ANALYSIS: EQUIVALENCE TO AWGN ON ARRAY OUTPUTS. Volkan Cevher, James H. McClellan 2-D SENSOR POSITION PERTURBATION ANALYSIS: EQUIVALENCE TO AWGN ON ARRAY OUTPUTS Volkan Cevher, James H McClellan Georgia Institute of Technology Atlanta, GA 30332-0250 cevher@ieeeorg, jimmcclellan@ecegatechedu

More information

Class Equation & Conjugacy in Groups

Class Equation & Conjugacy in Groups Subject: ALEBRA - V Lesson: Class Equation & Conjugacy in roups Lesson Developer: Shweta andhi Department / College: Department of Mathematics, Miranda House, University of Delhi Institute of Lifelong

More information

TIME REVERSAL COMPRESSIVE SENSING MIMO RADAR SYSTEMS NICK SAJADI

TIME REVERSAL COMPRESSIVE SENSING MIMO RADAR SYSTEMS NICK SAJADI TIME REVERSAL COMPRESSIVE SENSING MIMO RADAR SYSTEMS NICK SAJADI A DISSERTATION SUBMITTED TO THE FACULTY OF GRADUATE STUDIES IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY

More information

Markov Chains, Stochastic Processes, and Matrix Decompositions

Markov Chains, Stochastic Processes, and Matrix Decompositions Markov Chains, Stochastic Processes, and Matrix Decompositions 5 May 2014 Outline 1 Markov Chains Outline 1 Markov Chains 2 Introduction Perron-Frobenius Matrix Decompositions and Markov Chains Spectral

More information

LAMC Beginners Circle October 6, Oleg Gleizer. A problem solving session. Problem 1 Put the right sign, >, <, or =, between the fractions.

LAMC Beginners Circle October 6, Oleg Gleizer. A problem solving session. Problem 1 Put the right sign, >, <, or =, between the fractions. LAMC Beginners Circle October 6, 2013 Oleg Gleizer oleg1140@gmail.com A problem solving session Problem 1 Put the right sign, >,

More information

ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform

ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform Department of Electrical Engineering University of Arkansas ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Introduction Fourier Transform Properties of Fourier

More information

Some Results on the Arithmetic Correlation of Sequences

Some Results on the Arithmetic Correlation of Sequences Some Results on the Arithmetic Correlation of Sequences Mark Goresky Andrew Klapper Abstract In this paper we study various properties of arithmetic correlations of sequences. Arithmetic correlations are

More information

Application of the Representation Theory of Symmetric Groups for the Computation of Chromatic Polynomials of Graphs

Application of the Representation Theory of Symmetric Groups for the Computation of Chromatic Polynomials of Graphs Application of the Representation Theory of Symmetric Groups for the Computation of Chromatic Polynomials of Graphs Mikhail Klin Christian Pech 1 Department of Mathematics Ben Gurion University of the

More information

IB Paper 6: Signal and Data Analysis

IB Paper 6: Signal and Data Analysis IB Paper 6: Signal and Data Analysis Handout 5: Sampling Theory S Godsill Signal Processing and Communications Group, Engineering Department, Cambridge, UK Lent 2015 1 / 85 Sampling and Aliasing All of

More information

Week 1 Quantitative Analysis of Financial Markets Distributions A

Week 1 Quantitative Analysis of Financial Markets Distributions A Week 1 Quantitative Analysis of Financial Markets Distributions A Christopher Ting http://www.mysmu.edu/faculty/christophert/ Christopher Ting : christopherting@smu.edu.sg : 6828 0364 : LKCSB 5036 October

More information

1 Mathematical Preliminaries

1 Mathematical Preliminaries Mathematical Preliminaries We shall go through in this first chapter all of the mathematics needed for reading the rest of this book. The reader is expected to have taken a one year course in differential

More information

A Simple Example Binary Hypothesis Testing Optimal Receiver Frontend M-ary Signal Sets Message Sequences. possible signals has been transmitted.

A Simple Example Binary Hypothesis Testing Optimal Receiver Frontend M-ary Signal Sets Message Sequences. possible signals has been transmitted. Introduction I We have focused on the problem of deciding which of two possible signals has been transmitted. I Binary Signal Sets I We will generalize the design of optimum (MPE) receivers to signal sets

More information