Skip to main content
. 2021 May 27;21(11):3734. doi: 10.3390/s21113734
MIMO Multiple-input multiple-output
LZF Linear zero-forcing
LMMSE Linear minimum mean-square-error
ML Maximum likelihood
MP Message passing
BP Belief propagation
QR-BP QR-decomposition-based BP
IC Interference cancellation
QR-SBP Scheduled QR-BP with IC and candidate constraints
AWGN Additive white Gaussian noise
LLR Log-likelihood ratio
BER Bit-error ratio
FER Frame-error ratio
SNR Signal-to-noise ratio
MFB Matched-filter bound
Mathematical Symbols
The following mathematical symbols are used in this manuscript:
K Number of transmit antennas
M Number of receive antennas
Q Number of bits assigned for each transmit symbol
N Number of bits included in each transmit signal vector
X 2Q-ary constellation set
y M×1 receive signal vector
H M×K MIMO channel matrix
hm mth row of H
x K×1 transmit signal vector
n M×1 AWGN vector
bn nth bit among the bit sequence in each x
αmn Message from the nth bit node to the mth observation node
βmn Message from the mth observation node to the nth bit node
XK,b Set of K×1 vectors whose elements are the members of X with bn=0 or 1
ln LLR of bn
Q M×M unitary matrix with H=Q[R;0(MK)×K]
R K×K upper triangular matrix with H=Q[R;0(MK)×K]
rm mth row of R
r˜m 1×(Km+1) vector containing the non-zero elements of rm
y˜ K×1 receive signal vector for the QR-BP detector
n˜ K×1 AWGN vector for the QR-BP detector
x^k A hard decision symbol of xk
y˜(k) K×1 receive signal vector for the message updating of the bit sequence in xk
z(k) k×1 effective receive signal vector for xk in the proposed QR-SBP detector
x(k) k×1 effective transmit signal vector for xk in the proposed QR-SBP detector
n˜(k) k×1 effective AWGN vector for xk in the proposed QR-SBP detector
R(k) k×k effective channel matrix for xk in the proposed QR-SBP detector
Bmnb Set to update βmn with b=0 and 1 in the proposed QR-SBP detector
r˜m(k) 1×w vector containing the non-zero elements of the mth row of R(k)
X(k)w,b Set of w×1 vectors for xk whose elements are the members of X with bn=b
δ(k)w Number of surviving w×1 vectors in X(k)w,b
Y(k)w,b Set containing the δ(k)w surviving w×1 vectors in X(k)w,b
δ* Maximum δw(k) for all w and k
tmax Number of maximum BP iterations