Professional Documents
Culture Documents
AbstractScaling the different stage outputs in an FFT appropriately is crucial for getting a good Signal to Quantization
noise ratio (SQNR) in fixed point FFT design. Traditional designs
have either handled this through Convergent block floating
point technique (CBFP), which has memory, computation and
latency penalties or through time consuming simulations. In this
paper, we consider the special case of FFT design for OFDM
transceivers. We exploit the Gaussian nature of OFDM signals
to predict the bit-growth of the signal through the various
stages of the FFT and propose a technique to scale the signal
appropriately. Additionally, we investigate the quantization error
profile and propose a technique to improve SQNR by exploiting
the presence of null tones at the band edges. With the proposed
techniques, the performance comes close to the CBFP design, with
no increase in complexity compared to existing static designs.
Simulation results illustrating the performance improvements of
the proposed technique are presented.
N
1
X(k) exp
j2kn
N
n = 0 N 1
k=0
I. I NTRODUCTION
Fast fourier transforms (FFT) have been widely used in
various fields for computing the Discrete Fourier Transform
(DFT) of a signal. A lot of work has gone into designing
efficient architectures like radix 2, radix 22 [1], radix 23 [2]
and split radix algorithm. Fixed point FFT designs have largely
used the complex but optimal Convergent Block Floating Point
(CBFP) method [3]or its variants [4]. This method essentially
scales the output of every stage appropriately to maximally
utilise the dynamic range and hence gets the best Signal to
Quantization Noise Ratio(SQNR) for a given number of bits.
The disadvantage of this method is its higher complexity and
latency. Desingers often use simulations to decide the scaling
factors at the expense of increased design time.
Orthogonal frequency division multiplexing (OFDM) is now
used in a number of wireless systems like WLAN, WiMax,DVB, DAB, UWB and has also been proposed in future
cellular technologies like LTE. In OFDM, the data is sent on
orthogonal tones and an IFFT at the transmitter and an FFT at
the receiver multiplex and demultiplex the data respectively.
Many FFT designs for OFDM systems have also used the
CBFP technique as reported in [5], [3].
In this paper we exploit the statistical property of OFDM
signals and use it to derive a near-optimal scaling scheme. We
also discuss the effects of truncation and rounding and show
ways of increasing SQNR even with the low complexity truncation operation. In section II we present a short introduction
to OFDM. Section III discusses the traditional techniques
for fixed point design and points out their advantages and
disadvantages. In section IV, we derive the statistics of the
OFDM signal as it passes through different stages of the
N
1
x(n) exp
j2kn
N
k = 0...N 1
n=0
1 0
0 1
T =
1 0
0 1
Fig. 1.
0
1
0
1
For a radix 22 FFT, each stage has two butterflies and let the
corresponding matrices be T1 and T2 . The output is given by
Sm = Ttw T2 T1 Sm1 It can be seen that
1 0 1
0
1 1 0 0
0 1 0
1 1 0 0
1
T1 =
1 0 1 0 T2 = 0 0 1 j
0 1 0 1
0 0 1 j
These transformations are orthogonal transformations and
given that the input to the FFT is zero mean i.i.d Gaussian, the
output of every stage is also zero mean iid Gaussian. To show
this, it is enough to show that if the input has a correlation
matrix of the form 2 I, then the output also has a similar
form. Assume that the input Sm1 is iid with variance of
2
. Then the variance of the output is given by
m1
H
E[Sm Sm
]
=
=
=
H
H
Ttw T E[Sm1 Sm1
]T H Ttw
2
H
Ttw T T H Ttw
m1
2
rm1 Ir
(1)
(2)
(3)
i
at the input) and let Wm
denote an mth order FFT of the noise
th
affecting the i stage. Let Q(k) denote the quantization noise
affecting the k th tone at the FFT output, then
log2 N
Q(k) =
i=0
Fig. 2.
W iN (
2i
k
)
2i
(4)
M (k)
(5)
The above equation just reflects the fact that the mean of the
FFT output is the same as the FFT of the mean of the input,
which is just a non-zero value at DC and zero elsewhere.
i
i
(k) E[WM
(k)]|2 ]
E[|WM
= M 2
(6)
The above equation shows that the variance of the FFT output
is identical for all tones due to the i.i.d assumption and the fact
that the FFT is an orthogonal transformation. M represents the
processing gain of the FFT. The Quantization noise power is
given by
E[Q2 (k)]
2
log2 N
N
N
k
+
=
(
)
2 (7)
i
i
i
2
2
2
i=0
i=0
log2 N
The equation shows that the variance is same for all the
output tones of the quantization noise, but the mean is different
for different tones thereby causing a different noise power
profile. Now let us consider the two most common quantization schemes - truncation and rounding. Both truncation
and rounding have the same variance but their mean values
are different. Suppose b fractional bits are either truncated or
rounded to the nearest integer, it can be shown that the mean
and with rounding is 0.5
error with truncation is 0.5 0.5
2b
2b
The quantization noise power profile at the FFT output for
a 16 point FFT is plotted in figure 3 for both truncation and
rounding, based on equation 7, assuming 2 fractional bits at
every stage before rounding/truncating to an integer. The plot
shows that the quantization noise is high near the DC tones
while it significantly smaller near the edge tones. The trend is
the same for rounding as well, but the difference between edge
tone and DC tone is smaller due to the lower mean for the
4
2
Stage number is i
truncation
rounding
120
<13,i+1,tc>
BF 1
Noise Pwr
100
<13,i1,tc>
14 bits
<13,i+1,tc>
BF 2
80
Twiddle
factor
60
<13,0,tc> Stage 1
40
<13,2,tc> Stage 3
<13,4,tc>Stage 5 <13,6,tc>
x
radix 2
stage
<14,6,t>
20
Twiddle
factor
0
10
15
Tone index
Fig. 5.
Fig. 3. Theoretical plot of Quantization noise power over tones at the output
of a FFT
Plot of Mean absolute value of error vs tone index
0.4
Truncation
Rounding
0.35
0.3
0.25
0.2
0.15
0.1
0.05
20
40
60
80
100
120
140
Tone Index
Fig. 4.
5
2
Stage number is i
90
16 bits
80
<13,(i+1)/2,tc>
<13,(i1/2),tc>
14 bits
<13,(i+1)/2,tc>
70
BF 2
SQNR (dB)
BF 1
Twiddle
factor
60
50
40
<13,0,tc> Stage 1
<13,1,tc> Stage 3
i=1
i=3
<13,2,tc>Stage 5 <13,3,tc>
x
i=5
8 bits
radix 2
stage
30
<14,4,t>
increasing
bitwidth
20
Twiddle
factor
Fig. 6.
Fig. 8.
0.05
0.1
0.15
0.2
0.25
s
0.3
0.35
0.4
0.45
0.5
0.9
0.8
VIII. A PPENDIX
CDF of SQNR
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0
45
Fig. 7.
50
55
60
SQNR in dB
65
70
75
10log
(s2 + 1)erfc
s2
1
2s
2s
e
2
212
s
22N