a

r
X
i
v
:
0
8
0
8
.
0
5
4
4
v
1


[
c
s
.
I
T
]


5

A
u
g

2
0
0
8
Generalized Cross-correlation Properties of Chu
Sequences
Jae Won Kang, Younghoon Whang, Hyo Yol Park and
Kwang Soon Kim

, Senior Member, IEEE

Department of Electrical and Electronic Engineering,
Yonsei University,
134 Shinchon-dong, Seodaemun-gu, Seoul 120-749, Korea
Tel: +82-2-2123-5861
Fax: +82-2-313-2879
E-mail: ks.kim@yonsei.ac.kr

Corresponding Author
Abstract
In this paper, we analyze the cross-correlation properties for Chu sequences, which provide information on the
distribution of the maximum magnitudes of the cross-correlation function. Furthermore, we can obtain the number
of available sequences for a given maximum magnitude of the cross-correlation function and the sequence length.
Index Terms
Chu sequences, cross-correlation function.
I. INTRODUCTION
I
N general, it is desired to design a set of sequences with an impulsive autocorrelation function and
a zero cross-correlation function for many practical applications. However, according to the Welch
bound, the Sarwate bound, the Sidelnikov bound, the Massey bound and other bounds [1][4], it was
shown to be impossible to construct such an ideal set of sequences. Therefore, searching large families of
sequences with good auto-correlation function and cross-correlation function properties has been one of
the most interesting topics in sequence design. For evaluating the correlation properties, one good choice
is to use the maximum sidelobe magnitude of the autocorrelation function and the maximum magnitude
of the cross-correlation function, which are respectively denoted as

a
and

c
in this paper. Here, the
following questions arise naturally: how many pairs of sequences are available for a given maximum
values of

a
and

c
and what is the distribution of the magnitude of the cross-correlation function?
Among well known good sequences are Kasami [5], Gold [5], Chu [7][9] and complex four-phase [10]
sequences. For Kasami and Gold sequences, it was shown that there are

N + 1 sequences satisfying

a
= 1 and

c
= 1 +
_
2/N [5][6][11][12], where N is the sequence length. For four-phase sequences,
the number of sequences satisfying

a
= 1 +

N and

c
= 1 +

N is N + 2 [10][13][14]. On the other

hand, the autocorrelation function of Chu sequences is known to be zero except at the lag of an integer
multiple of the sequence length [7][9][15][17].
A set of Chu sequences with length N is dened as C = {a
r
| 0 < r < N, gcd(N, r) = 1}, where the
kth element of a
r
, a
r
(k), is dened as
a
r
(k) =
_

_
exp
_
j
rk
2
N
_
, N even,
exp
_
j
rk(k + 1)
N
_
, N odd.
(1)
The periodic autocorrelation function with lag ,
r
(), of the sequence a
r
is dened as

r
() =
N1

k=0
a
r
(k)a

r
(k + )+
N1

k=N
a
r
(k)a

r
(k + N). (2)
In [8], it was shown that the periodic autocorrelation function of Chu sequences satises

r
() =
_

_
N, mod N = 0,
0, mod N = 0.
(3)
Let a
r
and a
s
be any two Chu sequences with length N. Then, the cross-correlation function
r,s
() of
a
r
and a
s
with lag is dened as

r,s
() =
N1

k=0
a
r
(k)a

s
(k + ) +
N1

k=N
a
r
(k)a

s
(k + N)
=
N1

k=0
a
r
(k)a

s
(k + ),
(4)
where the last equality comes from the fact that a
r
(k +d) = a
r
(k +d +N) for an arbitrary integer d [8].
In [1] and [18], it was shown that the maximum magnitude of the cross-correlation function

c
can be
lower-bounded as a function of the sequence length and the maximum magnitude of the autocorrelation
function,

a
. By using this lower-bound, the optimum correlation properties of a set of sequences can be
dened and it follows that the lower bound of

c
is equal to

N when

a
equals zero. Certain pairs of
Chu sequences, a
r
and a
s
, meet this lower-bound when gcd(r s, N) = 1. However, in order to obtain
more Chu sequences with relatively low cross-correlation values, we need to investigate more general
cross-correlation properties.
In this paper, we derive general properties for cross-correlation function of Chu sequences. Using the
derived properties, we can obtain the magnitude distribution of the cross-correlation function. Here, the
maximum magnitude denotes the maximum magnitude value of the cross-correlation function of two
given Chu sequences among all possible lags and its distribution is taken over all possible pairs of Chu
sequences. In addition, the number of available sequences can be obtained for a given value of

c
and the
given sequence length.
The remaining of this paper is organized as follows. In Section II, the magnitude of cross-correlation
function of Chu sequences are described. In Section III, the distribution of the maximum magnitude of
the cross-correlation function and the number of available Chu sequences for given maximum cross-
correlation value and the sequence length are investigated. Finally, Section IV concludes this paper.
II. CHARACTERISTIC OF THE CROSS-CORRELATION FUNCTION OF CHU SEQUENCES
In order to investigate the cross-correlation function of Chu sequences in detail, we need to nd what
are the possible values that the cross-correlation function of Chu sequences can take, which are given in
the following theorem.
Denition 1: Let r and s be positive integers satisfying 0 < r, s < N, gcd(N, r) = 1 and gcd(N, s) =
1. Also dene g
r,s
= gcd(N, rs), u
r,s
= N/g
r,s
and v
r,s
= (rs)/g
r,s
. Then u
r,s
is relatively prime with
v
r,s
. Also, for a given lag , we can rewrite it as = i

g
r,s
+d

, where i

= /g
r,s
and d

= i

g
r,s
.
Theorem 1: The magnitude of the cross-correlation function
r,s
(), |
r,s
()|, is given as
|
r,s
()| =
_

_
_
Ng
r,s

K
(d

) , N and u
r,s
v
r,s
even, or N odd,
_
Ng
r,s

K
_
d

g
r,s
2
_
, N even and u
r,s
v
r,s
odd,
0, otherwise,
where
K
() is the Kroneker delta function.
To prove Theorem 1, the following lemmas are useful.
Lemma 1 [7][8]: The hth primitive root of unity
h
can be dened as
h
= exp
_
j2
u
h
_
, where u
is any integer relatively prime to h. Then, for any integer v, 0 < v h 1,
h1

