Printer Friendly

A low-complexity PAPR reduction SLM scheme for STBC MIMO-OFDM systems based on constellation extension.

1. Introduction

Multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) is an efficient technique for wireless communication, which utilizes spatial multiplexing technology to improve data transmission rate and ensure transmission accuracy via spatial diversity and beamforming [1]. It plays a vital role in many broadband wireless standards, including the IEEE 802.11ac for wireless local networking [2], IEEE 802.16e for metropolitan area networks [3], and third generation partnership project (3GPP) long term evolution (LTE) for cellular networks [4]. Moreover, it has been widely used in the 4G wireless communications and will be applied to the 5G wireless communications [5][6]. Compared with the traditional MIMO-OFDM system, STBC MIMO-OFDM system introduces spatial diversity gain, which enhances the transmission reliability [7]. However, the MIMO-OFDM system usually suffers from high PAPR, which complicates the design of the power amplifier at the receiver end. Therefore, the design of PAPR reduction scheme has become a hot spot in MIMO-OFDM research.

Classical PAPR reduction techniques include clipping, selective mapping (SLM), partial transmission sequence (PTS), and active constellation extension (ACE) [8]-[11]. Some methods, such as clipping, reduce PAPR by performing nonlinear preprocess to time-free signal. Though simple in principle and reducing PAPR significantly, the clipping technology leads to signal distortion and degradation of bit error rate (BER) performance [12]. ACE improves the BER performance by correcting the constellation after clipping [13]. Methods like SLM and PTS, reduce PAPR by changing the phase distribution of data frame. In SLM, the phase distribution of data frame is changed by multipling the data frame with a random phase vector [9]. While PTS divides a large frame into several subblocks, and multiply them with diffirent phase factors [11]. However, both SLM and PTS need to transmit the phase vector or phase factors as side information (SI), which wastes spectrum resource a lot.

Recently, various improved methods have been proposed to alleviate the PAPR problem of MIMO-OFDM. In [14], a novel phase offset SLM scheme has been proposed to reduce the PAPR without SI in Alamouti MIMO-OFDM systems. However, the complexity of this method is high. The work in [15] proposed the using of combination of PTS and signal clipping techniques to solve the high PAPR, but the exhaustive search in PTS process cost large computational complexity and the nonlinear distortion was introduced to system by clipping. In [16], a simple SLM method based on time-domain sequence cyclic shift and combination of antennas is proposed. However, the time-domain sequences generated by this method is not independent, which leads to a poor PAPR reduction performation compared to SLM.

In this work, a joint space-time selective mapping scheme based on active constellation extension, also called AST-SLM, is proposed. Unlike the traditional selective mapping (SLM) scheme, the transmission candidate sequence pairs are generated via weighted combination between the cyclic-shifted sequences in different antennas, and before this step, the active constellation extension is performed to the IFFT-operated time-domain sequences to reduce PAPR for the first time. While requiring only a small amount of computation, this scheme achieve better performance in reducing PAPR than SLM. Moreover, a blind detection scheme is proposed to estimate SI, so the SI needed in AST-SLM is less than SLM.

The rest of the paper is organized as follows. In Section 2, the main theory of Alamouti STBC MIMO-OFDM system, as well as the definition of PAPR are explained, and the SLM scheme is also described in this section. In Section 3, the AST-SLM and the blind detection scheme for estimating SI are described. In Section 4, the analysis of computational complexity is introduced. In Section 5, the simulation results and analysis are described. Finally, conclusions are given in Section 6.

2. Alamouti STBC MIMO-OFDM and SLM Scheme

2.1 Alamouti STBC MIMO-OFDM

We consider a two-antennas Space Time Block Codes (STBC) MIMO-OFDM system that adopts the Alamouti scheme. The orignal OFDM sequence transmitted in each antenna is denoted by:

[X.sub.i] = [[X.sub.i] (0), [X.sub.i](1),...,[X.sub.i](N - 1)] (1)

where N is the number of subcarriers, i is the index of antenna. The frame structure of the STBC MIMO-OFDM system is expressed as

[mathematical expression not reproducible] (2)

where (*)* indicates complex conjugate. The frames in the first column of [X.sub.STBC] are transmitted from antenna 1 during the first and the next symbol period, respectively. And the frames in the second column of [X.sub.STBC] are transmitted from antenna 2 during the first and the next symbol period, respectively [17].

The time-domain sequence on the antenna i can be expressed as

[mathematical expression not reproducible] (3)

And the PAPR on the [] antenna is defined as:

[PAPR.sub.i] = 10[log.sub.10][max{[|[x.sub.i](k)|.sup.2]}/E{[|[x.sub.i](k)|.sup.2]}](dB) (4)

