628 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 61, NO.

2, FEBRUARY 2013
Successive Interference Cancellation via
Rank-Reduced Maximum A Posteriori Detection
Hyukjoon Kwon, Member, IEEE, Jungwon Lee, Senior Member, IEEE, and Inyup Kang, Member, IEEE
AbstractThis paper proposes a codeword-based iterative
detection and decoding (IDD) algorithm for multiple-input
multiple-output (MIMO) systems. In the proposed algorithm,
multiple streams in a codeword are jointly detected at the rank-
reduced (RR) maximum a posteriori (MAP) receiver and inter-
stream interference is mitigated with successive interference can-
celation (SIC). Thus, the algorithm is abbreviated to RR-MAP-
SIC. Recent wireless standards such as Long-Term Evolution
require the system to encode data bits per codeword, not per
stream. As a result, conventional SIC algorithms could lose joint
information among streams in a codeword because different
streams of the same codeword are treated as interference. In-
stead, the proposed RR-MAP-SIC minimizes the loss of joint in-
formation by using the rank-reduced MAP detector. In addition,
this paper compares the detector complexity of RR-MAP-SIC
and investigates how the probability of symbol error is changed
in terms of the covariance of the residual interference. As the
number of iterations increases, the covariance is reduced so that
the error events also decrease. Lastly, the extrinsic information
transfer (EXIT) chart is used to analyze the performance of
RR-MAP-SIC. Simulation results demonstrate the superiority of
RR-MAP-SIC over the conventional algorithm and numerically
verify the EXIT chart analysis.
Index TermsMIMO, SIC, IDD, MAP, rank-reduced, LTE.
I. INTRODUCTION
T
HERE has been great interest in multiple-input multiple-
output (MIMO) systems ever since the capacity of wire-
less channels was revealed to signicantly increase over the
benet of spatial diversity gain [1]. In order to achieve such
a potential gain, a variety of space-time schemes for practical
standards such as 3GPP Long Term Evolution (LTE) have
been proposed. For example, [2] reforms channels to be
orthogonal and [3] uses the orthogonal structure of space-
time block codes to maximize the diversity order. Besides,
[4] designs an architecture for offering spatial multiplexing
over multiple antennas, called Bell Lab layered space-time
(BLAST). In [5], the vertical BLAST (V-BLAST) scheme
is introduced to successively eliminate interference so as to
enhance the detection capability. This detection algorithm
implicitly assumes that each stream is independently coded
and the iterative stream-by-stream detection is available at the
receiver.
Paper approved by M. Matthaiou, the Editor for MIMO Systems and
Performance Analysis of the IEEE Communications Society. Manuscript
received March 3, 2012; revised August 17 and October 15, 2012.
The authors are with the Mobile Solutions Lab, Samsung US
R&D Center, San Diego, CA, 92121, U.S.A. (e-mail: {hyukjoon, jung-
won}@alumni.stanford.edu, inyup.kang@samsung.com).
The material in this paper was presented in part to the IEEE 76th Vehicular
Technology Conference, Quebec City, Canada, Sept. 2012
Digital Object Identier 10.1109/TCOMM.2012.122112.120165
These space-time detection schemes are combined with
the channel coding schemes to achieve the channel capacity
promised by the MIMO technology. The combined scheme
evolves to exploit the iterative detection and decoding (IDD)
structure by exchanging soft information between the MIMO
detector and the channel decoder [6]. Such an iterative decod-
ing process operates on a turbo principle that is very effective
and computationally efcient although it is not strictly proved
as optimal [7]. The soft information can be measured by the ra-
tio of bit probabilities called the maximum a posteriori (MAP)
or a posteriori probability (APP) that is usually expressed as
L-values, i.e., log-likelihood ratio (LLR) values [8]. Under the
iterative algorithm, the detector directly calculates a posteriori
LLRs by using a priori LLRs. Then, the extrinsic LLRs are
generated by subtracting a priori LLRs from a posteriori
LLRs and they are delivered to the decoder. Recursively, the
decoder also generates its own extrinsic LLRs and feeds them
back to the detector as a form of a priori LLRs. This iterative
process continues until the desired performance is achieved.
Using the IDD structure, various MIMO detectors have been
extensively researched with the objective of achieving high
throughput with less computational burden. In [9], the MAP
detector directly computes a posteriori LLRs for space-time
bit-interleaved coded modulation (STBICM) systems. [10]
extends the scheme to be applicable to orthogonal frequency-
division multiplexing (OFDM) systems. Although the full-
dimensional MAP detector achieves the optimal performance,
it has a drawback that its complexity grows exponentially with
the number of transmit antennas and the order of modulation.
In order to reduce the complexity, [11] modies the sphere
decoding technique originally proposed in [12] such that only
a list of candidates are provided at the detector. Moreover,
[13] thoroughly studies the less computational detector using a
linear minimum mean square error (MMSE) with a posteriori
information. The asymptotic behavior of the MMSE detector
at the iterative receiver has been analyzed along with many
techniques such as belief propagation (BP) and density evolu-
tion (DE) in [14][16]. These message-passing techniques are
extended to jointly estimate channel and decode signals in an
iterative manner [17], [18]. Recently, the iterative receiver is
explored with soft feedback based on a priori LLRs or irreg-
ular convolutional codes [19][22]. In addition, [23] shows
that STBICM achieves full diversity with an IDD receiver,
and a decision-feedback algorithm is developed to mitigate
the error propagation in V-BLAST systems [24] and at the
MMSE detector [25]. Since the V-BLAST detector pioneers
the algorithm of successively canceling interference, most of
these detectors have been developed under the assumption that
0090-6778/13$25.00 c 2013 IEEE
KWON et al.: SUCCESSIVE INTERFERENCE CANCELLATION VIA RANK-REDUCED MAXIMUM A POSTERIORI DETECTION 629
all streams are separable as well as distinctly coded. Thus, it
is considered that the decoded information for a single stream
could be recycled for other undecoded streams.
However, the recent LTE standard [26] is determined to sup-
port codeword-based coded signals rather than stream-based
coded signals. With the motivation from practical needs, this
paper proposes a codeword-based successive interference can-
cellation (SIC) scheme using a rank-reduced (RR) maximum
a posteriori (MAP) detector. In this paper, an ML detector
is equivalently considered as a MAP detector having zero a
priori information. Thus, the proposed iterative algorithm is
generally called RR-MAP-SIC, although an ML detector is
used at the rst iteration. These rank-reduced techniques have
been mostly researched for designing lter coefcients at the
receiver [27]. In [28], multistage Wiener lter (MSWF) is
applied to suppress interference, which is extended to MIMO
systems in [29]. Also, these rank-reduced algorithms for the
lter design are advanced with iterative interpolation and least-
squares methods [30], [31]. On the contrary, this paper applies
the rank-reduced technique to the MAP detector in order to
minimize the loss of joint information among streams in a
codeword as well as to reduce the computational burden. In
particular, [32] exploits a simple slicer block that uses a pri-
ori information for adjusting the decision boundary between
symbols on the constellation and shows that the dimension
reduction technique suffers only negligible performance loss.
RR-MAP-SIC can be incorporated with this slicer block for
reducing the computational complexity at the detector in
which interference is canceled with soft information.
This paper compares the computational burden of RR-MAP-
SIC with MMSE-SIC and full-dimensional ML in terms of the
number of Euclidean distance (ED) calculations. Intuitively,
full-dimensional ML requires a large number of ED calcula-
tions. On the other hand, MMSE-SIC reduces the number of
ED calculations by converting a MIMO channel into multiple
single-input single-output (SISO) channels. This paper shows
that RR-MAP-SIC with two streams per codeword has the
same complexity as MMSE-SIC in terms of the leading order.
This paper also analyzes the probability of symbol error at
the detector, which is changed with the covariance of the
residual interference. As the number of iterations increases, it
is expected that the residual interference is reduced so that its
covariance becomes smaller. Accordingly, the performance of
RR-MAP-SIC is enhanced by the amount of the improved co-
variance. Lastly, the iterative processing used for the proposed
algorithm is analyzed with the extrinsic information transfer
(EXIT) chart technique [33][35]. The EXIT chart reveals how
reliable the proposed algorithm is given the code rate in terms
of the mutual information.
The main contributions of this paper are summarized as
follows. This paper
proposes a codeword-based rank-reduced MAP detector
using SIC and showed its superiority over conventional
algorithms.
provides a comparison in terms of the complexity of RR-
MAP-SIC and showed its feasibility in practice.
analyzes the performance in terms of the probability of
symbol error and the EXIT chart.
This paper is organized as follows: Sec. II describes the
system architecture of both transmitter and receiver. Sec. III
depicts the LLR ow exchanged between the detector and
decoder. In Sec. IV, MMSE-SIC is reviewed and RR-MAP-
SIC is proposed. Sec. V analyzes RR-MAP-SIC with its com-
plexity and performance. Sec. VI evaluates the performance
with the packet error rates and shows how the cumulative
distribution function (CDF) of LLRs is changed as the number
of iterations increases. The conclusion follows in Sec. VII.
II. SYSTEM MODEL
This paper considers a point-to-point MIMO channel where
a transmitter and a receiver are equipped with N
t
and N
r
antennas, respectively. Fig. 1 shows a block diagram of the
transmitter in which the sequence of data bits is encoded per
codeword. Thus, N
c
codewords can be encoded by using the
encoder N
c
times. Subsequently, the coded bits are permuted
with random interleaving patterns. The permuted sequence
would be statistically independent if large interleaving patterns
are used. The coded sequence is modulated on the quadrature
amplitude modulation (QAM) constellation and is distributed
to each subcarrier. In parallel, the modulated symbols are
divided into N
s
streams and then transmitted with MIMO
precoding matrices. For simplicity, this paper assumes that
the number of streams is the same as the number of transmit
antennas, i.e., N
s
= N
t
. When no precoding is applied, each
stream is directly mapped to the transmit antenna so that the
precoding matrix would be an identity matrix, I
Ns
.
The received signal at the ith subcarrier y
i
is given by
y
i
= H
i
s
i
+n
i
(1)
where H
i
and s
i
are the complex channel matrix and the trans-
mitted symbol vector, respectively. The channel is assumed to
be quasi-static, consisting of independent fading blocks. The
noise vector n
i
follows a complex Gaussian distribution with
zero mean and an identity covariance matrix I
Nr
. Using an
OFDM scheme, each subcarrier is assumed to be independent
of other subcarriers such that the subcarrier index i is omitted
in the following. In detail, Fig. 2 depicts a block diagram
of the receiver where each codeword is successively detected
and decoded. Since a mobile station in wireless channels is
limited to its small size and nite operating power, this paper
restricts to install a single detector and a single decoder. Thus,
parallel interference cancellation (PIC) is not considered.
In the SIC algorithm, the codeword index is updated after
successively decoding a codeword. Although N
c
= 2 is used
in the following section, it can be generalized with multiple
codewords, N
c
> 2
III. SUCCESSIVE INTERFERENCE CANCELATION
This section describes the process of successive interfer-
ence cancellation using soft information. Simply, the MIMO
detector receives a priori LLRs as an input and generates a
posteriori LLRs as an output. A priori LLR of the coded bit
c
n,m
, corresponding to the mth bit of the nth symbol in s, is
dened as
L
(a,1)
n,m
= log
P(b
n,m
= +1)
P(b
n,m
= 1)
(2)
630 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 61, NO. 2, FEBRUARY 2013
Encoder Modulator
Data
Bits
Interleaved
Coded Bits
Transmit
Symbols
Transmit Symbol
Vectors
Precoded Transmit
Signal Vectors
Ns Streams
Nt Antennas
Inter-
leaver
Coded
Bits
Serial to
Parallel
Symbol-to-
Symbol-
Vector
Mapping
Subcarriers
MIMO
Precoding
Nc Codewords
Fig. 1. A block diagram of the transmitter architecture.
-
Deinterleaver
Interleaver
Hard Decision
Binary Bits
Received Signal Vectors
MIMO
Detector
+