k=0

vk
h
= 0,
h
= 1.
Lemma 2: The squared magnitude of the cross-correlation function is given as
|
r,s
()|
2
=
_

_
u
r,s
g
r,s
gr,s1

m=0
(1)
ur,svr,sm
2
exp
_
j2
smd
g
r,s
_
, N even,
u
r,s
g
r,s
gr,s1

m=0
(1)
vrm(ur,s+1)
exp
_
j2
smd
g
r,s
_
, N odd.
The proof of Lemma 2 is given in Appendix A.
Now, the proof of Theorem 1 is given as follows.
Proof of Theorem 1: First, consider the case when N and u
r,s
v
r,s
are even. Then, from Lemma 2,
we obtain
|
r,s
()|
2
= u
r,s
g
r,s
gr,s1

m=0
exp
_
j2
smd

g
r,s
_
. (5)
If d

= 0, |
r,s
(i

u
r,s
)|
2
= u
r,s
g
2
r,s
= Ng
r,s
. When, d

= 0, since s is relatively prime with g

r,s
,
|
r,s
(i

g
r,s
+ d

)|
2
= 0.
Now, consider the case when N is even and u
r,s
v
r,s
is odd. When d

= g
r,s
/2, we obtain from Lemma
2 that

r,s
_
i

g
r,s
+
g
r,s
2
_

2
= u
r,s
g
r,s
gr,s1

m=0
exp
_
j2
_

m(u
r,s
v
r,s
m + s)
2
__
. (6)
We know that s is odd because s is relatively prime with N. If m is odd, u
r,s
v
r,s
m is odd and u
r,s
v
r,s
m+s
is even. On the other hand, if m is even, u
r,s
v
r,s
m is also even. Thus, m(u
r,s
v
r,s
m + s) is always even
and it shows that |
r,s
(i

g
r,s
+ g
r,s
/2)|
2
= u
r,s
g
2
r,s
= Ng
r,s
. When d

= g
r,s
/2, from Lemma 2, we can
rewrite |
r,s
()|
2
as

