Cell Search for Cell-Based OFDM Systems Using

Quasi Complete Complementary Codes

Chao-Yu Chen, Ying-Ju Min, Kuei-Ying Lu, and Chi-chao Chao

Institute of Communications Engineering
National Tsing Hua University, Hsinchu 30013, Taiwan, R.O.C.
E-mail: d919609@oz.nthu.edu.tw, g945612@alumni.nthu.edu.tw, g9564517@oz.nthu.edu.tw, ccc@ee.nthu.edu.tw
AbstractEstablishing a radio link in cell-based mobile com-
munication systems involves searching and synchronizing the
downlink known pattern of sequences associated with the base
stations. The performance of the searching process, often referred
to as cell search, depends greatly on the employed preamble
sequences. In this paper, we propose a construction of quasi com-
plete complementary codes (QCCCs) from Reed-Muller codes
and, due to their good auto-correlation and cross-correlation
properties, a preamble structure based on QCCCs. Furthermore,
the constructed QCCCs have low peak-to-average power ratios
(PAPRs) and hence are suitable for use in orthogonal frequency
division multiplexing (OFDM) systems. Simulation results show
that the QCCC-based preambles outperform the preambles
employed in the WiMAX system, both in terms of PAPR and cell
search performance. Moreover, the rich algebraic structures of
QCCCs potentially admit low-complexity encoding and decoding.
I. INTRODUCTION
Cell search is an important issue in cell-based communi-
cation systems. Before data signals can be transmitted, the
preamble sequences assist cell search and establishment of the
initial radio link. Each base station has its own cell-specic
preamble sequence, and the mobile station decides which
base station to connect to based on the received preamble.
Therefore, the preamble sequences employed greatly affect the
performance of cell search.
Two basic requirements for the preambles in orthogonal fre-
quency division multiplexing (OFDM) systems are low peak-
to-average power ratios (PAPRs) and low cross-correlations
between any two distinct preamble sets. The WiMAX system,
one of the cell-based OFDM systems, determines its pseudo-
noise (PN) preamble sequences using massive computer search
[1]. No structures of the employed preamble sequences are
known.
In this paper, we propose a preamble structure based on
quasi complete complementary codes (QCCCs), which com-
prise several sets of quasi auto-complementary codes (QACCs)
and can be constructed from cosets of Reed-Muller (RM)
codes. The constructed QCCCs have low PAPRs and good
auto-correlation and cross-correlation properties. Simulation
results show that the proposed QCCC-based preambles outper-
form the preambles employed in the WiMAX system, and the
rich algebraic structures of QCCCs potentially admit efcient
encoding and decoding algorithms.

This work was sponsored in part by the MediaTek Research Center at

National Chiao Tung University, Taiwan, R.O.C.
This paper is organized as follows. In Section II we describe
the signal model, and the cell search algorithm considered
is introduced in Section III. In Section IV we describe the
QCCCs and the constructions from cosets of RM codes.
The preamble structure based on QCCCs is introduced in
Section V. Simulation results are given in Section VI, and
nal conclusion is drawn in Section VII.
II. SIGNAL MODEL
Let the nth transmitted equivalent complex baseband OFDM
signal be given by
x
n
(t) =
N1

k=0
X
k,n
e
j2kft
, 0 t T
where N is the number of subcarriers, X
k,n
is the modulated
signal at the kth subcarrier for the nth symbol, f is the
subcarrier spacing, and T is the symbol duration. By sampling
x
n
(t) at sampling rate Nf, we have the ith sample of the
nth transmitted OFDM signal given by
x
i,n
x
n
_
i
Nf
_
=
N1

k=0
X
k,n
e
j2ik/N
.
Let z
n
= (z
0,n
, z
1,n
, . . . , z
N1,n
), where z
i,n
is the ith
sample of the nth symbol of the additive white Gaussian noise
(AWGN) with mean zero and variance
2
z
in both real and
imaginary parts (and the real and imaginary parts are assumed
to be independent).
Consider a discrete-time multipath channel model with
channel impulse response (CIR) h = (h
0
, h
1
, . . . , h
L1
)
T
where ()
T
denotes the transpose and L is the maximum delay
spread. Here we assume that the length of h is not larger than
the guard interval and the channel is static during transmission
of the preamble. In addition, assuming that the cyclic prex
(CP) that replicates the end of the OFDM symbol is employed
in the guard interval, we can have the received signal for the
kth subcarrier of the nth symbol given by
Y
k,n
= H
k
X
k,n
+ Z
k,n
, 0 k N 1 (1)
where H
k
=

