1406 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 38, NO.

4, JULY 1992

occurs. Also, if q = p k and p > 5 , it is necessary to have k = 1, [3] 0. Moreno and J. Sotero, “Computational approach to conjecture A
as in the proof of Theorem 1. of Golomb,” Congressus Numerantium, vol. 70, pp. 7-16, 1990.
For primes p > 5 , the roots of x2 - x - 1 = 0 are (1
+
i-6 ) / 2 E (1 k 6 ) ( ( p 1)/2) ( m o d p ) . As in the proof of
Theorem 1, this restricts us to primes for which 5 is a quadratic
residue. There is, however, the further restriction that both a and Generalized Chirp-Like Polyphase Sequences with
/3 = - l / a must be primitive in GF(p). Since 1 / a is primitive iff Optimum Correlation Properties
a is primitive, the extra condition is that the factor of - 1 must not
destroy primitivity. Now, multiplication by - 1 preserves primitiv- Branislav M. Popovid
ity iff - 1 is a quadratic residue mod p , which occurs iff p = 1
(mod 4). Combined with the requirement that 5 be a quadratic Abstract-A new general class of polyphase sequences with ideal
residue, namely p = f 1 (mod IO), this restricts G4 to primes periodic autocorrelation function is presented. The new class of se-
quences is based on the application of Zadoff-Chu polyphase sequences
p = 1 (mod 20) or p = 9 (mod 20). of length N = sm2, where s and m are any positive integers. It is shown
It remains only to show that all primes in these two residue that the generalized chirp-like sequences of odd length have the opti-
classes modulo 20 for which the T, construction occurs also have mum crosscorrelation function under certain conditions. Finally, re-
the G4 construction, and that no other such primes have the G4 cently proposed generalized P4 codes are derived as a special case of the
construction. generalized chirp-like sequences.
+
If f ( x ) = x2 x - 1 then f ( - x ) = x 2 - x - 1 , so the roots Index Terms-Sequences, codes, spread-spectrum, radar, pulse com-
+
of x 2 - x - 1 are the negatives of the roots of x 2 x - 1. Also, pression.
we are considering only primes for which a factor of - 1 has no
I. INTRODUCTION
effect on primitivity. We have already seen that the roots of
x2 - x - 1 are primitive or imprimitive together in the fields under Sequences with ideal periodic autocorrelation function [ 11-[5] are
consideration, so this also must hold for the roots of x 2 + x - 1. finding their applications in the field of spread spectrum communica-
By Theorem 1, the construction occurs iff at least one of the tions [I], construction of (super) complementary sets [6], [7], etc.
+
roots of x 2 x - 1 is primitive in GF( p ) ; but for p = 1 , 9 (mod These sequences usually have small aperiodic autocorrelation and
20) this will mean that both roots are primitive, and also that both ambiguity function sidelobes, so they are very useful in the pulse
roots of x 2 - x - 1 will be primitive. Conversely, if a root of compression radars (71-[IO].
x 2 - x - 1 is not primitive, then both its roots are imprimitive, and On the other hand, spread spectrum multiple access systems
the roots of x 2 + x - 1 are also imprimitive. 0 demand minimum possible crosscorrelation between the sequences
within selected set of sequences having good periodic autocorrela-
In the G4 construction for Costas arrays, since a + = 1 and tion function properties. Sarwate [5] has shown that the maximum
a p = - 1, certain symmetries can be expected relative to the main magnitude of the periodic crosscorrelation function and the maxi-
diagonal. mum magnitude of the periodic autocorrelation function are related
Theorem 4: Every Costas array given by the G4 construction through an inequality, which provides a lower bound on one of the
modulo a prime p > 5 has the points (1, 1) and ( ( p - 3)/2, ( p - maxima if the value of the other is specified. By using this inequal-
3)/2) on the main diagonal, and the pairs of points (2, p - 2), ( p ity the optimum correlation properties of the set of sequences can be
- 2 , 2 ) a n d ( ( p + 1 ) / 2 , ~ - 3 ) , ( p - 3 , ( p + 1)/2)situatedsym- defined. So, when the maximum magnitude of the periodic autocor-
metrically with respect to the main diagonal. relation function equals zero, from the Sarwate’s inequality it
follows that the lower bound for the maximum magnitude of the
Proof: Since a + (3 = a’ + 6’ = 1, ( 1 , 1) is a point of the periodic crosscorrelation is equal to d??, where N is the length of
array. From a = - @ - I and p = - a - ’ , and using a ( P - 1 ) /=2 sequences.
p(P-1)/2= - 1, it follows that = ( - 1)(p-l) = @ ( P - 1 ) / 2 p - 1 = In this correspondence, we shall present a new general class of
p(P-3)/2, and similarly (3 = ( - I ) ( ( y - l ) = ,(P-1)/2cy-1 =
polyphase sequences with ideal periodic autocorrelation function,
a ( P - 3 ) / 2 . Thus, 1 = cy + p = / 3 ( P - 3 ) / 2 + ~ ( p - ~ ) /whence
* , ( ( p - having at the same time the optimum crosscorrelation function. The
3)/2, ( p - 3)/2) is a point of the array. new sequences can be classified as the modulatable orthogonal
From Definition 2, a’ + +
p-’ = 1; that is, a 2 p p - 2 = 1, and sequences, according to the terminology from [ 11. The generalized
+
(2, p - 2 ) is a point of the array. From a p = - 1, p2 a-’ = Frank sequences, of length N = m 2 , where m is any positive
pz - = 1, because (as shown in the proof of Theorem 2), @ is a integer, are presented in [l] as the only known example of the
root of x 2 - x - 1 = 0. Hence, (-1,2) = ( p - 2 , 2 ) is also a modulatable orthogonal sequences. It is noticed that these sequences
point of the array. Next, +
+ p ( P + ’ ) / 2 = a - 2 0 . p ( P - 1 ) / 2 also have interesting aperiodic autocorrelation function properties
= p2 - (3 = 1, and similarly p P - 3 + +
a ( p f 1 ) /=2 (3-* a .
[lo].
a(P-11’2 = a 2 - a = 1 , from which both ( p - 3, ( p + 1)/2) and In Section 11, the basic definitions are given. In Section 111, we
+
( ( p 1)/2, p - 3) are points of the array. 0 present the generalized chirp-like sequences. In Section 111-A, we
Note: Fig. 1 shows that, except for the six points identified in show that the generalized chirp-like sequences have the ideal peri-
Theorem 4, none of the other points of the G4 construction need be odic autocorrelation function. Section 111-B concerns the periodic
symmetrically situated relative to the main diagonal. crosscorrelation function of the generalized chirp-like sequences.
Finally, in Section IV, we show that the recently proposed general-
REFERENCES
[l] S. W. Golomb and H. Taylor, “Constructions and properties of Manuscript received June 11, 1991; revised November 19, 1991,
Costas arrays,” Proc. IEEE, vol. 72, pp. 1143-1 163, Sept. 1984. The author is with IMTEL Institute of Microwave Techniques and Elec-
[2] S. W. Golomb, “Algebraic constructions for Costas arrays,” J . tronics, B. Lenjina 165b., 11071 Novi Beogred, Yugoslavia.
Combin. Theory ( A ) , vol. 37, no. 1, pp. 13-21, July 1984. IEEE Log Number 9107517.

0018-9448/92$03.00 0 1992 IEEE

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 38, NO. 4 , JULY 1992 1407

ized P4 codes are only a special case of the generalized chirp-like (GCL) sequence I s k } is defined as
sequences.
sk = akb(k)modm, k = O;.., N- I, (7)
11. BASICDEFINITIONS where ( k )mod m means that index k is reduced modulo m.
The following definitions will be useful. Example: For N = 8 , we have that s = 2 and m = 2, so the
A primitive nth root of unity W,, is defined as generalized chirp-like sequence { sk} is given by
w,, = e x p ( - j 2 ~ r / n ) , j = J F , (1) {sk) = { ~ o , ~ l ~ 0 5 , b o ~ 2 , ~ , W 4 ~ 5 , b o ,

where r is any integer relatively prime to n. b , W 4 . 5 ,b o w 2 ,b , W o 5 } , (8)

It can be easily shown that for any integer U , 0 <U 5 n - 1, the where W = exp ( - j 2 ~ r / 8 )j , = J-1,
r is any integer rela-
following relation is valid [l 11 tively prime to N = 8,q = 0, while bo and b , are arbitrary
n- 1 complex numbers with magnitude equal to 1.
1 w,,*uk = 0, w,, # 1
A . Periodic Autocorrelation Function of the Generalized
k=O
Chirp-L ike Sequences
The sequence { s k } of length L is said to have the ideal periodic
autocorrelation function e( p ) if it satisfies the following relation Theorem 1 : The generalized chirp-like polyphase sequences have
the ideal periodic autocorrelation function.
Proof: It can be seen in [2] that Zadoff-Chu sequences are
defined separately for N even and N odd, in order to satisfy the

where the asterisk denotes complex conjugation, the index ( k + P ) It can be easily proved that generalized chirp-like polyphase
is computed modulo L , time shift p is assumed to be positive sequence { s k } , defined by ( 7 ) , also satisfy the condition (9). In that
because e ( - p ) = O*(p),E = e(0) is energy of the sequence { s k } . case, the periodic autocorrelation function e( p ) of the sequence
Besides the well-known Frank sequences, and recently proposed { s k } can be written as
generalized Frank sequences [l], there is another large class of N-p- I N- 1
polyphase sequences with ideal periodic autocorrelation function.
'(P) = sksk*+p -k sksk*+p
The so-called Zadoff-Chu sequences [ 2 ] , [3] are defined as k=O k=N-p

N- I
, k = 0, 1,2;.., N I, for Neven,
, k=0,1,2;..,N-
-
1, forNodd,
= 1
k=O
'ks;+p.

q is any integer. For N even, from (4), ( 7 ) , and (lo), it follows

N- I
(4) O(P) = w -Np 2 / 2 - 4 p
1
k=O
W i p k b ( k ) m c d mb?k+p)mod m. ("1
The similar construction is proposed by Ipatov [4] and is defined
We shall introduce here the following change of variables:
by
k = ism +d, i = 0 , l;.., m - 1,
ak = W$'qk, k = 0 , 1,2;.., N - 1; d = 0, l ; . . , s m - 1.
(5)
N is odd ; q is any integer. From ( 1 1) and (12) we obtain
However, one of the referees pointed out that the class of Ipatov sm- I

sequences is equal to the class of Zadoff-Chu sequences of odd = Wi/J2/2-QPC Wipdb(d,m,m

d-O
length N . Namely, starting from the definition of Zadoff-Chu
m- I
sequences of odd length N = 2 t - 1, it follows . b<d+p)md
* m
i=O
C Wiip. (13)

If p # x m , x = 0 , 1,. . , sm - 1 , the second summation in (13)

where t = 2-' mod N . Since t is relatively prime to N , Wk is a is obviously zero, according to ( 2 ) .
primitive Nth root of unity. Hence, the right-hand side of (6) F o r p = x m , x = O , l ; . . , s m - l,from(13)weobtain
corresponds to the definition of Ipatov sequences. sm- 1
Based on the Zadoff-Chu sequences, the new, more general, = m~i(~m)2/2-qxm W[zd. (14)
class of polyphase sequences with optimum periodic autocorrelation d=O
and crosscorrelation function properties will be presented in the next If x # 0, the summation in (14) equals zero according to ( 2 ) . In
section. that way, we have proved Theorem 1 when N is even. The proof
for N odd is the same. 0
111. GENERALIZED
CHIRP-LIKE
POLYPHASE
SEQUENCES
Let { a k } , k = 0 , 1;. ., N - 1, be a Zadoff-Chu sequence of B. Periodic Crosscorrelation Function of the Generalized
length N = sm2, where m and s are any positive integers. Let Chirp-Like Sequences
{ b , } , i = 0 , . , m - 1, be any sequence of m complex numbers Let { x k } and { y k } , k = 0, 1; . ', N - 1, be the two general-
having the absolute values equal to 1. The generalized chirp-like ized chirp-like sequences of odd length, obtained from any two
1408 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 38, NO. 4, JULY 1992

complex vectors { b l , } and { b 2 i } , i = 0 , l ; . . , m - 1 , and from We shall prove now that

the two different primitive Nth roots of unity e x p ( j 2 x u l N ) and
exp ( j 2 x u / N ) , i.e., )Rx,(p)12=0, ife+O. (23)
xk W,[k(k+l)/2+9klbl We shall introduce the following change of variables
(15)
~

(k)modm,

yk ~ W;[k(k+l)/2+qklb2
k = ism +d, i = 0, l ; . . , m - 1 ,
(24)
(k)mcdm' d=O,l;..,sm- 1 '

W, = e x p ( j 2 x / N ) , From (21) and (24), we obtain

(U. N) = 1 ; ( U ,N ) = 1; U # U.Nisodd. sm- 1

Theorem 2 : The absolute value of the periodic crosscorrelation

function between any two generalized chirp-like sequences of odd m- 1
length N,obtained from the two different primitive Nth roots of * b2Td+p)mod mb2(d+p+e)modm . Wi('-u)ei.
(25)
unity exp ( J 2 a U / N ) and exp ( j 2 7r U / N ) , is constant and equal to i=O

JE, if ( U - U) is relatively prime to N. As ( U - U ) is relatively prime to N , it is also relatively prime to

Proof: The squared absolute value of the periodic crosscorrela- m , so according to ( 2 ) the inner summation in (25) is equal to zero
tion function Rx,( p ) of sequences { x k } and { y k } is defined as if e # xm, x = 0 , l ; . . , sm - 1 .
For e = x m , x = 0 , 1; . ., sm - 1 , Se also becomes equal to
N- 1 N- 1 zero, i.e..
I Rx,(P) l 2 = c
k=O
XkYk*+, c
I=O
XTYI+p.
sm- 1
se = w-(v-u)xd =
sm
0, if x # 0. (26)
Substituting ( 1 5 ) into (16), we obtain d=O

On that way we have proved the Theorem 2. 0

I Rx,( P ) I
Although the GCL sequences are defined either for odd and even
N-l N-l
= 1 ~~-~)(k-l)[(k+l+1)/2+ql-u~(k-l) lengths, we have seen that Theorem 2 . is valid only for the odd
k=O 1=0 lengths. We shall briefly discuss why it cannot be valid for even
lengths.
' b1( k ) mod m b1); mod m If the length of sequences N is even, and U and u are integers
relatively prime to N , then U and U must be odd. Consequently,
' b2Tk+p)modmb2(l+p)modm ( U - U) must be an even integer, because the difference between
any two odd integers is always an even integer. In that way, ( U - U)
We can introduce the following change of variables:
can never be relatively prime to N , and that is the reason why the
I = k + e , e = O , l ; . . , N - 1. Theorem 2 is defined only for the odd lengths.
It is interesting to note that the same fact is true for the general-
From (17) and ( 1 8 ) , we obtain ized Frank sequences [ 11. Namely, the generalized Frank sequences
are defined for lengths N = m 2 , where m is any positive integer. It
I R x J PI I is shown in [ l ] that when ( U - U ) and m are relatively prime, the
two generalized Frank sequences, corresponding to U and U, have
N-1 N-1
- ~~(u-~)e[(Zk+e+1)/2+ql+upe optimum crosscorrelation function. However, from the previous
k=O e=O discussion it follows that the pairs or sets of such sequences, having
the optimum crosscorrelation function, can exist only if m is an
' bl(k)mcdmblTk+e)mod m odd number. This important property of the generalized Frank
sequences is not explicitly mentioned in [ l ] .
b2Tk+p)modmb2(k+e+p)modm. If N is a second power of a prime number m , the set of m - 1
GCL polyphase sequences can be constructed using m - 1 different
This expression can be rewritten as
primitive Nth roots of unity. Any pair of sequences in such a set
N- 1 has the optimum crosscorrelation function, having the constant
IR ( p )I 2 = ~~(~-u)el(e+l)/2+qI+~ue~ magnitude equal to m.
XY et
e=O
IV. GENERALIZED
P4 CODES
where Se is defined as
In [9], the authors claimed that it has been found by computer
N- I simulation that a P4 code of length N = m2 can be written in terms
se = Wi(u-u)ek
of an m x m matrix with mutually orthogonal rows, and with
k=O
additional property that all rotations of any two columns are mutu-
.bl(k)modmblTk+e)mdm ally orthogonal. By postmultiplying such a matrix with the diagonal
matrix B, and concatenating the rows of the resultant matrix, the
. b2Tk+p)modmb2(k+p+e)modm. so-called generalized P4 codes with ideal periodic autocorrelation
function can be obtained.
From (20) and ( 2 1 ) , it is obvious that It can be easily seen that the generalized P4 codes can also be
obtained from the definition of generalized chirp-like sequences, by
I R ~ , (p ) I =N, if e = 0.
taking the sequence { u k } in (7) to be the P4 code.
l t O O I K A N b A L l I U N b U N I N r U K I V I A I I U N I l 7 J 2 U K 1 , V U L . JO, I Y U . L), J U L I 1409

We shall show below that the P4 codes are only a special case of B. L. Lewis and F. F. Kretschmer, “Linear frequency modulation
the Zadoff-Chu sequences, what means that the generalized P4 derived polyphase pulse compression codes,” IEEE Trans.
Aerospace Electron. Syst., vol. AES-18, no. 5, pp. 637-641, Sept.
codes are only a special case of the generalized chirp-like sequences 1982.
of length N = m2. F. F. Kretschmer, Jr. and K. Gerlach, “Low sidelobe radar wave-
The P4 code elements { a k }are given by [8], [9] forms derived from orthogonal matrices,” IEEE Trans. on AES,
vol. 27, no. I , pp. 92-101, Jan. 1991.
B. M. Popovid, “Comment on Merit factor of Frank and Chu
sequences,” Electron. Lett., vol. 27, no. 9, pp. 776-777, April 25,
1991.
R. C. Heimiller, “Author’s comment,” IRE Trans., vol. IT-8,p.
where N is any positive integer. 382, Oct. 1962.
This expression can be rewritten as

ak = W L 2 / 2 + ( N / 2 ) k , W, = exp ( jg ) . (28) Nonbinary Kasami Sequences over GF( p )

For N even, the P4 code can be obtained by substituting q = N / 2 Shyh-Chang Liu and John J. Komo, Senior Member, IEEE
in (4). For N odd, the P4 code can be obtained by substituting
q = ( N - 1)/2 in (4). Abstract-The correlation values and the distribution of these correla-
tion values are presented for the small set of nonbinary Kasami se-
As the P4 codes are only a special case of the Zadoff-Chu quences over GF( p ) ( p prime). The correlation results are an extension
sequences, it is not surprising that the P4 codes have ideal periodic of the binary results and have p +
2 correlation levels. This nonbinary
autocorrelation [9]. Kasami set is asymptotically optimum with respect to its correlation
In [2], it was shown that all the cyclic time shifted versions of the properties. These sequences are obtained, as in the binary case, from a
large primitive polynomial of degree n = 2 m and a small primitive
Zadoff-Chu sequences have the same absolute value of the aperi-
polynomial of degree m that yields a sequence length of p “ - 1 and
odic autocorrelation function. Consequently, the same is true for the +
maximum nontrivial correlation value of 1 p”’. Nonbinary Kasami
P4 codes [9]. sequences are directly implemented using shift registers and are applica-
ble for code division multiple access systems.
V. CONCLUSION
Index Terms-Kasami sequence, nonbinary, correlation levels and
In this correspondence, we have presented the new general class distribution, code division multiple access.
of polyphase sequences with ideal periodic autocorrelation function,
having at the same time the optimum periodic crosscorrelation I. INTRODUCTION
function. If the length of sequences N is a second power of a prime The set of binary Kasami sequences over GF(2) can be expressed
number m , the set of m - 1 generalized chirp-like polyphase as [ll, PI
sequences can be constructed using m - 1 different primitive Nth
roots of unity. Any pair of sequences in such a set has the optimum S= {Si(‘) IOStSN- l,lSZS2”}, (1)
crosscorrelation function, with the constant magnitude equal to
m. where
Compared with the generalized Frank sequences, the generalized
chirp-like sequences offer the higher degree of freedom for the si( t ) = t r y { tr; ( a ‘ ) + y;aT‘},
choice of sequence length.
n = 2 m , N = 2 ” - 1 , T = ( 2 ” - 1 ) / ( 2 m - 1) = 2 ” + 1 , a is a
ACKNOWLEDGMENT primitive element of GF(2”), and yi takes on each value of GF(2”)
The author is grateful to the referees for their valuable comments. for 1 s i 5 2 “ . Since aT is a primitive element of GF(2“), one
si( t ) is an m-sequence with period N and each other si( t ) is the
sum of an m-sequence with period N and a different phase of an
REFERENCES
m-sequence with shorter period 2 ” - 1 . The shorter m-sequence is
N. Suehiro and M. Hatori, “Modulatable orthogonal sequences and
their application to SSMA systems,” IEEE Trans. Inform. Theory,
a decimation by T of the longer m-sequence and the period of the
vol. 34, pp. 93-100, Jan. 1988. shorter m-sequence divides the period of the longer m-sequence.
D. C. Chu, “Polyphase codes with good periodic correlation proper- The correlation function, R i , ( r ) , 1 s i, j 5 2”, of the ith and
ties,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 531-532, July j t h sequences of S is given by
1972.
R. L. Frank, “Comments on Polyphase codes with good correlation N- 1
properties,” IEEE Trans. Inform. Theory, vol. IT-19, p. 244, Mar. Rij(?) = (- ,
l)Sl(f+T)+SI(l) 0 ~ ~ 5 N - 1 (3)
,
1973. f=O
V. P. Ipatov, “Multiphase sequences spectrums,” Izvestiya VUZ.
Radioelektronika (Radioelectronics and Communications Sys-
tems), vol. 22, no. 9, pp. 80-82, 1979. +
where t r is modulo N addition. If i and j are not cyclically
D. V. Sanvate, “Bounds on crosscorrelation and autocorrelation of distinct, R ;,(r) reduces to the autocorrelation function. The correla-
sequences,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 720-724,
Nov. 1979. Manuscript received January 15, 1991; revised November 21, 1991. This
B. M. Popovid, “Complementary sets based on sequences with ideal work was presented in part at the IEEE International Symposium on Infor-
periodic autocorrelation,” Electron. Lett., vol. 26, no. 18, pp. mation Theory, Budapest, Hungary, June 24-28, 1991.
1428-1430, Aug. 30, 1990. The authors are with the Department of Electrical and Computer Engi-
-, “Complementary sets of chirp-like polyphase sequences,” neering, Clemson University, Clemson, SC 29634-0915.
Electron. Lett., vol. 27, no. 3, pp. 254-255, Jan. 31, 1991. IEEE Log Number 9108026.

0018-9448/’92$03.00 0 1992 IEEE