xvi List of Figures
6.3 Chip-synchronous, soft-limiting error probabilities of the synchronous
multilevel carrier-hopping prime codes for L = w = {10,15, 20}, N =
p = 89, k = 1, and n = {1, 2}.......................................................................263
6.4 Chip-synchronous, soft-limiting error probabilities of the synchronous
trilevel carrier-hopping prime codes, optimized as a function of K,for
L = w = {8,12}, N = p = {23,31}, k = 1, and n = 2. ................................264
6.5 Gaussian error probabilities of the CIK Walsh-based synchronou s and
Barker-based asynchronous prime-permuted codes for various p and N.....270
7.1 Some double-length carrier-hopping prime codewords with 4 wave-
lengths and lengths {5, 25},basedonp
1
= p
2
= 5, and t
1
= 2, where
dark squares indicate the wavelength-time locations of pulses. ...................276
7.2 A complete periodic cross-correlation process of a long address code-
word of length N
2
= rN
1
and r + 1consecutiveOOKtransmissionsofa
short interfering codeword of length N
1
.......................................................277
7.3 Chip-synchronous, hard-limiting error probabilities of the triple-weight,
triple-length carrier-hopping prime codes (using lower-order wave-
lengths) versus K
3,2
and K
3,3
,wherew
1
= 9, w
2
= 11, w
3
= 13, N
1
= 17,
N
2
= 323, and N
3
= 7429, and K
1,1
= K
1,2
= K
1,3
= K
2,1
= K
2,2
= K
2,3
=
K
3,1
= 3.........................................................................................................2 8 4
7.4 Chip-synchronous, hard-limiting error probabilities of the triple-weight,
triple-length carrier-hopping prime codes (using lower-order wave-
lengths) versus K
2,1
and K
2,2
,wherew
1
= 9, w
2
= 11, w
3
= 13, N
1
= 17,
N
2
= 323, and N
3
= 7429, and K
1,1
= K
1,2
= K
1,3
= K
2,1
= K
2,2
= K
2,3
=
K
3,1
= 3.........................................................................................................2 8 5
7.5 Chip-synchronous, soft-limiting error probabilities of the single-weight,
double-length expanded carrier-hopping prime codes versus K
1,2
for
w
1
= 5, p
$
= 7, t
1
= 11, N
1
= 23, and N
2
= 529..........................................290
7.6 Chip-synchronous, soft-limiting error probabilities of the single-weight,
double-length expanded carrier-hopping prime codes versus K
1,1
for
w
1
= 5, p
$
= 7, t
1
= 11, N
1
= 23, and N
2
= 529..........................................291
7.7 Chip-synchronous, soft-limiting error probabilities of the single-weight,
triple-length expanded carrier-hopping prime codes versus K
1,2
and K
1,3
for w
1
= 7, p
$
= 3, t
1
= 6, t
2
= 3, N
1
= 13, N
2
= 169, N
3
= 2197, and
K
1,1
= 5.........................................................................................................2 9 2
7.8 Chip-synchronous, hard-limiting error probabilities of the double-length
quadratic-congruence carrier-hopping prime codes versus K
2
for t
1
= 11,
L = w = 7, N
1
= 31, and N
2
= 1147.............................................................296
7.9 Chip-synchronous, hard-limiting error probabilities of the double-length
quadratic-congruence carrier-hopping prime codes versus K
1
for t
1
= 11,
L = w = 7, N
1
= 31, and N
2
= 1147.............................................................297
7.10 Chip-synchronous, hard-limiting error probabilitiesofthedouble-length
quadratic-congruence carrier-hopping prime codes in OOK and multi-
code keying versus K
1
for t
1
= 11, L = w = 7, N
1
= 31, N
2
= 1147, and
K
2
= 15. ........................................................................................................ 301