The PAPR of MIMO-OFDM is defined as:

PAPR = max{[PAPR.sub.i]}, i [member of] [1, 2] (5)

The complementary cumulative distribution function (CCDF ) is usually used to evaluate the PAPR performance in a MIMO-OFDM system, which physically means the probability that the PAPR value exceeds the certain threshold [PAPR.sub.0] [18]

CCDF (PAPR) = [P.sub.r](PAPR > [PAPR.sub.0]) (6)

2.2 SLM scheme

In SLM scheme, the phase distribution of the data frame is changed by multiplying random phase vectors. Fig. 1 depicts the block diagram of SLM scheme. The main idea of SLM scheme can be briefly described as follow

Assume that there are G different random phase sequence vectors with length N

[P.sup.([mu]).sub.i] = [[P.sup.([mu]).sub.i1], [P.sup.([mu]).sub.i2]],...,[P.sup.([mu]).sub.i(N-1)], [mu]=1,2,... G (7)

where [P.sup.([mu]).sub.i] = exp(j[[phi].sup.([mu]).sub.i]), [[phi].sup.([mu]).sub.i] is evenly distributed in [0 2[pi]). However, to reduce the camputational complexity, [[phi].sup.([mu]).sub.i] is uaually set to [0 [pi]/2 [pi] 3[pi]/2]. Then, multiply the [X.sub.i] with [P.sup.([mu]).sub.i] to obtain [X.sup.([mu]).sub.i]:

[mathematical expression not reproducible] (8)

Apply IFFT to [X.sup.([mu]).sub.i] to obtain the time-domain sequences [x.sup.([mu]).sub.i]

[x.sup.([mu]).sub.i] [[x.sup.([mu]).sub.i0], [x.sup.([mu]).sub.i1],...,[x.sup.([mu]).sub.i(N-1)]] (9)


[x.sup.([mu]).sub.i0] = IFFT ([X.sup.([mu]).sub.i0]) (10)

Finally, the time-sequence with the smallest PAPR in [x.sup.([mu]).sub.i] is selected to be transmitted. Meanwhile, the random phase vector [P.sup.([mu]).sub.i] corresponding to [x.sup.([mu]).sub.i] is transmitted as SI. To transmit the SI in SLM, 2N bits is required for each antenna.

3. AST-SLM Scheme

In AST-SLM scheme, the ACE is done on the IFFT-transformed time-domain signal at the transmitter side at first, then various candidate sequence pairs with different PAPR are generated via weighted combination of cyclic-shifted time-domain sequences in different antennas. Compared with SLM algorithm, both the calculational complexity and SI of AST-SLM is significantly reduced. In addition, a blind detection scheme for estimating SI is proposed. And it is noteworthy that various parameters can be adjusted according to the actual system characteristics in AST-SLM scheme, which efficiently improves the flexibility and practicability.

3.1 ACE mudule

The clipping technology efficiently reduces the PAPR of signal, but inevitably causes signal distortion, which leads to fading in frequency band and spreading outside frequency band. However, the technique of constellation extension can largely eliminate the signal distortion caused by the clipping process [20]. Active constellation extension (ACE) can be defined as the combination of clipping technology and constellation extension process, which can be described briefly as follows:

First, clip the time-domain sequence at the [] antenna [x.sub.i], and the clipped sequence [x.sub.ic] can be written as:

[mathematical expression not reproducible] (11)

where [x.sub.i](n) =| [x.sub.i](n)|[e.sup.j[theta](n)], and [A.sub.max] = CR*E{[|[x.sub.i]|.sup.2]}. CR is the constant clipping rate.

Then, apply FFT to [x.sub.ic] to obtain [X.sub.ic]. Checking all the [X.sub.ic](k), as illustrated in Fig. 2, for those constellation points within the dotted line, extend them to the four standard constellation points, and for those constellation points beyond the dotted line and not in the extended area, extend them to the corresponding positions from the nearest thick solid line.

Fig. 3 shows the constellation change of QPSK signal in ACE process. From Fig. 3(a), after clipping process, the constellation becomes divergent and the Euclidean distance between adjacent constellation points gets smaller. That is to say, the clipping process introduces equivalent noise. As shown in Fig. 3(b), in the extended constellation diagram, the Euclidean distance between adjacent constellation points is increased and the noise is effectively reduced.

3.2 Joint space-time selective mapping mudule

Again consider the two-antenna MIMO-OFDM system mentioned above. We assume that the time-domain sequences generated at antenna 1 and antenna 2 after ACE operation are [x.sub.1] and [x.sub.2], respectively. In multicarrier systems, the centralized distribution of subcarrier phases can easily lead to large power peaks [21]. The phase distribution of those new sequences obtained by weighted combination of time-domain sequences on different antennas is more random than the original sequence, and theoretically, their PAPR may be lower [16]. Based on this, a new sequence set generated by weighting [x.sub.1] and [x.sub.2] can be denoted as