-1

Channel
Decoder
+
-
y = y H s
avg

y
L
(A,1)
cw(i)
L
(a,1)
cw(i)
L
(ext,1)
cw(i)
L
(ext,2)
cw(i)
L
(A,2)
cw(i)
L
(a,2)
cw(i)
L
(A,2)
cw(i)
Interference
Cancelation
Change CW
index
Fig. 2. A block diagram of the receiver architecture.
where the superscript 1 denotes that this LLR is associated
with the detector. Given the received signal y, the MIMO
detector generates a posteriori LLR corresponding to the same
bit as a priori LLR,
L
(A,1)
n,m
= log
P(b
n,m
= +1|y)
P(b
n,m
= 1|y)
. (3)
so the the conditional probability P(b
n,m
= +1|y) is equiva-
lently expressed with a posteriori LLRs as
P(b
n,m
= +1|y) =
e
L
(A,1)
n,m
/2
e
L
(A,1)
n,m
/2
+ e
L
(A,1)
n,m
/2
. (4)
As removing the dependency of a priori LLR from a poste-
riori LLR, the extrinsic LLR is calculated as
L
(ext,1)
n,m
= L
(A,1)
n,m
L
(a,1)
n,m
(5)
and it is deinterleaved to become a priori LLR for the channel
decoder L
(a,2)
n,m
, i.e.,
L
(a,2)
n,m
=
1
_
L
(ext,1)
n,m
_
. (6)
where indicates an interleaving function. Thus,
1
is a
deinterleaving function to reverse the interleaved bit sequence.
The superscript 2 implies that this LLR is dened for the
decoder. Using the same subscript (n, m) as L
(ext,1)
n,m
, this a
priori LLR for the channel decoder corresponds to the mth
bit of the nth symbol in s at the MIMO detector. Also, the
channel decoder generates its own a posteriori LLR, L
(A,2)
n,m
,
and consequently the extrinsic LLR is also calculated as
L
(ext,2)
n,m
= L
(A,2)
n,m
L
(a,2)
n,m
(7)
which is delivered back to the detector as an a priori LLR,
L
(a,1)
n,m
= (L
(ext,2)
n,m
). (8)
Simultaneously, a posteriori LLR of the decoder, L
(A,2)
n,m
, is
used to construct the soft estimate of transmit symbols that
are subtracted for detecting the next codeword as shown in
Fig. 2. The iterative process continues until the pre-determined
criteria are satised.
IV. DETECTION ALGORITHM
This section reviews the existing iterative scheme, MMSE-
SIC, and introduces the proposed rank-reduced (RR) MAP-
SIC scheme. Since non-iterative schemes such as full-
dimensional ML and near-ML are well explained in many
references [36], they are not reviewed again. Instead, the
iterative schemes are focused on by describing how to use
soft information. First of all, using a posteriori information,
the nth element of the soft estimate s of s can be calculated
as
s
n
= E
_
s
n
|L
(A,2)
n,1:M
_
(9)
=