r,s
(i

g
r,s
+
g
r,s
2
+ d

2
= u
r,s
g
r,s
gr,s1

m=0
exp
_
j2
_

m(u
r,s
v
r,s
m+ s)
2
+
smd

g
r,s
__
= u
r,s
g
r,s
gr,s1

m=0
exp
_
j2
smd

g
r,s
_
= 0,
(7)
where d

= d

g
r,s
/2 and the last equality comes from the fact that s is relatively prime with g
r,s
.
Finally, consider the case where N is odd. Then g
r,s
and u
r,s
should be odd. Then, from Lemma 2, we
obtain
|
r,s
(i

g
r,s
+ d

)|
2
= u
r,s
g
r,s
gr,s1

m=0
exp
_
j2
smd

g
r,s
_
=
_
Ng
r,s

k
(d

) ,
(8)
which concludes the proof.
III. DISTRIBUTION OF THE MAXIMUM MAGNITUDES OF THE CROSS-CORRELATION FUNCTION
A. The uniform property
Theorem 1 tells us that the characteristic of the cross-correlation function of two Chu sequences, a
r
and a
s
, depends only on g
r,s
= gcd(r s, N). For example, when g
r,s
= 1,

c
meets the lower bound
of

N. On the other hand, when g
r,s
= N,

c
becomes the largest value of N. However, it has not yet
been investigated how many sequences are available for a given values of

c
and the sequence length. To
answer the question, it is required to investigate the distribution of the maximum magnitude values of the
cross-correlation function.
Denition 2: Any given integer N can be represented as N =

k
i=1
p
c
i
i
, where p
i
denotes the ith
smallest prime factor of N. Let us dene
N
= {n|0 < n < N, gcd(n, N) = 1} as the index set of Chu
sequences of length N. Also, for a given integer c, dene the following sets and function as follows.
U
N,c
= {n c | 0 n < N}
R
N,c
= {n c | n
N
}
D
N,c
= {n c | 0 n < N and n /
N
}
P
m
N,c
= {np
m
c | 0 n < N/p
m
}
G
N,x
(S) = {n| n S and gcd(n, N) = x} for a given integer set S.
|A| : The cardinality of a set |A|.
From Theorem 1, we can see that the maximum magnitude of the cross-correlation function between
a
r
and a
s
is

r,s
= max

|
r,s
()| =
_
g
r,s
N. Thus, for given N, s
N
and x, it is easily seen that
G
N,x
(R
N,s
) = {r s | g
r,s
= gcd(r s, N) = x and r
N
} is the set of differences between s and
all Chu sequence indices whose maximum squared magnitude of the cross-correlation function with a
s
is equal to x. Then, |G
N,x
(R
N,s
)| is the number of available Chu sequences satisfying

2
r,s
/N = x. Then,
the main result of this subsection is given in the following theorem.
Theorem 2: Let 1 s = s

N be two different integers relatively prime with N. Then, |G

N,x
(R
N,s
)| =
|G
N,x
(R
N,s
)|.
Theorem 2 indicates that the distribution of the maximum magnitudes of the cross-correlation function
for a given Chu sequence set can be obtained by xing one sequence arbitrarily and examining the
cross-correlation functions with the other sequences. The following Lemmas 35 are useful the proof of
Theorem 2.
Lemma 3: For any two different integers c and c

, G
N,x
(U
N,c
) = G
N,x
(U
N,c
).
Proof: It has been proved that gcd(c + mN, N) = gcd(c, N) [19][20]. Then, it is easily seen that
{ gcd(c + 1, N), gcd(c + 2, N), , gcd(c + N, N) } = { gcd(1, N), gcd(2, N), , gcd(N, N) }
for any integer c. Therefore, G
N,x
(U
N,c
) = G
N,x
(U
N,c
).
Lemma 4: Let a and b be positive integers satisfying gcd(a, b) = 1. Also, for an arbitrary positive
integer m, dene C = {na c | k n < k

}, where k is an arbitrary integer and k

= k + mb. Then, C
contains exactly m integer multiples of b.
Proof: For the ith element c
i
= k
i
a c of C, we can represent it as c
i
= q(k
i
)b + e(k
i
), where
q(k
i
) = c
i
/b and e(b
i
) = c
i
mod b. Note that such a pair of q(k) and e(k) is unique for a given c
i
[20].
Let d
ij
= c
i
c
j
. Then d
ij
= (k
i
k
j
)a = {q(k
i
) q(k
j
)}b + e(k
i
) e(k
j
). Thus, e(k
i
) = e(k
j
) implies
that (k
i
k
j
) is an integer multiple of b and vice versa because a is relatively prime with b. Now, consider
the partition {C
r
, 0 r < m}, where C
r
= {k
r,i
a + c | k + rb k
r,i
< k + (r + 1)b}. Then, each C
r
contain exactly one element that is an integer multiple of b since e(k
r,i
), k +rb k
r,i
< k +(r +1)b, are
all distinct and 0 e(k
r,i
) < b, which concludes the proof.
Lemma 5: Let 1 s = s

< N be two different integers relatively prime with N. Then, if x is a

divisor of N, |G
N,x
(D
N,s
)| = |G
N,x
(D
N,s
)|.
Proof: For a given N =

k
i=1
p
c
i
i
, since D
N,s
=

k
i=1
P
i
N,s
from Denition 2, |G
N,x
(D
N,s
)| =

G
N,x
_

k
i=1
P
i
N,s
_

. Then, |G
N,x
(D
N,s
)| can be rewritten as
|G
N,x
(D
N,s
)| =
k

i=1

G
N,x
_
P
i
N,s
_

k1

i
1
=1
k

i
2
=i
1
+1

G
N,x
_
P
i
1
N,s
P
i
2
N,s
_

+
+ (1)
k2
2

i
1
=1
3

i
2
=i
1
+1

k

i
k1
=i
k2
+1

G
N,x
_
k1

m=1
P
im
N,s
_

+ (1)
k1

G
N,x
_
k

i=1
P
i
N,s
_

.
(9)
If gcd(x, p
m
) = 1, it is seen easily that there always exist N/(p
m
x) integer multiples of x among
the elements in P
m
N,s
from Lemma 4. If gcd(x, p
m
) = 1, p
m
should be a divisor of x since p
m
is a
prime number. Thus, there is no integer multiple of x among the elements in P
m
N,s
since x is relatively
prime with s. Thus, G
N,x
(P
m
N,s
) does not depend on s as long as s is relatively prime with N, i.e.,
G
N,x
(P
m
N,s
) = G
N,x
_
P
m
N,s

_
. Let M be an arbitrary subset of {1, , k}. Also, let m
i
denote the ith
element of M. Then, for a given index set M, dene L
M
N,s
=

|M|
i=1
P
m
i
N,s
= {nl
m
s | 0 n < N/l
m
},
where l
m
=

|M|
i=1
p
m
i
. Similarly, if gcd(x, l
m
) = 1, there always exist N/ (l
m
x) integer multiples of x
among elements in L
M
N,s
from Lemma 4. If gcd(x, l
m
) = 1, x should be an integer multiple of p
m
i
for
some m
i
M. Since s is relatively prime with all p
m
i
, m
i
M, there is no integer multiple of x among
the elements in L
M
N,s
. Thus, G
N,x
(L
M
N,s
) does not depend on s as long as s is relatively prime with N.
Thus, from (9), |G
N,x
(D
N,s
)| = |G
N,x
(D
N,s
)|.
The proof of Theorem 2 is now given as follows.
Proof of Theorem 2: When x is not a divisor of N, G
N,x
(R
N,s
) = regardless of s. When x is a
divisor of N, from Lemmas 3 and 5, we have already seen that |G
N,x
(U
N,s
)| and |G
N,x
(D
N,s
)| does not
depend on s as long as s is relatively prime with N and x is a divisor of N. Also, from Denition 2,
since R
N,s
D
N,s
= , |G
N,x
(R
N,s
)| = |G
N,x
(U
N,s
)| |G
N,x
(D
N,s
)|. Thus, G
N,x
(R
N,s
) does not depend
on s as long as s is relatively prime with N.
B. The distribution
In this subsection, the distribution of the maximum magnitudes of the cross-correlation function is
investigated. The main result of this subsection is given as follows.
Theorem 3: For N =

k
i=1
p
c
i
i
, 0 < x N, any s relatively prime with N, |G
N,x
(R
N,s
)| is given as
|G
N,x
(R
N,s
)| =

iMx

x
(i)

jM
k
x

x
(j), (10)
where M
x
, M
k
x
,
x
(i) and
x
(i) are dened as follows. When x is a divisor of N, M
x
denotes the
set of indices of the prime factors of x and M
k
x
= {1, , k} M
x
. Then, x can be represented as
x =

iMx
p
n
i
(x)
i
, where 0 < n
i
(x) c
i
. Also,
x
(i) and
x
(i) are dened as

x
(i) p
c
i
n
i
(x)
i
(1
K
(c
i
n
i
(x))) p
c
i
n
i
(x)1
i
,

x
(j) p
c
j
j
2p
c
j
1
j
.
When x is not a divisor of N, M
x
,
x
(i) = 0 and
x
(i) = 0, so that |G
N,x
(R
N,s
)| = 0.
The following Lemmas 610 are useful for the proof of Theorem 3.
Lemma 6 (Euler function [20]): Let (N) be the number of positive integers that are relatively prime
with N =

k
i=1
p
c
i
i
among {n| 0 < n < N}. Then, (N) is given as
(N) = N
k

i=1
_
1 p
1
i
_
. (11)
Lemma 7: If x is not a divisor of N, |G
N,x
(R
N,s
)| = 0 since gcd(r s, N) cannot be equal to x.
Lemma 8: When N is a prime number, for s
N
and 0 < x N, |G
N,x
(R
N,s
)| is given as
|G
N,x
(R
N,s
)| =
_

_
1, if x = N,
N 2, if x = 1,
0, otherwise.
(12)
Proof: Since N is a prime number, gcd(r s, N) = 1 when s = r and gcd(r s, N) = N when
s = r. Thus, |G
N,x
(R
N,s
)| = 0 for 1 < x < N. Since |
N
| = |R
N,s
| = N 1 from Denition 2,
|G
N,1
(R
N,s
)| = N 2 and |G
N,N
(R
N,s
)| = 1 .
Lemma 9: For N =

k
i=1
p
i
, its divisor x and gcd(s, N) = 1, we can denote M
x
be the set of indices
of the prime factors of x so that x =

iMx
p
i
and M
k
x
= {1, , k} M
x
. Then, |G
N,x
(R
N,s
)| is given
as
|G
N,x
(R
N,s
)| =
_

_
1, if x = N,

iM
k
x
(p
i
2), if x =

iMx
p
i
= N,
0, otherwise.
(13)
Proof: When k = 1, (13) holds from Lemma 8. Suppose that (13) holds for any divisor x of N
when k = K and let N

= Np
K+1
. Then, the set of all divisors of N

is given as {y = x or xp
K+1
| x
{all divisors of N}}. Note that
N
= { n| 0 < n < N

, gcd(n, N

) = 1} = { n + mN | n
N
, 0
m < p
K+1
, gcd(n + mN, p
K+1
) = 1}. Thus, R
N

,s
= { n s | n
N
} =

p
K+1
1
m=0
R
m
N,s
, where
R
m
N,s
= { n + mN s | n
N
, gcd(n + mN, p
K+1
) = 1 }.
When y = x for a divisor x of N, G
N

,y
(R
m
N,s
) = { n + mN | n G
N,x
(R
N,s
), gcd(n + mN, p
K+1
) =
1, gcd(n s + mN, p
K+1
) = 1 } since gcd(n s + mN, N

) = x implies gcd(n s, N) = x and

gcd(n s + mN, N

) = x if gcd(n s, N) = x and gcd(n s + mN, p

K+1
) = 1. Similarly, when
y=xp
K+1
for a divisor x of N, G
N

,y
(R
m
N,s
) = { n + mN | n G
N,x
(R
N,s
), gcd(n + mN, p
K+1
) =
1, gcd(n s + mN, p
K+1
) = p
K+1
}.
Now, dene B
N
(n) = { n + mN | 0 m < p
K+1
}. Then, it is easily seen that
|G
N

,y
(R
N

,s
)| =
p
K+1
1

m=0
|G
N

,y
(R
m
N

,s
)|
=

nG
N,x
(R
N,s
)
|B
N
(n)||
s
N,N
(x, y)|,
(14)
where
s
N,N
(x, y) = { |

nG
N,x
(R
N,s
)
B
N
(n), gcd( +s, p
K+1
) = 1 or gcd(, p
K+1
) = y/x}. From
Lemma 4, it is easily seen that |
s
N,N
(x, y) B
N
(n)| = 2 when y = x since there is exactly one element
in B
N
(n) for each of the two conditions : gcd( +s, p
K+1
) = 1 and gcd(, p
K+1
) = 1 and the elements are
different due to the fact that gcd( +s, p
K+1
) = 1 and gcd(s, N) = 1 implies gcd(, p
K+1
) = 1. Similarly,
p
K+1
1 elements are not integer multiples of p
K+1
in B
N
(n) when y = xp
K+1
since the rst condition
gcd( + s, p
K+1
) = 1 and gcd(s, N

) = 1 implies the second condition gcd(, p

K+1
) = 1 = p
K+1
.
Thus, from (14), |G
N

,y
(R
N

,s
)| = p
K+1
|G
N,x
(R
N,s
)| 2|G
N,x
(R
N,s
)| = (p
K+1
2)

iM
K
x
(p
i
2) =

iM
K+1
y
(p
i
2) when y = x and |G
N

,y
(R
N

,s
)| = p
K+1
|G
N,x
(R
N,s
)| (p
K+1
1)|G
N,x
(R
N,s
)| =

iM
K
x
(p
i
2) =

iM
K+1
y
(p
i
2) when y = xp
K+1
, which concludes the proof.
Lemma 10: For N = p
c
1
1
, its divisor x = p
n
1
(x)
1
, 0 < n
1
(x) c
1
and s
N
, |G
N,x
(R
N,s
)| is given as
|G
N,x
(R
N,s
)| =
_

x
(1), if x = p
n
1
(x)
1
,

x
(1), if x = 1,
0, otherwise.
(15)
Proof: When n
1
(x) = c
1
, G
N,N
(R
N,s
) = { r s | gcd(r s, N) = N, r
N
} = { 0 }, which
implies |G
N,N
(R
N,s
)| = 1. When 0 < n
1
(x) < c
1
, G
N,p
n
1
(x)
1
(R
N,s
) = { r s | gcd(r s, N) = p
n
1
(x)
1
, r

N
} = { r s | r = mp
n
1
(x)
1
+ s, 0 m < p
c
1
n
1
(x)
1
, gcd(m, p
1
) = 1 }. Since there are p
c
1
n
1
(x)1
1
integer multiples of p
1
among { m| 0 m < p
c
1
n
1
(x)
1
}, |G
N,p
n
1
(x)
1
(R
N,s
)| = p
c
1
n
1
(x)
1
p
c
1
n
1
(x)1
1
.
When x = 1, |G
N,1
(R
N,s
)| = { r s | gcd(r s, N) = 1, r
N
}. Note that |G
N,1
(R
N,s
)| =
|R
N,s
|

N
x=2
|G
N,x
(R
N,s
)| = |
N
|

c
1
i=1
|G
N,p
i
1
(R
N,s
)|. Since |
N
| = p
c
1
1
1
(p
1
1) from Lemma
6 and |G
N,N
(R
N,s
)| = 1, |G
N,1
(R
N,s
)| = p
c
1
1
p
c
1
1
1

c
1
1
i=1
(p
c
1
i
1
p
c
1
i1
1
) 1 = p
c
1
1
2p
c
1
1
1
.
Now, the proof of Theorem 3 is given as follows.
Proof of Theorem 3: When k = 1, (10) holds from Lemma 10. Suppose that (10) holds for any
divisor x of N when k = K and let N

= Np
c
K+1
K+1
. Then, the set of all divisors of N

is given as a
{ xp
l
K+1
| x {all divisors of N}, 0 l c
K+1
}. Note that
N
= { n| 0 < n < N

, gcd(n, N

) = 1} =
{ n + mN | n
N
, 0 m < p
c
K+1
K+1
, gcd(n + mN, p
K+1
) = 1}. Thus, R
N

,s
= { n s | n
N
} =

m{0, ,p
c
K+1
K+1
1}
R
m
N,s
, where R
m
N,s
= { n + mN s | n
N
, gcd(n + mN, p
K+1
) = 1 }.
When y = x for a divisor x of N, G
N

,y
(R
m
N,s
) = { n + mN | n G
N,x
(R
N,s
), gcd(n + mN, p
K+1
) =
1, gcd(n s + mN, p
K+1
) = 1 } since gcd(n s + mN, N

) = x implies gcd(n s, N) = x and

gcd(ns +mN, N

) = x if gcd(ns, N) = x and gcd(ns +mN, p

K+1
) = 1. Also, when y = xp
l
K+1
for a divisor x of N and 1 l c
K+1
, G
N

,y
(R
m
N,s
) = { n+mN | n G
N,x
(R
N,s
), gcd(n+mN, p
K+1
) =
1, gcd(n s + mN, p
l
K+1
) = p
l
K+1
}.
Now, dene B
N
(n) = { n + mN | 0 m < p
c
K+1
K+1
}. Then, it is easily seen that
|G
N

,y
(R
N

,s
)| =
p
c
K+1
K+1
1

m=0
|G
N

,y
(R
m
N

,s
)|
=

nG
N,x
(R
N,s
)
|B
N
(n)||
s
N,N
(x, y)|,
(16)
where
s
N,N
(x, y) = { |

nG
N,x
(R
N,s
)
B
N
(n), gcd( + s, p
K+1
) = 1 or gcd(, p
c
K+1
K+1
) = y/x}.
Similarly to the proof of Lemma 9, |
s
N,N
(x, y) B
N
(n)| = 2p
c
K+1
1
K+1
when y = x and |G
N

,y
(R
N

,s
)|
then is given as
|G
N

,y
(R
N

,s
)| =p
c
K+1
K+1

iMx

x
(i)

jM
K
x

x
(j) 2p
c
K+1
1
K+1

iMx

x
(i)

jM
K
x

x
(j)
=

iMy

y
(i)

jM
K+1
y

y
(j),
(17)
since M
y
= M
x
, M
K+1
y
= M
K
x
{K + 1},
y
(i) =
x
(i) for i M
x
,
y
(j) =
x
(j) for j M
K
x
and

y
(K+1) = p
c
K+1
K+1
2p
c
K+1
1
K+1
so that

iM
K+1
y

y
(j) =
_
p
c
K+1
K+1
2p
c
K+1
1
K+1
_

iMx

x
(i). Also, similarly
to the proof of Lemma 9, |
s
N,N
(x, y) B
N
(n)| = p
c
K+1
K+1
1 when y = xp
c
K+1
K+1
and |G
N

,y
(R
N

,s
)| is then
given as
|G
N

,y
(R
N

,s
)| = p
c
K+1
K+1

iMx

x
(i)

jM
K
x

x
(j)
_
p
c
K+1
K+1
1
_

iMx

x
(i)

jM
K
x

x
(j)
=

iMx

x
(i)

jM
K
x

x
(j) =

iMy

y
(i)

jM
K+1
y

y
(j),
(18)
since M
y
= M
x
{K + 1}, M
K+1
y
= M
K
x
,
y
(i) =
x
(i) for i M
x
and
y
(K + 1) = 1 so that

iMy

y
(i) =

iMx

x
(i) and

iM
K+1
y

y
(j) =

iM
K
x

x
(j) for j M
K
x
= M
K+1
y
. When y = xp
l
K+1
for 0 < l < c
K+1
, G
N

,y
(R
N

,s
) =
p
c
K+1
1
K+1
m=0
G
N

,y
(R
m
N

,s
) = { |

nG
N,x
(R
N,s
)
B
N,y
(n), = mp
l
K+1
+
s, 0 m < p
c
K+1
l
K+1
, gcd(m, p
K+1
) = 1}. Similar to the proof of Lemma 10, |G
N

,y
(R
N

,s
)| is given as
|G
N

,y
(R
N

,s
)| =
_
p
c
K+1
l
K+1
p
c
K+1
l1
K+1
_
|G
N,x
(R
N,s
)|
=
_
p
c
K+1
l
K+1
p
c
K+1
l1
K+1
_

iMx

x
(i)

jM
K
x

x
(j)
=

iMy

y
(i)

jM
K+1
y

y
(j),
(19)
since M
y
= M
x
{K+1}, M
K+1
y
= M
K
x
,
y
(i) =
x
(i) for i M
x
and
y
(K+1) = p
c
K+1
l
K+1
p
c
K+1
l1
K+1
so that

iMy

y
(i) =
_
p
c
K+1
l
K+1
p
c
K+1
l1
K+1
_

iMx

x
(i) and
y
(j) =
x
(j) for j M
K
x
= M
K+1
y
,
which concludes the proof.
C. Number of Available Chu sequences
In this section, the number of available Chu sequences satisfying a given maximum magnitude of the
cross-correlation is investigated. The main result of this subsection is given in the following theorems.
Theorem 4: Let a partial Chu sequence set C
A
be dened as C
A
= {a
r
| r A} for a given partial
index set A
N
and

A
c
be the maximum magnitude of the cross-correlation among sequences in C
A
.
Then,

A
c
|| if and only if any two elements in C
A
, a
r
and a
s
, satisfy gcd(r s, N) ||
2
/N.
Proof: The proof is apparent since

r,s
=
_
N gcd(r s, N) from Theorem 1.
Theorem 5: For a given

N || N, let X
N,
= { all divisors of N =

k
i=1
p
c
i
i
greater than
||
2
/N }, x
min
= min X
N,
, M
x
min
= {n|1 n < x
min
, gcd(n, N) = 1}, and x

min
= arg min
xX
N,
(x).
Then, the largest cardinality among partial Chu sequence sets satisfying

A
c
|| is lower bounded by
|M
x
min
| and upper bounded by (x

min
).
Proof: The lower bound is apparent from Theorem 4 since the difference of any two elements in
M
x
min
is smaller than x
min
. Now, consider the upper bound part. Dene
R
x
min
=
nNx
min
R
n
x
min
, (20)
where R
n
x
min
= {mx

min
+ n|0 m < N/x

min
} and N
x
min
= {n|1 n < x

min
, gcd(n, x

min
) = 1}.
Then, it is apparent that
n
R
x
min
and |N
x
min
| = (x

min
). Let A be any partial Chu sequence set
satisfying

A
c
||. Then, A R
n
x
min
1 because the difference of any two distinct elements in R
n
x
min
is at least x
min
. Thus, we can pick at most one element in R
n
x
min
for each n N
x
min
, which proves the
upper bound.
Lemma 11: R
n
x
min

n
= for any n N
x
min
.
Proof: Since gcd(n, x

min
) = 1, gcd(mx

min
+n, N) = gcd(n, (N/x

min
m)x

min
) = gcd(n, N/x

min
m). If gcd(n, N) = 1, gcd(mx

min
+ n, N) = 1 when m = 0. If gcd(n, N) = g > 1, gcd(mx

min
+
n, N) = 1 when 1 m = N(g 1)/(x

min
g) < N/x

min
, which concludes the proof.
Note that Lemma 11 implies that the upper bound in Theorem 5 is tight. Also, although not shown
explicitly, exhaustive search showed that we can nd a partial Chu sequence set with cardinality equal
to the upper bound for the sequence length N up to 10
5
. Thus, although not proved, we may conjecture
that the largest cardinality among partial Chu sequence sets satisfying

A
c
|| is (x

min
).
Example 1 (N = 143, || =

1430) : In this example, x

min
= x

min
= 11, R
x
min
= {11m + n | 0
m < 13 and 1 n < 11} and (x

min
) = 10. It is easily found that C
A
, A = {1, 2, , 10}, satises

A
c
|| and |A| = (x

min
).
Example 2 (N = 154, || =

1540) : In this example, x

min
= 11, x

min
= 14, R
x
min
= {14m+ n | 0
m < 11, 1 n < 14, gcd(n, 14) = 1} and (x

min
) = 6. Note that {n|1 n < 14, gcd(n, 14) = 1} =
{1, 3, 5, 9, 11, 13} and 11 is not relatively prime with N so that it cannot be included in a partial Chu
sequence set. Instead of 11, pick 14 2 + 11 = 39 to construct A = {1, 3, 5, 9, 13, 39}. Then, it is easily
found that C
A
satises

A
c
|| and |A| = (x

min
).
The three subgures in Fig. 1 shows the number of available Chu sequences satisfying |

A
/N|
2
<
2
N
for
2
N
= 0.01, 0.05, 0.1, when N is around 512, 1024, and 2048, respectively. Also, Table I gives the
prime factors of N used in Fig. 1. It is well known that N is preferred to be a prime number, which
is conrmed from the results. Also, the results indicate that, in cases we must choose N among non-
prime numbers by some reason, the number of available Chu sequences tends to increase as the smallest
difference between prime factors increases. Thus, it is preferred to choose N composed of two prime
factors with relatively large difference (e.g., 508, 514, 515, 2045, 2049, 2051 as shown in Table I.
IV. CONCLUSIONS
In this paper, we analyzed generalized cross-correlation properties for Chu sequences. From the analysis,
it was obtained that i) the magnitude of the cross-correlation function between any two Chu sequences for
all possible lags, ii) the distribution of the maximum magnitude of the cross-correlation among a given
Chu sequence set and iii) the number of available Chu sequences satisfying a given cross-correlation
constraint.
APPENDIX
A. Proof of Lemma 1
When N is an even number, we can rewrite
r,s
() as

