# Normalized Structured Compressed Sensing Based Signal Detection in Spatial Modulation 3D-MIMO Systems

Authors: Wei Ren; Guan Gui; Fei Li
Journal: Wireless Communications and Mobile Computing
 (2017)

---

## Abstract

Signal detection is one of the fundamental problems in three-dimensional multiple-input multiple-output (3D-MIMO) wireless communication systems. This paper addresses a signal detection problem in 3D-MIMO system, in which spatial modulation (SM) transmission scheme is considered due to its advantages of low complexity and high-energy efficiency. SM based signal transmission typically results in the block-sparse structure in received signals. Hence, structured compressed sensing (SCS) based signal detection is proposed to exploit the inherent block sparsity information in the received signal for the uplink (UL). Moreover, normalization preprocessing is considered before iteration process with the purpose of preventing the noise from being overamplified by the column vector with inadequately large elements. Simulation results are provided to show the stable and reliable performance of the proposed algorithm under both Gaussian and non-Gaussian noise, in comparison with methods such as compressed sensing based detectors, minimum mean square error (MMSE), and zero forcing (ZF).


---

## Body

## 1. Introduction

Multiple-input multiple-output (MIMO) systems improve reliability and spectral efficiency of communication systems as a result of multiple antennas and have been included in the fourth generation (4G) mobile communication standards [1, 2]. Nowadays, three-dimensional multiple-input multiple-output (3D-MIMO) system, equipped in a 2D planar array with a large number of active antennas, has shown large potential in increasing system capacity [3–5]. In 3rd Generation Partnership Project (3GPP) Release 12, 3D-MIMO system has been considered as an important technique for throughput enhancement and multiuser interference mitigation [6, 7]. Signal detection is one of the fundamental problems in 3D-MIMO wireless communication systems due to the requirement of synchronization between the antennas and the strong interchannel interference (ICI) between each of the receive antennas [8].Spatial modulation (SM) has attracted much research attention as a novel multiantenna transmission scheme due to its advantages of low complexity and high-energy efficiency [9, 10]. In addition to phase and amplitude modulation, SM can also utilize transmit antennas’ indices as the third dimension in order to invoke for more transmitting information. Unlike the traditional MIMO systems, the SM transmitter in 3D-MIMO systems uses massive transmit antennas but a small number of radio frequency (RF) chains, which significantly improves energy efficiency of the whole system, because the hardware cost and power consumption increase highly with the number of RF chains [10, 11]. With only one or several transmit antennas being active at each time slot, ICI at the receiver and the need to synchronize the transmit antennas can be largely reduced [12–15]. Moreover, with only one or several nonzero components in transmit signal at each slot, the inherent sparsity of SM-3D-MIMO signals can be utilized in signal detection. Since users have the same active antenna selection scheme and share the same spatial constellation symbol, the received signal has the block-sparse structure which can be utilized in signal detection via structure compressed sensing.For the novel transmit systems, suitable signal detection algorithms are required to obtain signals. The maximum-likelihood (ML) detector has too high complexity which will linearly increase with the size of the symbol constellation and the numbers of transmit and receive antennas [16]. Sphere decoding (SD) based [17] and linear minimum mean square error (LMMSE) based signal detecting method will suffer from large and considerable performance reduction in the SM-MIMO systems [18]. Compressed sensing (CS) theory should be used to reliably improve the signal detecting performance due to the exploiting of the inherent sparsity information in SM signals [19, 20]. In [21], CS theory is used for signal detection in multiple access large-scale channels. In [22], a structured compressed sensing based signal detecting algorithm is proposed for the massive spatial modulation MIMO systems. Paper [23] gives a performance evaluation of the existing signal detecting algorithms such as SCS based SSP algorithm, CS based SP algorithm, and other conventional methods. On the basis of existing near-optimal signal detection algorithms, this paper proposes a modified SCS based algorithm for the spatial modulation 3D-MIMO systems.The rest of this paper is organized as follows. Section2 presents spatial modulation, maximum-likelihood detection, and compressed sensing. Section 3 introduces the proposed normalized structured subspace pursuit algorithm. Section 4 gives simulation results and performance analysis of several signal detectors.