s
k
C
s
k
M

m=1
1
2
_
1 + c
k,m
tanh
_
L
(A,2)
n,m
2
__
(10)
where M is the modulation order and L
(A,2)
n,1:M
is a posteriori
LLR vector of the nth symbol of s. C refers to a set of symbols
on the QAM constellation and c
k,m
is the bipolar bit (1)
corresponding to the symbol point s
k
on the constellation [19].
Suppose that codeword j(= 1 or 2) is decoded. Then, the
received signal for codeword i(= j) is expressed as
y
cw
i
= y H
cw
j
s
(A,2)
cwj
(11)
= H
cw
i
s
cw
i
+H
cw
j
_
s
cw
j
s
(A,2)
cwj
_
+n (12)
where H
cwi
and s
cwi
are a set of the column vectors of H and
a subset vector of s, corresponding to codeword i, respectively.
Thus, s consists of s
(A,2)
cw1
and s
(A,2)
cw2
both of which are dened
as the estimated codewords with soft information. Since a
posteriori LLRs are initialized with zero, (12) is the same as
(1) at the beginning of the iteration. Given the receive signal
KWON et al.: SUCCESSIVE INTERFERENCE CANCELLATION VIA RANK-REDUCED MAXIMUM A POSTERIORI DETECTION 631
for codeword i, y
cw
i
, the following subsections explain how
to generate the extrinsic information at the detector.
A. Review of MMSE-SIC
Compared with full-dimensional ML, the MMSE detector is
suboptimal, but requiring much less complexity. In short, the
MMSE detector nullies interference so as to separate each
stream. Then, the maximum ratio combining (MRC) technique
is applied to maximize the signal strength at the stream [37].
Suppose that the nth stream of s is detected. n is the stream
index belonging to codeword i, which is dened as n cw
i
.
The MMSE ltering vector for the nth stream is dened as
w
n
=
_
HQ
n
H

+I
Nr
_
1
h
n
(13)
where Q
n
and h
n
are the covariance matrix of the residual
interference plus noise and the nth column vector of H,
respectively. The diagonal matrix Q
n
consists of sub-diagonal
matrices Q
cw
i
for codeword i as
Q
n
=
_
Q
cw
i
0
0 Q
cw
j
_
(14)
and its kth diagonal element is derived as
Q
n
(k, k) =
_
1 k cw
i
E
_
|s
k
|
2
| L
(A,2)
k,1:M
_
| s
k
|
2
otherwise.
(15)
When codeword i is detected, codeword j is assumed to
have already generated its a posteriori LLRs. Thus, Q
cw
j
is
calculated accordingly. As the number of iterations increases,
the LLRs are updated so that the covariance matrix is also
updated. Similar to (10), the 2nd order soft estimate can be
calculated in the same manner. Then, the estimated symbol s
n
of s
n
is obtained by ltering y
cwi
with the MMSE vector w
n
as
s
n
= w

n
y
cw
i
= w

n
h
n
s
n
+

kcwi,k=n
w

n
h
k
s
k
+w

n
H
cw
j
_
s
cw
j
s
(A,2)
cwj
_
+w

n
n
=
n
s
n
+
n
(16)
where

n
= w

n
h
n
(17)

n
= w

n
_
_

icwi,i=n
h
i
s
i
+H
cw
j
_
s
cw
j
s
(A,2)
cwj
_
+n
_
_
.
As a result, (16) becomes a SISO channel for s
n
where
the channel gain is
n
and the noise is
n
. In [38], it is
revealed that the residual interference plus noise can be well
approximated by a Gaussian random variable whose variance

2
n
is given by

2
n
= w

n
_
HQ
n
H

+I
Nr
h
n
h

n
_
w
n
. (18)
Now, N
s
/N
c
SISO channels that belong to codeword i are
ready to generate their a posteriori LLRs. As described in
(3), a posteriori LLR for the mth bit of the nth estimated
symbol is calculated as
L
(A,1)
n,m
= log
P (b
n,m
= +1| s
n
)
P (b
n,m
= 1| s
n
)
(19)
= log

bnB
+1
n,m
P ( s
n
|b
n
) exp
_
1
2
b

n
L
(a,1)
n,1:M
_

bnB
1
n,m
P ( s
n
|b
n
) exp
_
1
2
b

n
L
(a,1)
n,1:M
_ (20)
(a)
max

+1
m
,bnB
+1
n,m
_

1

2
n
| s
n

n
|
2
+
1
2
b

n
L
(a,1)
n,1:M
_
max

1
m
,bnB
1
n,m
_

1

2
n
| s
n

n
|
2
+
1
2
b

n
L
(a,1)
n,1:M
_
(21)
where (a) holds the max-log approximation, log

i
expx
i

max
i
x
i
, for reducing the computational complexity. and b
n
are the scalar symbol and the bit vector corresponding to the
nth element of s, respectively. In (21), both and b
n
are given
with the condition that the mth bit is b, and selected from the
set of transmit symbols and bits,
b
m
and B
b
n,m
, dened as
B
b
n,m
= {b
n
| b
n,m
= b} (22)

b
m
= {s
k
| b
k,m
= b, k}. (23)
The extrinsic LLR is derived by subtracting a priori LLR as
in (5) and it is delivered to the channel decoder after being
interleaved.
B. Proposed Rank-Reduced MAP-SIC
This subsection proposes an alternative SIC algorithm to use
a rank-reduced MAP detector (RR-MAP-SIC). The MMSE de-
tector transforms a single MIMO channel into multiple SISO
channels by treating different streams in the same codeword
as interference. Although this alteration reduces the detector
complexity, it also becomes a factor to lose joint information
among multiple streams in a codeword. Instead, RR-MAP-SIC
jointly detects those streams in the codeword so as to minimize
the loss of joint information. Furthermore, [32] reveals that
the MAP detector complexity can be reduced in terms of the
number of ED calculations by adjusting the decision boundary
between symbols on the QAM constellation. In particular,
when the number of streams per codeword is 2, the number
of ED calculations for MAP is the same as for MMSE.
The proposed RR-MAP-SIC whitens the residual interfer-
ence plus noise in (12), which enables to calculate a posteriori
LLRs with a form of ED. The whitening matrix for codeword
i is given by
W
cwi
=
_
H
cwj
Q
cwj
H

cwj
+I
Nr
_
1/2
, (24)
the Hermitian of which is multiplied by y
cw
i
for converting
(12) to a point-to-point channel with white noise. Then, the
ltered symbol vector s
cwi
of s
cwi
is derived as
s
cw
i
= W