r,s
() =
N1

k=0
exp
_
j
rk
2
N
_
exp
_
j
s (k + )
2
N
_
= exp
_

s
2
u
r,s
g
r,s
_
ur,sgr,s1

k=0
exp
_
j2
_
v
r,s
k
2
2u
r,s

sk (i

g
r,s
+ d

)
u
r,s
g
r,s
__
.
(21)
Then, the squared magnitude, |
r,s
()|
2
, is given as
|
r,s
()|
2
=
ur,sgr,s1

k=0
ur,sgr,s1

l=0
exp
_
j2
_
v
r,s
k
2
2u
r,s

sk (i

g
r,s
+ d

)
u
r,s
g
r,s
__
exp
_
j2
_
sl (i

g
r,s
+ d

)
u
r,s
g
r,s

v
r,s
l
2
2u
r,s
__
.
(22)
The last term in (22) is periodic with period u
r,s
g
r,s
because
exp
_
j2
_
s(l + u
r,s
g
r,s
)(i

g
r,s
+ d

)
u
r,s
g
r,s

v
r,s
(l + u
r,s
g
r,s
)
2
2u
r,s
__
= exp
_
j2
_
sl(i

g
r,s
+ d

)
u
r,s
g
r,s

v
r,s
l
2
2u
r,s
__
exp
_
jv
r,s
u
r,s
g
2
r,s
_
exp {j2(i

g
r,s
+ d

+ lg
r,s
v
r,s
)}
= exp
_
j2
_
sl(i

g
r,s
+ d

)
u
r,s
g
r,s

