References
sequence)
1 TONG, s.Y.:Synchronization recovery techniques for binary cyclic
codes, BellSyst. Tech. J., 1966, 45, (4), pp. 561-596
2 TAVARSE, s.E., and FUKADA, M.: Further results on the
synchronization of binary cyclic codes, IEEE Trans., 1970, IT-16,
(3), pp. 238-241
3 CHOI, Y.-H.: Burst synchronisationand error detection with a single
CRC decoder, Electron. Lett., 1997, 33, (l), pp. 13-15
Method for generating sets of orthogonal
sequences
H. Donelan a n d T. OFarrell
A new, systematic method of generating orthogonal sets of
sequences with good correlation properties is described. An
orthogonal set is defined as a collection of n sequences, of length
n chps, that are mutually orthogonal. Although there are many
possible orthogonal sets of a specified length, few have been
identified with a structured method of generation such as Walsh
codes and orthogonal Gold codes.
Introduction: Orthogonal sequences are utilised in many applica-
tions, in particular CDMA spread spectrum systems to improve
the bandwidth eficiency. The most common orthogonal
sequences, and those employed in or proposed for todays commu-
nications systems, are Walsh codes [ 11 and more recently orthogo-
nal Gold codes [2]. The new algorithm proposed is related to that
used to generate orthogonal Gold codes but produces large num-
bers of different orthogonal sets with favourable cross-correlation
values between sets of the same size. The procedure generates (n -
1) distinct, orthogonal sets of n sequences with length n. Sequences
are represented by the notation (x,} = (xo,xl, x2 ... x + ~ and
) {xk)
denotes a set of sequences: {x,O}, {xr},{x;} ... {x;-l}. The
sequences contain elements of the alphabet { 1, -1). Equivalent
definitions can be used by mapping 1 -+ 0 and -1 + 1 and replac-
ing multiplication operations between elements with modulo-2
addition.
Method of construction: The orthogonal sequences are developed
from a set of sequences created using the Gold sequence construct.
Gold sequences are constructed from a preferred pair of maximal
length sequences, by the element-by-elementmultiplication of one
sequence with every time shift of the second sequence. Orthogonal
Gold sequences can then be constructed from this family of Gold
sequences by appending an additional 1 to the end of each
sequence. Although, for optimum periodic cross-correlation the
two m-sequences should be preferred pairs [3], this construct can
be applied to any pair of m-sequences, of the same length, to pro-
duce orthogonal sets of sequences. Using the new method, orthog-
onal sequences are developed from a family of sequences
generated using the Gold construct, i.e. sequences generated by
the multiplication of one m-sequence with all shifts of a second m-
sequence. The two sequences are not necessarily preferred pairs.
Two m-sequences of lengths (n - 1) are represented by { a ; ) and
{bi},where
{a,} = (aO,al,a2,...,an-2)
{bi} = (boibl,b2>...rbn-2) (1)
Use of the Gold construct method on these two sequences
forms the set of sequences given by
o 5 R <n-1
{gP} = {0{U;}
{Ui)
x T k { b ; } for
for k = n - 1
otherwise
(2)
where Ik{b;}represents a cyclic shift of {b;}by k chips and x is
the element by element multiplication. As shown in eqn. 2 the
final member of the set is one of the original m-sequences, {ai}.
For future reference, the above set of sequences will be referred to
as a Gold constructed set of sequences. Performing the following
procedure on the above Gold constructed sequences produces a
set of orthogonal sequences:
ELECTRONICS LETTERS 2nd September 7999
Step 1: make the entry in column 1 a 1 (the first chip of the
Step 2: if the first chip of the sequence was already I and has
not, therefore, been altered by step 1 then a f f i a -1 on
the end of the sequence
Step 3: if the first chip of the sequence was a -I to begin with
and has, therefore, been altered by step 1 then a f f i a 1
on the end of the sequence
Step 4: repeat steps 1-3 for all sequences of the Gold constructed
set.
This procedure can be represented as follows:
Let {U%)) be the set of sequences {g@)} with the first chip, go(k),
of every sequence removed. Then the orthogonal set of sequences
can be represented by
{U} = (1, { U } , -gP)) (3)
The set of sequences (dk)}is a set of n sequences of length n that
are orthogonal to each other. By following the same procedure
with the same m-sequences but with the m-sequences in a different
initial phase shift, an entirely different set of orthogonal sequences
is generated.
{a,>z = (u1,a2,. . .,an-2,ao) = T1{a,}
{ h } 2 = ( b l , bar. . . , bn-2, bo) = T1{bt} (4)
For each of the initial phases of the m-sequences, where the cir-
cular shift is the same on both m-sequences, there is a different
orthogonal set. These have been called base sets and are distinct
from each other; no sequence appears in more than one set. For
two m-sequences of length (n - I), there exists (n - 1) base sets of
n sequences, length n.
Alternative constructs: By changing the initial phases or shifts of
the m-sequences the base sets produced are different. The (n - 1)
base sets created above can be used as a basis on which to study
the influence of the initial shift of the m-sequences on the con-
struction of the base sets produced by them. First, the interchang-
ing of {ai} and {b;}so that the Gold constructed family is derived
from {b;}multiplied by all shifts of {ai} produces, as before, a
Gold constructed family for each of the (n - 1) phase shifts. From
these, the new base sets are formed. The sequences produced are
the same as those in the original base sets, as the same combina-
tions of shifted m-sequences are used, but in this case they appear
in a different order and are therefore grouped into different base
sets. These sets are still orthogonal, so the order of the m-
sequences is irrelevant to the generation of orthogonal sets. Sec-
ondly, shifting the initial phase of one of the sequences with
respect to the other produces the same combination of sequences
grouped into the same base sets but the order of sequences is
dependent on the size of the circular shift on the one m-sequence.
Investigations were carried out to examine the effects of changing
a different column to all ones (step 1) other than the first column.
Excluding the original base sets, an additional [(n- 1) x (n - 2)]
orthogonal sets can be produced. These sets are not completely
distinct from the original base sets; some of the sequences from
the base sets were repeated within these new sets. All the above
variations on the new method still produce orthogonal sets of
sequences. A pair of m-sequences produces (n 1) base sets and
~
all variations as described above, concerning the initial phase shift
of the m-sequences and changing different columns, are related
back to these base sets.
Correlation properties: In CDMA systems, orthogonal sequences
are used to separate users sharing the same bandwidth. At the
receiver, the signal is correlated with the users unique sequence to
recover the information conveyed. Owing to the orthogonality
between the required users sequence and all other sequences, the
correlation between all other users is zero, therefore there is no
interference. Orthogonal spreading can only be used if all the users
are synchronised, as the cross-correlation value between sequences
at different time shifts is not zero. in the TIA IS-95 CDMA system
the forward channel is synchronous and therefore orthogonal
spreading can be used. 64 Walsh codes are used to provide orthog-
onality between users in the same cell. A users data are first
spread by one of the 64 Walsh codes and then masked by a long
pseudo-noise (I) sequence, unique to the cell so that the same 64
Vol. 35 No. 78 1537
Walsh codes can be reused in each cell. In this case the interfer-
ence between users of another cell behaves like any long PN code.
The new method presented here generates more than one set of
distinct sequences for a given sequence length. To explore the pos-
sibility of using more than one set simultaneously, i.e. a different
set allocated to each cell, the maximum interference between
sequences of different cells must be quantified. This can be repre-
sented as the peak cross-correlation value at zero time shift
between sequences.
All base sets of size n x n for values of n = 8, 16, 32, 64, 128
and 256 were created and the peak-cross correlation value at zero
time shift between all combinations of sequences of the same
length recorded and displayed in Table 1. The results improve in
relation to set size as the set size increases. Sets of size 32 and
above exhibit good set cross-correlation properties as the maxi-
mum value is less than half the sequence length. Such sequence
sets would therefore offer lower intercell interference levels,
thereby enhancing the capacity of a CDMA cellular system.
Table 1: Values of set cross-correlation
8x8 I 4
16 x 16 15 8 wireless/personal communications (Prentice Hall PTR, Upper
32 x 32 31 8
64x64 63 16
128 x 128 127 20
256 x 256 255 32
Conclusion: In summary, a novel method for generating sets of
orthogonal sequences has been described. For a pair of m-
Note on depth spectrum and depth
distribution of binary code
Dian-Wu Yue
It is shown that the depth distribution of a linear binary code can
be determined if its depth spectrum is given. Then the relation
between the depth spectra for a linear binary code and its dual
code as well as that for a linear binary code and its extended code
are considered, and some results given.
Introduction: The notion of the depth of a finite binary sequence
was first introduced by Etzion [l]. Etzion showed that a linear
code of dimension k contains codewords of k distinct depths, and
also gave the depth spectra for the Hamming code, the extended
Hamming code, and the first-order Reed-Muller code. Mitchell [2]
extended the notion of the depth of a finite binary sequence to an
infinite binary sequence, and showed that the set of infinite
sequences of finte depth corresponds to a set of equivalence
classes of rational polynomials. For all linear cyclic codes, Mitch-
ell found the depth spectra.
This Letter is a note on the work in [l, 21. It is shown that the
depth distribution of a linear binary code can be determined if its
depth spectra are given. The relation between the depth spectra for
a linear binary code and its dual code as well as that for a linear
binary code and its extended code are then considered, and some
results given.
Preliminaries: For a sequence x = (XI, x2, ..., x,) over the finite
field F = GF(2) and an element a E GF(2), we define cuc = (ox,,
ax,,..., coc,). We also define two operators E and G from P to
F- as follows:
E : (21,~2r...,zn) + (zZ,z3,..,~n)
n )-+ ( z 1 , 2 2 , . . . ,zn-i)
G : ( z i , ~.~. ,,z .
1538 ELECTRONICS LETTERS
sequences of length (n - I), a total of (n - 1) distinct base sets can
be produced. The investigation into the properties of the sets
included measuring the peak cross-correlation between sequences
of different sets of the same size. Results were favourable for
larger sets (size 32 x 32 and above) promoting the idea of using all
sequences of the same size, [n x (n - l)] sequences in total, simulta-
neously, for orthogonal spreading sequences in a synchronous
CDMA spread spectrum environment.
Acknowledgment: This work was supported by Supergold Commu-
nication Ltd.
0 IEE 1999 25 June 1999
Electronics Letters Online No: 19991046
D 01: 10.I049Iel:I9991046
H. Donelan and T. OFarrell (Institute of Integrated Information
Systems, University of Leeds, Leeds LS2 9JT, United Kingdom)
E-mail: eenhmd@electeng.leeds.ac.uk
References
1 and WILKES J.E.: Applications of CDMA in
GARG, v.K., SMOLIK, K.,
Saddle River, 1997)
2 TACHIKAWA, s.: Recent spreading codes for spread spectrum
communication systems, Electron. Commun. Jpn., 1992, 75, (6,
Part I) pp. 4149
3 POPOVIC, B.M.: Efficient despreaders for multi-code CDMA
systems. Proc. ICUPC97, Oct. 1997, San Diego, pp. 51G520
4 DINAN, E H., and JABBARI, B.: Spreading codes for direct sequence
CDMA and wideband CDMA cellular networks, IEEE Commun.
Mug., Sept. 1998, pp. 48-54
The derivative D : P + P-l is defined as D = E - G, i.e.
D(Xl,Zz,. . . , z n ) = ( 2 2 - ~ 1 , 2 3- 2 2 , . . . ,X, - ~ ~ - 1 )
Note that D is linear operator, i.e.
and
D ( C Y X=) ~ D x
for x,y E F and a E F.
denote a sequence with i consecutive
For a E GF(2), let [a]
appearances of a.
DeJinition I : The depth of a sequence x of length n, depth(x), is
the smallest integer i such that Dx = [@-I]. If no such i exists,
then the depth of x is defined to be n.
Henceforth, let C denote an [n,k] linear code over GF(2).
De3nition 2: Let D, be the number of codewords of depth i for the
code C. The numbers Do, D1, ..., D, are called the depth distribu-
tion of C.
Theorem 3[1]: The depth distribution of C contains exactly k
nonzero values.
We refer to the set of values of i for which Di is nonzero as the
depth spectrum of C, which, by theorem 3, must contain exactly k
integers.
Results: Suppose that C has depth spectrum {dl, d2, ..., dk}, where
d, < d2 < ... < dk. Now we can give a useful result as follows:
Lemma 4: Let c be a codeword in C. Assume that Cl,,=I,2,, k is a
codeword of depth d, in C. If c = C:=,q,c,, where qt E GF(2), q, t
0, j I k, then we have depth(c) = 4.
2nd September 1999 Vol. 35 No. 18