Keywords

1 Introduction

Orthogonal Frequency Division Multiplexing (OFDM) is a technique in which high rate serial data is converted into low rate parallel data and increases symbol duration. International standards using OFDM in wireless LAN, WiMAX, Mobile broadband wireless access (MBWA) and Broadcasting Radio Access Network (BRAN) committees [1, 2]. OFDM provides multipath fading and impulse noise free transmission and minimizes complexity of equalizers (single tap equalizer is sufficient). Hardware complexity of OFDM implementation is greatly reduced by using Fast Fourier Transform (FFT). OFDM suffers from Inter carrier interference (ICI) due to frequency offsets and increase in Peak to Average Power Ratio (PAPR) due to coherent addition of subcarriers [1, 3]. Increase in PAPR causes in band distortion and out of band radiation due to clipping and spectral broadening respectively [4].

There are many techniques to reduce PAPR such as amplitude clipping, recursive clipping and filtering (RCF), coding, tone reservation (TR), tone injection (TI), active constellation extension (ACE), Partial Transmit Sequence (PTS), Selective Level Mapping (SLM) and interleaving. SLM and PTS reduce PAPR significantly without loss of any information [13], but in PTS latency increases with number of sub blocks. In this paper, SLM is considered for reduction of PAPR using various phase sequences. The PAPR improvement changes with phase sequences. Hence the selection of phase sequence is very important for better improvement of PAPR. This paper investigated for optimum phase sequences for better PAPR performance improvement. Firstly, the improvement of PAPR using SLM technique and pseudorandom phase sequence is carried out. Later the phase sequences namely Riemann, Hadamard, Chaotic, modified Chu, Rudin Shapiro, Novel and Modified phase sequences are replaced and the results are compared. Riemann, chaotic, modified Chu, Hadamard and Novel phase sequences are well described in [510] respectively.

2 PAPR Problem in OFDM System

OFDM System

Let total information bits (M) are grouped into N symbols (Xk, k = 0, 1, ….N − 1) and each symbol is modulated on one of a set of orthogonal subcarriers The total bandwidth of system W is divided into N sub bands, then the individual subcarrier bandwidth is W/N and it is less than the coherence bandwidth Bc. Hence the frequency selective fading channel is converted into flat fading channel (W/N < Bc), and OFDM symbol duration is increased by N times. OFDM signal can be defined as

$$ x\left( t \right) = \frac{1}{\sqrt N }\mathop \sum \limits_{K = 0}^{N - 1} X_{k} e^{{j2\pi f_{k} t}} ,\quad 0 \le t \le NT $$
(1)

where \( j = \sqrt { - 1} \). As input data streams are orthogonal, the real and imaginary parts of x(t) are uncorrelated and according to the central limit theorem, the distribution of these parts approach Gaussian distribution for large N with zero mean and variance \( \sigma^{2} = E\left[ {\left| {Re\left\{ {x\left( t \right)} \right\}} \right|^{2} + \left| {Im\left\{ {x\left( t \right)} \right\}} \right|^{2} } \right]/2 \), where E[x] is the average value of x. the Probability Density Function (PDF) of OFDM signal is

$$ P_{r} \left\{ {x\left( t \right)} \right\} = \frac{1}{{\sqrt {2\pi \sigma^{2} } }}e^{{ - \frac{{[x\left( t \right)]^{2} }}{{2\sigma^{2} }}}} $$
(2)

Original OFDM signal has Rayleigh nature, uniform phase and its PDF is

$$ P_{r} \left( r \right) = 2re^{{ - r^{2} }} $$
(3)

where ‘r’ indicates OFDM signal level.

PAPR Problem

In OFDM, the peak power increases with number of subcarriers and much larger compare to average power due to coherent addition of subcarriers. This high PAPR moves signal into non-linear region of amplifier and degrades its efficiency. The PAPR of OFDM signals x(t) is

$$ PAPR\left[ {x\left( t \right)} \right] = \frac{{P_{peak} }}{{P_{average} }} = 10\,\log_{10} \frac{{\hbox{max} [\left| {X(n)} \right|^{2} ]}}{{E[\left| {X_{n} } \right|^{2} ]}} $$
(4)

where E[] denotes expected value. If this ratio is beyond threshold level, signal distortion due to clipping and radiation due to spectral broadening will occur. For large N, Rayleigh distributed OFDM signal peak will increase with non zero probability and its probability exceeds a threshold

$$ P_{0} = \frac{{\sigma_{0}^{2} }}{{\sigma_{n}^{2} }} . $$
(5)
$$ P\left( {PAPR \ge P_{0} } \right) = 1 - (1 - e^{{ - P_{0} }} )^{N} $$
(6)

Relation Between PAPR and Subcarriers