v
r,s
l
2
2v
r,s
__
,
(23)
where the last equality comes from the fact that g
r,s
is always even so that exp
_
jv
r,s
u
r,s
g
2
r,s
_
= 1
because r s should be even when N is even. For a periodic function f(x) with period N, it is easily
seen that
N1

l=0
f(l) =
N+k1

e=k
f(e). (24)
Then, from (23) and (24), (22) can be rewritten as
|
r,s
()|
2
=
ur,sgr,s1

k=0
exp
_
j2
_
v
r,s
k
2
2u
r,s

sk (i

g
r,s
+ d

)
u
r,s
g
r,s
__

ur,sgr,s+k1

e=k
exp
_
j2
_
se (i

g
r,s
+ d

)
u
r,s
g
r,s

v
r,s
e
2
2u
r,s
__
=
ur,sgr,s1

k=0
exp
_
j2
_
v
r,s
k
2
2u
r,s

sk (i

g
r,s
+ d

)
u
r,s
g
r,s
__

ur,sgr,s1

e=0
exp
_
j2
_
s(e + k) (i

g
r,s
+ d

)
u
r,s
g
r,s

v
r,s
(e + k)
2
2u
r,s
__
=
ur,sgr,s1

e=0
exp
_
j2
_
v
r,s
e
2
2u
r,s

