Beruflich Dokumente
Kultur Dokumente
2
TABLE I can be described in a matrix as follows:
TFL GRADE OF VARIOUS TYPE OF PULSE
s+,+ s+,- s+,. ⋯ s+,01-
s-,+ s-,- s-,. ⋯ s-,01-
2 ALVES et al: PERFORMANCE
S = .,+ .,- s OF s
GFDM OVER s ⋯ s.,01- , CHANNELS
FREQUENCY-SELECTIVE
.,. (1)
⋮ ⋮ ⋮ ⋱ ⋮
s41-,+ s41-,- s41-,. ⋯ s41-,01-
levelhigher
The achieved
values by of OFDM.
parameters 𝜉 and 𝜅 mean better TFL K subcarriers transmits M data symbols per GFDM frame.
The aim of this paper is to present
characteristics of a pulse. This pulses should give better in the analysis of the Since the mappers are independent, different constellation
where rows of the matrix representing subcarriers and
performance of GFDM in frequency-selective
various measures and performance in the new GFDM channels con- orders can be used in each stream, allowing for dynamic bit
column for subsymbols. Therefore, each element of the
sidering
signal. different channel profiles. To the best of the authors’ loading mapping according to the channel conditions for each
matrix s8,9 , k = 0, 1, 2, … , K − 1, m = 0, 1, 2, … , M − 1
knowledge, this is a novel analysis
The new system called generalized frequency division and, thereby, it is the subcarrier [29]. Because GFDM transmits M data symbols in
main contribution of this paper. Three types of receivers will be fed into mapper for next processing steps.
are
multiplexing or GFDM in short, like implied by the term is each subcarrier using M time-slots, the data symbols can be
considered: ZFR (Zero Forcing Receiver), MFR (Matched The best part
organized in of
a the GFDM
frame structure systemgiven is by
the flexibility in
a generalized-form of frequency division multiplexing. By
Filter Receiver) and Matched choosing the
⎡ type of filter 𝑔(𝑛) to be used for pulse- ⎤
utilizing a better TFL’s pulse for Filter
shapingReceiver with DSIC
the subcarriers, sprevious sworked, sMichailow . . . [1] sutilized
(MFR-DSIC). shaping. In the 0,0 0,1 0,2 0,M −1
we can play theAll results areofcompared
multiplexing information withsignal
the performance
in both ⎢ filter
s s s . . . s ⎥
of anandOFDM system. All to simulation two different ⎢ 1,0 raised 1,1 cosine (RC)
1,2 and root-raised
1,M −1 ⎥
time frequency domain fulfill theresults
demandthat have been
of higher ⎢ sto s2,1 the effect s1,2 of s2,M −1 ⎥
. . . inter-symbol
obtained using Matlab are compared with theoretical cosineS (RRC)
curves, = ⎢ 2,0 compare ⎥,
data rate. ⎢ . .. interference. .. . He .. to a ⎥
which allow one to conclude that the symbol error probabilityinterference⎣ and ..inter-carrier . . . . came . ⎦
expression proposed for OFDM can be used to estimate conclusion that
the RC filter gave more ISI but less ICI than
II. GENERALIZED FREQUENCY DIVISION MULTIPLEXING s K−1,0 sK−1,1 sK−1,2 . . . sK−1,M −1
performance of GFDM. RRC. (1)
The remaining of this paper is organized as follows: Section For where addition
the k-th to therow flexibility
represents inthechoosing symbols better transmitted TFL in the
Generalized Frequency Division Multiplexing (GFDM)
II presents the generation of GFDM symbols, whereas Sectioncharacteristic k-th subcarrier for filter,
and the GFDM m-th system
column also represents utilizing the asymbols
is multicarrier system, introduced by Fettweis [3] as a robust method in mitigating the effect of time-spreading.
III presents three techniques used to recover the transmitted transmitted in the m-th time-slot.
system that combine M-number of subsymbols and K- This phenomenon usually occurs when the system is used
information. Section IV contains the performance analysis of Each data symbol sk,m is up-sampled by zero-padding
number of subcarriers to build a frame. This is the first by mobile user. The sender or receiver or both terminal
GFDM considering AWGN and Section V evaluates the per- M N − 1 zeroes, resulting in the sequence
thing that make it different to Orthogonal Frequency moves faster than the speed of data transmission will
formance over frequency-selective channels. Finally, Section
Division Multiplexing (OFDM) in the case that it just spread the symbol and sk,mthus
(n) can = sk,moverlapδ(n − itsmN ),
neighbor. The (2)
VI concludes the paper.
utilizes one subsymbol and K-number of subcarriers in a method called tail-biting will provide last chunk of frame
frame. where N is the number of samples used to represent a time-
II. G ENERATION OF THE GFDM S IGNAL to be place
slot. This in sequence
the next frame is applied as redundant
to a transmit data.filter It actually
with impulse
A. GFDM
GFDM is Transmitter implemented in the system by using a circular convolution
a flexible multi-carrier modulation scheme that response g(n) of length L = M N . If conventional linear
in each subsymbol.
convolution is used, likeVOL. in the Filter Bank Multi-carrier
hasThe construction
been introduced by of Fettweis
the transmitter
et al [22]a and little bit interesting
it has more REVISTA TELECOMUNICAÇÕES, 15, Nº02, OUTUBRO DE 2013
complex
features than
for in CROFDM as proposed
applications. Figure by Bruno M. Alves
1 depicts the etblock (FBMC) [30] schemes, the guard time interval between the
all in [2]: of the GFDM transmitter.
diagram GFDM frames should be larger than the channel delay spread
sk,0
plus the filter spreading in order g(n) to avoid IFI (Inter Framewher
Time Slot #1 Time Slot #2 Time Slot #3
1 QAM
Upsampler
g (n)
e
interval
5 10would 15 be 20 a considerable drawback, 5
causing
10 15
throughput
20
MN sk,1
reduction, leading to a poor spectrum efficiency. However, this
g(<n-N>NM-1)
n
− j 2π
. . . . e N
Sample NM-1
. . . .
. . . . problem can be easily avoided g(n) by using a technique called
K-1 QAM
Upsampler
g (n)
tail-biting [22]. In this technique, the mN last samples at the
MN
e
− j2π
(K−1)n
N s k,2
output
5
of
10
the15
filter
20
are shifted to the first 5
mN10
positions,
15 20
as
g(<n-2N>NM-1)
Time Slot #2 illustrated in Figure 3. This process can be made by circular
convolution [31].
Serial/Parallel Converter
K QAM
Upsampler
g (n-N) g(n)
MN
− j0
K+1 QAM
Upsampler
g (n-N)
e
5 10 15 20 5 10 15
Filter
20
Filter
is the
MN s
Tak
n
. . . . e
− j 2π
N
k,0
g(n) Time Slot #1 Time Slot #2 Time Slot #3 Spreading Spreading
Data
Bits
.
.
.
.
.
.
.
. CP
Fig. 3 Creating GFDM g(n)Symbol using Circular Sample # NM-1 repre
Upsampler
Σ Fig. 3. GFDM symbol obtained Convolution
by circular convolution.
2K-1 QAM MN
g (n-N) 5 10 15 20 5 10 15 20
( K−1)n
− j 2π
e N sk,1 g(n-N)
. Finally, each sub-streamg(n)of symbol will be fed into wher
.
.
symbols transmitted
subcarrier in a given subcarrier. In [26], the author
complex converter:
Time Slot #M presents
s
5a deep
10 analysis
15 20
k,2
about the H
influence of Raised Cosine 5 10 15 20 25 30
g(n-2N)
Upsampler
(RC) and Root Raised Cosine1F.G8 (RRC) filters
(M-1)K QAM MN
g [n-(M-1)N]
e − j0 p 8 n = e g(n)
I , (2) in the performance
(M-1)(K+1) QAM
Upsampler
g [n-(M-1)N] of GFDM systems. The impact of the roll-off factor is analyzed
MN where N5 is number of sampling in a time slot. The output
as well. The 10major conclusions of this analysis are: i) if RCs
n
. . . . − j 2π
15 20 5 10 15 20 25 30 35
e N
. . . . frame will be the summation of every sub-stream from
. . . . are used on the transmitter and receiver sides there will be
each
largersinglewhen
subsymbol and subcarrier.
Fig.ISI
2. GFDM compared withbythe useconvolution.
of RRC because the
Upsampler
MK-1 QAM MN
g [n-(M-1)N] symbol obtained linear
Nyquist criterion is not satisfied, however the ICI will be
(K−1)n
B. GFDM Receiver
− j2π
e N
pulse-shaping) in average.
s21 s22 s23 … s2M
… … … … …
Fig. 6 PSD of OFDM & GFDM with RC (b=0.1) Fig. 9 PAPR of OFDM & GFDM with RC pulse-
shaping
5
V. CONCLUSION experience as senior engineer at PT PBI/Bechtel (1998)
and PT Austrian Energy Indonesia (2000).
The GFDM system can prove as an effective system to
support the introduction of next generation communication
system. A much faster data rate and more reliable system
along with low power consumption is mandatory in the
upcoming communication services.
The exercising of variety of pulse to be used in shaping
the subcarriers in GFDM system is intended to get the
more effective way to accomplish the job. Hopefully, we
can find the better pulse property such as roll-off factor
and standard deviation, or more advanced pulse type to be
used in GFDM system. The preliminary results can be
taken that we have to choose a type of another pulse with a
better time-frequency localization than rectangular.
REFERENCES
[1] Nicola Michailow et all, Generalized Frequency
Division Multiplexing for 5th Generation Cellular
Networks, IEEE Transactions on Communications,
Vol. 62, No. 9, September 2014.
[2] Bruno M. Alves et all, Performance of GFDM over
Frequency – Selective Channels, Revista Telecom.
Vol. 15, October 2013.
[3] Gerhard Fettweis et all, GFDM – Generalized
Frequency Division Multiplexing, IEEE, 2009.
[4] Rohit Datta et all, GENERALIZED FREQUENCY
DIVISION M ULTIPLEXING IN COGNITIVE
RADIO, 20th European Signal Processing Conference
(EUSIPCO 2012).
[5] Jinfeng Du, Pulse Shape Adaptation and Channel
Estimation in Generalized Frequency Division
Multiplexing Systems, Licentiate Thesis in
Electronics and Computer Systems, Stockholm,
Sweden 2008.
[6] Nicola Michailow et all, Generalized Frequency
Division Multiplexing: Analysis of an Alternative
Multi-Carrier Technique for Next Generation Cellular
Systems, CONFERENCE PAPER
(www.researchgate.net /publication/261231239),
August 2012.