## 2. System Model

Spatial Modulation. In spatial modulation MIMO systems, the transmitter has Nt transmit antennas and Na<Nt active antennas, and the receiver has Nr receive antennas. The information bit stream is grouped into two parts: the first part with log2⁡NtNa bits is mapped onto the spatial constellation symbols which indicate different selection schemes of the active transmit antennas, and the second part with log2⁡L bits is mapped onto the signal constellation symbols derived from the signal constellation set of L-ary. Therefore, the total information carried by each SM signal is Nalog2⁡L+log2⁡NtNa bits. Figure 1 shows an example of signal constellation symbol and spatial constellation symbol in the spatial modulation 3D-MIMO system.Figure 1
Signal constellation symbol and spatial constellation symbol in the SM 3D-MIMO system, whereNt=4, Na=1, and 4QAM are taken into account as an example.At the receiver, the received signaly∈CNr×1 is equal to(1)y=Hx+w,where x∈CNt×1 is the SM signal generated from the transmitter and w∈CNr×1 is the additive noise vector. H=Rr1/2H~Rt1/2∈CNr×Nt represents the correlated flat Rayleigh-fading MIMO channel, and H~ is composed of the entries which obey the independent and identical distribution CN(0,1). Rr is the correlation matric of the receiver and Rt is the correlation matric of the transmitter [24]. R is the correlation matrix composed of rij=ri-j and r is the correlation coefficient between neighboring antennas. Obviously, it is a nondeterministic polynomial hard (NP-hard) detection problem at the receiver.Maximum-Likelihood (ML) Detection. ML signal detection is the optimal signal detector to the NP-hard problem [25]. It can be expressed as(2)x^ML=arg⁡minsuppx∈A,x∈B⁡y-Hx2.However, the ML signal detector is unrealistic with the high computational complexity ofO(MNa2log2⁡(NtNa)) when Nt, Na, and M are large [16, 26].Compressed Sensing (CS). Using sparsity, compressed sensing can provide reliable detection for s-sparse signals. CS is formulated as y=Φx, where y∈Rm is the measurement vector and Φ∈Rm×n is the measurement matrix with m<n. Moreover, Φ is a matrix satisfying therestricted isometry property (RIP) [27, 28], m is greater than c1slog⁡(n/s) for some small constant c1, and x can be reconstructed by l1-minimization as(3)x^=arg⁡miny=Φx⁡xl1.Note that RIP identifies the so-calledisometry constantδs of the measurement matrix Φ as the smallest number such that 1-δsx22≤Φx22≤(1+δs)x22 holds for s-sparse vector x. The perfect reconstruction of s-sparse vector can be achieved if the sampling matrix Φ is properly designed to satisfy δc2s<θ for some constant c2 [26, 29].


## 3. The Proposed Signal Detection Algorithm in SM 3D-MIMO Systems

### 3.1. Grouped Transmission Scheme

The SM signalxk is transmitted from the kth user in one time slot and is expressed as xk=eksk. It is composed of two parts: the first part of spatial constellation symbol ek∈Cnt and the second part of signal constellation symbol sk∈L which is generated by L-ary modulation. Because each user employs only one RF chain, there is just one nonzero entry of ek which is on behalf of the active transmit antenna. Hence, the rest of the entries in ek are all equal to zero; that is, (4)suppek∈A,ek0=1,ek2=1,where A=1,2,…,nt represents the spatial constellation symbol set. Therefore, every SM signal xk contains log2L+log2⁡nt bits per channel use (bpcu), so the entire throughput coming from the transmitter is K(log2⁡(L)+log2⁡nt) bpcu.At the transmitter, it is set that one group containsG consecutive SM signals. The SM signals form one group have the same spatial constellation symbol and active antenna selection scheme; that is,(5)suppxk1=suppxk2=⋯=suppxkG,where xk1,xk2,…,xkG are SM signals of the kth user in G consecutive symbol slots. Thus they show the feature of structured sparsity, which can be exploited as a priori information to improve the performance of the signal detection.At the receiver, onlyMRF receive antennas are needed to receive signals because of the reductive numbers of RF chains at the BS. With K users concurrently served at the BS, the received signal yq∈CMRF which is form the qth time slot can be expressed as(6)yq=∑k=1Kyk,q+wq=∑k=1KHkxk+wq,where Hk∈CM×nt represents the MIMO channel matrix from the kth user.