se (i

g
r,s
+ d

)
u
r,s
g
r,s
__
ur,sgr,s1

k=0
exp
_
j2
v
r,s
ke
u
r,s
_
.
(25)
The last term can be divided in two terms in (25), when e = mu
r,s
and e = mu
r,s
for 0 m < g
r,s
.
Therefore, it can be expressed as
|
r,s
()|
2
=

e=mur,s
exp
_
j2
_
v
r,s
e
2
2u
r,s

se (i

g
r,s
+ d

)
u
r,s
g
r,s
__
ur,sgr,s1

k=0
exp
_
j2
v
r,s
ke
u
r,s
_
+

e=mur,s
exp
_
j2
_
v
r,s
e
2
2u
r,s

se (i

g
r,s
+ d

)
u
r,s
g
r,s
__
ur,sgr,s1

k=0
exp
_
j2
v
r,s
ke
u
r,s
_
.
(26)
When e = mu
r,s
for 0 m < g
r,s
, the last term is equal to 0 from Lemma 1 in (26) because u
r,s
is
relatively prime with v
r,s
. Accordingly, we can rewrite (26) as follows
|
r,s
()|
2
=

e=mur,s
exp
_
j2
_
v
r,s
e
2
2u
r,s

se (i

g
r,s
+ d

)
u
r,s
g
r,s
__
ur,sgr,s1