cwi
y
cw
i
= W

cwi
H
cw
i
s
cw
i
+W

cwi
H
cw
j
(s
cw
j
s
(A,2)
cwj
)
+W

cwi
n
cw
i
=
cw
i
s
cw
i
+
cw
i
(25)
632 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 61, NO. 2, FEBRUARY 2013
where the channel gain matrix
cw
i
and the whitened noise

cw
i
for codeword i are expressed as

cw
i
= W

cwi
H
cw
i
(26)

cw
i
= W

cwi
_
H
cw
j
(s
cw
j
s
(A,2)
cwj
) +n
cw
i
_
. (27)
The MIMO channel in (25) can be directly applied to the MAP
detector. Since the symbol vector for codeword i, s
cw
i
, is a
vector of the length N
s
/N
c
, it does not need full-dimensional
MAP but the rank-reduced MAP. Then, a posteriori LLR for
the mth bit of the nth symbol where n cw
i
is derived as
L
(A,1)
n,m
= log
P (b
n,m
= +1|s
cwi
)
P (b
n,m
= 1|s
cw
i
)
(28)
= log

bnB
+1
n,m
P (s
cw
i
|b
n
) exp
_
1
2
b

n
L
(a,1)
n,1:M
_

bnB
1
n,m
P (s
cwi
|b
n
) exp
_
1
2
b

n
L
(a,1)
n,1:M
_ (29)
= log

sS
+1
n,m
,bnB
+1
n,m
exp
_
D
s
+L
(a,1)
_
log

sS
1
n,m
,bnB
1
n,m
exp
_
D
s
+L
(a,1)
_
(30)
(b)
max
sS
+1
n,m
,bnB
+1
n,m
_
D
s
+L
(a,1)
_
max
sS
1
n,m
,bnB
1
n,m
_
D
s
+L
(a,1)
_
(31)
where (b) also holds the max-log approximation as (a). Given
a priori information for codeword i, (30) is expressed with
the Euclidean distance D
x
and the bit scalar L
(a,1)
, which are
dened as
D
s
= s
cwi

cwi
s
2
(32)
L
(a,1)
=
1
2
b

n
L
(a,1)
n,1:M
. (33)
In addition, S
b
n,m
refers to a set of symbol vectors where the
mth bit of the nth symbol is equal to b, which is given by
S
b
n,m
= {s | b
n,m
= b}. (34)
Likewise, the extrinsic LLR is calculated and passed to the
channel decoder as explained in Sec. IV-A.
V. PERFORMANCE ANALYSIS
This section compares the complexity of RR-MAP-SIC with
MMSE-SIC and full-dimensional ML in terms of the number
of ED calculations. Also, the performance of RR-MAP-SIC
is analyzed for showing how the probability of symbol error
is changed with the covariance of the residual interference.
Lastly, the EXIT chart is provided to compare both RR-MAP-
SIC and MMSE-SIC.
A. Complexity Comparison
Table I tabulates the number of ED calculations that each
algorithm requires to generate a posteriori LLR per transmit
symbol vector. The hardware complexity depends on many
factors such as the number of adders and multipliers at the
circuit level, and the design structure to compute in parallel or
in serial. Among them, this subsection focuses on the number
TABLE I
NUMBER OF EUCLIDEAN DISTANCE CALCULATIONS
Detector Complexity
Full-ML 2
MNs
MMSE-SIC Ns2
M
RR-MAP-SIC Nc2
M

Ns
Nc
1

+1
of ED calculations because it is a main factor to determine
the computational complexity at the algorithm level.
For full-dimensional ML abbreviated as Full-ML, the com-
plexity grows exponentially as the number of transmit streams
increases. On the other hand, MMSE-SIC increases the com-
plexity linearly in terms of the number of transmit streams.
Since MMSE-SIC separates streams by using the MMSE
ltering vector in (13), the complexity can be much reduced
at a large number of streams.
Regarding the proposed RR-MAP-SIC, the exponent at the
number of ED calculations is reduced from N
s
to N
s
/N
c
because the detection occurs per codeword. Using a slicer
block in [32], the exponent can be additionally reduced by
1 due to the fact that the last stream does not have to be
detected. Instead, the symbol vector is detected once more to
calculate the LLR of the last stream.
Suppose that N
t
= N
s
= 4 and N
c
= 2 with 16 QAM
are used. In this scenario, Full-ML and MMSE-SIC requires
16
4
= 65536 and 4 16 = 64 ED calculations, respectively.
RR-MAP-SIC needs 2 32 = 64 ED calculations which is
the same as MMSE-SIC. The complexity can vary according
to simulation scenarios. However, this section shows that the
proposed RR-MAP-SIC is a practical alternative.
B. Symbol Error Probability
This subsection analyzes RR-MAP-SIC in terms of the
probability of symbol error given the xed coding gain. As the
number of iterations increases, both codewords are decoded
successively so that their a posteriori LLRs are updated. As
a result, symbol points on the constellation are assigned with
asymmetric probabilities that cause to decrease the covariance
of the residual interference. This subsection shows how the
error probability is changed and how much the SNR gain is
achieved in terms of this covariance value.
For ease of analysis, the number of streams is limited to 2.
Although multiple streams are available, the error probability
would be much complicated in MIMO channels with more
than 2 streams. Under the simplied condition, (1) can be
rewritten as
y = Hs +n (35)
= h
1
s
1
+h
2
s
2
+n (36)
where s
i
C is the ith symbol of s and i = 1, 2. For detecting
the 1st symbol s
1
, (25) is directly converted to
s
1
=
1
s
1
+
1
(37)
where
1
and
1
are complex channel gain and whitened
noise. Both N
r
1 vectors are calculated from (26) and
(27), respectively. Then, the error probability of QAM sym-
bols is determined by comparing the joint probability of s
1
KWON et al.: SUCCESSIVE INTERFERENCE CANCELLATION VIA RANK-REDUCED MAXIMUM A POSTERIORI DETECTION 633
and the kth point, s
(k)
1
, on the QAM constellation where
k = 1, . . . , 2
M
. The decision rule to determine the ith QAM
symbol over the jth QAM symbol is
P
s
_
s
(i)
1
_
P
s|s
_
s
1
| s
(i)
1
_
P
s
_
s
(j)
1
_
P
s|s
_
s
1
| s
(j)
1
_
(38)
for all j = i. The probability condition in (38) is equivalently
rewritten with the argmin condition as
s
1
= arg min
i
_
_
_
_s
1

1
s
(i)
1
_
_
_
2
2 log P
s
_
s
(i)
1
_
_
. (39)
where s
1
is the estimated symbol for s
1
, minimizing the MAP
metric in (39). Consequently, the probability of symbol error
is calculated as
P
e
=
2
M

i
P
s
_
s
(i)
1
_
P
s|s
_
s
1
= s
(i)
1
| s
(i)
1
_
. (40)
When symbol points would be equally distributed on the QAM
constellation, the probability of symbol error in (40) is upper-
bounded by the average number of nearest neighbors and the
Q function [39]
P
e
4
_
1
1
2
M/2
_
Q
_
d
min