Let there are N Gaussian independent and identically distributed random Variables \( x_{n} ; 0 \le n \le N - 1 \) with zero mean and unit power. Average power \( E_{n} = \left( {x\left[ n \right]} \right)^{2} \) is

$$ E\left[\{ {\frac{1}{\sqrt N }(\left| {X_{0} + X_{1} + X_{2} + \cdots + X_{N - 1} } \right|)}\}^{2} \right] $$
(7)
$$ \frac{1}{N}E(\left| {X_{0} + X_{1} + X_{2} + \cdots + X_{N - 1} } \right|)^{2} = \frac{{E\left| {x_{0} } \right|^{2} }}{N} + \frac{{E\left| {x_{1} } \right|^{2} }}{N} + \cdots + \frac{{E\left| {x_{N - 1} } \right|^{2} }}{N} = 1 $$

Value increases with number of coherent subcarrier

$$ { \hbox{max} }\left[ {\frac{1}{\sqrt N }(\left| {X_{0} + X_{1} + X_{2} + \cdots + X_{N - 1} } \right|)} \right]^{2} = \left[ {\left| {\frac{N}{\sqrt N }} \right|} \right]^{2} = \left| {\sqrt N } \right|^{2} = N $$

Therefore maximum PAPR of OFDM with N subcarriers is N.

Selective Level Mapping

In SLM, multiple data blocks of same information is generated and array multiplied with various phase vectors as shown in the Fig. 1. The sequence with minimum PAPR is considered for transmission. Every data block is array multiplied by V different phase sequences, each of length N, V(m) = [vm,0, vm,1, …, vm,N−1]T, m = 1, 2, …, M, resulting in M new (modified) data blocks.

Fig. 1
figure 1

Block diagram of OFDM transmitter with SLM

The new block for the mth sequence is

$$ X\left( m \right) = [X_{{0 V_{m,1} }} ,X_{{1V_{m,2} }} , \ldots X_{{N - 1 v_{m,N - I} }} ]^{T} $$
(8)

where m = 1, 2, …, M.

Among new data blocks X (m), m = 1, 2… M, the one with the minimum PAPR is considered for transmission. The amount of PAPR performance improvement depends on number of duplicate candidates (M) and type of phase sequence. The reduction of PAPR is proportional to M, but increase in M increases overhead information in terms of index length (log2M) as side information. Hence M should not be large. Therefore selection of phase sequence play vital role in improving PAPR performance.

3 PAPR Mitigating Phase Sequences

Riemann Sequence

Riemann matrix (R) can be defined as

$$ R\left( {p,q} \right) = \begin{array}{*{20}l} {{\text{p }}{-} 1} \hfill & {{\text{if}}\,{\text{p}}\,{\text{divides}}\,{\text{q}}} \hfill \\ { - 1 } \hfill & {\text{otherwise}} \hfill \\ \end{array} $$
(9)

Here first row and column of the Riemann matrix have to remove to obtain required matrix.

Chaotic Sequence

In this approach concentric circle constellation (CCC) based mapping is considered to obtain the data symbols. This sequence exhibits random behaviour. The M-ary chaotic sequence Cn €{0, 1, 2,…M − 1}, 0 ≤ n ≤ N − 1 and Cn is given by

$$ \begin{array}{*{20}l} {{\text{C}}_{\text{n}} = \left[ {\frac{{{\text{M}}_{{{\text{y}}_{{{\text{n}} + 1}} }} }}{2}} \right] + \frac{\text{M}}{2},} \hfill & {{\text{y}}_{{{\text{n}} + 1}} = {\text{f}}\left( {{\text{y}}_{\text{n}} } \right) = 1 -\upalpha{\text{y}}_{\text{n}}^{2} ,} \hfill \\ {\upalpha\, \in \,\left[ {1.4015,1.99} \right],} \hfill & {{\text{y}}_{\text{n}} \in \left( { - 1,1} \right)} \hfill \\ \end{array} $$
(10)

C r, the rth element of first phase sequence becomes P 1r  = exp(j2πC r/M).

Rudin Shapiro Sequence

Every element of this sequence is either +1 or −1. The nth term of the sequence, b n , is

$$ a_{n} = \mathop \sum \nolimits \varepsilon_{i} \varepsilon_{i + 1} \quad {\text{and}}\quad b_{n} = \left( { - 1} \right)^{{a_{n} }} $$
(11)

where ε i indicates the digits of n (binary form). Therefore a n  gives the number of occurrences of the sub-string 11 in the binary expansion of n.

b n  = +1 for a n  is even and bn = −1 for a n  is odd. This sequence can be generated by

$$ {\text{b}}_{{2{\text{n}}}} = {\text{b}}_{\text{n}} \quad {\text{and}}\quad {\text{b}}_{{2{\text{n}} + 1}} = \left( { - 1} \right)^{\text{n}} {\text{b}}_{\text{n}} $$
(12)