### 3.2. Normalized Structured Subspace Pursuit Algorithm

The proposed NSSP algorithm is described in Algorithm1. In the NSSP algorithm, there is normalization preprocessing before the iteration process, after which (1) can be written as(7)y=H′Cx+w,where C∈RNt×Nt is a diagonal matrix and its diagonal elements are the l2-norm of H-,i denoting the ith column of H. H′ is of dimension Nr×Nt. Let x′=Cx; (8) can be written as (8)y=H′x′+w.Algorithm 1:Our proposed NSSP based signal detection algorithm in spatial modulation 3D-MIMO systems.
Input: y(t): the received signal
H
(
t
):  the channel matrix
N
a: the number of active antennas
Output: x^(t):  the recovery signal for 1≤t≤G
(
1
)  for  s=1 to Na
(
2
)
let H-,s′(t) be normalized sth column H-,s(t) of H(t)
(
3
)
H
′
(
t
)
=
[
H
-
,
1
′
t
⋯
H
-
,
N
a
′
(
t
)
]
(
4
)  k=1, T0=φ, r(t)=y(t)
(
5
)  for  k≤Na
(
6
)
u
(
t
)
=
H
′
t
∗
r
(
t
)
(
7
)
P
=
arg
⁡
max
P
′
⁡
∑
t
=
1
G
u
P
′
t
2
2
,
P
′
∈
A
(
8
)
Ω
=
T
k
-
1
∪
P
(
9
)
w
(
t
)
=
H
Ω
′
t
†
y
(
t
)
(
10
)
T
k
=
arg
⁡
max
T
′
⁡
∑
t
=
1
G
w
T
′
t
2
2
,
T
′
∈
A
(
11
)
r
(
t
)
=
y
(
t
)
-
H
′
t
H
T
k
′
t
†
y
(
t
)
(
12
)
k
=
k
+
1
(
13
)  x^(t)=HTkt†y(t)Different from conventional compressed sensing based detectors, where the sensing and recovery processes share the same measurement matrix, the normalization preprocessing allows different matrices during the two processes. After the normalization preprocessing, the noise will not be overamplified by the column vector with inadequately large elements [26].On the other hand, the spatial constellation set will be exploited as a priori information in the NSSP algorithm. It means that the estimated support set during each iteration should belong to the predefined spatial constellation set. During each iteration, the potential true indices will be obtained according to the correlation between the MIMO channels and the residual in the previous iteration, and then the estimated support set will be updated after the least squares.It is proved that the recovery performance of SCS based signal detectors is better than the traditional CS based signal detectors with the measurement vectors of the same size [30]. The structured compressed sensing based algorithm can solve multiple sparse signals with common support set but different measurement matrices [22].The description of the NSSP algorithm is given as follows:(1)
The parameters of input are the measurement vectory, the number of active antennas Na, and the channel matrix H.(2)
The normalization preprocessing performs before iteration process.H′ is of dimension Nr×Nt and C∈RNt×Nt is a diagonal matrix whose diagonal elements are the l2-norm of H-,i denoting the ith column of H.(3)
In the support merging section, according to the correlationut between the previous residual iteration and the MIMO channels, a potential support set P which makes the correlation ut largest will be selected from the predefined spatial constellation set.(4)
After updating the current support setTk, wrong indices will be removed and most likely indices will be selected according to the least squares.(5)
The normalization preprocessing allows different measurement matrices during the sensing and recovery process; the matrix during the sensing process isH′ inlines (6)~(12) and the matrix during the recovery process is H inline (13).(6)
The parameter of output is the estimated signalx^(t)=HTkt†y(t).


## 3.1. Grouped Transmission Scheme

