This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts

for publication in the ICC 2008 proceedings.

A New Adaptive OFDM System with Precoded Cyclic

Prefix for Cognitive Radio
Xianbin Wang*, Yiyan Wu†, Hsiao-Chun Wu#
* † #
Dept. of ECE Communications Research Centre Dept. of ECE
Univ. of Western Ontario, Canada Ottawa, ON K2H 8S2, Canada Louisiana State University, LA 70803
Email: xianbin.wang@uwo.ca Email: yiyan.wu@crc.ca Email: wu@ece.lsu.edu

Abstract— Recent development in cognitive radio (CR) new communication system. The available communication
brings significant technical challenges in the design of robust channel for cognitive radio is often very hostile. On one hand,
and flexible transmission technique in hostile communication available spectrum for CR is often corrupted with strong co-
environment with varying channel condition. An adaptive Or- channel and adjacent-channel interference from existing li-
thogonal Frequency Division Multiplexing (OFDM) system, censed communication systems. On the other hand, the fasting
with a precoded cyclic prefix (PCP), is proposed in this paper variation of the carrier frequency and bandwidth for the avail-
to address these challenges. Besides the basic function as a able spectrum requires that the CR transceiver can adjust its
guard interval for the OFDM systems, the PCP provides an ef- transmission parameters in a fast and efficient manner.
ficient way of sending the transmission system parameters of
the cognitive radio simultaneously with the data carrying
OFDM signal. These parameters may include the bandwidth,
total number of OFDM subcarriers, modulation and coding
schemes used. Overall spectrum efficiency can be improved
due to the elimination of the preambles and handshaking sig-
naling required when there is any change in the CR transmis-
sion parameters. The receiver design particularly a hybrid
domain equalizer for the PCP-OFDM system is presented in
this paper. Implementation related issues including exploita- (a) Transmitter
tion of the PCP structure, interference cancellation and com-
plexity reduction are investigated. The performance of the
proposed OFDM systems and the channel estimators are ana-
lyzed and verified through numerical simulations.
Index terms: OFDM, cyclic prefix, cognitive radio, adaptive
transmission.
I. INTRODUCTION
Today’s wireless communication systems are characterized by
a fixed spectrum allocation policy, i.e. the spectrum is regu-
lated by governmental agencies and is assigned to license
holders on a long term basis for large geographical regions. (b) Receiver
According to Federal Communications Commission (FCC), Fig. 1. Block Diagram of the PCP-OFDM System.
temporal and geographical utilization rate of the assigned (a) Transmitter. (b) Receiver.
spectrum can be as low as 15% [1, 2] at any location and at
any given time. Although the fixed spectrum assignment pol- The objective of this paper is to address the aforementioned
icy generally served well in the past, the dramatic increase in challenges with the proposed adaptive OFDM systems by us-
wireless communications in recent years poses a looming ing precoded cyclic prefix (PCP). The proposed PCP-OFDM
challenge due to spectrum overcrowding. provides a flexible, robust, and efficient platform specifically
tailored for cognitive radio communications. The organization
Cognitive radio is a revolutionary technology that aims for of the paper is as follows. Principle and architecture of the
remarkable improvements in efficiency of spectrum usage. PCP-OFDM system are presented in Section II. The design of
The cognitive radio is normally defined as an intelligent wire- the corresponding receiver, particularly the synchronization
less communication system that is aware of its environment and hybrid domain equalization blocks, are considered. Based
and uses the methodology of “understanding-by-building” to on our interference analysis for the proposed OFDM system,
learn from the environment and adapt to statistical variations an efficient time-domain interference cancellation algorithm is
in the input stimuli, with the efficient utilization of the radio proposed for the hybrid domain equalizer. Simulation results
spectrum as the primary objective [3,4]. In addition to the nu- to validate and assess the performance of the proposed tech-
merous regulation related issues aroused, the recent develop- niques are presented and discussed in Section V, and the paper
ment of cognitive radio brings significant technical challenges is summarized in Section VI.
in the design robust adaptive transmission technique for this

978-1-4244-2075-9/08/$25.00 ©2008 IEEE 3642

Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 3, 2009 at 08:00 from IEEE Xplore. Restrictions apply.
 This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 proceedings.
