5.7 DIRECT-SEQUENCE MULTIPLE-ACCESS DESIGNS
5.7.5 A Transform-Domain Design Philosophy
The linear designs of the previous section have excellent periodic correla- tion properties, but short linear spans. A transform domain design approach will now be described which results in a NLFFL design producing balanced binary sequences with optimal correlation properties and longer linear span [32], [42].
Consider two functions,r(x) and s(x), mapping the elements of GF(2d) into 1 and 1. These functions can be viewed as representing NLFFL functions
Pmax2L>21.
7 12L2#2L>2121>22L>21 Pmax aN21J12
NJ1 b1>2 12L2L>21r21>2 r2L>21,
mar1z2
340 Pseudonoise Generators
p1ch5e 8/17/01 10:27 AM Page 340
http://jntu.blog.com
operating on a Galois m-sequence generator with characteristic polynomial ma(z), whose d-stage register contents represent an(see (5.127)).
The resulting binary (1 and 1) sequences, {r(an)} and {s(an)}, have peri- odic cross-correlation at shift tgiven by
(5.292) where yat.
The inner product of r(yx) and s(x) over xHGF(2d) in (5.292) can be stud- ied in a transform domain using any inner product-preserving transform.Two closely related transforms will be considered for this purpose, the first being the trace transformwhich is defined as
(5.293) for all lHGF(2d). The following properties of the trace transform can be verified:
(a) Inversion theorem:
(5.294) (b) Multiplicative shifting theorem: For y0,
(5.295) (c) Parseval’s relation:
(5.296) (d) Additive shifting theorem:
(5.297) (5.298) Another equivalent inner-product-preserving transform is defined after a one-to-one linear mapping of GF(2d) onto the space of d-tuples with elements in GF(2). Specifically, let b1, . . . , bd be an arbitrary basis for GF(2d), and let g1, . . . ,gdbe another basis for GF(2d) with the property that (5.299) Tr1bigj2 e1, ij
0, ij.
vd
sˆ1l2 rˆ1ly2 for all l iff s1x2 r1x2 112Tr1xy2 for all x.
s1x2r1xy2 for all x iff sˆ1l2 rˆ1l2 112Tr1ly2 for all l,
xGF12a d2r1x2s1x2 a
lGF12d2rˆ1l2sˆ1l2. s1x2 r1yx2 for all x iff sˆ1l2 rˆ1y1l2 for all l.
r1x2 1 2d>2 a
lGF12d2rˆ1l2 112Tr1lx2. rˆ1l2 1
2d>2 a
xGF12d2r1x2 112Tr1lx2 r102s102 a
xGF12d2r1yx2s1x2. Rrs1t2 a
2d1 n1
r1ant2s1an2 r11n2,p, rd1n2
Direct-Sequence Multiple-Access Designshttp://jntu.blog.com 341
Two bases satisfying (5.299) are called complementary.It can be verified [42]
that every basis for GF(2d) has a complementary basis. Let xand lbe arbi- trary elements of GF(2d), represented in complementary bases by
(5.300) Coordinate values can be determined by applying (5.299) and trace linear- ity to (5.301) to yield
(5.301) for all i. These same relations allow Tr(lx) to be interpreted as an inner prod- uct of vectors of coefficients from the expansions (5.300).
(5.302) The mapping from xHGF(2d) to , can be used to define
(5.303) for all xin GF(2d), substitution of (5.302) and (5.303) into the trace trans- form definition (5.293) gives
(5.304) The right side of (5.304) defines the Fourier transform of the function R(x). The inversion theorem, Parseval’s relation, and additive shifting theo- rem for the Fourier transform are easily derived from the corresponding results for trace transforms, in view of (5.304). Both transforms will be used in the design approach to follow.
Returning to the periodic cross-correlation computation of (5.292), we now develop a bound on cross-correlation. Applying Parseval’s relation (5.296) gives
(5.305) Therefore,
(5.306) where the sum over lin (5.306) has been limited to those lfor which the corresponding term is non-zero, i.e.,
(5.307) and
(5.308) Parseval’s relation also implies that
(5.309)
lasr
0rˆ1l2 02 a
lGF12d20rˆ1l2 02 a
xGF12d20r1x2 022d, ysr5l:rˆ1y1l2 06 5ly:lsr6.
ss¢ 5l:sˆ1l2 06 0Rrs1t2 0 1 a
lysr¨ss
0rˆ1y1l2 0 0sˆ1l2 0, Rrs1t2 r102s102 a
lGF12d2rˆ1y1l2sˆ1l2. R1l2 rˆ1l2 1
2d>2a
xvd
R1x2112ltx¢ R1l2. R1x2¢ r1x2
xvd Tr1lx2xtL.
xiTr1gix2, liTr1bil2 x a
d i1
xibi, l a
d i1
ligi.
342 Pseudonoise Generators
p1ch5e 8/17/01 10:27 AM Page 342
http://jntu.blog.com
which yields a bound on the trace transform, namely
(5.310) Applying the definition on the left side of (5.310) to (5.306) gives a general bound on correlation magnitude.
(5.311) The above development suggests the following procedure for designing a set of distinct NLFFL functions operating on identical m-sequence shift registers, to produce sequences with good periodic auto- and cross-correla- tion properties:
Property P-1.
Assume that the transforms of all functions in are non-zero on the same subset of GF(2d) and are all zero outside . Notice that
(5.312) for all . Hence, a set of balanced sequences will be achieved in this design if and only if 0 is not in .
Property P-2.
Choose the set (with ) so that is as small as possible for all non-integer yin GF(2d). To calculate the average size of the intersection, let ai1 for each ifor which , and let ai0 otherwise. Then for y at, we have
(5.313) and bounding the maximum intersection by the average intersection gives
(5.314) Property P-3.
Design the set of functions so that for each rand sin ,
(5.315) a
xGF12d2r1x2s1x20 a
lGF12d2rˆ1l2sˆ1l2.
b, rs b
0s0 1 0s0 12 2d2 . max
yGF12d2 yGF122
0yss0 1
2d2 a
2d2
t1 a
2d2 i0
aitai
0yss0 a
2d2 i0
aitai, ais
ss 0s
s
s rb
0s3rˆ1020 a
xGF12d2r1x235r1an2 6 is balanced, s
s
b b
0Rrs1t2 0 1 2BrBs0ysr ¨s0. Br¢ max
l 0rˆ1l2 02 2d 0sr0 ,
Direct-Sequence Multiple-Access Designshttp://jntu.blog.com 343
This orthogonality guarantees that 0Rrs(0)0is 1. Since in the transform domain can be viewed as a -tuple, the achievable size of is limited by , i.e.,
(5.316) Property P-4.
Design each function in so that its trace transform has constant magni- tude, namely on by (5.309). If this objective can be achieved and if the bounds (5.314) and (5.316) can be achieved with equality, then by (5.311) it is possible to find orthogonal NLFFL functions such that
(5.317) for all t0 mod 2d1.
The final parameter, namely , can be chosen with the aid of the Welch bound, which states that 0Rrs(t)0must be on the order of 2d/2when is large. Assuming that (5.317) is valid and tight, the Welch bound (5.241) indi- cates that should be on the order of 2d/2, with larger values of result- ing in designs which cannot meet that bound with equality. The above design approach, with , will be successfully demonstrated in the next section.