I. I NTRODUCTION
Filter bank multicarrier (FBMC) is a transmission technology proposed long time ago [1]. In recent years, FBMC has
recaptured widespread interests for its possible applications
in cognitive radio, dynamic spectrum access and heterogenous networks [27]. Like the orthogonal frequency division
multiplexing (OFDM), FBMC is also a multicarrier scheme.
Compared to OFDM [8], FBMC uses a prototype lter with
much better time-frequency product. The localization of the
FBMC signal in both time and frequency makes it much more
robust to timing error and frequency offset.
In general FBMC has higher complexity than OFDM,
which has limited FBMCs applications. There have been
some fast algorithms proposed to reduce the complexity. For
example, a fast algorithm for the Offset Quadrature Amplitude
Modulation (OQAM, also called OFDM-OQAM in some
literature) is proposed in [9]. In [10], a unied fast algorithm
is proposed that is applicable to arbitrary sampling rate and
subcarrier spacing. In general, such fast algorithms use the fast
Fourier transform (FFT) and the polyphase structure to reduce
the complexity. The polyphase structure is realized by fast
convolution algorithms [11]. In practice, the prototype lter
length is limited to just a few block symbol length. Thus
the convolution length for the polyphase structure becomes
very short. As we know, it is not efcient to implement short
convolution algorithms in parallel processors [12, 13]. On the
other hand, parallel processors are widely used in various
platforms. For example, FPGA usually has large scale parallel
922
with T F = :
p(t) = p0 (
F
t) = p0 ( t).
T
(1)
p0 (t)p0 (t n )ej2k t dt
Ap0 (n, k) =
=
(3)
Ap (n, k).
T
Thus, to make the FBMC system orthogonal, we only need to
design a normalized prototype lter p0 (t) such that
Ap0 (n, k) = 0, if and only if k = n = 0.
(4)
x(t) =
sn (k)p(t nT )ej2kF t .
N/21 M 1
k=N/2 n=0
(5)
N/21 M 1
sn (k)p0
k=N/2 n=0
j2km
j2km
m
n e N . (9)
+ m)Ts ),
x((lN
1,
m = 0, 1, , N
N/21
(6)
k=N/2 n=0
sn (m) =
sn (k)p(mTs nT )e
sn (k)e
j2km
(10)
(11)
k=N/2
Then
yl (m) =
M
1
sn (m)p0
n=0
l
m
+
n .
(12)
(13)
/ + l/ n < / + l/ + 1/.
Let
1
l
l
M1 = + , M2 = + + .
Then
923
yl (m) =
M2
n=M1
sn (m)p0
l
m
+
n .
(14)
(15)
We dene
k
m
+
gk (m) = p0
Then
M2
yl (m) =
.
sn (m)gln (m).
(16)
factor here can be the same or different as that at the transmitter. For simplicity, we use the same notation as that at the
T
.
transmitter. Thus the sampling period is Ts = N1 F = N
The received signal samples are divided into blocks of length
and denoted as
N
(17)
+ m)Ts ),
yl (m) = x
((lN
1; l = 0, 1,
m = 0, 1, , N
n=M1
+ l n < + l + 1,
we obtain
Let
(18)
1 < l n .
(19)
K1 = 1, K2 = .
(20)
(21)
1 l < + (M 1).
In general, the size of the output data sequence is around
times that of the input data sequence.
Based on the above derivations, we have the parallel algorithm as follows.
Algorithm 1: Unied parallel algorithm for FBMC
transmitter
j2km
N/21
1. Compute sn (m) = k=N/2 sn (k)e N . This can be
-point FFT for any xed n. Parallel algorithms
realized by a N
for FFT have been studied extensively and efcient algorithms
are available in [12, 13, 16].
for k [K1 , K2 ]
2. Compute gk (m) = p0 k + m
M2
sn ()gln ().
(22)
n=M1
2
+ 1 + 1) vector
For xed l, only (M2 M1 + 1) (
2
+ 1 ) vector additions
multiplications and (M2 M1 ) (
.
are needed. The vector lengths are N
(23)
1
N
cp T
yl (m)
N
l m=0
j2km
l
m
n e N
p0 +
1
N
l m=0
1
N
m=0
Dene
un (m) =
zn (k) =
j2km
yl (m)gln (m)e
j2km
. (24)
Then
yl (m)gln (m)e
yl (m)gln (m).
(25)
1
N
un (m)e
j2km
(26)
m=0
1 < l n .
(27)
Thus we only need gk (m) for k [K1 , K2 ]. Let
1 = 1 + n, M
2 = + n .
M
(28)
1, M
2 ].
Then obviously the index l is conned in interval [M
Based on the above derivations, we have the parallel algorithm as follows.
Algorithm 2: Unied parallel algorithm for FBMC receiver
for k [K1 , K2 ]
1. Compute gk (m) = p0 k + m
N
1. This can be done in real-time or by
and m = 0, 1, , N
pre-computation. If pre-computation is used, we pre-calculate
these values and store them in memory. The values are not
related to T and F and can be
used for different scenarios.
M
2. Compute un (m) = 1N l=2M yl (m)gln (m). This
1
can be done in parallel by forming vector operations:
un () =
2
M
1
l=M
yl ()gln ().
(29)
1 + 1) (2 + 2) vector
2 M
For xed n, only (M
924
0.8
0.8
0.9
0.7
0.6
0.5
0.4
0.3
0.2
0.6
0.4
0.2
0.1
0
10
0.2
20
15
10
Fig. 1.
10
15
20
normalized frequency
normalized frequency
Fig. 2.
N/4
FBMC
OFDM
V. S IMULATIONS
In the simulations, we use Matlab running in a general
computer to verify the correctness of the parallel algorithms.
The Matlab program is exactly based on Algorithm 1 for the
transmitter and Algorithm 2 for the receiver by using vector
operations. Note that the simulations here are not for showing
the performance gain of the parallel algorithms, as the actual
performance of a parallel algorithm is related to the processing
platform. Here we just show that the parallel algorithms are
correct and compare the performance of FBMC and OFDM
at various situations.
For fair comparison, we choose the FBMC system and
OFDM system to have the same bandwidth efciency. The
prototype lter for FBMC is designed based on the IOTA
(Isotropic Orthogonal Transform Algorithm) [24]. As an
example, the frequency
response of the normalized prototype
lter for T = F = 1.25 is shown in Figure 1. We can also
treat OFDM as a special type of FBMC with the rectangular
function as its prototype lter. For comparison the frequency
response of the equivalent normalized prototype lter for
OFDM with cyclic prex (CP) length N/4 is shown in Figure
2. Obviously, the prototype lter for FBMC is much welllocalized in frequency.
We consider practical situations with carrier frequency offset (CFO) and timing error. Let the maximum CFO be max
kHz and maximum timing error be max samples. The actual
CFO and timing error at each Monte-Carlo test are randomly
generated in [max , max ) and [max , max ), respectively,
with even distribution.
10
10
10
12
14
16
18
20
22
24
26
28
30
SNR
Fig. 3.
925
FBMC
OFDM
FBMC
OFDM
10
10
10
10
10
15
20
25
30
35
40
10
SNR
Fig. 4.
Fig. 6.
18
20
22
24
26
28
30
R EFERENCES
16
Acknowledgement: Thank Dr. The Hanh Pham for providing the prototype lter and helpful discussions.
10
10
15
20
25
30
35
40
SNR
Fig. 5.
14
SNR
FBMC
OFDM
10
12
[1] S. Weinstein and P. Ebert, Data transmission by frequency-division multiplexing using the discrete Fourier transform, IEEE Trans. Commun.
Tech., vol. 19, p. 628C634, Oct. 1971.
[2] B. L. Floch, M. Alard, and C. Berrou, Coded orthogonal frequency
division multiplex, Proceedings of IEEE, vol. 83, no. 6, pp. 982996,
1995.
[3] R. Haas and J.-C. Belore, A time-frequency well-localized pulse
for multiple carrier transmission, Wireless Personal Communications,
vol. 5, pp. 118, 1997.
[4] P. Siohan and C. Roche, Cosine-modulated lterbanks based on extended gaussian functions, IEEE Trans. Signal Processing, vol. 48,
no. 11, pp. 30523061, 2000.
[5] B. Farhang-Boroujeny, OFDM versus lter bank multicarrier, IEEE
Signal Processing Magazine, pp. 92112, May 2011.
[6] D. Noguet, M. Gautier, and V. Berg, Advances in opportunistic radio
technologies for TVWS, EURASIP Journal on Wireless Communications and Networking, vol. 170, pp. 112, 2011.
[7] PHYDYAS, PHYDYAS-physical layer for dynamic spectrum access
and cognitive radio, in http://www.ict-phydyas.org/, 2013.
[8] M.-O. Pun, M. Morelli, and C.-C. J. Kuo, Multi-Carrier Techniques for
Broadband Wireless Communications: A Signal Processing Perspective.
UK: Imperial College Press, 2007.
[9] L. Vangelista and N. Laurenti, Efcient implementations and alternative
architectures for OFDM-OQAM systems, IEEE Trans. On Communications, vol. 49, no. 4, pp. 664675, 2001.
[10] E. Gutierrez, J. A. Lopez-Salcedo, and G. Seco-Granados, Unied
framework for exible multi-carrier communication system, in 8th
International Workshop on Multi-Carrier Systems & Solutions (MC-SS),
(Spain), May 2011.
[11] G. Bi and Y. H. Zeng, Transforms and Fast Algorithms for Signal
Analysis and Representation. Boston, USA: Birkhauser-Springer, 2003.
[12] Y. H. Zeng, L. Z. Cheng, and M. Zhou, Parallel Algorithms for Digital
Signal Processing. China: National University of Defense Technology
Press, 1998.
[13] E. Chu and A. George, Inside the FFT Black Box: Serial and Parallel
Fast Fourier Transform Algorithms. Taylor & Francis, 2010.
[14] Y. H. Zeng, Y.-C. Liang, Z. D. Lei, S. W. Oh, F. Chin, and S. M. Sun,
Worldwide regulatory and standardization activities on cognitive radio,
in IEEE DySPAN, (Singapore), April 2010.
[15] Y.-C. Liang, K. Chen, Y. Li, and P. Mahonen, Cognitive radio networking and communications: an overview, IEEE Trans on Vehicular
Technology, vol. 60, no. 6, pp. 123, 2011.
[16] M. Ayinala, M. Brown, and K. K. Parhi, Pipelined parallel FFT
architectures via folding transformation, IEEE Transactions on Very
Large Scale Integration (VLSI) Systems, vol. 20, pp. 10681081, June
2012.
926