2
_
(41)
where d
min
is the minimum distance between two symbols on
the QAM constellation. As the number of iterations increases,
a posteriori LLRs are updated and accordingly bit proba-
bilities are updated from (4). Then, the symbol probability,
P
s
(s
(i)
1
), are also dramatically asymmetric. In this circum-
stance, the conditional probability in (40) is approximated to
P
s|s
_
s
1
= s
(i)
i
| s
(i)
1
_
P
s|s
_
s
1
= s
(j)
1
| s
(i)
1
_
, j (42)
= Q
_
d
min

2
+
ij
_
(43)
where the jth symbol s
(j)
1
is the nearest neighbor of s
(i)
1
. The
additional argument to d
min

1
/

2 inside the Q function is

ij
=

2
d
min

_
log P
s
_
s
(i)
1
_
log P
s
_
s
(j)
1
__
(44)
which is derived in Appendix A. Given a large number of
iterations, the asymmetry of symbol probabilities becomes so
strong that it is enough to consider only the nearest neighbor
symbol in (40).
Fig. 3 shows the probability of symbol error in (40) with 4
QAM, which is calculated with different symbol probability
distribution. The covariance of the residual interference varies
according to the probability distribution. As the number of
iterations increases, the covariance is quickly reduced from 1
to 0. Since the code rate is maintained, the slope of symbol
error rates is not changed. Instead, the SNR gain is clearly
observed. Sec. VI will show the performance of RR-MAP-
SIC with the coding gain and the soft information.
C. EXIT Chart
This subsection demonstrates the superiority of RR-MAP-
SIC over MMSE-SIC by using the EXIT chart. Both iterative
schemes exchange information between the detector and the
decoder as a form of extrinsic LLRs. In order to track the
0 5 10 15 20 25
10
4
10
3
10
2
10
1
10
0
4 QAM
SNR (dB)
A
n
a
l
y
t
i
c
a
l

S
y
m
b
o
l

E
r
r
o
r

R
a
t
e

(
S
E
R
)

w
i
t
h

H
a
r
d

D
e
c
i
s
i
o
n


Cov 1.0000
Cov 0.1900
Cov 0.0199
Cov 0.0020
Fig. 3. The probabilities of symbol error in (40) are plotted in terms of the
covariance of residual interference.
information ow, many theoretical methods are proposed such
as the pairwise error probability (PEP) [40] or the BP message-
passing algorithm based on factor graph [41]. However, these
approaches are very complex because two-way paths, from the
detector to the decoder and vice versa, should be simultane-
ously investigated for determining the error events.
Alternatively, the EXIT chart is a versatile tool for ana-
lyzing such an iterative scheme between the detector and the
decoder. This method divides them into two separate blocks
and investigates each block to reveal the relation between the
input and the output based on mutual information. These input
and output correspond to a priori and a posteriori LLRs in
two SIC algorithms. Under the assumption that both LLRs are
(de)interleaved so as to be independent of neighbor LLRs, the
EXIT chart describes the ow of extrinsic information given a
priori LLRs for the detecting codeword and a posteriori LLRs
for the detected codeword. Also, the trajectory on the EXIT
chart can visualize the ow of extrinsic information with the
number of iterations.
Fundamentally, the EXIT chart works as follows. Given the
general channel model y = hx + n where h, x and n are
the channel gain, the input signal and the noise, respectively,
the extrinsic information is derived, which becomes a priori
information of the next block. Under the assumption that this
a priori sequence follows a Gaussian distribution, the mutual
information is calculated as I
L
(a) = I
_
X; L
(a)
_
. After taking
a priori information as an input, the output is generated at
the detector or the decoder, which is a posteriori information.
Sequentially, it is transformed into the extrinsic LLR and its
mutual information is calculated as I
L
(ext) = I
_
X; L
(ext)
_
. In
detail, [33][35] introduces how to draw the EXIT chart and
how to calculate the mutual information.
Fig. 4 shows the EXIT charts of RR-MAP-SIC and MMSE-
SIC with 4 and 16 QAM. The extrinsic curves of the de-
tector are combined with the inverted extrinsic curves of
the decoder. From the top, the inverted curves correspond
to 4 rates, 0.83, 0.75, 0.50 and 0.33, of a turbo code with
4 inner iterations at the decoder. At the SNR 2 dB with
4 QAM, the detector curves of MMSE-SIC is overlapped
with the decoder curve with the code rate 0.75. This implies
that MMSE-SIC cannot be reliable even when the number of
634 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 61, NO. 2, FEBRUARY 2013
0 0.5 1
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
I
L
(a) (Detector), I
L
ext (Decoder)
I
L
e
x
t
(
D
e
t
e
c
t
o
r
)
,

I
L
(
a
)

(
D
e
c
o
d
e
r
)
4 QAM, SNR = 2 dB


RRMAPSIC
MMSESIC
0 0.5 1
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
I
L
(a) (Detector), I
L
ext (Decoder)
I
L
e
x
t
(
D
e
t
e
c
t
o
r
)
,

I
L
(
a
)

(
D
e
c
o
d
e
r
)
16 QAM, SNR = 4 dB


RRMAPSIC
MMSESIC
Fig. 4. The EXIT charts mapping RR-MAP-SIC and MMSE-SIC are shown.
The extrinsic information curves for the decoder corresponds to the rates, 0.83,
0.75, 0.50 and 0.33, in the order from the top. The extrinsic information curves
for the detector are plotted with two markers.
iterations increases. On the other hand, the detector curves
of RR-MAP-SIC is positioned above the decoder curve with
the code rate 0.75. This means that RR-MAP-SIC could be
eventually reliable as the number of iterations increases. At
the SNR 4 dB with 16 QAM, a similar trend is observed
between RR-MAP-SIC and MMSE-SIC. These SNR points
with different modulation orders are numerically veried in
Fig. 5(b) and Fig. 7 at the next section. Since the EXIT
chart is generated with many assumptions such as Gaussian
distributed LLRs, they are not identically matched to each
other. However, the EXIT chart well shows the performance
of both SIC algorithms.
VI. SIMULATION RESULTS
This section presents the results of computer simulation,
using MATLAB to evaluate the gain of the proposed RR-
MAP-SIC. The number of transmit and receive antennas is
N
t
= N
s
= 4, respectively. The channel follows a Rayleigh
fading distribution. Both 4 and 16 QAM are used to run
simulation. A single packet with uncoded 400 bits is encoded
with the code rate R
c
= 1/3, 1/2 or 3/4 at the turbo encoder,
and is sent over 10 subcarriers with N
c
= 2 codewords.
Channels are assumed to be perfectly estimated at the receiver.
The performance is measured with packet error rates (PERs)
which are averaged over 10000 packets. Moreover, this section
assumes that the decoder complexity is more dominant than
the detector complexity. Under the assumption, a non-iterative
scheme is simulated with 8 inner iterations at the decoder
while an iterative scheme is simulated with 2 outer iterations
per codeword and 4 inner iterations in order to fairly compare
both schemes.
Fig. 5 compares the proposed RR-MAP-SIC with MMSE-
SIC, Full-ML and Full-MAP-IDD. The legend Full-MAP-
IDD means that full-dimensional MAP is iteratively used for
detecting with updated a priori information. The number in
the bracket indicates the number of outer iterations. Thus,
the only difference between Full-ML and Full-MAP-IDD(1)
is the number of inner iterations at the decoder. The rst
7 6 5 4 3 2
10
3
10
2
10
1
10
0
4 QAM, Code Rate: 0.33
SNR [dB]
P
a
c
k
e
t

