IEEE
Std 802.11a-1999 SUPPLEMENT TO IEEE STANDARD FOR INFORMATION TECHNOLOGY—
8
Copyright © 1999 IEEE. All rights reserved.
b) Produce the PLCP header field from the RATE, LENGTH, and SERVICE fields of the TXVECTOR
by filling the appropriate bit fields. The RATE and LENGTH fields of the PLCP header are encoded
by a convolutional code at a rate of R = 1/2, and are subsequently mapped onto a single BPSK
encoded OFDM symbol, denoted as the SIGNAL symbol. In order to facilitate a reliable and timely
detection of the RATE and LENGTH fields, 6 “zero” tail bits are inserted into the PLCP header. The
encoding of the SIGNAL field into an OFDM symbol follows the same steps for convolutional
encoding, interleaving, BPSK modulation, pilot insertion, Fourier transform, and prepending a GI as
described subsequently for data transmission at 6 Mbit/s. The contents of the SIGNAL field are not
scrambled. Refer to 17.3.4 for details.
c) Calculate from RATE field of the TXVECTOR the number of data bits per OFDM symbol (N
DBPS
),
the coding rate (R), the number of bits in each OFDM subcarrier (N
BPSC
), and the number of coded
bits per OFDM symbol (N
CBPS
). Refer to 17.3.2.2 for details.
d) Append the PSDU to the SERVICE field of the TXVECTOR. Extend the resulting bit string with
“zero” bits (at least 6 bits) so that the resulting length will be a multiple of N
DBPS
. The resulting bit
string constitutes the DATA part of the packet. Refer to 17.3.5.4 for details.
e) Initiate the scrambler with a pseudorandom non-zero seed, generate a scrambling sequence, and
XOR it with the extended string of data bits. Refer to 17.3.5.4 for details.
f) Replace the six scrambled “zero” bits following the “data” with six nonscrambled “zero” bits.
(Those bits return the convolutional encoder to the “zero state” and are denoted as “tail bits.”) Refer
to 17.3.5.2 for details.
g) Encode the extended, scrambled data string with a convolutional encoder (R = 1/2). Omit (puncture)
some of the encoder output string (chosen according to “puncturing pattern”) to reach the desired
“coding rate.” Refer to 17.3.5.5 for details.
h) Divide the encoded bit string into groups of N
CBPS
bits. Within each group, perform an “interleav-
ing” (reordering) of the bits according to a rule corresponding to the desired RATE. Refer to 17.3.5.6
for details.
i) Divide the resulting coded and interleaved data string into groups of N
CBPS
bits. For each of the bit
groups, convert the bit group into a complex number according to the modulation encoding tables.
Refer to 17.3.5.7 for details.
j) Divide the complex number string into groups of 48 complex numbers. Each such group will be
associated with one OFDM symbol. In each group, the complex numbers will be numbered 0 to 47
and mapped hereafter into OFDM subcarriers numbered –26 to –22, –20 to –8, –6 to –1, 1 to 6,
8 to 20, and 22 to 26. The subcarriers –21, –7, 7, and 21 are skipped and, subsequently, used for
inserting pilot subcarriers. The “0” subcarrier, associated with center frequency, is omitted and filled
with zero value. Refer to 17.3.5.9 for details.
k) Four subcarriers are inserted as pilots into positions –21, –7, 7, and 21. The total number of the sub-
carriers is 52 (48 + 4). Refer to 17.3.5.8 for details.
l) For each group of subcarriers –26 to 26, convert the subcarriers to time domain using inverse Fourier
transform. Prepend to the Fourier-transformed waveform a circular extension of itself thus forming a
GI, and truncate the resulting periodic waveform to a single OFDM symbol length by applying time
domain windowing. Refer to 17.3.5.9 for details.
m) Append the OFDM symbols one after another, starting after the SIGNAL symbol describing the
RATE and LENGTH. Refer to 17.3.5.9 for details.
n) Up-convert the resulting “complex baseband” waveform to an RF frequency according to the center
frequency of the desired channel and transmit. Refer to 17.3.2.4 and 17.3.8.1 for details.
An illustration of the transmitted frame and its parts appears in Figure 110 of 17.3.3.
Authorized licensed use limited to: XIDIAN UNIVERSITY. Downloaded on March 22, 2009 at 23:41 from IEEE Xplore. Restrictions apply.