II. PCP-OFDM SYSTEM
Consider the proposed PCP-OFDM system in Fig.1. The
transmitter in Fig. 1(a) is basically the same as that in a tradi-
tional OFDM system, except that the cyclic prefix is now re-
placed by a precoded sequence. Pseudo random sequence or
zero sequence have been used in OFDM as prefix and postfix
to protect OFDM symbol from ISI [5,6]. Our proposed PCP is
combined from two Kasami sequences, precoded by the CR
transmitter identification and system parameters.
The real part of the PCP represents the transceiver identifi-
cation and imaginary part is precoded for the transmission of
OFDM system parameters including the number of the subcar-
riers and the modulation/coding schemes used. In addition, the
size of inverse fast Fourier transformation (IFFT) block, i.e.
the number of subcarriers of adaptive OFDM modulator, is
also controlled by by the spectrum sensing, sharing and con-
trolling unit (SSCU). The total number of the subcarriers in
the OFDM signal and its carrier frequency depends on the in-
formation of the available spectrum from the spectrum sensing
unit. The number of the subcarriers as well as the coding and
modulation schemes will be coded into different cyclic prefix.
The same PCP is used as the cyclic prefix for all the forthcom-
ing OFDM symbols unless there is a change in the transmis-
sion system parameters. The generation of the pseudo random
sequence and consequently the precoded cyclic prefix is con-
trolled by SSCU.
Precoded Cyclic Prefix. Two Kasami sequences will be used
to generate the precoded cyclic prefix according to
c P = c P , r + jc P , i . (1)
Note here all elements in the pseudo random sequences in (1)
take on values +1 or -1. This is to avoid any direct current
(DC) component in the transmitted signal. The real part of the
cyclic prefix, c P, r , will be used as the identification of cogni-
tive radio, while the imaginary part c P ,i will be used to trans-
mit the system parameters. The generator for such Kasami
sequences can be found in [7].When large set Kasami se-
quences with period of 2n − 1 are used, both the real and imagi-
nary part of the PCP can have M = 2n / 2+1 (2n + 1) different
sequences. Here n is a nonnegative even integer. The real part
of the cyclic prefix is uniquely assigned as the identification of
the cognitive radio. Signals from each cognitive radio can then
be easily traced back to its sourcing transmitter for spectrum
monitoring and sharing purposes. With the M possible se-
quences for the imaginary part, it is therefore possible to
transmit log 2 M ≈ 1.5n bits for the cognitive radio parameters.
This approach is similar to coded shift keying [8]. The input
data sequence is denoted as
d = [d0 , d1, , d1.5n−1 ] (2)
where d i ∈{0,1} . Each data sequence of system parameters
thus is associated with one unique Kasami sequence. For in-
stance, it is possible to transmit nine bits of system informa-
tion using Kasami sequence when n=6. If the first two bits
of d in (2) are used to indicate the number of the subcarriers,
four different sizes can be used. Similarly, information of four
modulation and four coding schemes can be transmitted using
the d 2 d 3 and d 4 d 5 . The remaining bits can be used for error
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 3, 2009 at 08:00 from IEEE Xplore. Restrictions apply.
coding or indicating the order of the OFDM symbol when the
system information has to be transmitted over several different
OFDM symbols.
Another ways of using the system parameter information is
to let each different d represents a different pre-determined CR
transmission platform, with each platform has its own combi-
nation of OFDM subcarriers, bandwidth, coding schemes etc.
As an example, the large Kasami set with n=6 provides 512
different transmission options for the CR.
Fig. 2. Signal propagation of one OFDM symbol with two PCPs.
PCP-OFDM Transmitter. Each OFDM symbol at the output
of Fig.1 (a) is specified by an N-point time-domain vector x
obtained via an IFFT of the complex data vector X of size N.
Without loss of generality, each OFDM symbol in time do-
main can be expressed in vector form as
x = FNH X , (3)
where F = F is the inverse Fourier Transform matrix with its
H −1
N N
( )
(n, k)th entry exp { j 2π nk / N } / N . Operator (⋅ )H denotes
conjugate vector/matrix transposition. Before the transmission
of the OFDM symbol in (1), the generated PCP sequence with
length of P is inserted as its prefix. The duration of the pseudo
random length should be longer than or at least equal to the
channel delay spread for a complete removal of ISI during the
demodulation process. Note that in the proposed system, the
beginning of the CR communication starts with one precoded
cyclic prefix. This is equivalent generating a new OFDM sym-
bol of N+2P samples with one pseudo random sequence as its
last P samples and the other sequence as its cyclic prefix in the
first P samples. Consequently, cyclic structure for each PCP-
OFDM symbol is produced since the pseudo random sequence
will be used as cyclic prefix for all the OFDM symbols. As a
result, it creates a series of new OFDM symbols of
( N + P) samples with cyclic structure similar to traditional
OFDM symbols protected by cyclic prefix.
Without loss of generality, consider the following signal
vector for interference analysis and PCP-OFDM symbol de-
modulation
x' = [CP (0), CP (1), , CP ( P − 1), x(0), . (4)
T
x(1), , x ( N − 1), C p (0), CP (1), , CP ( P − 1) 
Now let N ' = N + P and vector r ' is the received signal
vector corresponding to the transmitted signal vector x' in (3).
Unless otherwise stated, we assume an L-tap static complex
channel h = [ h0 , h1 , … , hL −1 ]T for signal propagation and inter-
ference analysis, with the worst case L = P . The received signal
r ' corresponding to the transmitted signal vector x ' can be ex-
pressed as
3643
 This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 proceedings.

 h0 0 0  to be canceled due to the elimination of the cyclic structure in

 h h0  the OFDM signal when only N samples of the received signal
 1 
  are used for the demodulation process. For the purpose of sig-
  , (5) nal analysis, we construct two N × N matrices for the ISI and
 hL −1 h1 h0  ICI evaluation [16]. The first matrix is defined as