E
r
r
o
r

R
a
t
e

(
P
E
R
)


FullML
MMSESIC
RRMAPSIC
FullMAPIDD(1)
FullMAPIDD(2)
(a) Code Rate 0.33
0 1 2 3 4 5
10
3
10
2
10
1
10
0
4 QAM, Code Rate: 0.75
SNR [dB]
P
a
c
k
e
t

E
r
r
o
r

R
a
t
e

(
P
E
R
)


FullML
MMSESIC
RRMAPSIC
FullMAPIDD(1)
FullMAPIDD(2)
(b) Code Rate 0.75
Fig. 5. The PERs of Full-ML, MMSE-SIC, RR-MAP-SIC and Full-MAP-
IDD are compared in terms of the code rates at 4 QAM.
uses 8 but the second uses 4. Interestingly, it is observed
that RR-MAP-SIC even outperforms Full-MAP-IDD(2) at the
code rate 0.33 in Fig. 5(a). When the code rate is low, the
bit sequence in a codeword is well decoded such that SIC
rarely loses information. Essentially, RR-MAP-SIC is a serial
algorithm to cancel interference. For instance, codeword 1
is rst detected and decoded, and then its updated a priori
information helps to detect codeword 2. This process is
repeated once more. However, Full-MAP-IDD(2) is a parallel
algorithm so that both codewords are detected and decoded
simultaneously. Hence, the detection performance of codeword
2 at RR-MAP-SIC is better if SIC does not lose information.
When the code rate is high, the decoding performance is
degraded so that SIC loses information while generating the
soft estimate in (10) and the covariance in (15). In this case,
it is advantageous to jointly detect both codewords rather
than to successively cancel interference if the complexity is
not concerned. Fig. 5(b) shows the performance of the high
code rate 0.75, which is consistent with the interpretation
above. Also, RR-MAP-SIC outperforms MMSE-SIC whose
performance is degraded a lot as the code rate increases. In
addition, RR-MAP-SIC is shown to be robust compared with
MMSE-SIC and Full-ML.
KWON et al.: SUCCESSIVE INTERFERENCE CANCELLATION VIA RANK-REDUCED MAXIMUM A POSTERIORI DETECTION 635
2 3 4 5 6 7
10
3
10
2
10
1
10
0
16 QAM, Code Rate: 0.50
SNR [dB]
P
a
c
k
e
t

E
r
r
o
r

R
a
t
e

(
P
E
R
)


FullML with 8 inner iter.
RRMAPSIC with 1 outer iter. and 8 inner iter.
RRMAPSIC with 2 outer iter. and 4 inner iter.
Fig. 6. The PERs are compared for showing the iterative gain at 16 QAM
with the code rate 0.50.
1 2 3 4 5 6 7
10
3
10
2
10
1
10
0
16 QAM, Code Rate: 0.50
SNR [dB]
P
a
c
k
e
t

E
r
r
o
r

R
a
t
e

(
P
E
R
)


MMSESIC, Outer(1)
MMSESIC, Outer(2)
MMSESIC, Outer(3)
MMSESIC, Outer(4)
RRMAPSIC, Outer(1)
RRMAPSIC, Outer(2)
RRMAPSIC, Outer(3)
RRMAPSIC, Outer(4)
Fig. 7. The PERs are compared in terms of the number of outer iterations.
16 QAM and the code rate 0.50 are used.
Fig. 6 demonstrates the gain of iterations by comparing
the PERs of Full-ML and RR-MAP-SIC. For coded bits,
the PER performance could be enhanced by increasing the
number of inner iterations at the decoder. Alternatively, the
PER performance could be enhanced by increasing the outer
iterations between the detector and the decoder. In practice, the
complexity of both methods is different because the detector
and the decoder are separately designed. However, as shown
in Sec. V-A, RR-MAP-SIC reduces the detector complexity
such that the decoder complexity can be dominant. Fig. 6
clearly shows that it is benecial to increase the number of
outer iterations instead of inner iterations under the xed total
number of iterations.
Fig. 7 presents the performance of RR-MAP-SIC and
MMSE-SIC in terms of the number of outer iterations. At the
number of iterations > 1, both detection algorithms could use
updated a priori information so as to enhance the performance.
The biggest gain of iteration is achieved at the 2nd iteration
where both codewords are detected with non-zero a priori
information. Furthermore, it is shown that the PER gain of
RR-MAP-SIC over MMSE-SIC increases from 0.3 to 0.8 dB,
as the number of iterations increases from 1 to 4. However, in
0.6 0.8 1
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
The 1st iteration for codeword 1
Bit Probability (x)
C
u
m
u
la
t
iv
e

D
is
t
r
ib
u
t
io
n

F
u
n
c
t
io
n

(
C
D
F
)
F
(
x
)

=

P
(
X

x
)


SNR: 4.5 dB
SNR: 5.0 dB
SNR: 5.5 dB
SNR: 6.0 dB
0.6 0.8 1
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
The 2nd iteration for codeword 1
Bit Probability (x)
C
u
m
u
la
t
iv
e

D
is
t
r
ib
u
t
io
n

F
u
n
c
t
io
n

(
C
D
F
)
F
(
x
)

=

P
(
X

x
)


SNR: 4.5 dB
SNR: 5.0 dB
SNR: 5.5 dB
SNR: 6.0 dB
Fig. 8. The bit probability obtained from a posteriori LLR is distributed in
terms of the number of iterations at 64 QAM with the code rate 0.33. As
the number of iterations increases, the LLR becomes large enough for the
decoded bit to be reliable.
practice, the hardware complexity is limited so that the number
of iterations should be limited, too. Fig. 7 indicates that 2 3
iterations are enough to obtain the saturated performance.
Fig. 8 plots the cumulative distribution function (CDF) of
the bit probabilities converted from the absolute values of
a posteriori LLRs at the decoder in (10). The codeword 1
is detected without a priori information at the 1st iteration.
However it is detected again with a priori information at
the 2nd iteration. The detection performance straightforwardly
affects the decoding performance. Although it is shown that
the CDFs at the 1st iteration have a bit diagonal slopes,
they become very steep at the 2nd iteration. As a result, the
covariance of the residual interference is quickly reduced so
that the PER is enhanced as in Fig. 3 and Fig. 7.
VII. CONCLUSION
This paper investigated the PER gain achievable at the
receive using SIC with soft information. This paper proposed
the rank-reduced MAP detector with SIC (RR-MAP-SIC),
which minimizes the loss of joint information among multiple
streams in a codeword. It was shown that the PER performance
was improved a lot by increasing the number of outer iterations
rather than by increasing the number of inner iterations at the
decoder. When the code rate is low, it was observed that the
proposed RR-MAP-SIC was even better than full-dimensional
MAP with the same number of outer iterations. However, the
PER gain depends on the modulation order and the code rate
so that it varies accordingly.
When generating the PER plots, this paper assumed that
the channel is perfectly known at the receiver. In practice,
the channel information is only available at the position of
reference signals so that the estimation errors should occur.
The inaccurate channel estimation errors degrade the detector
performance, which affects the decoder performance sequen-
tially. Since the proposed RR-MAP-SIC is a serial algorithm
to decode both codewords, these errors could be propagated
and become a factor to degrade the performance. Therefore, a
further study is required to compensate the PER degradation
caused by the imperfect channel knowledge.
636 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 61, NO. 2, FEBRUARY 2013
APPENDIX A
DERIVING ERROR PROBABILITY
As shown in (42), an error is mostly detected when the
nearest neighbor symbol is selected in (39). The distance
between two nearest neighbor symbols is given by

