Beruflich Dokumente
Kultur Dokumente
CORRESPONDENCE
(SNR), a,-,
2
2
2
a, - an+ = ___N
whose solution is
a; = a; 1 + qq-.
[
II.
a2,
@NW,
e"@
_
1)
+
@
p
8'(n)
= 1+ 1
1 I (Sti-R)i % (20)
N
J. P. M. SCHALKWIJK
L. I. BLUESTEIN
Communication Systems Laboratories
Sylvania Electronic Systems
Div. of Sylvania Elec. Prods., Inc.
Waltham, Mass. 02154
REFERENCES
11 T. J. Gobliok,
Theoretical
limitations
on the transmission
of data from
an&g
murces,
IEEE
Trans.
Information
Theory,
vol.
IT-l&
pp. 558-567,
October
1965.
A coding
scheme for additive
noise chitnnels
with
El J. P. M. Schalkwijk,
IEEE
Trans.
Information
Theory.
feedback,
Part
II:
Band-limited
signals,
vol. IT-U,
pp. 183-189,
April 1966.
Ial T. Kailath,
An application
of Shannons
r&e-distortion
theory
to analog
Proc. Princeton
Symp. on Systm
Science,
oommunicrttion
over feedback
channels,
Mrtrch
1967.
141 T. J. Cruise,
Achievement
of rate-distortion
bound
over additive
white
noise channel utilialng
& noiseless feedback
channel,
Proc. IEEE
(Letters), vol. 55,
pp. 583-584,
April 1967.
NOTATION
O(a, b) = 2 -
1 - 2 I/a + bjj.
Optimal
plexing
Binary
Multi-
INTRODUCTION
received
July
22, 1966;
revised
February
4, 1967.
2n- + 1
715, f2, . - - LJ
lcm
STATEMENT
AND
PROOF
OF RESULT
(+1)2) + 1
t = p
b (n+2)2) + 1
(n odd)
(n even).
2(n+1,/2
and
s-/n+z)/z
620
IEEE
where
TRANSACTIONS
ON
INFORMATION
v(g
[ v(O),V(l), * . *
,v(+
b(i) = 5!((~zL+1)-i)
i -2 ( (L+1)2+
qu, b)(T) =
1)
when
or
(n+1)/2
- 1)
(2
a(~) = 1.
z2-1 + 1.
t ; 1; 01.
n-1,2 ones
x2- + 1
= Icm (fl, fz, . . . f.-I)
then.fv I go-l,
Proof:
= u (by Lemma 2) = 2 - 1
Let
mfs
0,
1)
Lemma S
Lemma 1
Let 01be any primitive
- 2)v(?z -
-l
1967
and
OCTOBER
fj n+1
__( 2 > . . . v(n
Theorem
a(i) = T(or-i)
THEORY,
/ g,,-l.
Lemma 4
**-I+ 1
gk= lcm7fl,fz, **. fk)
where fi is the minimal polynomial of (Y<.Let f be an irreducible
polynomial of degree n. Let A, be the conjugate class of roots off.
Let ml = min {i 1 tii P Af), the class leader of A,. Then rnt > k
implies f is a factor of gk.
Proof: f irreducible of degree n implies f ( zin-l + 1 implies f 1 gk
lcm Vi, f2, . *. fkl, and rnf > k implies ft j Icm (fi . . . fk) implies
f 1 gk.
Lemma .%?
Let 01be any primitive
2-1 +
1.
v=
2-l -
1 - 2-
for
n odd
for
n even.
1 y-1
y/2
n-1
r = c ~(42
i=o
and
s = c ~(232~.
i=
Now u = 2% - 1 = c::h
y-12
n-1
=
c
i=o
v(4y
of ai. Let
a-2(2n--1
at zz
1)
p-
+ )
1
ia(2n+
L w+)2
_ 1 _ p-w7
+ 1
(for
n odd) =
for
n even;
a-*[2-
= p- _ 1 _ 2-1/2 = p
J
.
= p-l _ 1 _ y/z 1
\ a-2[24 _ 1 _ y/y
Now fl is the minimal polynomial of 01 = flu and ft is the minimal
polynomial of at = &,. By Lemma 2 ml, = u > v - 1 and mf, =
u > v - 1. Thus by Lemma 1 fi andft are factors of go-l. Hence,
V(fd C V(g&
and v(fd C I%,-&
Thus o e V(fd and b p V(ft)
implies a and b E (S.-I). Thus by Lemma 4
Ie(a, b)/ < 2 -
7
2 - 1 -
q2:-
(2* - 1 - qy-
_
-
2
2
1 - 2(v - 1) =
_
-
y-19
29
=
=
+ 3
2(%+2)/z + 3.
2(*+1)/z
621
CORRESPONDENCE
for
n odd
le(a, b) 1 2 2r+22 + 1
for
n even.
ItI
W e note further that for purely random sequences of length 23 1 = 8191 we would expect the cross-correlation function to exceed
A 180 for 5 percent of the correlation values and hence
2a=2-2
linear sequences chosen in accordance with our technique perform
bett,er with respect to their cross-correlation properties than purely
random sequences.
IV.
CONSTRUCTION
OF ENCODING
FAMILIES
le(T)l 5 2(n+z)z + 1.
In a spread spectrum multiplexing application such families form
ideal codes which minimizes interlink interference. Instead of
having each communication link employ a different maximal
sequence we assign to each link a member of the encoding family
to be constructed below. These are nonmaximal linear sequences,
and hence their autocorrelation function will not be two-valued;
however, the out-of-phase value of the autocorrelation function
will satisfy the above inequality. Thus by slightly relaxing the
conditions on the autocorrelation function we obtain a family of
encoding sequences with the high cross-correlation peaks eliminated.
The procedure for generating these encoding families is embodied
in the following theorem.
Theorem
jet< t =
2(n+1z + 1
for
n odd
2(n+2)2 + 1
for
n even
REFERENCES
111 N. Zierler,
Linear
recurring
sequences,
J. SIAM,
vol. 7, March
1959.
@I R. Gold,
Characteristic
linear
sequences
and
their
ooset
functions,
(accepted
for publication
J. Sot. Ind. ii&.
Math.,
May
1965).
[$I W. W. Peterson,
Error Correcting
Codes. New York:
Wiley,
1961.
141 T. Kasami,
Weight
distribution
formula
for some class of cyclic
codes,
University
of Illinois?
Urbana,
Rept. R-265, April 1966.
[sl R. Gold, Maxunal
recursive
sequences
with 3-valued
recursive
cross-correlation functions
(submitted
for publication,
January
1967).
Average Digit-Error
Codes
Probability
INTRODUCTION
Let
b,
where al, bl E V(fi), and at, bt z V(ft). \@(a, b)\ = IB(al -I- bl, at +
bt) 1 5 t by Theorem 2 since al + bl E V(fi) and UI $ b, E V(f t).
Thus, by way of illustration, if we consider the pair of polynomials,
fi(x) = 1 + z + x2 + x3 + x7 and f dz) = 1 + x -I- x2 i- x3 -I- x4 -Ix5 + x7 then the product polynomial isfi(x) fz(x) = 1 -I- 2 -I- x6 f
n # mod 4.
GOLD
n =
R =
K =
p =
AND
ASSUMPTIONS
code length
code rate
2R
channel-error probability
H(t) = - t logz t - (1 - t) log, (1 - t)
pR = smaller solution of R + H&)
= 1
PC
PR/(l
2pR
2PR)
Manuscript
received
December
12, 1966; revised
May
1 J. N. Pierce,
Average
digit error probability
after
codes,
Air Force
Cambridge
Research
Labs.,
Bedford,
October
1966.
22, 1967.
decoding
Mass..
random
linear
Kept.
66-695,