r' =  0 0  . x '+ w '
   h0 0 0 0 0
 hL−1 h1 h0   h h0 0 0 0 
 hL−1 h1   1
   0, (8)
   
 0 C =  hL −1 hL − 2 h0 0 0
 0 hL−1   0 hL −1 h1 h0 0
where the size of the channel matrix in (5) is  
 
( N + 3P −1) × ( N + 2 P) , and w ' is an additive white Gaussian  0
 0 0 hL −1 h0 
noise (AWGN) vector with the same size as r ' . Suppose the
which represents the channel seen by the OFDM symbol. The
channel impulse response of the channel is known through
second matrix
channel estimation, a straightforward way to obtain the equal-
0 0 hL −1 hL − 2 h1 
ized signal x ' with size of ( N + P) in time domain can be for- 0 0 0 hL −1 h2 
mulated as  
 , (9)
x ' = FNH+ L D−1 ( H ' ) FN + L r ' N + L + w FEQ , (6)  
N+L CT =  0 0 0 0 hL −1 
where r 'N + L is the [ N + P + 1: N + 2 P] samples from the received 0 0 0 0 0 
 
signal r ' and H'=DFTN+L ( h ) . D ( H ' ) is the diagonalized chan-  
nel matrix for the frequency domain equalizer (FEQ) with the 0 0 0 0 0 

frequency channel response as its diagonal elements. It is ob- represents the tail end of the channel’s impulse response that
vious that desired equalized OFDM symbol x is the first N generates ISI in the succeeding symbol. These two matrices
samples of x ' . The demodulation process is have the interesting property of
X = DFTN ( x ) + W FEQ . (7) C + CT = C cycl , (10)
III. HYBRID EQUALIZER FOR PCP-OFDM SYSTEM where Ccycl is the “ideal” channel matrix, i.e. the matrix that
The complexity associated with the demodulation process for results in a cyclic convolution between the transmitted signal
the proposed PCP-OFDM using (6) and (7) is much higher and the channel. Based on (3)-(7), we can express the received
than traditional OFDM system. Compared to an N-point tradi- signal (N samples) for the OFDM symbol in OP as
tional OFDM symbol demodulation process, one extra (N+P) r = Cx + CT c P + w . (11)
-point IFFT and one (N+P)-point FFT are required in (6). This
is because the frequency domain equalization is done on an To use the similar demodulation procedure for traditional
OFDM symbol with size of (N+P). Note that IFFT/FFT with OFDM system, the following ideal received signal vector has
very large size may be used for cognitive radio communica- to be constructed:
tions due to the dynamic range of available bandwidth and ri = r1 − CT cP + CT x , …..(12)
other channel conditions. Consequently, the increase in the where
demodulation complexity of the PCP-OFDM symbol could be r1 = [ r '( P + 1), …… , r '( P + N )]T . (13)
substantial. It is therefore of great importance to develop a re- The signal structure depicted in (12) suggests that the first
ceiver with reduced complexity that is comparable to the tradi- step of the proposed hybrid domain receiver in demodulating
tional OFDM receiver. Here we propose a receiver structure x is to remove the ISI term by subtracting the ISI CT c P from
for the PCP-OFDM system in Fig 1(b). To elaborate the new
receiver, an interference analysis is presented here for the de- the preceding PCP sequence. For any reasonable channel sig-
velopment of the new receivers. Fig. 2 depicts a static multi- nal-to-noise ratio (SNR) of interest, the error from the esti-
path channel and the received signal over one PCP-OFDM mated channel is small enough and hence we will have
symbol and two adjacent PCP in (2). As highlighted by the reliable ISI cancellation. After ISI removal, the next step is to
shaded region in the Fig. 2, the received is spread by the mul- remove the ICI term, or equivalently to perform cyclic recon-
tipath channel, resulting in ISI. The interferences from the ad- struction for the received PCP-OFDM signal. This could be
jacent blocks have to be cancelled for the successful done iteratively as any attempt of ICI removal has to be based
demodulation of the symbol in question. on a temporary decision for the OFDM symbol. However, the
As suggested in Fig. 2, only N samples in the observation computation complexity associated with this iterative ap-
periods (OP) are considered in the proposed receiver for the proach is enormous since the ICI cancellation is in time do-
demodulation of the PCP-OFDM symbol. Note here that same main and the demodulation the OFDM symbol is in frequency
OP is normally used in a conventional OFDM receiver. As a domain. The conversion any signal from time to frequency or
result, ISI from the preceding PCP sequence have to be esti- from frequency to time domain will depend on Fourier trans-
mated and cancelled. With estimated channel impulse re- formation. Here we propose an ICI cancellation approach to-
sponse, ISI can be computed and subtracted from the received tally in time domain. Consider the propagation of the PCP-
signal. However, the intercarrier interference (ICI) still needs OFDM symbol as shown in Fig. 2. When r1 is used for the

3644
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 3, 2009 at 08:00 from IEEE Xplore. Restrictions apply.
 This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 proceedings.

demodulation, we found the remaining tail from the current 0

10

PCP-OFDM symbol is actually the signal we need to recon-

struct the cyclic signal structure. To do this, we have to derive
the tail signal from the following received signal vector of N
−2
10

samples,

Probility of Detection Error

(14)
r2 = [ r '( P + N + 1), …… , r '(2 P + N − 1), 0, ……, 0]
T −4
10

( P -1)Samples ( N - P +1)Samples

If the signal component from the second PCP is subtracted −6

from (12), the desired ICI signal will be obtained as [19] 10

n ICI = r2 − CH cP:N . (15)

where the ( N × N ) matrix CH is given by −8
10

 h0 0 0 0 0
 h h0 0 0 0 
Multipath Channel
 1
−10 Average over two symbols
10

0 . (16) Average over four symbols

 AWGN Channel
 
C H =  hL −2 hL −3 h0 0 0 −10 −8 −6 −4 −2 0
SNR
2 4 6 8 10

 0 0 0 0 0 Fig.4. Probability of detection error for the proposed cognitive radio

 
  system parameter transmission technique using precoded cyclic pre-
 0 0 0 0 0  fix. The duration of the PCP used in the simulation is 255.

Now the ideal signal for the hybrid domain equalizer to de-
modulate the PCP-OFDM symbol can be derived using IV. NUMERICAL SIMULATIONS AND DISCUSSIONS
ri = r1 − CT c p + r2 − C H c P:N . (17)
Computer simulations have been carried out to verify and
When the channel estimate is accurate, the ideal signal in extend the analytical results of the proposed PCP-OFDM in
the above equation becomes previous sections.
ri = Ccycl FNH X . (18) To evaluate the proposed data transmission technology us-
As for the OFDM system with cyclic prefix, the circulant ing the procoded cyclic prefix, the probability of the detection
matrix Ccycl can be diagonalized by N × N (I)FFT matrices error for the system parameters for was simulated and plotted
in Fig. 3, and Fig.4, respectively. Two different Kasami se-
[19]. For the demodulation purpose, applying a FFT matrix to
quences are considered in the simulation for n=6, and n=8.
the above equation lead to
The corresponding periods of these sequences are 63, and 255.
FN ri = FN Ccyc FNH X = D N ( H ) X . (19) N It is observed that good CR system parameter detection per-
where D N ( H ) is the N × N diagonal matrix with the estimated
N
formance is obtained at very low signal to noise ratio, even for
frequency domain transfer function as its diagonal elements. the PCP with the duration of 63 samples. Without any multi-
As the result, the complete zero-forcing demodulation process path interference mitigation, the detection error upper bound is
is 10-1 at the SNR of 10dB. However, this number can be re-
duced to 10-2 when the detection is performed on the averaged
X = D −N1 ( H ) FN ri . (20) N
PCP over two adjacent OFDM symbols. This number was fur-
ther reduced to 10-4 when this average period is extended to
0
10
four OFDM symbols. Since the operational SNR requirement
for the OFDM system is much higher than the PCP system pa-
rameter transmission system, robust performance is expected
Probility of Detection Error

−1
for the proposed transmission scheme based on PCP. In addi-
10
tion, multipath interference cancellation technique and RAKE
receiver could be used to improve the detection performance.
Similar performance curves in Fig.4 also exist for the PCP-
−2
10 OFDM using Kasami sequences of 255 samples as its PCP.
The difference is the detection performance was significantly
improved when the duration of the cyclic prefix increased.
−3
10
Very low error rate is achieved without any multipath interfer-
ence cancellation in Fig. 4. Very robust performance can be
Multipath Channel
Average over two symbols achieved in the proposed the data transmission scheme using
−4
Average over four symbols
AWGN Channel precoded cyclic prefix, even at very low SNR levels. As a re-
10
−4 −2 0 2 4 6 8 10 sult, no error correction coding is needed for the proposed sys-
SNR
tem using Kasami sequences with period of 255 or longer. A
Fig.3. Probability of detection error for the proposed cognitive radio simple time domain averaging of neighboring PCP sequences
system parameter transmission technique using precoded cyclic pre-
fix. The duration of the Kasami sequence used in the simulation is 63.
can significantly improve the performance.

3645
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 3, 2009 at 08:00 from IEEE Xplore. Restrictions apply.
 This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 proceedings.
PCP−OFDM, Multipath Channel1
CP−OFDM, Multipath Channel 1
PCP−OFDM Multipath Channel 2
CP−OFDM Multipath Channel 2
−1
10 PCP−OFDM AWGN Channel
CP−OFDM AWGN Channel
−2
10
SER
−3
10
−4
10
2 4 6 8 10 12
Eb/No
Fig.5. Symbol error rates for the PCP-OFDM and conventional
OFDM systems. The number of the subcarriers, N, precoded cyclic
prefix duration, P, and the modulation scheme in the PCP-OFDM
systems are 256, 63 and 16QAM, respectively.
Numerical simulations have also been conducted to quan-
tify the performance of the proposed new PCP-OFDM re-
ceiver, particularly the hybrid domain equalizer. The
demonstration OFDM system considered has an FFT size of
256 and PCP duration of 63 samples, which is about 1/4 of the
OFDM symbols duration. PCP-OFDM symbols are generated
in the simulations as per Fig. 1(a). As for the channel model,
we consider two static channel models:
Channel 1: h1=[0.2592, 0, 0, 0, 0.8639, 0, 0, 0, - 0.3455i,
0, 0.1728, 0, - 0.0864i , 0 , 0, 0.1728]T,
and
Channel 2: h2= [0.9713, 0, 0, -0.0971 + 0.1943i, 0, 0, 0,
0.0971]T.
The first channel h1 has a longer effective impulse response
and hence a smaller coherent bandwidth. It also has more
variation in the frequency response than h2 . We like to point
out that the emphasis of the investigation is to demonstrate the
workability of PCP-OFDM and its potential application in
cognitive radio communications. Consequently, “exact” chan-
nel modeling and parameter selections are only secondary
concerns in this paper, as a lot depends on design issues be-
yond the scope of this paper, such as choice of frequency of
operation; symbol rate, modulation; antenna types; antenna
heights, the terrain, rates of movement, and other geometrical
factors (e.g., distances between antennas and distances to re-
flective surfaces).
The precoded cyclic prefix used in the simulation was gen-
erated by a Kasami sequence generator. Two Kasami se-
quences with period of 63 samples are combined together to
generate the complex PCP to be inserted into OFDM signal.
The imaginary part of the PCP is modulated by nine bits in-
formation as the initial value to the Kasami sequence. The
nine bits information provides sufficient information on sys-
tem parameters of the cognitive radio to the receiver. It can
support the choice of 512 different transmission platforms for
CR communications, depending on the CR channel conditions
including bandwidth, interference strength and mobility. The
SER curves for 16QAM modulation were plotted in Fig.5. As
predicted, the replacement of the traditional cyclic prefix with
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 3, 2009 at 08:00 from IEEE Xplore. Restrictions apply.
the proposed precoded Kasami sequence has virtually no im-
pact to the OFDM symbol error rate performance. The per-
formance difference between the PCP-OFDM system and the
traditional OFDM system with cyclic prefix is negligible. This
can be explained by equation (17). ISI from the precoded cy-
clic prefix to PCP-OFDM symbol was removed and the cyclic
structure for the received signal was reconstructed. Conse-
quently there is no difference in using the precoded cyclic pre-
fix and the traditional cyclic prefix. The simulation results also
confirm the effectiveness of our ISI and ICI cancellation tech-
niques. Similar performance characteristics are observed for
Channel 2.
V. CONCLUSIONS
A new adaptive OFDM system supporting fast and efficient
14
spectrum allocation for future cognitive radio communications
was presented in this paper. The flexibility of the new OFDM
platform is derived from the concurrent transmission of the
system parameters of the cognitive radio together with the
OFDM signal. The corresponding receiver for the proposed
OFDM system was designed based on the proposed intersym-
bol interference and intercarrier interference cancellation algo-
rithms. Implementation complexity for the new hybrid domain
equalizer is dramatically reduced and is comparable to tradi-
tional OFDM systems. The probability of the detection error
for the proposed system parameter transmission technique us-
ing PCP as well as symbol error rate of the PCP-OFDM were
analyzed and verified through numerical simulations. With the
PCP-OFDM platform, spectrum assignment will become more
flexible and dynamic. Greater flexibility in responding to the
dynamic channel conditions as well as various communication
demands will be easily achieved.
References
[1] U.S. Federal Communications Commission, “Notice of pro-
posed rule making and order” ET Docket No 03-222, Dec. 2003.
[2] I. F. Akyildiz, W.-Y. Lee, M. C. Vuran, S. Mohanty. “Next gen-
eration/dynamic spectrum access/cognitive radio wireless net-
works: A survey”, Computer Networks (Elsevier), vol. 50, no.
13, pp. 2127–2159, Sept. 2006.
[3] J. Mitola III, “Software radio architecture: a mathematical per-
spective”, IEEE J. Sel. Areas Commun., vol. 17, no. 4, pp. 514-
538, April 1999.
[4] S. Haykin “Cognitive radio: brain-empowered wireless commu-
nications”, IEEE J. Sel. Areas Commun., vol.23, no. 2, pp. 201-
220, Feb. 2005.
[5] M. Muck, M. Courville, M Debbah, and P. Duhamel, “A Pseudo
Random Postfix OFDM modulator and inherent channel estima-
tion techniques”, in Proc. Globecom 2003, pp.2380-2384, Nov.
2003.
[6] B. Muquet, Z. Wang, G. B. Giannakis, M.D. Courville, and P.
Duhamel, "Cyclic prefixing or zero padding for wireless multi-
carrier transmissions?", IEEE Trans. Commun., vol. 50, no. 12,
pp. 2136-2148, Dec. 2002.
[7] D. V. Sarwate and M. B. Pursley, “Cross Correlation Properties
of Pseudorandom and Related Sequences”, Proc. IEEE, vol.68,
no.5, pp.593-619, May 1980.
[8] S. Erkucuk and D. I. Kim, “Combined M-ary Code Shift
Keying/Binary Pulse Position Modulation for Ultra Wide-
band Communications”, in Proc. Globeom 2004, pp.804-
808, Nov. 2004.
3646