The SM signalxk is transmitted from the kth user in one time slot and is expressed as xk=eksk. It is composed of two parts: the first part of spatial constellation symbol ek∈Cnt and the second part of signal constellation symbol sk∈L which is generated by L-ary modulation. Because each user employs only one RF chain, there is just one nonzero entry of ek which is on behalf of the active transmit antenna. Hence, the rest of the entries in ek are all equal to zero; that is, (4)suppek∈A,ek0=1,ek2=1,where A=1,2,…,nt represents the spatial constellation symbol set. Therefore, every SM signal xk contains log2L+log2⁡nt bits per channel use (bpcu), so the entire throughput coming from the transmitter is K(log2⁡(L)+log2⁡nt) bpcu.At the transmitter, it is set that one group containsG consecutive SM signals. The SM signals form one group have the same spatial constellation symbol and active antenna selection scheme; that is,(5)suppxk1=suppxk2=⋯=suppxkG,where xk1,xk2,…,xkG are SM signals of the kth user in G consecutive symbol slots. Thus they show the feature of structured sparsity, which can be exploited as a priori information to improve the performance of the signal detection.At the receiver, onlyMRF receive antennas are needed to receive signals because of the reductive numbers of RF chains at the BS. With K users concurrently served at the BS, the received signal yq∈CMRF which is form the qth time slot can be expressed as(6)yq=∑k=1Kyk,q+wq=∑k=1KHkxk+wq,where Hk∈CM×nt represents the MIMO channel matrix from the kth user.


## 3.2. Normalized Structured Subspace Pursuit Algorithm

The proposed NSSP algorithm is described in Algorithm1. In the NSSP algorithm, there is normalization preprocessing before the iteration process, after which (1) can be written as(7)y=H′Cx+w,where C∈RNt×Nt is a diagonal matrix and its diagonal elements are the l2-norm of H-,i denoting the ith column of H. H′ is of dimension Nr×Nt. Let x′=Cx; (8) can be written as (8)y=H′x′+w.Algorithm 1:Our proposed NSSP based signal detection algorithm in spatial modulation 3D-MIMO systems.
Input: y(t): the received signal
H
(
t
):  the channel matrix
N
a: the number of active antennas
Output: x^(t):  the recovery signal for 1≤t≤G
(
1
)  for  s=1 to Na
(
2
)
let H-,s′(t) be normalized sth column H-,s(t) of H(t)
(
3
)
H
′
(
t
)
=
[
H
-
,
1
′
t
⋯
H
-
,
N
a
′
(
t
)
]
(
4
)  k=1, T0=φ, r(t)=y(t)
(
5
)  for  k≤Na
(
6
)
u
(
t
)
=
H
′
t
∗
r
(
t
)
(
7
)
P
=
arg
⁡
max
P
′
⁡
∑
t
=
1
G
u
P
′
t
2
2
,
P
′
∈
A
(
8
)
Ω
=
T
k
-
1
∪
P
(
9
)
w
(
t
)
=
H
Ω
′
t
†
y
(
t
)
(
10
)
T
k
=
arg
⁡
max
T
′
⁡
∑
t
=
1
G
w
T
′
t
2
2
,
T
′
∈
A
(
11
)
r
(
t
)
=
y
(
t
)
-
H
′
t
H
T
k
′
t
†
y
(
t
)
(
12
)
k
=
k
+
1
(
13
)  x^(t)=HTkt†y(t)Different from conventional compressed sensing based detectors, where the sensing and recovery processes share the same measurement matrix, the normalization preprocessing allows different matrices during the two processes. After the normalization preprocessing, the noise will not be overamplified by the column vector with inadequately large elements [26].On the other hand, the spatial constellation set will be exploited as a priori information in the NSSP algorithm. It means that the estimated support set during each iteration should belong to the predefined spatial constellation set. During each iteration, the potential true indices will be obtained according to the correlation between the MIMO channels and the residual in the previous iteration, and then the estimated support set will be updated after the least squares.It is proved that the recovery performance of SCS based signal detectors is better than the traditional CS based signal detectors with the measurement vectors of the same size [30]. The structured compressed sensing based algorithm can solve multiple sparse signals with common support set but different measurement matrices [22].The description of the NSSP algorithm is given as follows:(1)
The parameters of input are the measurement vectory, the number of active antennas Na, and the channel matrix H.(2)
The normalization preprocessing performs before iteration process.H′ is of dimension Nr×Nt and C∈RNt×Nt is a diagonal matrix whose diagonal elements are the l2-norm of H-,i denoting the ith column of H.(3)
In the support merging section, according to the correlationut between the previous residual iteration and the MIMO channels, a potential support set P which makes the correlation ut largest will be selected from the predefined spatial constellation set.(4)
After updating the current support setTk, wrong indices will be removed and most likely indices will be selected according to the least squares.(5)
The normalization preprocessing allows different measurement matrices during the sensing and recovery process; the matrix during the sensing process isH′ inlines (6)~(12) and the matrix during the recovery process is H inline (13).(6)
The parameter of output is the estimated signalx^(t)=HTkt†y(t).