k=0
exp
_
j2
v
r,s
ke
u
r,s
_
=
gr,s1

m=0
exp
_
j2
_
v
r,s
u
r,s
m
2
2

sm(i

g
r,s
+ d

)
g
r,s
__
ur,sgr,s1

e=0
exp (j2v
r,s
me)
= u
r,s
g
r,s
gr,s1

m=0
(1)
vr,sur,sm
2
exp
_
smd

g
r,s
_
.
(27)
When N is an odd number, we can derive |
r,s
()|
2
in similar to case when N is even. Accordingly, we
can rewrite |
r,s
()|
2
as

r,s
() =
N1

k=0
exp
_
j
rk (k + 1)
N
_
exp
_
j
s (k + ) (k + 1 +)
N
_
= exp
_
j
s (
2
+ )
u
r,s
g
r,s
_
ur,sgr,s1

k=0
exp
_
j2
_
v
r,s
(k
2
+ k)
2u
r,s

sk (i

g
r,s
+ d

)
u
r,s
g
r,s
__
.
(28)
Then, the squared magnitude, |
r,s
()|
2
, is given as
|
r,s
()|
2
=
ur,sgr,s1

k=0
ur,sgr,s1

l=0
exp
_
j2
_
v
r,s
(k
2
+ k)
2u
r,s

sk (i

g
r,s
+ d

)
u
r,s
g
r,s
__
exp
_
j2
_
sl (i

g
r,s
+ d

)
u
r,s
g
r,s

v
r,s
(l
2
+ l)
2u
r,s
__
.
(29)
The last term in (29) is periodic with period u
r,s
g
r,s
because
exp
_
j2
s (l + u
r,s
g
r,s
) (i

g
r,s
+ d

)
u
r,s
g
r,s
_
exp
_
_
_
j
v
r,s
_
(l + u
r,s
g
r,s
)
2
+ (l + u
r,s
g
r,s
)
_
u
r,s
_
_
_
= exp
_
j2
_
sl (i

g
r,s
+ d

)
u
r,s
g
r,s

v
r,s
(l
2
+ l)
2u
r,s
__
exp(jv
r,s
g
r,s
u
r,s
(g
r,s
+1))exp(j2(i

g
r,s
+d

+lg
r,s
v
r,s
))
= exp
_
j2
_
sl (i

g
r,s
+ d

)
u
r,s
g
r,s

v
r,s
(l
2
+ l)
2u
r,s
__
,
(30)
where the last equality comes from the fact that g
r,s
+1 is always even so that exp (jv
r,s
g
r,s
(u
r,s
g
r,s
+ 1)) =
1 because r s should be odd when N is odd. Then, from (24) and (30), (29) can be rewritten as
|
r,s
()|
2
=
ur,sgr,s1

k=0
exp
_
j2
_
v
r,s
(k
2
+ k)
2u
r,s

sk (i

g
r,s
+ d

)
u
r,s
g
r,s
__

ur,sgr,s+k1

e=k
exp
_
j2
_
se (i

g
r,s
+ d

)
u
r,s
g
r,s

v
r,s
(e
2
+ e)
2u
r,s
__
=
ur,sgr,s1

e=0
exp
_
j2
_
v
r,s
(e
2
+ e)
2u
r,s

se (i

g
r,s
+ d

)
u
r,s
g
r,s
__
ur,sgr,s1

k=0
exp
_
j2
v
r,s
ke
u
r,s
_
.
(31)
The last term can be divided in two terms in (31), when e = mu
r,s
and e = mu
r,s
for 0 m < g
r,s
.
Therefore, it can be expressed as
|
r,s
()|
2
=

e=mur,s
exp
_
j2
_
v
r,s
(e
2
+ e)
2u
r,s

se (i

g
r,s
+ d

)
u
r,s
g
r,s
__
ur,sgr,s1

k=0
exp
_
j2
v
r,s
ke
u
r,s
_
+

e=mur,s
exp
_
j2
_
v
r,s
(e
2
+ e)
2u
r,s

se (i

g
r,s
+ d

)
u
r,s
g
r,s
__
ur,sgr,s1

k=0
exp
_
j2
v
r,s
ke
u
r,s
_
.
(32)
When e = mu
r,s
for 0 m < g
r,s
, the last term is equal to 0 from Lemma 1 in (32) because u
r,s
is
relatively prime with v
r,s
and we can rewrite (32) as follows
|
r,s
()|
2
=

e=mur,s
exp
_
j2
_
v
r,s
(e
2
+ e)
2u
r,s

se (i

g
r,s
+ d

)
u
r,s
g
r,s
__
ur,sgr,s1

k=0
exp
_
j2
v
r,s
ke
u
r,s
_
=
gr,s1

m=0
exp
_
j2
_
v
r,s
m(u
r,s
+ 1)
2

sm(i

g
r,s
+ d

)
g
r,s
__
ur,sgr,s1

e=0
exp (j2v
r,s
me)
= u
r,s
g
r,s
gr,s1

