A UNIFIED APPROACH TO FOURIER-CLIFFORD-PROMETHEUS SEQUENCES, TRANSFORMS AND FILTER BANKS
|
|
- Archibald Norris
- 5 years ago
- Views:
Transcription
1 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 Abstract In this paper we develop a new unified approach to the so-called generalized Fourier-Clifford-Prometheus sequences, transforms (FCPTs and M-channel Filter Banks. It is based on a new generalized FCPT-generating construction. This construction has a rich algebraic structure that supports a wide range of fast algorithms. Keywords: Clifford algebra, filter banks, Golay-Shapiro sequences, Fourier-Clifford- Prometheus transforms. 1. Introduction The basis which has come to be known as the Prometheus Orthonormal Set (PONS was introduced in 1 to prove the H.S. Shapiro global uncertainty principle conjecture. Each function in PONS is called a Golay-Shapiro sequence. They are defined on 0, 1, piecewise ±1and can change sign only at points of the form j/2 n,j0, 1,...,2 n 1, n 1, 2,... These basis functions satisfy almost all standard properties of the Walsh functions. Discrete classical Fourier-Prometheus Transforms (FPT in bases of different Golay-Shapiro sequences can be used in many signal processing applications: multiresolution by discrete orthogonal wavelet decomposition, digital audio, digital video broadcasting, communication systems (Orthogonal Frequency Division Multiplexing, Multi-Code Code-Division Multiple Access, radar, and cryptographic systems. Golay-Shapiro (GS 2-complementary (±1-valued sequences associated with the cyclic group Z 2 were introduced by Shapiro and Golay
2 2 in In 1961, Golay 3 gave an explicit construction for binary Golay complementary pairs of length 2 m and later noted 4 that the construction implies the existence of at least 2 m m!/2 binary Golay sequences of this length. They are known to exist for all lengths N 2 α 10 β 26 γ, where α, β, γ are integers and α, β, γ 0 8, but do not exist for any length N having a prime factor congruent to 3 modulo 49. Budisin 10 using the earlier work of Sivaswamy 11, gave a more general recursive construction for Golay complementary pairs and showed that the set of all binary Golay complementary pairs of length 2 m obtainable from it concides with those given explicitly by Golay 3. For a survey of results on nonbinary Golay Complementary pairs, see Recently, Davis and Jedwab 14, combining results appearing in the work of Golay and Shapiro cited above, gave an explicit description of a large class of Golay complementary sequences in terms of certain cosets of the first order Reed-Muller codes. The following general elements are used for building the classical Fourier-Prometheus transforms in bases of classical Golay-Shapiro sequences: 1 the Abelian group Z n 2, 2 the 2-point Fourier transform F 2, and 3 the complex field C; i.e., these transforms are associated with the triple (Z n 2, F 2, C. The multiresolution analysis (MRA operates upon a discrete signal x(l oflength2 n, where n is an integer. The sequence x(l isconvolved with two filters L and H. Each convolution results in a sequence half the length of the original sequence. The result from the convolution with the low-pass filter is again transformed. Each re-transformed sequence of the low-pass output is referred to as a dilation. For a sequence x(l of length 2 n, a maximum of n dilations can be performed. MRA applied to a real-valued sequence x(l is defined recursively by the equations: { } { c (p (l L c (p 1 (l, d (p H c (p 1(l}, where p n, n 1,...,1, 0, c n (l x(l, and c(l (Lx(l d(l (Hx(l 2 n 1 l0 2 n 1 l0 k lp (l 2kx(l, k hp (l 2kx(l are low-pass and high-pass filters, respectively. The sequences c (p (l andd (p (l are called the averages and differences of the original signal. The inverse discrete wavelet transform reconstructs c (n (l x(l using the recursive algorithm c (p+1 (l L {c (p (l} + H {d (p (l},
3 A Unified Approach to Fourier-Clifford-Prometheus transforms 3 where L and H are the inverse filters of L and H, respectively. All filters L, H, and L,H, satisfy the following equation LL I, HH I, and LL + HH 2I, LH H L 0, (1 where I and 0 denote the identity and zero operators. Note that a pair of filters having these properties required of the transformations L and H are known as quadrature mirror filters, having the perfect reconstruction property. The conditions (1 can be rewritten in terms of the Z-transform as k lp (z 2 + k hp (z 2 2, k lp (zk lp ( z+k hp (zk hp ( z 0, z T 1 where T 1 is the unit circle of the complex field C. These conditions mean that impulse responses k lp (l andk hp (l form a Golay-Shapiro (GS 2- complementary pair. In this paper we develop a new unified approach to the so-called generalized Fourier-Clifford-Prometheus (FCP sequences, FCPtrans- forms (FCPTs, and M-channel Filter Banks. We describe the precise theoretical and computational relationship between M-band wavelets, M-channel filterbanks and generalized Golay-Shapiro sequences. The approach is based on a new generalized FCPT-generating construction. This construction has a rich algebraic structure that supports a wide range ( of fast algorithms. This construction is associated not with the triple Z n 2, F 2, C, but rather with other groups instead of Z n 2, other unitary transforms instead of F 2, and other algebras (Clifford algebras instead of the complex field C. 2. New construction of classical and multiparametric Prometheus transforms We begin by describing the original Golay 2-complementary (±1- valued sequences. Definition 1 Let p(t :(p 0,p 1,...,p N 1, q(t :(q 0,q 1,...,q N 1, where p i,q i {±1}. The sequences p(t, q(t are called a 2-complementary (±1-valued or Golay complementary pair over {±1} if CORp, p(τ+corq, q(τ Nδ(τ, or p(z 2 + q(z 2 N, z T 1, where CORf, f(τ is the periodic correlation function of f(t; p(z and q(z are Z-transforms of p(t and q(t, respectively. Any sequence which is a member of a Golay complementary pair is called a Golay sequence.
4 4 The Fourier-Prometheus matrix of depth n has size 2 n 2 n : FP 2 n Pr α (t 2n 1 α,t0. For α and t we shall use binary representations α α n : (α 1,α 2,...,α n,t t n : (t 1,t 2,...,t n, where α i,t i {0, 1}, i 1, 2,...,n. Obviously, α 1 (α 1,α 2 (α 1,α 2,α 3 (α 1,α 2,α 3,... t 1 (t 1,t 2 (t 1,t 2,t n (t 1,t 2,...,t n,... For this reason, Pr (0,0,...,0,0 (t 1,...,t n Pr (0,0,...,0,1 (t 1,...,t n Pr (0,0,...,1,0 (t 1,...,t n 2 n FP (αn 1,α n Pr (0,0,...,1,1 (t 1,...,t n Pr (1,1,...,1,0 (t 1,...,t n Pr (1,1,...,1,1 (t 1,...,t n 2n 1 1 α n 1 0 Pr(αn 1,0(t, Pr (αn 1,1(t where Pr (αn 1,0(t andpr (αn 1,1(t are a pair of GS 2-complementary sequences and represents the vertical concatenation of matrices. The classical matrix FP 2 n is formed by starting with the (2 2- Pr0 (t 1 1 matrix 21 FP and by repeated application Pr 1 (t 1 1 of the PONS-iteration construction to pairs of rows in the matrix. p In the (n + 1st iteration this construction takes each pair q Pr(αn 1,0(t of Pr (αn 1,1(t 2 n FP (αn 1,α n 2n 1 1 α n 1 0 Pr(αn 1,0(t Pr (αn 1,1(t and constructs four rows of twice the length p q PONS(p, q p q p q q p q p q q q p ( ( 1 1 p 1 1 p 1 1 q 1 1 q ( ( 1 1 p p 1 1 q q ( p F 2, q ( T2 0 p F 2 q T 1 2 p p 1 1
5 A Unified Approach to Fourier-Clifford-Prometheus transforms 5 where {T α 1 } 1 α 1 0 are dyadic shifts. Using this construction for all 2k 2 complementary pairs (α k 2 0, 1,...,2 k 2 1, we obtain 2 n+1 FP (αn,α n+1 2n 1 2n 1 α n 0 α n 0 ( Pr(αn 1,0(t F 2 ( F 2 p q Pr (αn 1,1(t T2 αn T αn 2. (2 Repetition of this construction yields the Fourier-Prometheus matrix 2 n+1 FP of size 2 n+1 2 n+1. Our new PONS construction uses in (2 three parametric unitary matrices e U 2 (β,ϕ,γ i(β+γ cos ϕ e i(β γ sin ϕ e i(β γ sin ϕ e i(β+γ cos ϕ instead of F 2 : 2 n+1 FP (αn,α n+1 ( β ( n+1, ϕ n+1, γ n+1 2n 1 α n 0 U(β n+1,ϕ n+1,γ n+1 where Pr(αn 1,0(t β n, ϕ n, γ n Pr (αn 1,1(t β n, ϕ n, γ n T α k 2, (3 β n+1 (β 1,...,β n+1, ϕ n+1 (ϕ 1,...,ϕ n+1, γ n+1 (γ 1,...,γ n+1 are three (n + 1D vectors of parameters. Extra parameters β k,ϕ k,γ k (k 1, 2,...,n+ 1 are changed from stage to stage in this construction. The resulting matrix still has orthogonal rows and every pair is 2-complementary in the Golay-Shapiro sense. 3. PONS associated with Abelian groups 3.1 Abelian groups Z n N A natural generalization of a 2-complementary Golay pair is an N- complementary Golay N-member orthogonal set of Clifford-valued sequences p 0 (t,..., p N 1 (t, where t 0, 1,..., N n 1. Definition 2 Let p 0 (t, p 1 (t,...,p N 1 (t be an N-member orthogonal set of Clifford-valued sequences, where p i (t {ε k N }N 1 k0, ε N :
6 6 e 2πu/N Cla, Cla is a Clifford algebra, and u is an appropriate bivector with the property u 2 1. The sequences {p i (t} N 1 i0 are called N-complementary {ε k N }N 1 k0 -valued sequences of length N n if CORp 0, p 0 (τ+...+corp N 1, p N 1 (τ N n δ(τ, or p 0 (z 2 + p 1 (z p N 1 (z 2 N n, z T 1, where p i (z are Z-transforms of p i (t, i 0, 1,...,N 1, respectively. Let, for example, N 3. Then for the group Z 3 we define the Fourier- Clifford-Prometheus transform as the Fourier-Clifford transform 3 1 FCP : 31 FC Pr 0(t Pr 1 (t 1 ε 3 ε 2 3. Pr 2 (t 1 ε 2 3 ε 3 For the group Z 2 3 we define the Fourier-Clifford-Prometheus transform using the classical PONS-construction (2 by Pr 0 (t 3 2 FCP α1,α 2 2 α 1 0 FC 3 Pr 1 (t T α 1 3 Pr 2 (t 1 ε 3 ε ε 3 ε 2 1 ε ε 3 1 ε 2 3 ε 3 1 ε 3 ε ε 3 ε 2 1 ε ε 3 1 ε 2 3 ε 3 1 ε 3 ε ε 3 ε 2 1 ε ε 3 1 ε 2 3 ε 3 1 ε 3 ε ε 2 3 ε 3 Pr (0,0 (t ε 3 ε ε 2 3 ε 3 1 Pr (0,1 (t ε ε 3 ε 3 1 ε 2 3 Pr (0,2 (t 1 ε 2 3 ε 3 1 ε 3 ε 2 3 Pr (1,0 (t ε 2 3 ε 3 1 ε 3 ε Pr (1,1 (t, ε 3 1 ε 2 3 ε ε 3 Pr (1,2 (t 1 ε 3 ε ε 2 3 ε 3 Pr (2,0 (t ε 3 ε ε 2 3 ε 3 1 Pr (2,1 (t ε ε 3 ε 3 1 ε 2 3 Pr (2,2 (t where {T α 1 } 2 α 1 0 are 3-cyclic shift operators. After n + 1 iterations we obtain the following Fourier-Clifford-Prometheus transform on the group
7 A Unified Approach to Fourier-Clifford-Prometheus transforms 7 Z n+1 3 : 3 n+1 FCP (αn,α n+1 3n 1 α n 0 ( FC 3 Pr (αn 1,0(t Pr (αn 1,1(t Pr (αn 1,2(t T αn. 3 The same expression is true for the Fourier-Clifford-Prometheus transform on the group Z n N : N n+1 FCP (αn,α n+1 N n 1 α n 0 ( FC N Pr (αn 1,0(t Pr (αn 1,1(t... Pr(αn 1,N 1(t T αn N, where FC N is the Fourier-Clifford transform on the group Z N, are N-cyclic shift operators. {T α 1 } N 1 α Abelian groups Z N1 Z N2... Z Nn Let Z N1 Z N2... Z Nn be an Abelian group, where N 1,N 2,...,N n are positive integers. The classical Fourier-Prometheus transforms are generated by the Fourier-Walsh transform F 2 and by dyadic shifts. Fourier-Clifford-Prometheus transforms associated with Z n N are generated by the Fourier-Clifford transform FC N of the group Z N and by N-ary shifts. We shall generate new Fourier-Clifford-Prometheus transforms associated with Abelian groups Z N1 Z N2... Z Nn Z Nn+1 by using the set of Fourier-Clifford transforms FC N1, FC N2,...,FC Nn, FC Nn+1. For example, the group Z 2 Z 3 Z 4 requires three Fourier-Clifford transforms F , F 3 1 ε 3 ε ε 2 3 ε 3, F ε 1 4 ε 2 4 ε ε ε ε 3 4 ε 2 4 ε 1 4.
8 8 Pr0 (t Let us consider the group Z 2 Z 3. FCP 2 FC 2 Pr 1 (t 1 1. We define the Fourier-Clifford-Prometheus transform associated with the Abelian group Z 2 Z 3 by using the classical PONS 1 1 construction 2 3 FCP (α1,α 2 Pr (α1 1,0 2 (t α 1 0 FC 3 Pr (α1,1 2 (t T α 1 3, Pr (α1,2 2 (t where (α 1,β 2 2 : (α 1,β 2 mod2. Therefore, ε 3 ε 2 3 FCP ε 2 3 ε 3 1 ε 3 ε ε 2 3 ε ε 3 ε 3 ε 2 3 ε ε 3 ε 3 ε 2 3 ε ε 2 3 ε ε 3 ε 3 ε 3 ε ε 2 3 ε Pr (0,0 (t Pr (0,1 (t Pr (0,2 (t Pr (1,0 (t Pr (1,1 (t Pr (1,2 (t (4 We design Fourier-Clifford-Prometheus transforms associated with the Abelian groups Z N1 Z N2... Z Nn+1 bythesameclassicalpons construction N n+1 FCP (αn α n+1 N n 1 α n 0 FC Nn+1 Pr (αn 1, 0 Nn... Pr(α(n 1, Nn+1 1 Nn T αn N n+1 where F Nn+1 is the Fourier-Clifford transform on the group Z Nn+1, α n + β n+1 n+1 : (α n + β n+1 modn n+1,α n : (α 1,α 2,...,α n,n n : N 1 N 2 N n, (α n,β n+1 :(α 1,...,α n,β n+1, and, hence, (α n,β n+1 n : (α 1,...,α n,β n+1 modn n.
9 A Unified Approach to Fourier-Clifford-Prometheus transforms 9 4. Fast Fourier-Prometheus Transforms 4.1 Radix-2 Fast Transforms Let us return to the Fourier-Clifford-Prometheus transform Pr (0,0 (t 1 FP 2 2 Pr (0,1 (t Pr (1,0 (t Pr (1,1 (t Π 4 (F 2 F 2 0, (5 where 0 : diag(pr 0 (t diag(pr α (0 is a diagonal matrix and Π 4 is a special permutation matrix. From this expression we see that Prometheus functions up to constant factor are modulated Walsh functions: Pr (α1,α 2 (t 1,t 2 ( 1 α 1α 2 Wal (α1,α 2 (t 1,t 2 ( 1 t 1t 2, where ( 1 α 1α 2 and ( 1 t 1t 2 are the so-called Shapiro multipliers, and Wal (α1,α 1 (t 1,t 2 ( 1 α 1t 1 2 α 2 t 2. The same result is true in the general case for the Fourier-Clifford-Prometheus (2 n 2 n -transform FP 2 n 0 Π 2 n(f 2 F 2 F 2 0, where Π 2 n is a special permutation matrix and 0 diag(pr 0 (tdiag(pr α (0 is the diagonal matrix whose diagonal elements form the Shapiro (±1-multipliers. If α (α 1,α 2,...,α n is the binary representation of the number in the αth row of 0, where α i P Z 2, then for diagonal elements α,α we have the expression α,α n 1 ( 1 i1 α iα i+1. The quantity b(α n 1 i1 α iα i+1 is the number of occurrences of the block B (11 in the binary representation of α, (α 1,α 2,...,α n. For this reason the Fourier-Clifford-Prometheus transform has the Cooley-Tukey fast algorithm FP 2 n 0 Π 2 n CT 1 2 nct2 2 n CTn 2 n 0, (6 where CT2 i n : I 2... F 2... I 2 for i 1, 2,...,n are the so-called Cooley-Tukey sparse matrices. Now we can prove that an analogous result is true for Davis-Jedwab Clifford-valued sequences. Let MC 2 h {ε k } 2h 1 2 h k0 be the multiplicative cyclic group of 2 h th roots of unity and ε 2 h be a 2 h th primitive root in a
10 10 Clifford algebra Cla. Let (c 1,c 2,...,c n Z n Z 2 h 2 h Z 2 h... Z 2 h, be an nd vector of parameters over Z 2 h, where Z n is a set of nd vectors 2 h (labels. Let FC 2 (ε c k 2 h : 1 ε c k 2 h 1 ε c k 2 h ε ck 2 h, k 1, 2,...,n, (7 be a set of (2 2-matrices. Then the tensor product of these matrices ( FCPDJ (c 1,c 2,...,c n 2 n : 0Π 2 n F 2 (ε c 1 F 2 h 2 (ε c 2 F 2 h 2 (ε cn 2 h 0 (8 gives us new multi-parametric Fourier-Prometheus transforms with fast Cooley-Tukey algorithm: FCPDJ (c 1,c 2,...,c n 2 n 0Π 2 n CT2 1 n(εc 1 CT 2 2 h 2 n(εc 2 CT n 2 h 2 n(εcn 2 h 0, (9 where CT k 2 n(εc k 2 h : I 2... F 2 (ε c k 2 h... I 2, and k 1, 2,...,n. 4.2 Radix-N Fourier-Prometheus transforms Let us consider the case of Z 2 3. In this case FCP 3 2 0Π 9 (F 3 F 3 0, where 0 diag{pr (0,0 (t 1,t 2 } diag{pr (t1,t 2 (0, 0} and Π 9 is a special permutation matrix. From this expression we see that Prometheus functions up to constant factor are modulated Chrestenson-Clifford sequences (i.e., Clifford-valued characters of the group Z 2 3 : Pr (α1,α 2 (t 1,t 2 Pr (α1,α 2 (0, 0 Ch (α1,α 2 (t 1,t 2 Pr (0,0 (t 1,t 2 ε α 1α 2 3 Ch (α1,α 2 (t 1,t 2 ε t 1t 2 3 where Pr (α1,α 2 (0, 0 ε α 1α 2 3 ε α 1α 2 3 ε α 1t 1 2 α 2 t 2 3 ε t 1t 2 3, Pr (0,0 (t 1,t 2 ε t 1t 2 3, and Ch (α1,α 1 (t 1,t 2 ε α 1t 1 2 α 2 t 2 3. For this reason, this Fourier-Clifford Prometheus transform has the Cooley-Tukey fast algorithm FP Π 9 CT 9 1 CT2 9 0, where CT9 1 : F 3 I 3,CT9 2 I 3 F 3. The same result is true in the general case for Fourier-Clifford-Prometheus (3 n 3 n -transforms FP 3 n 0 Π 3 n (F 3 F 3 F Π 3 n CT 3 1 nct2 3 n CTn 3 n 0,
11 A Unified Approach to Fourier-Clifford-Prometheus transforms 11 where CT3 i n : I 3... F 3... I 3 for i 1, 2,...,n are the so-called Cooley-Tukey sparse matrices. Now we are ready to write the analogous expression for Fourier-Clifford-Prometheus (N n N n -transforms FP N n 0 Π N n (F N F N F N 0 0 Π N n CT 1 N nct2 N n CTn N n 0, (10 where CTN i n : I N... F N... I N for i 1, 2,...,n are the so-called Cooley-Tukey sparse matrices. The same result is true in the general case for the Fourier-Clifford-Prometheus (N n N n -transform FP N n 0 Π N n (F N1 F N2 F Nn 0 0 Π N n CT 1N n CT 2N n CT nn n 0, (11 where 0 : diag(pr 0 (t diag(pr α (0 is a diagonal matrix and Π N n a permutation matrix, and CT i : I N n N1... F Ni... I Nn for i 1, 2,...,n are the so-called Cooley-Tukey sparse matrices. 5. Conclusions We have shown how Clifford algebras can be used to formulate a new unified approach to so-called generalized Fourier-Clifford-Prometheus transforms. It is based on a new generalized FCPT-generating construction. This construction has a rich algebraic structure that supports a wide range ( of fast algorithms. This construction is associated not with the triple Z n 2, F 2, C, but rather with other groups instead of Z n 2, other unitary transforms instead of F 2, and other algebras (Clifford algebras instead of the complex field C. Acknowledgments The work was supported by the Russian Foundation for Basic Research, research project no The paper contains some results obtained in the project no of the Ural State Technical University. We thank the Organizing Committee of the NATO Advanced Study Institute Computational Noncommutative Algebra and Applications. The authors are grateful for their NATO support. References
12 12 1 Byrnes, J.S. (1994. Quadrature mirror filter, low crest factor arrays, functions achieving optimal uncertainty principle bounds, and complete orthonormal sequences - a unified approach. Applied and Computational Harmonic Analysis, pp Golay, M.J.E. ( Multislit spectrometry. J.Optical Society Am., 39: Golay, M.J.E. (1951. Complementary series. IRE Trans. Inform. Theory, IT-7, pp Golay, M.J.E. (1977. Sieves for low autocorrelation binary sequences. IEEE Trans. Inform. Theory, IT-23, pp Shapiro, H.S. (1951. Extremal problems for polynomials and power series. ScM.Thesis, Massachusetts Institute of Technology. 6 Shapiro, H.S. (1958. A power series with small partial sums. Notices of the AMS, 6(3: Rudin, W. ( Some theorems on Fourier coefficients. Proc. Amer. Math. Soc., 10, pp Turan, R.J. (1974. Hadamard matrices, Baumert-Hall units, four-symbol sequences, pulse compression, and surface wave encodings. J.Combin. Theory (A. vol. 16, pp Eliahou, S., Kervaire, M., and Saffari, B. (1990. A new restriction on the lengths of Golay complementary sequences. J. Combin. Theory (A, vol. 55, pp Budisin, S.Z. (1990. New complementary pairs of sequences. Electron. Lett., Vol. 26, pp Sivaswamy, R. (1978. Multiphase complementary codes. IEEE Trans. Inform. Theory, vol. IT-24, pp Saffari, B.: History of Shapiro polynomials and Golay sequences. In preparation. 13 Fan, P. and Darnell, M. (1996. Sequence Design for Communications Applications (Communications Systems, Technologies and Applications. Taunton, U.K.:Res.Studies, 14 Davis, A. and Jedwab, J. (1999. Peak-to-Mean Power control in OFDM, Golay complementary Sequences, Reed-Muller codes. IEEE Trans. Inform. Theory, vol. IT-45, No. 7, pp
Polynomial Residue Systems via Unitary Transforms Matthew G. Parker
Polynomial Residue Systems via Unitary Transforms Matthew G. Parker Selmer Centre, Inst. for Informatikk, Høyteknologisenteret i Bergen, University of Bergen, Bergen 500, Norway Email: matthew@ii.uib.no
More informationA construction of binary Golay sequence pairs from odd-length Barker sequences
A construction of binary Golay sequence pairs from odd-length Barker sequences Jonathan Jedwab Matthew G. Parker 12 September 2008 (revised 20 January 2009) Abstract Binary Golay sequence pairs exist for
More informationEven 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 informationLarge 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 informationTopic 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 informationGeneralised Rudin-Shapiro Constructions
Generalised Rudin-Shapiro Constructions Matthew G. Parker 1 Code Theory Group, Inst. for Informatikk, Høyteknologisenteret i Bergen, University of Bergen, Bergen 5020, Norway. E-mail: matthew@ii.uib.no.
More informationModule 4. Multi-Resolution Analysis. Version 2 ECE IIT, Kharagpur
Module 4 Multi-Resolution Analysis Lesson Multi-resolution Analysis: Discrete avelet Transforms Instructional Objectives At the end of this lesson, the students should be able to:. Define Discrete avelet
More informationConstructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach
Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach Shu Lin, Shumei Song, Lan Lan, Lingqi Zeng and Ying Y Tai Department of Electrical & Computer Engineering University of California,
More informationModule 4 MULTI- RESOLUTION ANALYSIS. Version 2 ECE IIT, Kharagpur
Module MULTI- RESOLUTION ANALYSIS Version ECE IIT, Kharagpur Lesson Multi-resolution Analysis: Theory of Subband Coding Version ECE IIT, Kharagpur Instructional Objectives At the end of this lesson, the
More informationOn 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 informationContents. Acknowledgments
Table of Preface Acknowledgments Notation page xii xx xxi 1 Signals and systems 1 1.1 Continuous and discrete signals 1 1.2 Unit step and nascent delta functions 4 1.3 Relationship between complex exponentials
More informationCome on Down! An Invitation to Barker Polynomials
Come on Down! An Invitation to Barker Polynomials 5.0 4.5 4.0 3.5 I c e r m 3.0 2.5 0.0 0.1 0.2 0.3 0.4 0.5 Michael Mossinghoff Davidson College Introduction to Topics Summer@ICERM 2014 Brown University
More informationIMPROVED RESULTS ON THE OSCILLATION OF THE MODULUS OF THE RUDIN-SHAPIRO POLYNOMIALS ON THE UNIT CIRCLE. September 12, 2018
IMPROVED RESULTS ON THE OSCILLATION OF THE MODULUS OF THE RUDIN-SHAPIRO POLYNOMIALS ON THE UNIT CIRCLE Tamás Erdélyi September 12, 2018 Dedicated to Paul Nevai on the occasion of his 70th birthday Abstract.
More informationDeclaration of Partial Copyright Licence
i nt he De pa r t me nt of Ma t he ma t i c s De c e mbe r3,2010 Declaration of Partial Copyright Licence The author, whose copyright is declared on the title page of this work, has granted to Simon Fraser
More informationOn The Weights of Binary Irreducible Cyclic Codes
On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:
More informationLecture 16: Multiresolution Image Analysis
Lecture 16: Multiresolution Image Analysis Harvey Rhody Chester F. Carlson Center for Imaging Science Rochester Institute of Technology rhody@cis.rit.edu November 9, 2004 Abstract Multiresolution analysis
More informationThere are no Barker arrays having more than two dimensions
There are no Barker arrays having more than two dimensions Jonathan Jedwab Matthew G. Parker 5 June 2006 (revised 7 December 2006) Abstract Davis, Jedwab and Smith recently proved that there are no 2-dimensional
More informationChapter 6 Reed-Solomon Codes. 6.1 Finite Field Algebra 6.2 Reed-Solomon Codes 6.3 Syndrome Based Decoding 6.4 Curve-Fitting Based Decoding
Chapter 6 Reed-Solomon Codes 6. Finite Field Algebra 6. Reed-Solomon Codes 6.3 Syndrome Based Decoding 6.4 Curve-Fitting Based Decoding 6. Finite Field Algebra Nonbinary codes: message and codeword symbols
More informationDigital Image Processing
Digital Image Processing, 2nd ed. Digital Image Processing Chapter 7 Wavelets and Multiresolution Processing Dr. Kai Shuang Department of Electronic Engineering China University of Petroleum shuangkai@cup.edu.cn
More informationDOPPLER 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 informationMATH32031: Coding Theory Part 15: Summary
MATH32031: Coding Theory Part 15: Summary 1 The initial problem The main goal of coding theory is to develop techniques which permit the detection of errors in the transmission of information and, if necessary,
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 12 Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted for noncommercial,
More informationNovel 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 informationMatthew G. Parker, Gaofei Wu. January 29, 2015
Constructions for complementary and near-complementary arrays and sequences using MUBs and tight frames, respectively Matthew G. Parker, Gaofei Wu The Selmer Center, Department of Informatics, University
More informationECE8771 Information Theory & Coding for Digital Communications Villanova University ECE Department Prof. Kevin M. Buckley Lecture Set 2 Block Codes
Kevin Buckley - 2010 109 ECE8771 Information Theory & Coding for Digital Communications Villanova University ECE Department Prof. Kevin M. Buckley Lecture Set 2 Block Codes m GF(2 ) adder m GF(2 ) multiplier
More informationWavelets and Filter Banks
Wavelets and Filter Banks Inheung Chon Department of Mathematics Seoul Woman s University Seoul 139-774, Korea Abstract We show that if an even length filter has the same length complementary filter in
More informationBasic Multi-rate Operations: Decimation and Interpolation
1 Basic Multirate Operations 2 Interconnection of Building Blocks 1.1 Decimation and Interpolation 1.2 Digital Filter Banks Basic Multi-rate Operations: Decimation and Interpolation Building blocks for
More informationBinary construction of quantum codes of minimum distances five and six
Discrete Mathematics 308 2008) 1603 1611 www.elsevier.com/locate/disc Binary construction of quantum codes of minimum distances five and six Ruihu Li a, ueliang Li b a Department of Applied Mathematics
More informationA Generalized Reverse Jacket Transform
684 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: ANALOG AND DIGITAL SIGNAL PROCESSING, VOL. 48, NO. 7, JULY 2001 A Generalized Reverse Jacket Transform Moon Ho Lee, Senior Member, IEEE, B. Sundar Rajan,
More informationThe BCH Bound. Background. Parity Check Matrix for BCH Code. Minimum Distance of Cyclic Codes
S-723410 BCH and Reed-Solomon Codes 1 S-723410 BCH and Reed-Solomon Codes 3 Background The algebraic structure of linear codes and, in particular, cyclic linear codes, enables efficient encoding and decoding
More informationarxiv: v1 [cs.oh] 3 Oct 2014
M. Prisheltsev (Voronezh) mikhail.prisheltsev@gmail.com ADAPTIVE TWO-DIMENSIONAL WAVELET TRANSFORMATION BASED ON THE HAAR SYSTEM 1 Introduction arxiv:1410.0705v1 [cs.oh] Oct 2014 The purpose is to study
More informationON THE EXISTENCE OF APERIODIC COMPLEMENTARY HEXAGONAL LATTICE ARRAYS
ON THE EXISTENCE OF APERIODIC COMPLEMENTARY HEXAGONAL LATTICE ARRAYS YIN TAN AND GUANG GONG Abstract. Binary (periodic aperiodic complementary sequences have been studied extensively due to their wide
More informationPERIODIC TIME SPREAD PULSE SIGNALS WITH PERFECT AUTOCORRELATION
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,
More informationDecomposing Bent Functions
2004 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 8, AUGUST 2003 Decomposing Bent Functions Anne Canteaut and Pascale Charpin Abstract In a recent paper [1], it is shown that the restrictions
More informationA Framework for the Construction of Golay Sequences
1 A Framework for the Construction of Golay Sequences Frank Fiedler, Jonathan Jedwab, and Matthew G Parker Abstract In 1999 Davis and Jedwab gave an explicit algebraic normal form for m! h(m+) ordered
More informationA Novel Fast Computing Method for Framelet Coefficients
American Journal of Applied Sciences 5 (11): 15-157, 008 ISSN 1546-939 008 Science Publications A Novel Fast Computing Method for Framelet Coefficients Hadeel N. Al-Taai Department of Electrical and Electronic
More informationAperiodic 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 informationCorrecting Codes in Cryptography
EWSCS 06 Palmse, Estonia 5-10 March 2006 Lecture 2: Orthogonal Arrays and Error- Correcting Codes in Cryptography James L. Massey Prof.-em. ETH Zürich, Adjunct Prof., Lund Univ., Sweden, and Tech. Univ.
More informationNew 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 informationWavelength Isolation Sequence Pairs
Wavelength Isolation Sequence Pairs Jonathan Jedwab and Jane Wodlinger Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, BC, V5A S6, Canada {jed, jwodling}@sfu.ca 9 January
More informationIntroduction to Discrete-Time Wavelet Transform
Introduction to Discrete-Time Wavelet Transform Selin Aviyente Department of Electrical and Computer Engineering Michigan State University February 9, 2010 Definition of a Wavelet A wave is usually defined
More informationOn Boolean functions which are bent and negabent
On Boolean functions which are bent and negabent Matthew G. Parker 1 and Alexander Pott 2 1 The Selmer Center, Department of Informatics, University of Bergen, N-5020 Bergen, Norway 2 Institute for Algebra
More informationSymmetric Wavelet Tight Frames with Two Generators
Symmetric Wavelet Tight Frames with Two Generators Ivan W. Selesnick Electrical and Computer Engineering Polytechnic University 6 Metrotech Center, Brooklyn, NY 11201, USA tel: 718 260-3416, fax: 718 260-3906
More informationAlgebraic Structures Exam File Fall 2013 Exam #1
Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write
More informationPERIODIC 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 informationUnitary 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 informationChapter 7 Wavelets and Multiresolution Processing
Chapter 7 Wavelets and Multiresolution Processing Background Multiresolution Expansions Wavelet Transforms in One Dimension Wavelet Transforms in Two Dimensions Image Pyramids Subband Coding The Haar
More informationPlotkin s Bound in Codes Equipped with the Euclidean Weight Function
Tamsui Oxford Journal of Mathematical Sciences 5() (009) 07-4 Aletheia University Plotkin s Bound in Codes Equipped with the Euclidean Weight Function Sapna Jain Department of Mathematics, University of
More informationFilter Banks II. Prof. Dr.-Ing. G. Schuller. Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany
Filter Banks II Prof. Dr.-Ing. G. Schuller Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany Page Modulated Filter Banks Extending the DCT The DCT IV transform can be seen as modulated
More informationTOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS. 1. Introduction
TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS KEITH CONRAD A (monic) polynomial in Z[T ], 1. Introduction f(t ) = T n + c n 1 T n 1 + + c 1 T + c 0, is Eisenstein at a prime p when each coefficient
More informationSubquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
1 Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases H. Fan and M. A. Hasan March 31, 2007 Abstract Based on a recently proposed Toeplitz
More informationNew Design of Orthogonal Filter Banks Using the Cayley Transform
New Design of Orthogonal Filter Banks Using the Cayley Transform Jianping Zhou, Minh N. Do and Jelena Kovačević Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign,
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationIntroduction p. 1 Compression Techniques p. 3 Lossless Compression p. 4 Lossy Compression p. 5 Measures of Performance p. 5 Modeling and Coding p.
Preface p. xvii Introduction p. 1 Compression Techniques p. 3 Lossless Compression p. 4 Lossy Compression p. 5 Measures of Performance p. 5 Modeling and Coding p. 6 Summary p. 10 Projects and Problems
More informationDSP Algorithm Original PowerPoint slides prepared by S. K. Mitra
Chapter 11 DSP Algorithm Implementations 清大電機系林嘉文 cwlin@ee.nthu.edu.tw Original PowerPoint slides prepared by S. K. Mitra 03-5731152 11-1 Matrix Representation of Digital Consider Filter Structures This
More informationConstructions of Complementary Sequences for Power-Controlled OFDM Transmission
Constructions of Complementary Sequences for Power-Controlled OFDM Transmission Kai-Uwe Schmidt and Adolf Finger Communications Laboratory Technische Universität Dresden 0106 Dresden, Germany schmidtk@ifn.et.tu-dresden.de
More informationQuantum Mechanics in Finite Dimensions
Foundations of Physics, VoL 6, No. 5, 1976 Quantum Mechanics in Finite Dimensions T. S. Santhanam 1 and A. R. Tekumalla 2 Received January 21, 1975 We explicitly compute, following the method of Weyl,
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-13 Recap Divisibility Prime Number Theorem Euclid s Lemma Fundamental Theorem of Arithmetic Euclidean Algorithm Basic Notions - Section
More informationTHE FAST FOURIER TRANSFORM III 10.3
10.3 The Fast Fourier Transform 439 THE FAST FOURIER TRANSFORM III 10.3 Many applications of linear algebra take time to develop. It is not easy to explain them in an hour. The teacher and the author must
More informationarxiv: v2 [math.fa] 27 Sep 2016
Decomposition of Integral Self-Affine Multi-Tiles Xiaoye Fu and Jean-Pierre Gabardo arxiv:43.335v2 [math.fa] 27 Sep 26 Abstract. In this paper we propose a method to decompose an integral self-affine Z
More informationLinear Algebra for Machine Learning. Sargur N. Srihari
Linear Algebra for Machine Learning Sargur N. srihari@cedar.buffalo.edu 1 Overview Linear Algebra is based on continuous math rather than discrete math Computer scientists have little experience with it
More informationL. Yaroslavsky. Fundamentals of Digital Image Processing. Course
L. Yaroslavsky. Fundamentals of Digital Image Processing. Course 0555.330 Lec. 6. Principles of image coding The term image coding or image compression refers to processing image digital data aimed at
More information- An Image Coding Algorithm
- An Image Coding Algorithm Shufang Wu http://www.sfu.ca/~vswu vswu@cs.sfu.ca Friday, June 14, 2002 22-1 Agenda Overview Discrete Wavelet Transform Zerotree Coding of Wavelet Coefficients Successive-Approximation
More informationSupplement to Multiresolution analysis on the symmetric group
Supplement to Multiresolution analysis on the symmetric group Risi Kondor and Walter Dempsey Department of Statistics and Department of Computer Science The University of Chicago risiwdempsey@uchicago.edu
More informationON THE SEMIPRIMITIVITY OF CYCLIC CODES
ON THE SEMIPRIMITIVITY OF CYCLIC CODES YVES AUBRY AND PHILIPPE LANGEVIN Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one exception, that an irreducible cyclic
More informationSome new periodic Golay pairs
Some new periodic Golay pairs Dragomir Ž. Doković 1, Ilias S. Kotsireas 2 arxiv:1310.5773v2 [math.co] 27 Aug 2014 Abstract Periodic Golay pairs are a generalization of ordinary Golay pairs. They can be
More informationNew Constructions for De Bruijn Tori
New Constructions for De Bruijn Tori Glenn Hurlbert Garth Isaak Dedicated to the memory of Tony Brewster Abstract A De Bruijn torus is a periodic d dimensional k ary array such that each n 1 n d k ary
More informationMachine Learning: Basis and Wavelet 김화평 (CSE ) Medical Image computing lab 서진근교수연구실 Haar DWT in 2 levels
Machine Learning: Basis and Wavelet 32 157 146 204 + + + + + - + - 김화평 (CSE ) Medical Image computing lab 서진근교수연구실 7 22 38 191 17 83 188 211 71 167 194 207 135 46 40-17 18 42 20 44 31 7 13-32 + + - - +
More informationCyclic codes: overview
Cyclic codes: overview EE 387, Notes 14, Handout #22 A linear block code is cyclic if the cyclic shift of a codeword is a codeword. Cyclic codes have many advantages. Elegant algebraic descriptions: c(x)
More informationLecture 7 January 26, 2016
MATH 262/CME 372: Applied Fourier Analysis and Winter 26 Elements of Modern Signal Processing Lecture 7 January 26, 26 Prof Emmanuel Candes Scribe: Carlos A Sing-Long, Edited by E Bates Outline Agenda:
More informationON SPECTRAL CANTOR MEASURES. 1. Introduction
ON SPECTRAL CANTOR MEASURES IZABELLA LABA AND YANG WANG Abstract. A probability measure in R d is called a spectral measure if it has an orthonormal basis consisting of exponentials. In this paper we study
More information2013/Fall-Winter Term Monday 12:50 Room# or 5F Meeting Room Instructor: Fire Tom Wada, Professor
SYSTEM ARCHITECTURE ADVANCED SYSTEM ARCHITECTURE Error Correction Code 1 01/Fall-Winter Term Monday 1:50 Room# 1- or 5F Meeting Room Instructor: Fire Tom Wada, Professor 014/1/0 System Arch 1 Introduction
More informationWavelets and Multiresolution Processing
Wavelets and Multiresolution Processing Wavelets Fourier transform has it basis functions in sinusoids Wavelets based on small waves of varying frequency and limited duration In addition to frequency,
More informationA Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group
A Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group Richard P. Stanley Department of Mathematics, Massachusetts Institute of Technology Cambridge,
More informationLETTER Almost Perfect Sequences and Periodic Complementary Sequence Pairs over the 16-QAM Constellation
400 IEICE TRANS. FUNDAMENTALS VOL.E95 A NO.1 JANUARY 2012 LETTER Almost Perfect Sequences Periodic Complementary Sequence Pairs over the 16-QAM Constellation Fanxin ZENG a) Member Xiaoping ZENG Nonmember
More informationToward a Realization of Marr s Theory of Primal Sketches via Autocorrelation Wavelets: Image Representation using Multiscale Edge Information
Toward a Realization of Marr s Theory of Primal Sketches via Autocorrelation Wavelets: Image Representation using Multiscale Edge Information Naoki Saito 1 Department of Mathematics University of California,
More informationChapter 7 Wavelets and Multiresolution Processing. Subband coding Quadrature mirror filtering Pyramid image processing
Chapter 7 Wavelets and Multiresolution Processing Wavelet transform vs Fourier transform Basis functions are small waves called wavelet with different frequency and limited duration Multiresolution theory:
More informationMATH 433 Applied Algebra Lecture 19: Subgroups (continued). Error-detecting and error-correcting codes.
MATH 433 Applied Algebra Lecture 19: Subgroups (continued). Error-detecting and error-correcting codes. Subgroups Definition. A group H is a called a subgroup of a group G if H is a subset of G and the
More informationChapter 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 informationNew Restrictions on Possible Orders of Circulant Hadamard Matrices
New Restrictions on Possible Orders of Circulant Hadamard Matrices Ka Hin Leung Department of Mathematics National University of Singapore Kent Ridge, Singapore 119260 Republic of Singapore Bernhard Schmidt
More informationAlgebra. Modular arithmetic can be handled mathematically by introducing a congruence relation on the integers described in the above example.
Coding Theory Massoud Malek Algebra Congruence Relation The definition of a congruence depends on the type of algebraic structure under consideration Particular definitions of congruence can be made for
More informationInteger Maxima in Power Envelopes of Golay Codewords
1 Integer Maxima in Power Envelopes of Golay Codewords Michael W. Cammarano and Meredith L. Walker April 6, 1999 Abstract This paper examines the distribution of integer peaks amoung Golay cosets in Z
More informationWavelets and Multiresolution Processing. Thinh Nguyen
Wavelets and Multiresolution Processing Thinh Nguyen Multiresolution Analysis (MRA) A scaling function is used to create a series of approximations of a function or image, each differing by a factor of
More informationLow-complexity error correction in LDPC codes with constituent RS codes 1
Eleventh International Workshop on Algebraic and Combinatorial Coding Theory June 16-22, 2008, Pamporovo, Bulgaria pp. 348-353 Low-complexity error correction in LDPC codes with constituent RS codes 1
More informationFactoring on a Quantum Computer
Factoring on a Quantum Computer The Essence Shor s Algorithm Wolfgang Polak wp@pocs.com Thanks to: Eleanor Rieffel Fuji Xerox Palo Alto Laboratory Wolfgang Polak San Jose State University, 4-14-010 - p.
More informationQuaternary Golay sequence pairs II: Odd length
Quaternary Golay sequence pairs II: Odd length Richard G. Gibson and Jonathan Jedwab 11 August 2009 (revised 9 July 2010) Abstract A 4-phase Golay sequence pair of length s 5 (mod 8) is constructed from
More informationHadamard ideals and Hadamard matrices with two circulant cores
Hadamard ideals and Hadamard matrices with two circulant cores Ilias S. Kotsireas a,1,, Christos Koukouvinos b and Jennifer Seberry c a Wilfrid Laurier University, Department of Physics and Computer Science,
More informationB. Encryption using quasigroup
Sequence Randomization Using Quasigroups and Number Theoretic s Vaignana Spoorthy Ella Department of Computer Science Oklahoma State University Stillwater, Oklahoma, USA spoorthyella@okstateedu Abstract
More informationDesign of Orthonormal Wavelet Filter Banks Using the Remez Exchange Algorithm
Electronics and Communications in Japan, Part 3, Vol. 81, No. 6, 1998 Translated from Denshi Joho Tsushin Gakkai Ronbunshi, Vol. J80-A, No. 9, September 1997, pp. 1396 1402 Design of Orthonormal Wavelet
More informationDoppler 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 informationMultiresolution analysis & wavelets (quick tutorial)
Multiresolution analysis & wavelets (quick tutorial) Application : image modeling André Jalobeanu Multiresolution analysis Set of closed nested subspaces of j = scale, resolution = 2 -j (dyadic wavelets)
More informationFrom Fourier to Wavelets in 60 Slides
From Fourier to Wavelets in 60 Slides Bernhard G. Bodmann Math Department, UH September 20, 2008 B. G. Bodmann (UH Math) From Fourier to Wavelets in 60 Slides September 20, 2008 1 / 62 Outline 1 From Fourier
More informationReed-Solomon codes. Chapter Linear codes over finite fields
Chapter 8 Reed-Solomon codes In the previous chapter we discussed the properties of finite fields, and showed that there exists an essentially unique finite field F q with q = p m elements for any prime
More informationThe New Graphic Description of the Haar Wavelet Transform
he New Graphic Description of the Haar Wavelet ransform Piotr Porwik and Agnieszka Lisowska Institute of Informatics, Silesian University, ul.b dzi ska 39, 4-00 Sosnowiec, Poland porwik@us.edu.pl Institute
More informationAn Introduction to Filterbank Frames
An Introduction to Filterbank Frames Brody Dylan Johnson St. Louis University October 19, 2010 Brody Dylan Johnson (St. Louis University) An Introduction to Filterbank Frames October 19, 2010 1 / 34 Overview
More informationTwo-Dimensional Orthogonal Filter Banks with Directional Vanishing Moments
Two-imensional Orthogonal Filter Banks with irectional Vanishing Moments Jianping Zhou and Minh N. o epartment of Electrical and Computer Engineering University of Illinois at Urbana-Champaign, Urbana,
More informationOn Walsh transform and matrix factorization 1
Eighth International Workshop on Optimal Codes and Related Topics July 10-14, 2017, Sofia, Bulgaria pp. 55-60 On Walsh transform and matrix factorization 1 Iliya Bouyukliev iliyab@math.bas.bg Paskal Piperkov
More informationECEN 5022 Cryptography
Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,
More informationCONSTRUCTION OF AN ORTHONORMAL COMPLEX MULTIRESOLUTION ANALYSIS. Liying Wei and Thierry Blu
CONSTRUCTION OF AN ORTHONORMAL COMPLEX MULTIRESOLUTION ANALYSIS Liying Wei and Thierry Blu Department of Electronic Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong ABSTRACT We
More informationNew duality operator for complex circulant matrices and a conjecture of Ryser
New duality operator for complex circulant matrices and a conjecture of Ryser Luis H. Gallardo Mathematics University of Brest Brest, France Luis.Gallardo@univ-brest.fr Submitted: May 6, 2015; Accepted:
More information