## 4. Performance Analysis

Here we present the bit error rate (BER) performance of the proposed algorithm and several signal detection algorithms. The ZF, MF, and MMSE detection is simulated for comparisons. And the SP algorithm is chosen as CS based signal detection for comparison. The parameters are listed in Table1. Nt is the number of transmit antennas, Na is the number of active antennas in each user, and Nr is the number of receive antennas at the receiver. 16QAM signal constellation set is considered.Table 1
Simulation parameters.
Parameters
Value
Transmit antenna number at BS
96
Transmit antenna number in each user
1
Receive antenna number at BS
64
Modulate mode
16-QAM
Noise model
Gaussian/non-Gaussian noiseFigure2 shows BER versus signal to noise ratio (SNR) performance of ZF, MF, MMSE, SP, and NSSP over uncorrelated Rayleigh-fading MIMO channels, where K=24, Na=24, Nt=96, Nr=64, G=1, and 16QAM and Gaussian noise are considered. It can be observed that the proposed NSSP algorithm outperforms the conventional signal detectors since the normalization preprocessing is considered and the structured sparsity of sparse signals is exploited. The performance of the NSSP algorithm and the SP algorithm is similar under the Gaussian noise.Figure 2
BER versus SNR performance of ZF, MF, MMSE, SP, and NSSP over uncorrelated Rayleigh-fading MIMO channels, whereK=24, Na=24, Nt=96, Nr=64, G=1, and 16QAM and Gaussian noise are considered.Figure3 shows BER versus SNR performance of ZF, MF, MMSE, SP, and NSSP over uncorrelated Rayleigh-fading MIMO channels, where K=24, Na=24, Nt=96, Nr=64, G=1, and 16QAM and non-Gaussian noise are considered. It is obvious that the NSSP algorithm gives better performance than conventional signal detectors especially when the SNR is comparatively high. Moreover, The NSSP algorithm performs much better than the SP algorithm under the non-Gaussian noise.Figure 3
BER versus SNR performance of ZF, MF, MMSE, SP, and NSSP over uncorrelated Rayleigh-fading MIMO channels, whereK=24, Na=24, Nt=96, Nr=64, G=1, and 16QAM and non-Gaussian noise are considered.Figures4 and 5 shows BER versus SNR performance of the NSSP algorithm under Gaussian noise and non-Gaussian noise, respectively, with different numbers of transmit antennas and receive antennas. For example, NSSP-64∗48 means there are 64 transmit antennas and 48 receive antennas in this simulation. It may be concluded that the NSSP algorithm has stable and reliable performance under both Gaussian and non-Gaussian noise. Moreover, it performs better when the numbers of transmit and receive antennas are larger.Figure 4
BER versus SNR performance of the NSSP algorithm under Gaussian noise with different numbers of transmit and receive antennas.Figure 5
BER versus SNR performance of the NSSP algorithm under non-Gaussian noise with different numbers of transmit and receive antennas.


## 5. Conclusion

This paper proposed a structured compressed sensing based signal detection for the SM-3D-MIMO system. Firstly, normalization preprocessing is considered before iteration process with the purpose of preventing the noise from being overamplified by the column vector with inadequately large elements. Secondly, the inherent sparsity of 3D-SM-MIMO signals is utilized in signal detection to reduce computation. Finally, simulation results have been provided to confirm the merits of the proposed methods in detection.



---

*Source: 4539470-2017-12-06.xml*