3 GOODPUT RESULTS AND
DISCUSSION
In IEEE 802.16e/WiMAX there are 8 possible Mod-
ulation/Coding Schemes (MCS) (IEEE, 2005). See
Table 1. We only consider 7 of them since 64QAM-
1/2 is practically not used (Alpert et al., 2010). In
every MCS there can be various size FEC blocks.
In the following discussion we only consider the
longest ones. We denote the number of bits in the
longest FEC block in every MCS by F. In QPSK-1/2,
16QAM-1/2 and 64QAM5/6 holds F=480. In QPSK-
3/4, 16QAM-3/4, 64QAM-1/2 and 64QAM-3/4 holds
F=432. In 64QAM-2/3 holds F=384. See Table 1
under column F.
The IEEE 802.16e/WiMAX also allows the fol-
lowing Data Blocks’ sizes only : 128, 256, 512, 1024,
2048, 4096 and 8192 bits. Recall that we denote by B
the size of a Data Block.
In Figure 1 we assume three FEC block success
probabilities p: 0.999, 0.99 and 0.9 . In the figure we
show, for the three success probabilities and for all the
possible values of B and F, the maximum PDU Good-
puts. We assume that the PDU contains the GMH and
CRC fields of 6 and 4 bytes respectively, and one sub-
header of 3 bytes which contains the serial numbers of
the Data Blocks. Thus, the total number of the PDU
overhead bits is 104. Notice that every PDU size can
also have remainder bits, which are not used for the
transmission of data. This happens when the PDU
size, minus the overhead bits, is not divided by the
Data Block size. There is a trade-off in determining
the optimal PDU length: on one hand adding another
FEC block to a PDU reduces its success probability.
However, on the other hand, it adds data bits to the
PDU, which contribute to the Goodput. Recall that
the use of fixed size Data Blocks only, results with re-
mainders which reduce the Goodput. Also, especially
for long Data Blocks, their size mandates a minimum
number of FEC blocks in a PDU, in order to accom-
modate at least one Data Block.
We see for p = 0.999 that the Goodputs for all
the possible values of B and F are almost the same,
and very high, due to the high value of p. There is
some reduction in the Goodput for B=8192 because
many FEC blocks are needed to accommodate one
such Data Block, with somewhat low PDU success
probability.
For p = 0.99 and 512 ≤ B ≤ 2048, F=432 is
slightly better than the other two values of F. For
512 ≤ B ≤ 2048 and F=432, the optimal PDU sizes
are all 5 FEC blocks. For F=480 the optimal sizes are
11,11 and 9 FEC blocks respectively, and for F=384
they are 7,11 and 11 respectively. For all the consid-
ered values of B, F=432 has a remainder of 8 bits after
5 FEC blocks, and thus it uses the first 5 FEC blocks
very efficiently. In F=480 the remainders in the short
PDUs are quite large, over 200 bits, and therefore
the optimal PDU size is relatively large compared to
F=432, and the Goodput, therefore, is slightly lower.
For F=384 the addition of one Data Block to the PDU
sometimes requires the addition of two FEC blocks.
On one hand this addition contributes to the Goodput
because there are more data bits. On the other hand
it causes the optimal PDU length to be slightly larger
than for F=432, with a smaller success probability,
and therefore with a small reduction in the Goodput.
In summary, compared to F=480 the case of F=432
is better because of smaller remainders in the short
PDUs. Compared to F=384 it is better because in the
later the PDU size sometimes has ”jumps” in order to
accommodate an additional Data Block.
Notice that for B=4096 and B=8192 the large
number of FEC blocks that is needed to accommo-
date at least one Data Block causes a low PDU suc-
cess probability. This is the dominant parameter and
the FEC blocks’ sizes F and the remainders are less
important. Therefore, the Goodputs are almost the
same for all the values of F.
For p = 0.9 every additional FEC block reduces
the Goodput significantly and therefore, for B=128,
256, 512, 1024 the best F is the one where a low
remainder is received first. For B=128 and F=384
a remainder of 24 bits happens after 2 FEC blocks,
resulting with F=384 having the best Goodput. For
B=256 both F=384 and F=480 have low remainders
after 3 FEC blocks while in F=432 there is a small re-
mainder only after 4 FEC blocks. For B=512, B=1024
and F=384, a low remainder is received after 3 FEC
blocks while for F=432 and F=480 the first three FEC
blocks have a large remainder. Therefore, F=384 has
the highest Goodput. For B=2048, 4096 and 8192 the
large number of FEC blocks that is needed to accom-
modate at least one Data Block makes all the Good-
puts low, with a lower impact to the remainders.
In Figure 2 we compare the Goodput in the case
of a PDU with a Bit stream (Eq.1) to the Goodput of
PDUs with Data Blocks. Figures 2(A),(B) and (C)
show the results for F=480, 432 and 384 respectively.
Since the results are similar in all the cases of F, we
only concentrate in the case of F=480.
We again consider p = 0.999, p = 0.99 and p =
0.9. For p = 0.999 the high FEC success probability
makes the number of FEC blocks in the optimal size
PDUs less dominant. The Goodput in Bit stream is
slightly better than in the case of Data Blocks only
due to the remainders in the later. For B=8192 the
optimal size of a PDU is 35 FEC blocks and it con-
WINSYS2012-InternationalConferenceonWirelessInformationNetworksandSystems
318