[Z.sub.0] = [1/[square root of n]][n.summation over (i=1)] [+ or -] [x.sub.i], n[member of][1,2] (12)

where 1/[square root of n] is the power normalization weighting factor. Since the sign of the time-domain sequence does not affect the PAPR, there are actually only four sequences with different PAPR in Z (0), therefore, we correct it as follow:

[Z.sub.0] = {[x.sub.1],[x.sub.2][square root of 1/2]([x.sub.1] + [x.sub.2]),[square root of 1/2]([x.sub.1] - [x.sub.2])} (13)

Furthermore, to produce more candidate sequences, we cyclic-shift [x.sub.i] with a certain cyclic shift factor [w.sub.i]. to obtain [mathematical expression not reproducible] as follow:

[mathematical expression not reproducible] (14)

where cicshift(*) represents the cyclic shift operation, W is the maximum shift factor. And then the set of candidate sequence can be further expanded by weighted combination of [x.sub.iw] as Eq. (13), which can be expressed as follow:

[mathematical expression not reproducible] (15)

Hence, [W.sup.2] candidate sequence sets can be generated.

[mathematical expression not reproducible] (16)

And the sequence pairs choosed from [Z.sub.j]. can be written as:

[mathematical expression not reproducible] (17)

where a [not equal to] b, a,b[member of][1,2,3,4] and 1 [less than or equal to]l[less than or equal to][C.sup.2.sub.4],0[less than or equal to]j[less than or equal to] [W.sup.2] - 1.

Finally, we consider all the [W.sup.2] candidate emission sequence sets, thus [C.sup.2.sub.4][W.sup.2] sequence pairs with different PAPR can be obtained, and the one with the smallest PAPR is selected as the final transmission sequence pair

[mathematical expression not reproducible] (18)

where [b.sub.11], [b.sub.12], [b.sub.21], [b.sub.22] [member of][0, [+ or -]1, [+ or -]1/[square root of 2]], [[??].sub.1] and [[??].sub.2] denote the cyclic shift factor of [x.sub.1] and [x.sub.2] in [[[[??].sub.1], [[??].sub.1]]], respectively. In order to correctly restore [[x.sub.1] ([[??].sub.1]) [x.sub.2] ([[??].sub.1])] at the receiver side, B is the only SI required to be transmitted. And to restore [x.sub.1] and [x.sub.2], the cyclic shift factors [[[??].sub.1] [[??].sub.2]] are generally transmitted as SI too.

3.3 The proposed blind detection scheme

Under the condition that the complexity of the receiver is not a limit for system design, we propose a blind detection scheme to estimate [[[??].sub.1] [[??].sub.2]], which bolck diagram is shown in Fig. 4 and can be described as follow.

According to the property of Fourier transform, the cyclic shift process on the time-domain sequence x equates to the phase rotation in frequency-domain sequence X [22], which can be denoted as:

IFFT (X (n) * [e.sup.j2[pi]w(n-1)/N]) = cicshif (x, w) (19)

Assume that the cyclic-shifted time-domain sequence [mathematical expression not reproducible] is restored and the number of subcarriers is large enough, the frequency-domain sequences is given as follow:

[mathematical expression not reproducible] (20)

Then the central constellation points of [[??].sub.i] can be written as:

[mathematical expression not reproducible] (21)

where M is the order of the modulation. For example, when a power-normalized QPSK signal has passed through an AWGN channel, its constellation diagram is not a standard QPSK any more, but its central constellation points can be approximately written as

1/[square root of 2][1 + i,-1 + i,-1 - i,1 - i], i = [square root of -1] (22)

