Documente Academic
Documente Profesional
Documente Cultură
I. INTRODUCTION
531
and no attempt is made to optimize their design. The dimensions of the time interleavers are 200 b.
B. Receiver
At the receiving end, the signal-detection process involves the
following sequence of operations:
1) Frame initialization: The receiver waits until it finds a sufficiently strong signal to indicate the start of data transmission.
2) Symbol synchronization: The sampled received signal
is cross-correlated with a predefined synchronization
sequence and the condition that results in highest cross
correlation is used to establish symbol synchronization.
The received signal is oversampled with four samples
per symbol period. Binary Barker sequences are used
for synchronization due to their good autocorrelation
properties.
3) Hardware-induced intersymbol interference (ISI) mitigation: The spectrum shaped with an analog low-pass filter
is usually distorted by the radio-frequency front-end of
the transmitter during the transmission process. The ISI
caused by the spectrum shaping and its distortions is mitigated by a precalculated fixed-coefficient FIR filter.
4) Channel estimation: The matrix channel response is estimated by using a mutually orthogonal 16-dimensional
Hadamard sequence transmitted between the parallel antennas for training purpose.
5) Information recovery: The iterative detection and decoding receiver described in Section II is used to recover
the transmitted signals. In this scheme, we separate the
receiver into two stages: soft interference-cancellation
detector and a set of parallel single-inputsingle-output
(SISO) channel decoders. Extrinsic information learned
from one stage is applied to the other stage iteratively
until the receiver converges. These two stages of pro-
532
Fig. 3.
With no channel encoding, 100150 bits were detected incorrectly in each packet; indeed a 100% packet-error rate was occasionally observed. With channel encoding, the number of errors
in each packet is reduced to below 15 and the packet-error rate is
reduced by over 25%. In fact, the packet-error rate is further reduced to 17% at iteration 2. Thereafter, only about 4 packets are
corrupted and among the corrupted packets, only 12 bits are in
error per packet. Even though the frame-error performance has
converged at iteration 3, the appearance and disappearance of
errors are observed between packets, from iteration 3 to 6. However, a packet-error rate of 45% is maintained. For example, at
iteration 3, packets 7, 35, 50, and 75 are in error whereas at iteration 5, packets 15, 35, 50, and 75 are in error.
SignalSpace Diagram: Another measure of convergence of
the iterative receiver is the mean square error (MSE) between the
detected signals and the transmitted constellation points in the
signalspace diagram. Here we consider two examples. First,
we show a packet of data that has converged to zero bit error in
three iterations. The second example shows the appearance and
disappearance of errors from one iteration to the next.
Example 1: Perfect Convergence: In this example, we illustrate a perfect convergence behavior. Fig. 3 displays the softdecoded signals in the signalspace diagram for packet 1. Here
the and axes, respectively, represent the real and imaginary
parts of the 4-QAM signal. Subplot 1 shows the positions of the
200 8 coded bits, whereas subplots 29 show the positions of
the 98 8 decoded bits at iterations 18 of the T-BLAST receiver.
The corresponding MSEs of the detected soft bits are shown
in Fig. 4. A bit error occurs if the MSE exceeds 1. MSE between 0 and 1 means that a bit is classified appropriately but
has a residual error that can propagate through the soft interference-cancellation receiver. Subplot 1 shows the MSE before
decoding. Almost all the bits have residual error and about 30%
are detected incorrectly. The figure illustrates how the test error
Fig. 5.
533
decreases as new iterations are added to the receiver. In particular, all bits have been detected correctly in three iterations.
Example 2: Appearance and Disappearance of Errors: In
this example, we illustrate the appearance and disappearance of
errors from one iteration to the next. Fig. 5 displays the soft decoded signals in the signalspace diagram for packet 2. The corresponding MSEs of the detected soft bits are shown in Fig. 6.
From the figures, we observe the following:
the residual errors do not converge within eight iterations;
all the bit errors are corrected at iteration 3. However, a
single bit error appears in the fourth, sixth, and eighth iterations and disappears during the fifth and seventh iterations, which demonstrates the appearance and disappearance of errors in the course of convergence.
In both examples, little benefit results from increasing the
number of iterations beyond three; thus, it is reasonable to
accept this number as the practical number of iterations in
terms of both error reduction and receiver complexity.
D. Experiments With (8,5)-BLAST
The above tests were repeated with eight transmit and five
receive antennas. Even though the performance decreased from
the previous experiment, good convergence behavior is still observed. Figs. 7 and 8 display the soft-decoded signals in the
signalspace diagram and the corresponding MSEs of the detected soft bits, respectively. In contrast to the previous experiment, five iterations were needed to achieve a perfect convergence. Moreover, this point is also borne out by the bit-error rate
performance, Fig. 9, over 100 packets versus the number of itand 6 plotted using solid traces. Note
erations for both
that the broken traces show the corresponding performances assuming no channel coding.
534
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
, A nonlinear iterative beamforming technique for wireless communications, in 33rd ASILOMAR Conf. Signals, Systems, and Computers, vol. 2, Pacific Grove, CA, Oct. 1999, pp. 957961.
, Turbo-BLAST: A novel technique for multi-transmit multi-receive wireless communications, in Multiaccess, Mobility, and
Teletraffic for Wireless Communications: Kluwer, 2000, vol. 5, pp.
1324.
, A simplified diagonal BLAST architecture with iterative parallelinterference cancellation, in Proc. IEEE Int. Conf. Commun. (ICC), vol.
10, Helsinki, Finland, June 2001, pp. 30673071.
, Turbo-BLAST for wireless communications: Theory and experiments, IEEE Trans. Signal Proc., vol. 50, pp. 25382546, Oct. 2002.
J. G. Foschini, Layered space-time architecture for wireless communication in a fading environment when using multi element antennas,
Bell Labs Tech. J., 1996.
G. D. Golden, J. G. Foschini, R. A. Valenzuela, and P. W. Wolniansky,
Detection algorithm and initial laboratory results using V-BLAST
space-time communication architecture, Electron. Lett., vol. 35, pp.
1415, Jan. 1999.
D. Gesbert, H. Bolcskei, D. Gore, and A. Paulraj, MIMO wireless channels: Capacity and performance prediction, Proc. IEEE Globecom02,
vol. 1, pp. 10831087, Nov. 2000.
C. Berrou, A. Glavieux, and P. Thitmajshima, Near Shannon limit
error-correcting coding and decoding: Turbo codes, in Proc. Int. Conf.
Commun., Geneva, Switzerland, May 1993, pp. 10641070.
J. Hagenauer, The turbo principle: Tutorial introduction and state of the
art, in Int. Symp. Turbo Codes, Best, France, Sept. 1997.
X. Wang and V. Poor, Iterative (Turbo) soft interference cancellation
and decoding for coded CDMA, IEEE Trans. Commun., vol. 47, pp.
10461061, July 1999.
K. M. Chugg, A. Anaastasopoulos, and X. Chen, Iterative Detection:
Adaptivity, Complexity Reduction and Application: Kluwer, 2001.
M. Tuchler, R. Koetter, and A. C. Singer, Turbo equalization: Principles
and new results, IEEE Trans. Commun., vol. 50, pp. 754767, May
2002.
H. Zheng and D. Samardzija, Performance evaluation of indoor wireless video system using BLAST test-bed, in The 35th Annu. Conf. Inform. Sciences Syst., Baltimore, MD, Mar. 2001.
535