s
(j)
1
s
(i)
1

= d
min
. (45)
The Euclidean distance for (37) is developed into
s
1

1
s
1i

2
= s
1

2
s
(i)
1

1
s
1
s
(i)
1
s

1
+

s
(i)
1

2
. (46)
In addition, (37) is also used to expand the multiplication of

1
with s
1
into

1
s
1
+s

1
=
1

2
_
2z + s
(i)
1
+ s
(i)
1
_
(47)
which is the sum of a complex and its conjugate. In (47), z
is a real Gaussian random variable of zero mean and variance
1/2
1

2
. Without loss of generality, the nearest neighbor
symbol s
(j)
1
of s
(i)
1
in (45) is considered as s
(j)
1
= s
(i)
1
+d
min
.
The conditional probability in (42) is derived in (49) with
the Q-function which is the tail probability of the standard
Gaussian distribution dened as
Q(x) =
1

2
_

x
e
t
2
/2
dt. (48)
When there is no iteration, (49) becomes a function of only
d
min
and
1
, which is the same as the error probability in [39].
REFERENCES
[1] I. E. Telatar, Capacity of multi-antenna Gaussian channels, European
Trans. Telecommun., vol. 10, pp. 585595, 1999.
[2] S. M. Alamouti, A simple transmit diversity technique for wireless
communications, IEEE J. Sel. Areas Commun., vol. 16, pp. 14511458,
Oct. 1998.
[3] V. Tarokh, H. Jafarkhani, and A. R. Calderbank, Layered space-time
architecture for wireless communication in a fading environment when
using multi-element antennas, IEEE Trans. Inf. Theory, vol. 45, pp.
14561467, 1999.
[4] G. J. Foschini, Space-time block codes from orthogonal designs, Bell
Labs Tech. J., vol. 2, pp. 4159, 1996.
[5] P. Wolniansky, G. Foschini, G. Golden, and R. Valenzuela, V-BLAST:
an architecture for realizing very high data rates over the rich-scattering
wireless channel, in Proc. 1998 URSI Int. Symp. Signals, Syst., Elec-
tron., pp. 295300.
[6] X. Wang and H. Poor, Iterative (turbo) soft interference cancellation
and decoding for coded CDMA, IEEE Trans. Commun., vol. 47, no. 7,
pp. 10461061, July 1999.
[7] J. Hagenauer, The turbo principle: tutorial introduction and state of the
art, Proc. 1997 Int. Symp. Turbo Codes, pp. 111.
[8] J. Hagenauer, E. Offer, and L. Papke, Iterative decoding of binary block
and convolutional codes, IEEE Trans. Inf. Theory, vol. 42, no. 2, pp.
429445, Mar. 1996.
[9] A. Tonello, Space-time bit-interleaved coded modulation with an
iterative decoding strategy, in Proc. 2000 IEEE Veh. Technol. Conf.
Fall, vol. 1, pp. 473478.
[10] I. Lee, A. Chan, and C.-E. Sundberg, Space-time bit-interleaved coded
modulation for OFDM systems, IEEE Trans. Signal Process., vol. 52,
no. 3, pp. 820825, Mar. 2004.
[11] B. Hochwald and S. ten Brink, Achieving near-capacity on a multiple-
antenna channel, IEEE Trans. Commun., vol. 51, no. 3, pp. 389399,
Mar. 2003.
[12] U. Fincke and M. Pohst, Improved methods for calculating vectors
of short length in a lattice, including a complexity analysis, Math.
Comput., vol. 44, pp. 463471, Apr. 1985.
[13] M. Tuchler, A. Singer, and R. Koetter, Minimum mean squared error
equalization using a priori information, IEEE Trans. Signal Process.,
vol. 50, no. 3, pp. 673683, Mar. 2002.
[14] J. Boutros and G. Caire, Iterative multiuser joint decoding: unied
framework and asymptotic analysis, IEEE Trans. Inf. Theory, vol. 48,
no. 7, pp. 17721793, July 2002.
[15] G. Caire, R. Muller, and T. Tanaka, Iterative multiuser joint decoding:
optimal power allocation and low-complexity implementation, IEEE
Trans. Inf. Theory, vol. 50, no. 9, pp. 19501973, Sept. 2004.
[16] P. Salvo Rossi and R. Muller, Joint twofold-iterative channel estima-
tion and multiuser detection for MIMO-OFDM systems, IEEE Trans.
Wireless Commun., vol. 7, no. 11, pp. 47194729, Nov. 2008.
[17] G. Kirkelund, C. Mancho andn, L. Christensen, E. Riegler, and
B. Fleury, Variational message-passing for joint channel estimation and
decoding in MIMO-OFDM, in Proc. 2010 IEEE Globecomm, pp. 16.
[18] C. Navarro Manch on, G. E. Kirkelund, E. Riegler, L. P. B. Christensen,
and B. H. Fleury, Receiver architectures for MIMO-OFDM based on
a combined VMP-SP algorithm, ArXiv e-prints, Nov. 2011. Available:
http://adsabs.harvard.edu/abs/2011arXiv1111.5848N.
[19] J. Choi, A. Singer, J. Lee, and N. Cho, Improved linear soft-input soft-
output detection via soft feedback successive interference cancellation,
IEEE Trans. Commun., vol. 58, pp. 986996, Mar. 2010.
[20] L. Kong, S. Ng, R. Tee, R. Maunder, and L. Hanzo, Reduced-
complexity near-capacity downlink iteratively decoded generalized
multi-layer space-time coding using irregular convolutional codes,
IEEE Trans. Wireless Commun., vol. 9, no. 2, pp. 684695, Feb. 2010.
[21] M. Butt, R. Riaz, S. X. Ng, and L. Hanzo, Near-capacity iterative de-
coding of binary self-concatenated codes using soft decision demapping
and 3-D EXIT charts, IEEE Trans. Wireless Commun., vol. 9, no. 5,
pp. 16081616, May 2010.
[22] S. Yang and L. Hanzo, Iterative detection and decoding using approx-
imate bayesian theorem based PDA method over MIMO Nakagami-m
fading channels, in Proc. 2012 IEEE GLOBECOM, pp. 15.
[23] G. Kraidy and P. Salvo Rossi, Achieving full diversity over the MIMO
fading channel with space-time precoders and iterative linear receivers,
IEEE Trans. Wireless Commun., vol. 10, no. 8, pp. 24072411, Aug.
2011.
[24] H. Lee, B. Lee, and I. Lee, Iterative detection and decoding with an
improved V-BLAST for MIMO-OFDM systems, IEEE J. Sel. Areas
Commun., vol. 24, no. 3, pp. 504513, Mar. 2006.
[25] R. de Lamare and R. Sampaio-Neto, Minimum mean-squared error
iterative successive parallel arbitrated decision feedback detectors for
DS-CDMA systems, IEEE Trans. Commun., vol. 56, no. 5, pp. 778
789, May 2008.
[26] 3GPP, 3gpp release 9, Website, 1996. Available: http://www.3gpp.org/
Release-9.
[27] Y. Hua, M. Nikpour, and P. Stoica, Optimal reduced-rank estimation
and ltering, IEEE Trans. Signal Process., vol. 49, no. 3, pp. 457469,
Mar. 2001.
[28] M. Honig and J. Goldstein, Adaptive reduced-rank interference sup-
pression based on the multistage Wiener lter, IEEE Trans. Commun.,
vol. 50, no. 6, pp. 986994, June 2002.
[29] Y. Sun, V. Tripathi, and M. Honig, Adaptive turbo reduced-rank
equalization for MIMO channels, IEEE Trans. Wireless Commun.,
vol. 4, no. 6, pp. 27892800, Nov. 2005.
[30] R. de Lamare and R. Sampaio-Neto, Adaptive reduced-rank processing
based on joint and iterative interpolation, decimation, and ltering,
IEEE Trans. Signal Process., vol. 57, no. 7, pp. 25032514, July 2009.
[31] , Adaptive reduced-rank equalization algorithms based on alter-
nating optimization design techniques for MIMO systems, IEEE Trans.
Veh. Technol., vol. 60, no. 6, pp. 24822494, July 2011.
[32] C. K. A. Yeung, J. Lee, and S. Kim, A simple slicer for soft detection
in Gray-coded QAM-modulated MIMO OFDM systems, in Proc. 2012
IEEE Sarnoff Symp., pp. 15.
[33] S. ten Brink, Designing iterative decoding schemes with the extrinsic
information transfer chart, AEU Int. J. Electron. Commun., vol. 54,
no. 6, pp. 389398, Nov. 2000.
[34] , Convergence behavior of iteratively decoded parallel concate-
nated codes, IEEE Trans. Commun., vol. 49, no. 10, pp. 17271737,
Oct. 2001.
[35] J. Hagenauer, The EXIT chartintroduction to extrinsic information
transfer in iterative processing, in Proc. 2004 Eur. Signal Process.
Conf., pp. 15411548.
[36] M. Damen, H. El Gamal, and G. Caire, On maximum-likelihood
detection and the search for the closest lattice point, IEEE Trans. Inf.
Theory, vol. 49, no. 10, pp. 23892402, Oct. 2003.
[37] J. R. Barry, E. A. Lee, and D. G. Messerschmitt, Digital Communication,
3rd edition. Springer, 2003.
KWON et al.: SUCCESSIVE INTERFERENCE CANCELLATION VIA RANK-REDUCED MAXIMUM A POSTERIORI DETECTION 637
P
s|s
_
s
1
= s
(j)
1
| s
(i)
1
_
= P
s|s
_