m=0
(1)
vr,sm(ur,s+1)
exp
_
smd

g
r,s
_
.
(33)
On that way we have proved Lemma 1.
ACKNOWLEDGMENT
This research was supported by the MKE (Ministry of Knowledge Economy), Korea, under the ITRC
(Information Technology Research Center) support program supervised by the IITA (Institute of Informa-
tion Technology Assessment) (IITA-2008-(C1090-0801-0011))
REFERENCES
[1] D. V. Sarwate, Bounds on correlation and autocorrelation of sequences,, IEEE Trans. Inform. Theory, vol. IT-25, pp 720724 Nov.
1979
[2] L. R. Welch, Lower bounds on the maximum cross correlation of signals, , IEEE Trans. Inform. Theory, vol. IT-20, No. 3, pp. 603616,
May 1991.
[3] V. M. Sidelnikov, On mutual correlation of sequences, , Soviet Math Doklady, vol. IT-12, No. 1, pp. 197201, 1991.
[4] J. L. Massey, On Welchs bound for the crosscorrelation of a sequence set, , IEEE ISIT90, pp. 385, San Diego, CA, USA, Sep. 1990.
[5] T. Kasami,Weight Distribution Formula for Same Class of Cyclic Codes, , Coordinated Science Lab., Univ. Illinois at Urbana-
Champaign, Urbana, II., Tech. Rep. R285, 1966.
[6] R. Gold, Maximal recursive sequences with 3-valued recursive crosscorrelation functions, , IEEE Trans. Inform. Theory, vol. IT-14,
pp. 154156, Jan. 1968
[7] R.L. Frank and S. A. Zadoff,Phase shift pulse codes with good periodic correlation properties, , IRE Trans. Inform. Theory, vol. IT-8,
pp. 381382, Oct. 1962.
[8] D.C. Chu, Polyphase codes with good periodic correlation properties, , IEEE Trans. Inform. Theory, vol. IT-18, pp. 531532, July
1972.
[9] R. L. Frank, Comments on Polyphase codes with good correlation properties, , IEEE Trans. Inform. Theory, vol. IT-19, pp. 244, Mar.
1973
[10] S. Bozta, R. Hammons and P. V. Kummer, 4-phase sequences with near optimum correlation properties, , IEEE Trans. Inform. Theory,
vol. 38, pp. 11011113, May 1992.
[11] D. V. Sarwate and M. B. Pursley, Crosscorrelation properties of pseudo random and related sequencs,, Proc. IEEE, vol. 68, pp
593618, May. 1980.
[12] S. I. Park, S. R. Park, I. Song, and N. Suehiro, Multiple acces interference reduction for QS-CDMA system with a novel clss of
polyphase sequences,, IEEE Trans. Inform. Theory, vol. 46, pp. 14881458, July 2000
[13] P. Fan and M. Darnell,Sequence Design for Communications Applications,, (Wiley and RSP, New York, 1996) ISBN 0-471-96557-x
[14] S. R. Park, I. Song, S. Yoon and J. Lee, A New polyphase sequence with perfect even and good odd cross-correlation functions for
DS/CDMA systems, , , IEEE Trans. Vehicular Tech., vol. 51, No. 5, pp. 829832, Sep. 2002
[15] B. M. Popovic, Generalized chirp-like polyphase sequences with optimum correlation properties, , IEEE Trans. Inform. Theory, vol.
IT-38, pp. 14061409, July 1992 15211523A.B Nov. 2002
[16] Y. Liu and P. Fan, Modied Chu sequences with smaller alphabet sized,, Electron. Lett.,vol. 40 No. 10, pp. 315-316A.B , May. 2004
[17] L. Lu and V. K. Dubey, Extended orthogonal polyphase codes for multicarrier CDMA System, , , IEEE Comm. Lett., vol. 8, No. 12,
pp. 700702, Dec. 2004
[18] D.Y. Peng, and P.Z. Fan, Generalized Sarwate bounds on the periodic autocorrelation and crosscorrelations of binary sequences, ,
Electron. Lett.,vol. 38(24), pp.
[19] R. Kwiatek and G. Zwara, The divisibility of intergers and integer relatively primes,, Formalized Mathematics., vol. 1, No. 5, pp.
855866, Nov. 1990
[20] D. M. Burton, Elementary number theory,, (Allyn and Bacon, 1980) ISBN 0-205-06978-9
TABLE I
THE PRIME FACTORS OF ADJACENT NUMBERS FOR N = 512, 1024 AND 2048
N 507 508 509 510 511 512 513 514 515 516 517
Prime factors 3, 13
2
2
2
, 127 509 2, 3, 5, 17 7, 73 2
9
3
3
, 19 2, 257 5, 103 2
2
, 3, 43 11, 47
N 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029
Prime factors 1019 2
2
, 3, 5, 17 1021 2, 7, 73 3, 11, 31 2
10
5
2
, 41 2, 3
3
, 19 13, 79 2
2
, 257 3, 7
3
N 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053
Prime factors 3
2
, 227 2
2
, 7, 73 5, 409 2, 3, 11, 31 23, 89 2
11
3, 683 2, 5
2
, 41 7, 293 2
2
, 3
3
, 19 2053
500 505 510 515 520 525
100
200
300
400
500
600
700
Length of sequences
N
u
m
b
e
r

o
f

a
v
a
i
l
a
b
l
e

s
e
q
u
e
n
c
e
s


|
N
|
2
=0.01
|
N
|
2
=0.05
|
N
|
2
=0.1
1010 1015 1020 1025 1030 1035
200
400
600
800
1000
1200
1400
Length of sequences
N
u
m
b
e
r

o
f

a
v
a
i
l
a
b
l
e

s
e
q
u
e
n
c
e
s


|
N
|
2
=0.01
|
N
|
2
=0.05
|
N
|
2
=0.1
2035 2040 2045 2050 2055 2060
0
500
1000
1500
2000
2500
Length of sequences
N
u
m
b
e
r

o
f

a
v
a
i
l
a
b
l
e

s
e
q
u
e
n
c
e
s


|
N
|
2
=0.01
|
N
|
2
=0.05
|
N
|
2
=0.1
Fig. 1. Number of available sequences for a given maximum magnitude bound of the cross-correlation function