Chu Sequence

In this scheme, the phase sequence is defined as \( {\text{B}}^{{({\text{u}})}} = \left[ {{\text{B}}_{0}^{{({\text{u}})}} ,{\text{B}}_{1}^{{({\text{u}})}} , \ldots \ldots \ldots .{\text{B}}_{{{\text{N}} - 1}}^{{({\text{u}})}} } \right] \). The \( {\text{b}}_{\text{k}}^{{({\text{u}})}} \) is the kth element of a phase sequence. It is defined as

$$ {\text{b}}_{\text{k}}^{{({\text{u}})}} = \left\{ {\begin{array}{*{20}l} {{ \exp }\left( {{\text{i}}\frac{{2\uppi}}{\text{N}}\left[ {\frac{{{\text{uk}}^{2} }}{2}} \right]} \right), } \hfill & {{\text{N}}\,{\text{even}}} \hfill \\ {{ \exp }\left( {{\text{i}}\frac{{2\uppi}}{\text{N}}\left[ {\frac{{{\text{uk}}\left( {{\text{k}} + 1} \right)}}{\text{N}}} \right]} \right),} \hfill & {{\text{N}}\,{\text{odd}}} \hfill \\ \end{array} } \right. $$
(13)

Pseudo Random Sequence

This sequence can be generated randomly in terms of exponential sequence. The phase sequence is defined as

$$ p\left( u \right) = \exp \left( {\frac{\pi i}{n}} \right) $$
(14)

where n is a random angle value to generate the exponential phase sequence.

Modified Sequence

In the proposed approach, the matrix elements obtained by the multiplication of the normalised matrices is considered as phase rotation sequence. The first matrix is defined as

$$ \begin{aligned} & {\text{A}}\left( {\text{p, q}} \right)\, { = }\, 0 {\text{ if k}}\,{ = }\, 0\\ & { = }\, - 1 {\text{ if k }}\,{ < }\, 0\\ & { = }\, 1 {\text{ if k }}\,{ > }\, 0 {\text{ where k }}\,{ = }\, {\text{p}} \,{-}\, {\text{q}} .\\ \end{aligned} $$

The second matrix is defined as

$$ \begin{aligned} & {\text{B}}\left( {{\text{p}},{\text{ q}}} \right)\, = \, 1 {\text{ if p divides q}} \\ & = \, - 1 {\text{ else}} \\ \end{aligned} $$

The final matrix (phase elements) is obtained by multiplying the above matrices.

$$ C\left( {i,j} \right) = A\left( {i,j} \right)* B\left( {i,j} \right) $$
(15)

4 Digital Modulation Schemes

Digital modulation schemes are of binary and M-ary. If the bandwidth of the channel is not sufficient for desired data transmission, M-ary digital modulation schemes are preferred. In general OFDM systems are designed for high data rate applications, so M-ary signaling schemes especially M-ary PSK and QAM are used. Detailed description about M-ary PSK and QAM performance are given in [11].

5 Results and Conclusions

The probability of the OFDM Signal PAPR exceeds a threshold value γ is

$$ P_{r} \left\{ {PAPR\left[ {x\left( n \right)} \right] > \gamma } \right\} = 1 - \left( {1 - e^{ - \gamma } } \right)^{N} $$

Here the PAPR improvement is verified by considering 4096 bits for various phase sequences. From the results it is observed that PAPR reduction improvement is better for Riemann sequence and also it is observed that improvement increases with order of modulation. Increase in order improves the spectral efficiency. Modified phase sequence performance is better over other sequences at higher order modulation schemes (Figs. 2, 3, 4, 5, 6, 7 and 8).

Fig. 2
figure 2

Comparision of PAPR reduction for various phase sequences with 16PSK

Fig. 3
figure 3

Comparision of PAPR reduction for various phase sequences with 16QAM

Fig. 4
figure 4

Comparision of PAPR reduction for various phase sequences with 8PSK

Fig. 5
figure 5

Comparision of PAPR reduction for various phase sequences with 8QAM

Fig. 6
figure 6

Comparision of PAPR reduction for various phase sequences with QPSK

Fig. 7
figure 7

Comparision of PAPR reduction for various phase sequences with BPSK

Fig. 8
figure 8

Comparision of PAPR reduction for various phase sequences with 64QAM

6 Conclusions

In this paper, the main problem of OFDM system, high PAPR and its significance is discussed. SLM scheme is implemented for reduction of PAPR and the reduction performance for various PAPR minimization phase sequences is compared. For higher order modulation schemes, the PAPR performance improvement is better. The PAPR reduction improvement using Modified phase sequence is far better for higher order modulation schemes compare to other phase sequences and competent with Riemann phase sequence. This sequence is less complex and easier for implementation and transmission of side information along with desired data is not required. Hence it is more bandwidth efficient.