L1
i=0
h
i
e
j2ik/N
and Z
k,n
=
1/N

N1
i=0
z
i,n
e
j2ik/N
. Note that H
k
is the frequency-
selective fading response at the kth subcarrier and Z
k,n
s
are independent and identically distributed complex Gaussian
random variables with mean zero and variance 2
2
z
/N.
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 proceedings.
978-1-4244-2075-9/08/$25.00 2008 IEEE
We can express H as F
L
h, where H =
(H
0
, H
1
, . . . , H
N1
)
T
and F
L
is an N L submatrix
of the N N Fourier matrix F = [e
j2kl/N
]
k,l
for
k, l = 0, 1, . . . , N 1, and then (1) can be rewritten in the
vector form as
Y
n
= X
D,n
F
L
h +Z
n
, n = 0, 1, . . . , M 1
where Y
n
= (Y
0,n
, Y
1,n
, . . . , Y
N1,n
)
T
, X
D,n
=
diag X
0,n
, X
1,n
, . . . , X
N1,n
is a diagonal matrix, Z
n
=
(Z
0,n
, Z
1,n
, . . . , Z
N1,n
)
T
is the noise vector, and M is the
number of the transmitted OFDM symbols.
III. CELL SEARCH ALGORITHM
Since in reality we have no knowledge of the channel
response before cell search is performed, here we consider
the joint channel estimation and preamble detection for cell
search.
A. Cell Search
The derivation in this subsection is modied from [2]. The
likelihood function can be given by
f ( Y
0
, Y
1
, . . . , Y
M1
[ X
D,0
, X
D,1
, . . . , X
D,M1
)
=
1
(4
2
z
/N)
MN/2
exp
_
N
4
2
z
M1

n=0
|Y
n
X
D,n
F
L
h|
2
_
.
(2)
Therefore, the joint maximum-likelihood (ML) estimation
of the CIR, h, and the transmitted preamble, X
D
=
[X
D,0
, X
D,1
, . . . , X
D,M1
], is given by
_

h,

X
D
_
= arg min

h,

X
D
_
M1

n=0
_
_
_Y
n


X
D,n
F
L

h
_
_
_
2
_
. (3)
Assuming

X
D
=

X
D
is given and h remains constant
during transmission of the M symbols, we can get the estimate
of the channel response

h that minimizes (3) by using the least
square (LS) criterion as

h =
_
M1

n=0
F
H
L

X
H
D,n

X
D,n
F
L
_
1
_
M1

n=0
F
H
L

X
H
D,n
Y
n
_
=
1
MN
M1

n=0
F
H
L

X
H
D,n
Y
n
(4)
where ()
H
denotes the conjugate transpose and we assume
that X
k,n
s are q-psk modulated, yielding

X
H
D,n

X
D,n
= I
N
.
Substitute

h as

h given in (4) back into (3), and the
estimated transmitted preamble can then be given by

X
D
= arg max

X
D
_
_
_
_
_
M1

n=0
F
H
L

X
H
D,n
Y
n
_
_
_
_
_
2
(5)
which results in the generalized likelihood ratio test (GLRT)
detection.
B. Joint Frequency Offset Estimation and Cell Search
When there is mismatch between the transmitter and re-
ceiver carrier frequencies, we can write the received signal in
the time domain as
y
i,n
= e
j2i
_
N1

m=0
x
m,n
h
(im)N
+ z
i,n
_
where (i)
N
means i mod N and is the frequency
mismatch with = /N, where is an inte-
ger with 0 N 1. Here we consider
the integer-part frequency offset only. Let X
D,n
=
diag
_
X
(0)N,n
, X
(1)N,n
, . . . , X
(N1)N,n
_
be a diago-
nal matrix and X
D
= [X
D,0
, X
D,1
, . . . , X
D,M1
]. We
can then have the joint estimation of the integer-part frequency
offset and the preamble as
_
,

X
D
_
= arg max
,

X
D
_
_
_
_
_
M1

n=0
F
H
L

X
H
D ,n
Y
n
_
_
_
_
_
2
. (6)
IV. QCCCS FROM RM CODES
Let c = (c
0
, c
1
, . . . , c
n1
) be a Z
q
-valued sequence of
length n, where c
i
is in the ring Z
q
= 0, 1, . . . , q 1. The
aperiodic auto-correlation function (c; u) of c at displace-
ment u is dened as
(c; u) =
_

n1u
k=0
X
k+u
X

k
, 0 u n 1

n1+u
k=0
X
k
X

ku
, n + 1 u < 0
where ()

denotes the conjugate, X

k
=
c
k
, and =
e
2j/q
is a complex qth root of unity. And the aperiodic
cross-correlation function (c, d; u) of c and d, where d =
(d
0
, d
1
, . . . , d
n1
), at displacement u is dened as
(c, d; u) =
_

n1u
k=0
X
k+u

X

k
, 0 u n 1

n1+u
k=0
X
k

X

ku
, n + 1 u < 0
where X
k
=
c
k
and

X
k
=
d
k
.
Denition 1: [3] A set of M sequences c
1
, c
2
, . . . , c
M
of
length n is called an auto-complementary code (ACC) of order
M, or referred to as a Golay complementary set of order M
[4], if the auto-correlation functions satisfy
(c
1
; u) + (c
2
; u) + + (c
M
; u) =
_
0, u ,= 0
Mn, u = 0.
The sequences c
1
, c
2
, . . . , c
M
are called Golay sequences of
order M.
Denition 2: [3] The M sets of M length-n sequences
c
1
1
, c
1
2
, . . . , c
1
M
, . . . , c
M
1
, c
M
2
, . . . , c
M
M
are called a com-
plete complementary code (CCC) of order M if every set is
an ACC and every two distinct sets satisfy
M

k=1
(c
i
k
, c
j
k
; u) = 0, for any u; i, j = 1, 2, . . . , M; i ,= j.
We can see from (6) the relation between correlations and
GLRT detection. For simplicity, consider the case when there
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 proceedings.
is no noise, = 0, and L = 1. Hence, we have Y
n
= h
0
X
n
,
where X
n
is the nth transmitted preamble sequence. Equation
(6) then becomes
_
,

X
D
_
= arg max
,

X
D
[h
0
[
2

M1

n=0
N1

k=0

(k )
N,n
X
k,n

2
= arg max
,

X
D

M1

n=0
N1

k=0

k,n
X
(k+ )N,n

2
= arg max
,

X
D

M1

n=0
_
N1

k=0

k,n
X
k+ ,n
+
1

k=0

N+k ,n
X
k,n
_

2
. (7)
From the last term in (7), it is desirable that the sum of cross-
correlations between every two distinct sets is small and the
sum of auto-correlations of all sequences within a set is large
at zero displacement and small for the other displacements.
And CCCs have these nice correlation properties.
However, increasing the order of a CCC requires an increase
of the order of its comprised ACCs as well. If we concatenate
all the sequences within an ACC as one preamble for each
cell, we would like the number of sets of ACCs, i.e., the order
of the CCC, to be above a certain number so that each cell
can have its specic preamble. However, as each preamble
sequence takes up an OFDM symbol duration in transmission
but contains no data at all, we do not want the number of
sequences within an ACC to be too large. To deal with this
dilemma, we seek for ways of increasing the order of the CCC
to be greater than 2 yet maintaining the order of the composing
ACCs at 2.
We will then propose a quasi complete complementary
code which is composed of quasi auto-complementary codes.
The word quasi here implies a slight imperfection in the
correlation property in contrast to the original CCC. In other
words, the sum of the auto-correlation values of the QACCs
and that of the cross-correlation values between two arbitrary
QACCs are no longer 0 as dened for CCCs. The denitions
for the QACC and QCCC are given below.
Denition 3: We call a set of M length-n sequences c
i
:
i = 1, 2, . . . , M a quasi auto-complementary code of order
M if
Mn
n1

u=n+1

i=1
(c
i
; u)

Mn
2
.
If the left equality holds, this set is in fact an ACC of order M.
And Mn
2
is an upper bound on

n1
u=n+1

M
i=1
(c
i
; u)

for
any set of order M.
Denition 4: The M

sets of M length-n sequences c

1
i
:
i = 1, 2, . . . , M, . . . , c
M

i
: i = 1, 2, . . . , M are called a
quasi complete complementary code of order M

if every set
is a QACC and every two distinct sets satisfy
0
n1

u=n+1

i=1
(c
j
i
, c
k
i
; u)

Mn
2
for any u; j, k = 1, 2, . . . , M

; j ,= k.
Before we show the relationship between RM codes and
QCCCs, we introduce RM codes rst. Denote by RM(r, m)
the rth-order Reed-Muller code of length 2
m
over Z
2
and
denote the 2
m
-tuple vectors by
v
i
= (00 0
. .
2
i1
11 1
. .
2
i1
00 0
. .
2
i1
11 1
. .
2
i1
), i = 1, 2, . . . , m
and v
0
= (11 1), which is the all-one vector. For vec-
tors a = (a
0
, a
1
, . . . , a
n1
) and b = (b
0
, b
1
, . . . , b
n1
),
ab = (a
0
b
0
, a
1
b
1
, . . . , a
n1
b
n1
) where rep-
resents the product. Then RM(r, m) is a binary linear
code generated by the following vectors [5]: G
RM
(r, m) =
v
0
, v
1
, v
2
, . . . , v
m
, v
1
v
2
, . . . , v
m1
v
m
, . . . , up to products
of degree r.
It has been shown in [4] that the PAPR of any sequence of
an ACC of order M is at most M. The PAPR of a sequence
c is dened as
PAPR(c) = max
0tT
P
c
(t)
P
av
where the instantaneous power of an OFDM signal is given
by P
c
(t) = [x
n
(t)[
2
and the average power P
av
is N for
equal energy constellations. The following result, taken from
[6], asserts that a QACC of order 2 can be obtained from the
ACC proposed in [7] by adding an offset vector and there is
also an upper bound on PAPR for its sequences.
Theorem 1: For any integer m > 1 and any permutation
of 1, 2, . . . , m, if we let
Q =
m1

i=1
v
(i)
v
(i+1)

m

i=1
(a
i
v
0
v
i
)
where a
i
Z
2
and denotes binary addition, then for any
length-2
m
codeword c QRM(1, m), there exists another
codeword b = cv
(1)
QRM(1, m) such that c, b is a
QACC of order 2 with

n1
u=n+1
[(c; u) + (b; u)[ < 6 2
m
.
In addition, we have PAPR(c)< 6.
Examining the vector

m
i=1
(a
i
v
0
v
i
), we can nd that it
is actually a vector of weight 1. Therefore, only 1 bit in the
sequences of the original ACC is altered, which is why the
correlation property of the ACC is mostly retained.
Finally, in this section, the construction of QCCCs is given
to obtain a high-order QCCC composed of QACCs of order
2 from Theorem 1.
[QCCC Construction] For any integer m > 2 and any
integer k with 2 k m1, let b
s
= (b
s
1
, b
s
2
, . . . , b
s
m
), 0
s m 1, be vectors of length m, where the rst
m 1 elements of b
s
are the cyclic-shift (s positions to
the right) of (1, 2, . . . , m 1) and b
s
m
= m, and then let
d
s,k,t
= (d
s,k,t
1
, d
s,k,t
2
, . . . , d
s,k,t
m
), t = 0 for k = m 1 and
1 t k 1 otherwise, be a vector of length m, where the
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 proceedings.
CP
Preamble
sequence 1
CP
Preamble
sequence 2
CP Data symbol
Fig. 1. Preamble structure using QCCCs.
rst k elements are the cyclic-shift (t positions to the right)
of (b
s
1
, b
s
2
, . . . , b
s
k
) and the rest elements are identical to those
of b
s
. If we denote
Q
s,k,t,p,q
=
m1

i=1
v
d
s,k,t
i
v
d
s,k,t
i+1

_
(pv
0
v
m1
) (qv
0
v
m
)
m2

i=1
(v
0
v
i
)
_
where p, q Z
2
, and
c
s,k,t,p,q
= Q
s,k,t,p,q

_
(p q) v
d
s,k,t
m1
_

_
(1 q) v
d
s,k,t
m2
_
then there exists a QCCC composed of order-2 QACCs, where
each coset Q
s,k,t,p,q
RM(1, m) contains one composing
QACC
_
c
s,k,t,p,q
, c
s,k,t,p,q
v
d
s,k,t
1
_
.
For all possible s, k, t, p, and q, we can obtain that there are
2(m1)[2 + (m2)(m3)] different coset representatives
Q
s,k,t,p,q
and hence the order of QCCC is 2(m1)[2+(m
2)(m3)].
V. PREAMBLE STRUCTURE
The QCCCs employed as preambles are of length 128 for
m = 7 and 256 for m = 8. The orders of the QCCCs
for m = 7 and m = 8 are 264 and 448, respectively, and
we randomly choose 114 QACC sets from those as cell-
specic preambles to be comparable with those in WiMAX.
We allocate the sequences c of length 128 and 256 to 512 and
1024 subcarriers, respectively, by the following assignment:
X
3k+43
= (1)
c
k
, for k = 0, 1, . . . , 127; m = 7
X
3k+86
= (1)
c
k
, for k = 0, 1, . . . , 255; m = 8 (8)
where X
k
is the frequency-domain BPSK modulated signal at
the kth subcarrier. The preamble in WiMAX consists of only
one sequence, but here we use two sequences for one preamble
since the QACC employed has order 2. The preamble structure
using QCCCs is shown in Fig. 1.
The PAPRs of the preambles using QCCCs and the WiMAX
preambles are calculated and compared in Table I. We can see
that the PAPR values of QCCC-based preambles are lower
than the upper bound given in Theorem 1 and also lower than
those of the WiMAX preambles.
In Table I, we also consider the average absolute values of
the cross-correlations of QCCCs and PN sequences used in
WiMAX. Since the cross-correlations of the sequences in the
same QACC of order 2 are summed as in Denition 4, the
largest possible cross-correlation is twice the sequence length
while that of PN sequences is equal to the sequence length.
TABLE I
COMPARISONS OF PAPR AND CROSS-CORRELATION BETWEEN
QCCC-BASED AND PN-BASED WIMAX PREAMBLES
Preamble Type m= 7 m= 8 512-FFT 1024-FFT
QCCC QCCC WiMAX WiMAX
PAPR (dB) 4.03 3.75 4.16 4.35
Length (N
len
) 128 256 143 284
Number of sequences
(Np)
2 2 1 1
Average cross-
correlation (avg)
7.90 10.98 6.40 8.99
avg/(N
len
Np) 0.031 0.021 0.045 0.032
The ratio of the average absolute value of the cross-correlation
to the largest possible value is used as the comparison criterion
for the correlation property. It can be found that the ratios of
PN sequences of length 143 and 284 in WiMAX are larger
than those of the QCCCs of length 128 and 256, respectively.
Thus when the correlation property is concerned, QCCCs also
outperform the PN sequences employed in WiMAX.
VI. SIMULATION RESULTS
We consider OFDM systems of 512 and 1024 subcarriers,
3.5MHz and 7MHz bandwidth, and 4MHz and 8MHz sam-
pling frequency, respectively. The symbol duration is 128 s
and the guard time is 16 s. The carrier frequency is 3.8 GHz,
and the IEEE 802.16 standard species a maximum oscillator
error of 22 parts per million (ppm), which corresponds to the
maximum possible frequency offset of 11 subcarriers.
We consider the Stanford University Interim channel model
type 3 (SUI-3) [8], which has the delay prole 0.0, 0.5, 1.0
s and the power prole 0, 5, 10 dB with each tap an
independent, zero-mean complex Gaussian random variable.
Since we assume that the maximum delay spread is not longer
than the guard interval, we let the parameter L in (6) be equal
to the number of samples in the guard interval, i.e., L = 64
and 128 for subcarriers 512 and 1024, respectively.
Here we use (6) as the detection algorithm even though
now (4) does not hold because

X
H
D,n

X
D,n
,= I
N
under the
assignment (8). For the sake of simplicity, let us consider the
case that there is no frequency offset, and then the estimated

h should be modied to be

h =
_
M1

n=0
F
H
L

X
H
D,n

X
D,n
F
L
_

_
M1

n=0
F
H
L

X
H
D,n
Y
n
_
where ()

denotes the pseudo-inverse. The above estimate

should thus be substituted back to (3) for the exact detec-
tion algorithm. However, if we use the approximation that

M1
n=0
F
H
L

X
H
D,n

X
D,n
F
L
M

NI
L
where

N is the length
of the adopted sequence, then we can obtain the same detection
algorithm as given in (5). Similarly, the approximation leads to
the same algorithm as in (6) for the case with frequency offset.
The approximate algorithm performs as well as the exact
algorithm from simulation results but has less complexity, and
so it is used in the rest simulations.
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 proceedings.
20 22 24 26 28 30 32
10
5
10
4
10
3
10
2
10
1
E
s
/N
0
(dB)
F
a
l
s
e

C
e
l
l

D
e
t
e
c
t
i
o
n

P
r
o
b
a
b
i
l
i
t
y
2 PN sequences with 512FFT
2 QCCC sequences with 512FFT
Fig. 2. Performance comparisons between PN-based and QCCC-based
preambles for 512 subcarriers.
20 22 24 26 28 30 32
10
4
10
3
10
2
10
1
E
s
/N
0
(dB)
F
a
l
s
e

C
e
l
l

D
e
t
e
c
t
i
o
n

P
r
o
b
a
b
i
l
i
t
y
2 PN sequences with 1024FFT
2 QCCC sequences with 1024FFT
Fig. 3. Performance comparisons between PN-based and QCCC-based
preambles for 1024 subcarriers.
The PN-based preamble sequences used in WiMAX are
assumed to be transmitted twice to render a fair comparison
with QCCC-based preamble sequences in Figs. 2 and 3,
where the symbol signal-to-noise ratio E
s
/N
0
is given by
E
s
/N
0
=

N1
k=0
[X
k
[
2
/(2
2
z
/N). We can obtain a gain of
about 0.6 dB and 1.0 dB when QCCC-based preambles are
employed instead of PN-based preambles for 512 and 1024
subcarriers, respectively. In addition, in Fig. 4 the preamble
structure of two QCCC sequences for 512 subcarriers is
compared with that of one PN sequence for 1024 subcarriers
in the original WiMAX system. We can observe a 1.4 dB gain
with the QCCC-based preamble structure.
VII. CONCLUSION
In this paper, we have constructed quasi complete comple-
mentary codes from cosets of RM(1, m) with order as high as
22 24 26 28 30 32 34 36
10
4
10
3
10
2
10
1
E
s
/N
0
(dB)
F
a
l
s
e

C
e
l
l

D
e
t
e
c
t
i
o
n

P
r
o
b
a
b
i
l
i
t
y
1 PN sequence with 1024FFT
2 QCCC sequences with 512FFT
Fig. 4. Performance comparisons between the preamble employing one PN
sequence for 1024 subcarriers and that using two QCCC sequences for 512
subcarriers.
2(m 1) [2 + (m2)(m3)] for length 2
m
. They possess
the properties of low PAPRs and small cross-correlation values
between every two composing QACCs and are hence proposed
to be employed in the preamble structure for cell-based
OFDM systems. Simulation results show that the QCCC-based
preambles outperform the original PN-based preambles in the
WiMAX system.
Since the PN sequences employed in WiMAX have no
known structures, all the preamble sequences need to be stored
for transmission and detection. Also during cell search, all
the preamble sequences should be compared to determine
the transmitted sequence. While the proposed QCCCs are
derived from cosets of RM codes and hence possess rich alge-
braic structures, thereby potentially admitting low-complexity
encoding and decoding algorithms, which may signicantly
accelerate the process of cell search.
REFERENCES
[1] Y. Segal, I. Kitroser, Y. Leiba, E. Shasha, and Z. Hadad, Preambles
design for OFDMA PHY layer, FFT sizes of 1024, 512, and 128, IEEE
C802.16e-04/125r1, Aug. 2004.
[2] T. Cui and C. Tellambura, Joint data detection and channel estimation
for OFDM systems, IEEE Trans. Commun., vol. 54, pp. 670679, Apr.
2006.
[3] N. Suehiro and M. Hatori, N-shift cross-orthogonal sequences, IEEE
Trans. Inf. Theory, vol. 34, pp. 143146, Jan. 1988.
[4] K. G. Paterson, Generalized Reed-Muller codes and power control in
OFDM modulation, IEEE Trans. Inf. Theory, vol. 46, pp. 104120, Jan.
2000.
[5] S. Lin and D. J. Costello, Jr., Error Control Coding, 2nd ed. Upper
Saddle River, NJ: Pearson Prentice Hall, 2004.
[6] C.-Y. Chen, C.-H. Wang, and C.-C. Chao, Peak-to-average power ratio
reduction in OFDM using complementary sets and Reed-Muller codes,
submitted for publication.
[7] J. A. Davis and J. Jedwab, Peak-to-mean power control in OFDM,
Golay complementary sequences, and Reed-Muller codes, IEEE Trans.
Inf. Theory, vol. 45, pp. 23972417, Nov. 1999.
[8] V. Erceg et al., Channel model for xed wireless applications, IEEE
802.16.3c-01/29r4, Jul. 2001.
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 proceedings.