Suppose that the candidate set of cyclic shift factor is known to the receiver side, which is [0,..., W -1]. The W anti-rotation sequences can be obtained by the reverse phase rotation of [[??]'.sub.i] according to Eq. (19)

[mathematical expression not reproducible] (23)

where [X.sup.'] is the standard central constellation points of the adopted modulation. There must be an anti-rotation sequence which have the smallest Euclidean distance with [X.sup.'.sub.i]. Thus, the estimation of [[[??].sub.1] [[??].sub.2]] can be described as:

[mathematical expression not reproducible] (24)

The most innovative feature of this blind detection scheme is the estimation of cyclic shift factors in the receiver side. So B is the only SI required to be transmitted. Although the computational complexity in receiver is increase, but the complexity of the whole system is reduced compared with SLM, which will be detailedly explained in Section 4.

3.4 The transmitter side of AST-SLM

The Block diagram of AST-SLM scheme is shown as Fig. 5, and the specific steps of the AST-SLM in transmitter side are summarized as follows

Step 1 Map the data bit stream to the certain modulation constellation (MPSK/MQAM), then perform STBC encoding to obtain the frequency-domain sequence on different antennas.

Step 2 Set the clipping rate CR and the maximum number of ACE iteration [M.sub.t], and set the current iteration number m = 1.

Step 3 Apply IFFT transformation on [X.sub.i] ([[??].sub.i]) to obtain the time-domain sequence [x.sub.i] ([[??].sub.i]), then implement clipping operation as Eq. (11).

Step 4 Turn the switch [K.sub.i] to the 1, perform FFT transformation on [x.sub.i] ([[??].sub.i]) to obtain a new frequency-domain sequence [[??].sub.i], and perform constellation expansion on [[??].sub.i], set m = m +1.

Step 5 Repeat step 3 and step 4 till m = [M.sub.t].

Step 6 Turn the switch [K.sub.t] to the 2, and oversample [x.sub.i] with the oversample rate L,

[x.sub.i] =IFFT [[[??]]] (25)


[mathematical expression not reproducible] (26)

Step 7 Cyclic-shift [x.sub.i], with shift factor [W.sub.i], [W.sub.i][member of] [0,1,... W-1] to get [mathematical expression not reproducible] and [mathematical expression not reproducible] using Eq. (14);

Step 8 Weight the [mathematical expression not reproducible] and [mathematical expression not reproducible] to get a new sequence set [mathematical expression not reproducible] using Eq. (15);

Step 9 Choose the sequence pair with the smallest PAPR in [Z.sub.p],0[less than or equal to]p[less than or equal to][W.sup.2] -1 as the transmission sequence pair [[[??].sub.1], [[??].sub.2]].

3.5 The receiver side of AST-SLM

After channel transmission, the sequence pair in receivier side is denoted as [[Y.sub.1],[y.sub.2]], the relationships between [[y.sub.1],[y.sub.2]] and the transmitted sequence pair [[[??].sub.1], [[??].sub.2]] can be expressed as:

[mathematical expression not reproducible] (27)

where [h.sub.ij] (i, j = 1, 2) represents the impulse response of the channel, and [n.sub.i]. (i = 1, 2) represents the channel noise. The sequence pair obtained after channel equalization is written as [[[??]*.sub.1], [[??]*.sub.1]]

[mathematical expression not reproducible] (28)

where [n*.sub.i], i [member of] [1, 2] is the sum of channel noise and channel equalization equivalent error noise. And the recovered cyclic-shifted sequence is given as:

[mathematical expression not reproducible] (29)

Finally, the original sequence can be restored by inversely cyclic-shifting the [mathematical expression not reproducible] with the estimated [[[bar.W].sub.1], [[bar.W].sub.2]], that is

[mathematical expression not reproducible] (30)

Now we consider the SI needed in AST-SLM. More specifically, to transmit b and [[[??].sub.1] [[??].sub.2]], only 8 and 2[log.sub.2]W bits is needed, respectively. If the [[[??].sub.1] [[??].sub.2]] is estimated by the blind detection scheme, then B is the only SI of AST-SLM, that is to say, only 8 bits is required. Here we define SI reduction ratio (SRR), which can be expressed as:

SRR = (1 - [SI of AST-SLM/SI of SLM]) x 100% [greater than or equal to] (1-[8+2[log.sub.2]W/4N]) x 100% (31)

Since N [greater than or equal to] 64 and W [less than or equal to] N in practical MIMO-OFDM systems, thus SRR [greater than or equal to] 92.1% can be guaranteed. In other words, AST-SLM further reduces the SI by at least 92.1% compared to SLM, so the higher spectrum utilization can be realized in the system.

4. Complexity Analysis

In this section, we analyse the computational complexity of AST-SLM, SLM, ACE and PTS. It is noteworthy that the computational complexity of AST-SLM depends on whether the cyclic shift factors [[w.sub.1], [w.sub.2]] are known to the receiver, so we discuss the two situations in AST-SLM: cyclic shift factors are known (AST-SLM1) and unknown (AST-SLM2). To simplify the model, we only consider the complex multiplication (CM) and complex addition (CA) as indication of computational complexity.

4.1 Calculational complexity of transmitter

Assum that the number of subcarriers is N and the oversample rate is L, the computational complexity for a N -points IFFT/FFT transformation at the transmitter are N[log.sub.2]N/2 CMs and N[log.sub.2]N CAs. We firstly consider the ACE module of the AST-SLM scheme. In the first [M.sub.t] -1 iterations, only one N -point IFFT and FFT are performed each iteration. Whereas, only one LN -points IFFT is needed in the last iteration. Therefore, ([M.sub.t]-1)N[log.sub.2]N+LN[log.sub.2]LN CMs and 2([M.sub.t]-1)N[log.sub.2]N + 2LN[log.sub.2]LN CAs are required in the ACE module. Next, we consider the joint space-time selective mapping module. 4[W.sup.2]LN CAs are required to weighted-combine the cyclic-shifted sequences on different antennas. Thus, the number of CM and CA required in tranmitter of AST-SLM scheme are ([M.sub.t]-1)N [log.sub.2]N+LN[log.sub.2]LN and 2([M.sub.t] -1)N[log.sub.2]N + 2LN ([log.sub.2] LN+2[W.sup.2]), respectively.

Under the same conditions that the number of alternative sequences is [W.sup.2], the number of CM and CA required in SLM are [W.sup.2]LN [log.sub.2] LN and 2[W.sup.2]LN [log.sub.2] LN, respectively. And for ACE, they are ([M.sub.t]-1)N[log.sub.2]N+LN[log.sub.2]LN and 2([M.sub.t]-1)N[log.sub.2]N + 2LN[log.sub.2]LN. However, for PTS, [W.sup.2] = [V.sup.P], V is the partition number of OFDM signal, and P=4 is the elements number of phase set [[phi].sup.([mu]).sub.i] = [0 [pi]/2 [pi] 3[pi]/2]. So the

number of CM and CA required in PTS are [square root of W]WLN [log.sub.2] LN and 2[square root of W]LN [log.sub.2] LN, respectively.

4.2 Calculational complexity of receiver

Under the condition that the SI B is known, in the receiver side of AST-SLM, the received sequence pair [[[??]*.sub.1], [[??]*.sub.1]] is firstly operated based on Eq. (29), then the cyclic-shifted sequences [mathematical expression not reproducible] are recovered, and the computational complexity for this step is 2LN CAs.

When cyclic shift factors [[w.sub.1], [w.sub.2]] is known to the receiver as SI, to restore [x.sub.i], reverse cyclic shift operation is applied to [mathematical expression not reproducible] to obtain [[bar.x].sub.i] as Eq. (30). This step do not require any CA or CM. Then, FFT is performed on [[bar.x].sub.i] to obtain the restored frequency-domain sequences [[bar.X].sub.i], where LN[log.sub.2]LN CMs and 2LN[log.sub.2]LN CAs are required. Thus, LN[log.sub.2]LN CMs and 2LN(1 + [log.sub.2]LN) CAs are required in AST-SLM.

If [[w.sub.1], [w.sub.2]] is unknown to the receiver, FFT is first performed on [mathematical expression not reproducible] to obtain the frequency-domain sequences with phase deflection [mathematical expression not reproducible], where LN[log.sub.2]LN CMs and 2LN[log.sub.2]LN CAs are required. To estimate [[w.sub.p][w.sub.2]], 2WN CMs are needed for the proposed blind detection scheme. Thus, N(2W + L[log.sub.2]LN) CMs and 2LN(1+[log.sub.2]LN) CAs are required.

When SI is known, the other three algorithms have the same computational complexity at the receiver, LN[log.sub.2]LN CMs and 2LN[log.sub.2]LN CAs.

Table 1 summarizes the computational complexity of the above four schemes. As can be seen, many parameters affect the computational complexity. And the value of subcarrier number N and maximun cyclic shift factor W are closely related to the computational complexity. Their relationships are shown in Fig. 6 and Fig. 7.

As illustrated in Fig. 6, as N increases, the computational complexity of the four schemes increase both in the transmitter side and the receiver side. Compared to SLM and PTS, the computational complexity in the transmitter side of AST-SLM and ACE is decreased greatly. In the receiver side, computational complexity of AST-SLM is slightly increased when cyclic shift factor is not transmitted as SI. This is because the estimation of cyclic shift factor requires computational effort.

Fig. 7 shows that, with the increase of W, the computational complexity of the four schemes increase in the transmitter side, but almost stay unchanged in the receiver side(when cyclic shift factor is transmitted as SI). Under the situation that cyclic shift factor is not transmitted as SI, AST-SLM need more computational complexity in the receiver side than other schemes. However, in the transmitter side, the computational complexity (especially CM) of AST-SLM is greatly reduced compared to SLM and PTS.

We defined computational complexity reduction ratio(CCRR) to get better comparison of computational complexity between AST-SLM and SLM. The CCRR can be writed as:

CCRR = (1-[complexity of AST-SLM/complexity of SLM])x100% (32)

where the complexity includes the complexity of transmitter and receiver.

Table 2 gives the CCRR under different values of N and W, and we set L = 4, Mt = 2. As can be seen, all the CCRR values are greater than 86%, some CCRR values are even close to 100%. This proves once again that the computational complexity of AST-SLM is much lower than SLM.

5. Simulation Results and Analysis

The PAPR and BER performance of the above mentioned schemes is simulated in this section. The parameters considerd in the MATLAB simulation are given as Table 2.

5.1 PAPR performance

Fig. 8 is the CCDF curve of AST-SLM scheme under different parameter settings. As shown, the PAPR performance of AST-SLM is closely related to the maximum shift factor W, the clipping rate CR, and the number of ACE iterations [M.sub.t]. Specifically, the PAPR performance is positively correlated with the values of W and [M.sub.t], and negatively correlated with the values of CR. It is because that the PAPR reduction performance is improved with [M.sub.t] increasing and CR decreasing, and the number of alternative transmision sequence pairs is increased as W increase. For example, when W = 4 and CR = 3, the [10.sup.-3] PAPR is about 0.1dB reduced when increasing [M.sub.t] = 2 to 4. When W = 4 and [M.sub.t] = 2, the [10.sup.3] PAPR is approximately 0.35dB reduced when decreasing CR = 4 to 3. And when [M.sub.t] = 2 and CR = 3, the [10.sup.-3] PAPR is 0.38dB reduced when increasing W = 4 to 10. However, [M.sub.t] and CR can not be too large or too small, otherwise, the signal distortion is serious. In addition, the larger the W and [M.sub.t] are, the more the computational complexity is increased, which lead to the reducing of the real-time performance of the scheme. Therefore, in practical applications, the algorithm parameters should be flexibly configured according to the real-time requirements of systems.

Fig. 9 indicates the CCDF curves of the four schemes. From the results, the CCDF curve of AST-SLM is steeper than SLM, ACE and PTS, indicating that the PAPR reduction performance of AST-SLM is efficiently improved. Let W be the same value, when CCDF = [10.sup.-3], the PAPR of AST-SLM is 0.5dB lower than SLM and PTS. Moreover, AST-SLM also outperforms ACE in PAPR performance. The reason is that, in AST-SLM, the PAPR is drastically reduced twice. The first time is achieved by ACE process and the second time is realized by joint space-time selective mapping.

5.2 BER performance

Fig. 10 shows the BER performance curves of the four schemes in the receiver side when passing through the fading multipath channel with Doppler frequency shift. The time delay of the channel is [0 0.012 0.024 0.036 0.048 0.06] T, where T is the symbol period, and the path energy is [1.0 0.6095 0.4945 0.394 0.2371 0.19], and the maximum Doppler shift is set to 0.01 [DELTA]f, where [DELTA]f is the subcarrier frequency spacing. It is noteworthy that the BER performance of the AST-SLM is almost unaffected by the maximum shift factor W, but is slightly worse than the SLM and PTS. And the reason is twofold: on the one hand, the ACE module introduces the signal distortion to the system, on the other hand, the signal variance increases in the process of generating the candidate sequence pairs by weighted combination between sequence on different antennas, which introduces more noise than SLM and PTS. However, there are some remedial measures can be done to reduce the signal distortion which introduced by ACE, such as filtering. This will be the focus of our next research.

6. Conclusion

In this paper, a low-complexity method based on active constellation extension and joint space-time SLM (AST-SLM) for reducing PAPR in Alamouti STBC MIMO-OFDM systems is proposed. The proposed method can obtain better PAPR reduction performance and require less SI than SLM, PTS and ACE. And compared to SLM and PTS, the computational complexity of AST-SLM is greatly reduced in transmitter side. In addition, a blind detection scheme to estimate SI is proposed, which greatly reduced the SI. Though the BER performance of AST-SLM is slightly worse than SLM and PTS, but AST-SLM still outperforms them by its greater PAPR reduction performance and lower computational complexity.


[1] Yu-Kuan Chang, Fang-Biau Ueng, Yi-Wei Jhang, "Turbo MIMO-OFDM Receiver in Time-Varying Channels," KSII Transactions on Internet & Information Systems, Vol. 12, No. 8, pp. 3704-3724, August 2018. Article (CrossRef Link).

[2] "Ieee approved draft standard for it - telecommunications and information exchange between systems - LAN/MAN - specific requirements--part 11: Wireless LAN medium access control and physical layer specifications- amd 4: Enhancements for very high throughput for operation in bands below 6ghz," IEEEP802.11ac/D7.0, pp. 1-456, December, 2013. Article (CrossRefLink).

[3] "IEEE standard for local and metropolitan area networks part 16: Air interface for fixed and mobile broadband wireless access systems amendment 2: Physical and medium access control layers for combined fixed and mobile operation in licensed bands and corrigendum 1," IEEE Std 802.16e-2005 and IEEE Std 802.16-2004/Cor 1-2005 (Amendment and Corrigendum to IEEE Std 802.16-2004), pp. 1-822, 2006. Article (CrossRef Link).

[4] Shu-Ming Tseng, Yung-Fang Chen, "Average PSNR Optimized Cross Layer User Grouping and Resource Allocation for Uplink MU-MIMO OFDMA Video Communications," IEEE Access, vol. 6, pp. 50559-50571, 2018. Article (CrossRef Link).

[5] Sampath H, Talwar S, Tellado J, et al., "A fourth-generation MIMO-OFDM broadband wireless system: design, performance, and field trial results," IEEE Communications Magazine, vol. 40, no. 9, pp. 143-149, 2002. Article (CrossRef Link).

[6] Hao Y H, "Research on MIMO-OFDM Technology Based on PDM Method for 5G Systems," Mobile Communications, 2016. Article (CrossRef Link).

[7] S. M. Alamouti, "A simple transmit diversity technique for wireless communications," IEEE J. Sel. Areas Commun., vol. 16, pp.1451-1458, Oct. 1998. Article (CrossRef Link).

[8] Li X, Cimini L J J, "Effects Of Clipping And Filtering On The Performance Of Ofdm," IEEE Communications Letters, vol. 2, no. 5, pp. 131-133, 1998. Article (CrossRef Link).

[9] Bauml. R., W. Fischer. et al, "Reducing the peak-to-average power ratio of multicarrier modulation by selected mapping," Electronics Letters, vol. 32, no.22, pp.2056-2057, 1996. Article (CrossRef Link).

[10] Yang Z, Fang H, Pan C, "ACE with frame interleaving scheme to reduce peak-to-average power ratio in OFDM systems," IEEE Transactions on Broadcasting, vol.51, no.4, pp.571-575, 2005. Article (CrossRef Link).

[11] Kang S G, Kim J G, Joo E K, "A novel subblock partition scheme for partial transmit sequence OFDM," IEEE Transactions on Broadcasting, vol. 45, no.3, pp.333-338, 1999. Article (CrossRef Link).

[12] More. A. P, Somani. S. B, "The reduction of PAPR in OFDM systems using clipping and SLM method," in Proc. of International Conference on Information Communication and Embedded Systems. IEEE, pp.593-597, 2013. Article (CrossRef Link).

[13] Kou. Y. J, Lu. W. S, Antoniou. A, "A New Peak-to-Average Power-Ratio Reduction Algorithm for OFDM Systems via Constellation Extension," IEEE Trans Wireless Commun, vol.6, no.5, pp.1823-1832, 2007. Article (CrossRef Link).

[14] Jiang T, Ni C, Guan L, "A Novel Phase Offset SLM Scheme for PAPR Reduction in Alamouti MIMO-OFDM Systems Without Side Information," IEEE Signal Processing Letters, vol.20, no.4, pp. 383-386, 2013. Article (CrossRef Link).

[15] Ayad. A. Abdulkaf, Mohamad. Yusoff. Alias, et al, "A Hybrid PAPR Reduction Scheme for Optical Wireless OFDM Communication Systems," KSII Transactions on Internet & Information Systems, Vol. 12, No. 3, pp. 1136-1151, March 2018. Article (CrossRef Link).

[16] Hu Wujun, Yang Lin, "An improved SLM algorithm based on cyclic shift and signal combination in MIMO-OFDM systems," JOURNAL OF COMPUTATION, vol.36, no.4, pp. 170-177, 2015.

[17] Vijayalakshmi. M, Rama. L. R. K., "Efficient PAPR Reduction Approach for Selective Mapping in a STBC MIMO-OFDM System," International Journal of Computer Networks & Communications, vol.10, no.3, pp.45-53, 2018. Article (CrossRef Link).

[18] Liu Fang, Wang Yong, "Peak-to-average ratio suppression algorithm for reserved subcarrier OFDM signal with joint constellation extension," Transactions of Communications, vol.37, no.3, pp. 175-181, 2016.

[19] Yang Z, Fang H, Pan C, "ACE with frame interleaving scheme to reduce peak-to-average power ratio in OFDM systems," IEEE Transactions on Broadcasting, 2005, vol.51, no.4, pp. 571-575, 2005. Article (CrossRef Link).

[20] Bae. K, Andrews. J. G, Powers E. J, "Adaptive active constellation extension algorithm for peak-to-average ratio reduction in OFDM," IEEE Communications Letters, vol. 14, no.1, pp.39-41, 2010. Article (CrossRef Link).

[21] Tan. M, Latinovic. Z, Bar-Ness. Y, "STBC MIMO-OFDM peak-to-average power ratio reduction by cross-antenna rotation and inversion," IEEE Communications Letters, vol.9, no.7, pp.592-594, 2005. Article (CrossRef Link).

[22] Mallat S, Hwang W L, "Singularity detection and processing with wavelets," IEEE Press, vol.38, no.2, pp.617-643, 1992. Article (CrossRef Link).

Guang Li received the B.S. degree in National Digital System Engineering and Technological Research Center, Zhengzhou, China in 2017. He is currently working towards the M.S. degree on signal processing in National Digital System Engineering and Technological Research Center. His research interests are in OFDM signal demodulation and channel estimation.

Tianyun Li is an associate professor of National Digital System Engineering and Technological Research Center, Zhengzhou, China. He received his PhD in communication engineering in National Digital System Engineering and Technological Research Center in 2011. His research interests includes signal processing and parameter estimation.

Guang Li (1*), Tianyun Li (1)

(1) National Digital System Engineering and Technological Research Center Zheng Zhou 450000, China


(*) Corresponding author: Guang Li

Received October 21, 2018; revised December 1, 2018; accepted January 14, 2019; published June 30, 2019
Table 1. Computational complexity of the transmitter side and receiver

Algorithm               CM                    CA

([[w.sub.1][W.sub.2]]   ([m.sub.t]-1)         2([m.sub.t]-1)
is known)               N[log.sub.2] N        N[log.sub.2] N
AST-SLM2                +LN [log.sub.2] LN    +2LN([log.sub.2] LN +
([[W.sub.1],[W.sub.2]]                        2[W.sup.2])
is unknown)
SLM                     [W.sup.2]LN           2[W.sup.2]LN
                        [log.sub.2] LN        [log.sub.2] LN
ACE                     ([m.sub.t]-1)         2([m.sub.t]-1)N
                        N[log.sub.2] N        [log.sub.2]N +2LN
                        +LN [log.sub.2] LN    [log.sub.2] LN
PTS                     [square root of W]LN  2[square root of W]LN
                        [log.sub.2] LN        [log.sub.2] LN

Algorithm               CM                  CA

([[w.sub.1][W.sub.2]]   LN [log.sub.2] LN   2LN(1 + [log.sub.2] LN)
is known)
AST-SLM2                N (2W + L
([[W.sub.1],[W.sub.2]]  [log.sub.2] LN)
is unknown)
SLM                     LN [log.sub.2] LN   2LN [log.sub.2] LN
ACE                     LN[log.sub.2] LN    2LN[log.sub.2] LN
PTS                     LN [log.sub.2] LN   2LN [log.sub.2] LN

Table 1. CCRR of AST-SLM

State of               N = 64             N = 256           N = 1024
[[w.sub.1],[w.sub.2]]  CM       CA        CM         CA   CM      CA

known     W = 4        87.9%    86.2%     87.5%   86.4%   87.2%   86.5%
          W = 10       98.1%    97.6%     98.0%   97.7%   97.9%   97.7%
          W = 16       99.2%    99.0%     99.2%   99.1%   99.2%   99.1%
unknown   W = 4        86.3%    86.2%     86.2%   86.4%   86.2%   86.5%
          W = 10       97.4%    97.6%     97.5%   97.7%   97.5%   97.7%
          W = 16       98.8%    99.0%     98.9%   99.1%   98.9%   99.1%

Table 3. Parameters in simulation

Parameter                              Specification

System                                 STBC MIMO-OFDM system with two
                                       transmit antennas
Channel                                fading multipath channel with
                                       Doppler frequency shift
Subcarriers number (N)                  1024
Oversampling rate (L)                      4
Clipping rate (CR)                         2,3
Maximum shift factor (W)                   4,10,16
partition number of PTS (V)                2,4
Number of ACE iterations([M.sub.t])        2,4
Random phase in                            0, [pi]/2, [pi], 3[pi]/2
Modulation                             QPSK
Time of simulations                    10000
COPYRIGHT 2019 KSII, the Korean Society for Internet Information
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2019 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Author:Li, Guang; Li, Tianyun
Publication:KSII Transactions on Internet and Information Systems
Date:Jun 1, 2019
Previous Article:A Neoteric Three-Dimensional Geometry-Based Stochastic Model for Massive MIMO Fading Channels in Subway Tunnels.
Next Article:A Water-saving Irrigation Decision-making Model for Greenhouse Tomatoes based on Genetic Optimization T-S Fuzzy Neural Network.

Terms of use | Privacy policy | Copyright © 2021 Farlex, Inc. | Feedback | For webmasters