1
s
1
_
s
(j)
1
s
(i)
1
_
+s

1
_
s
(j)
1
s
(i)
1
_

>
2
_

s
(j)
1

s
(i)
1

2
_
+ 2 log
P
s1
(s
(i)
1
)
P
s1
(s
(j)
1
)
_
= P
s|s
_

2
_
2z + s
(i)
1
+ s
(i)
1
_
d
min
>
1

2
d
min
_
d
min
+ s
(i)
1
+ s
(i)
1
_
+ 2 log
P
s1
(s
(i)
1
)
P
s1
(s
(j)
1
)
_
= P
s|s
_
2
1

2
d
min
z >
1

2
d
2
min
+ 2 log
P
s1
(s
(i)
1
)
P
s1
(s
(j)
1
)
_
= P
s|s
_
z >
d
min
2
+
1
d
min

2
log
P
s1
(s
(i)
1
)
P
s1
(s
(j)
1
)
_
= Q
_
d
min

2
+

2
d
min

log
P
s1
(s
(i)
1
)
P
s1
(s
(j)
1
)
_
(49)
[38] M. Tuchler, R. Koetter, and A. Singer, Turbo equalization: principles
and new results, IEEE Trans. Commun., vol. 50, no. 5, pp. 754767,
May 2002.
[39] J. M. Ciof, EE379A class note: signal processing and detection, Stan-
ford University. Available: http://www.stanford.edu/group/ciof/ee379a/.
[40] G. Caire, G. Taricco, and E. Biglieri, Bit-interleaved coded modula-
tion, IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 927946, May 1998.
[41] F. Kschischang, B. Frey, and H.-A. Loeliger, Factor graphs and the
sum-product algorithm, IEEE Trans. Inf. Theory, vol. 47, no. 2, pp.
498519, Feb. 2001.
Hyukjoon Kwon received his B.S. degree in Elec-
tronics Engineering from Seoul National Univer-
sity in 2001, and both M.S. and Ph.D. degree in
Electrical Engineering from Stanford University in
2006 and 2010, respectively. From 2001 to 2004,
he worked for Corecess Inc., as a research engineer
to develop ethernet switches. From 2010 to 2011,
he was with Marvell Semiconductor Inc., as senior
engineer to design WiFi products. Since 2011, he
has been with Samsung US R&D Center as staff
engineer to research advanced cellular technologies.
His main research interests are in the fundamental aspects of wireless
communication and its practical application.
Jungwon Lee is a Senior Director at Samsung Mo-
bile Solutions Lab in San Diego, CA, in charge of an
R&D lab consisting of about 30 engineers with PhD
degrees. He received his PhD degree in Electrical
Engineering from Stanford University in 2005. From
2000 to 2003, he worked for National Semiconduc-
tor, Telcordia Technologies, AT&T Shannon Labs
Research, and Ikanos Communications as a research
intern or a consultant. From 2003 to 2010, he was
with Marvell Semiconductor Inc., as a Principal
Engineer. Since 2010, he has been with Samsung
US R&D Center. Dr. Lee has co-authored more than 50 papers as well as
numerous standards contributions for various standards bodies, and he holds
over 60 US patents. He is a Senior Member of the IEEE and an Editor
for IEEE COMMUNICATIONS LETTERS, and he has served on the technical
program committee of many IEEE conferences. Dr. Lees main research
interests lie in wireless and wireline communication theory.
Inyup Kang received B.S. and M.S. degrees in
Electronics Engineering from Seoul National Uni-
versity in 1985 and 1987, respectively, and Ph.D.
degree in Electrical Engineering from UCLA in
1996. From 1996 to 2009 he was at Qualcomm, San
Diego, where he led generations of cellular modem
chipsets as VP of technology. Since 2010 he has
been working at Samsung Electronics as EVP in
charge of R&D and commercialization of cellular
baseband/RF chipset & software for 2G, 3G, and 4G.
His main research interests are in the fundamental
and theoretical aspects of cellular wireless communications.