Constrained pattern extension algorithm based peak power reduction techniques for MIMO-OFDM applications

Journal Pre-proof Constrained Pattern extension algorithm based peak power reduction techniques for MIMO-OFDM applications B. Ramesh, J. Senthilkumar, Y. Suresh, V. Mohanraj

PII: DOI: Reference:

S0140-3664(19)30490-6 https://doi.org/10.1016/j.comcom.2019.08.021 COMCOM 5939

To appear in:

Computer Communications

Received date : 23 May 2019 Revised date : 16 August 2019 Accepted date : 24 August 2019 Please cite this article as: B. Ramesh, J. Senthilkumar, Y. Suresh et al., Constrained Pattern extension algorithm based peak power reduction techniques for MIMO-OFDM applications, Computer Communications (2019), doi: https://doi.org/10.1016/j.comcom.2019.08.021. This is a PDF file of an article that has undergone enhancements after acceptance, such as the addition of a cover page and metadata, and formatting for readability, but it is not yet the definitive version of record. This version will undergo additional copyediting, typesetting and review before it is published in its final form, but we are providing this version to give early visibility of the article. Please note that, during the production process, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. © 2019 Published by Elsevier B.V.

Journal Pre-proof

CONSTRAINED PATTERN EXTENSION ALGORITHM BASED PEAK POWER REDUCTION TECHNIQUES FOR MIMO-OFDM APPLICATIONS B.Ramesh1, Dr.J.Senthilkumar2, Dr.Y.Suresh3, Dr.V.Mohanraj4

[email protected]

of

Research Scholar, Assistant Professor Department of ECE, Annapoorana Engineering College, Salem1

Professor, Department of IT, Sona College of Technology, Salem2, 3, 4

ABSTRACT In any correspondence framework, the emphasis is on assessing the channel drive reaction to recover the transmitted flag

precisely

at

the

bit stacking and control allotment has been finished with the imperative of information rate which enhances the BER execution significantly than the current calculations. To accomplish great QoS,

re-

information

pro

current calculations. CPE with versatile

recipient's end. The Constrained Pattern Extension (CPE) plot gives successful

methods for foreshorten the peak-to-

urn al P

average power ratio (PAPR) without the

requirement for side data. In these

proposed calculations, CPE is utilized to moderate MAI. In CPE, each sub channel is

deteriorated

utilizing

particular

disintegration and transmit precoding matrix. This other framework changes the

spatial channel into a progression of

parallel sub channels with no crosstalk

Jo

from each other. CPE with ideal power

and sub-carrier distribution is performed with the requirement of aggregate power which amplifies the base client limit and entirety limit fundamentally than the

different clients are given need in relegating sub channels to that of various clients. MIMO clients are viewed as first to distribute energy to fulfill their information rate prerequisites and after that whatever is left of the power is dispersed among the subchannels of clients utilizing the versatile bit stacking calculation. Along these lines, the proposed calculation gives well least client limit, and entirety limit with low intricacy contrasted with existing asset portion calculations figure client SISO and MIMO-OFDM frameworks. At long last, two ACE calculations have been proposed in this theory to build the

framework

limit

and

BER

Journal Pre-proof

subcarriers at any given time and time

these proposed calculations can be

division or recurrence division multiple

utilized in future remote correspondence

access is utilized to help numerous

frameworks for better and enhanced

clients. Likewise, it neglects to use decent

exhibitions.

multiuser variety bringing about poor

words:

MIMO

–

OFDM,

Constrained Pattern Extension, peakto-average power ratio, Bit Error Rate 

framework execution. Since the plan is settled paying little heed to the present

pro

Key

of

execution with zero MAI. In this manner,

channel

condition,

settled

asset

designation is problematic. Then again, 1. INTRODUCTION

modulation techniques designate the sub being

channels, bits, power, and vacancies

considered as an adjustment and different

adaptively to the clients is based on their

access strategy for fourth-generation

channel

wireless networks. Additionally, it is right

modulation

now received as a regulation, and

utilization of decent multiuser variety

numerous entrance method for fast

to accomplish higher execution. In this

information get to frameworks, for

section, the novel ACE calculation for

example, IEEE802.11a/g remote LAN

multiuser OFDM System has been

and

proposed, and its performance has

OFDM

is

IEEE

urn al P

re-

Multiuser

802.16a

settled

remote

preferences. technique

al. 2004, Kim et al. 2004). To enhance

calculations and demonstrated that the

framework execution further, ARA for

proposed

multiuser OFDM is inescapable. Asset

framework limit with high QoS.

allotment strategies for multiuser OFDM

2. LITERATURE SURVEY

Jo

2005, Gao and Araghi 2006). In settled multiuser OFDM frameworks, just a single

client

can

transmit

all

the

estimation

actual

full

been

and versatile (Jang et al. 2003, Mohanram

with

makes

broadband access frameworks (Wong et

are of two sorts: settled (Lawrey 1999)

dissected

Proposed

expands

ACE the

A robust strategy to decrease the PAPR of the MIMO-OFDM using Subblock Successive Transform algorithms, which use the points of opportunity

Journal Pre-proof

entirely in space area towards the loss of

time-space

calculation [4]. An enhanced estimation is

reception apparatuses [7].

proposed as ISST, among the Sub-bits are

motions

Agreeable

at

all

PTS

transmit

for

PAPR

diminishment in MIMO-OFDM have

yet also sub-obstructs on a similar radio

Partial transmit arrangement (PTS) gives

wire

in

alluring top to-normal power proportion

recurrence space. So it can completely

(PAPR) decrease execution in OFDM or

utilize the degrees of opportunity in both

MIMO-OFDM [8]. Be that as it may, it

space area and recurrence area. In this

prompts

work, an enhanced calculation is planned,

computational

then the sub-bits are similarly as SST

agreeable PTS (co-PTS) is proposed. In

calculation in space area, yet additionally,

co-PTS, substitute enhancement and

sub-bits on a similar radio wire are

spatial sub bit round stage is utilized.

progressively

Recreation comes about demonstrate that

domain [5].

pivoted

in

recurrence

This work proposes a top tonormal

power

proportion

pro

turned

restrictively

re-

progressively

urn al P

are

of

similarly as SST calculation in space area,

co-PTS

can

substantial

unpredictability.

lessen

An

many-sided

computational quality significantly and

lessening

accomplish better PAPR diminishment

strategy that keeps up an impact of direct

execution contrasted with customary

pre-coding by bit diagonalization (BD)

PTS.

for multi-user OFDM frameworks [6]. In

this way, BD experiences waveform

Various

bending

orthogonal

caused

with

a

nonlinear

has

different

recurrence

yield

division

the

multiplexing (MIMO-OFDM) innovation

transmission of mapping procedure can

is a standout amongst the most alluring

decrease PAPR BDSLM plays out the

contender for the fourth era (4G) versatile

stage move to balance signs of all clients

radio

previously the straight pre-coding. From

battles the multipath blurring channel and

a few stage successions, it chooses a stage

enhances the data transfer capacity

grouping that limits the pinnacle of the

proficiency. In the meantime, it likewise

Jo

communications

by

information

correspondence.

It

adequately

Journal Pre-proof

builds framework limit to give a reliable

division

transmission. A basic framework of the

frameworks.

PAPR for a vast number of sub-

nature SLM plans are diminishing the

transporters, which result in numerous

many-sided computational quality of bit

limitations for functional applications.

error rate to decrease the PAPR decrease

Coding, stage pivot, and cutting are

execution basement[11].

multiplexing

low-complexity

of

Various

(OFDM)

pro

among multiple PAPR diminishment plots that have been proposed to defeat

The SLM conspire demonstrates parallel

this issue [9]. In this work, we mostly

PAPR decrease execution as the ordinary

research

SLM

the

PAPR

diminishment

plot

while

diminishing

the

execution with two different PAPR

computational

lessening techniques: fractional transmit

Likewise, an SLM unraveling plan

grouping (PTS) and particular mapping

reasonable for this the computational

(SLM).

iterative

intricacy at the recipient is contrasted

calculation has the conventional PTS

with the conventional SLM conspire.

technique is a traversal calculation, which

Interpreting strategy does not debase the

requires all conceivable stage esteems to

BER execution and furthermore does not

be assessed, that obliges the excellent

increment. A top to-normal power

application.

problematic

proportion (PAPR) diminishment given

prediction is acquainted with lessen the

versatile all-pass channels (AAPFs) for

quantity of stage designs assessment. It

various info single-yield orthogonal

reduces the unpredictability and joins the

recurrence

benefit of PTS plot on PAPR decrease

frameworks with space-recurrence bit

execution. A little level of debasement is

coding is utilized [12]. The AAPF makes

watched

stage pivot to lessen the PAPR. With the

Hence,

with

Jo

contrasted

a

nature.

re-

imperfect

urn al P

The

complexity

the

ideal

division

multiplexing

arrangement [10].The chose mapping

scattered

(SLM) conspire one of the notable crest

empowers

to-normal power proportion (PAPR)

without side data (SI). The PAPR

decrease plans for orthogonal recurrence

lessening

pilot

design,

information execution

and

the

AAPF

recuperation the

BER

Journal Pre-proof

execution with considered framework

reenactments are directed to approve

parameters are practically identical to

scientific outcomes, demonstrating that

those of the visually impaired SLM (B-

the proposed M-PTS conspire has better

SLM) plot, and the low many-sided

data transmission proficiency and bit

quality SLM (LC-SLM) conspire with SI

error

[13].

contrasted and the C-PTS plot. The

(BER)

execution

of

proportion

pro

aggregate information rate more distant A group of stars is reshaping strategy for

debases. Also, the held subcarriers might

crest to-normal power proportion (PAPR)

meddle in a recurrence specific blurring

decrease

channel; accordingly, bit error rate (BER)

in

orthogonal

recurrence

divisions [14]. Then the adaptability in

The above disused all references

re-

stage revolution decision and the capacity

may increment generally. [17]

to maintain a strategic distance from

papers have various advantages like

information rate misfortune make the

robustness to multipath fading, high

Selective

spectral

mapping

strategies

urn al P

level

efficiency,

immunity

to

additional appropriate for proper bit error

impulse interferences, flexibility and

rate execution in OFDM frameworks. [15,

easy equalization over single carriers

16]

communication systems. Therefore this

A multi-focuses square mapping

proposed

investigation

displays

a

(MSM) plot at that point portrays in detail

power reduction decrease conspire for

how to join the MSM conspire with

the OFDM frameworks in light of the

traditional

CPE

incomplete

transmit

approach,

where

subcarrier

gathering and curved streamlining

PTS, to lessen the PAPR of OFDM

strategies are embraced

signals. Contrasted and C-PTS, the M-

3. SYSTEM MODEL OF PROPOSED

PTS conspire needs not to submit side

OFDM SYSTEM

data

Jo

arrangement (C-PTS) plot, named as M-

while

keeping

practically

an

Peak to average power reduction

indistinguishable execution of PAPR

using Constrained Pattern extension

decreasing from the C-PTS plot. Broad

MIMO-OFDM System architecture is

Journal Pre-proof

Modulation (M-QAM) techniques. After

generated as an order of binary input to

mapping N point constellation, OFDM

the MIMO-OFDM model which are

symbols were transformed using serial-

measurably from the free information.

to-parallel conversion.Keeping in mind

Then the input information’s are collected

the end goal to acquire time-area flag

and

constellation

tests, the flag is gone through N-point

mapping of M-ary phase-shift keying (M-

Inverse Fast Fourier transforms (IFFT)

PSK) and M-ary Quadrature Amplitude

with L oversampling factor.

pro

with

Jo

urn al P

re-

modulated

of

shown in Figure 1.The random bits were

Figure 1 Constrained Pattern extension

functions to reduce the PAPR reduction

MIMO-OFDM System architecture

values. The C-time oversampled time-

The oversampling component is used to obtain accurate discrete-time

area flag tests can be written to as

Journal Pre-proof

𝑦

√

∑

/

𝑌 .𝑒 𝑀𝐶

,0

subcarrier samples, and then, a modifier is

𝑖

applied after S/P converter, as shown in

1 …. (1)

Fig. 1.The modifier accomplishes the transfer function process on the discrete

discrete time domain estimation (𝛾) can

time-domain signal sections and is

be estimated as follows

designed as

min

| |

…. (2)

| |

𝑦

𝐷

𝑦 … (4)

pro

𝛾

of

Peak to Average Power Reduction in

In this work, the reference sample is The exponential function is represented as

assumed to equal to Dref= δr+ jδi,

E[yi] and the difference between time-

wherever δr and δi are the real and

domain signal samples (Dref) can be

imaginary components, respectively, and take any arbitrary actual values.

(P/S) converter.

3.1. Optimum Constrained Pattern

written as 𝑦

this

can

be

urn al P

Mathematically,

re-

computed before the parallel-to-serial

𝐷

𝑦𝑖.

Extension (CPE) Algorithm The changed plan involves a

substantial computational complexity

Then, new PAPR (𝛾 ) using the

nature

Constrained Pattern extension technique

procedure. In this area, we propose a

can be calculated using.

sub-ideal

𝛾

max

The

prefix

… (3)

bit

is

added

subsequently parallel to serial conversion

Jo

(P /S) in an OFDM system. At the target, the CP is separated, and then, the signal is carried through S/P converter. The transpose process is executed at the

destination to improve the original

because

of

its

successive

calculation

named

Constrained Pattern Extension (CPE). This estimate means to lighten the execution time related with CPE and, in

the

meantime,

must

ensure

convergence. The two goals can be achieved if the estimation of A is limited to a values arrangement of qualities given by, 𝑨 𝟐𝜹, … , 𝟏 progression

𝑸

𝟏 𝜹 being among

𝟏, 𝟏

𝜹, 𝟏 𝜹

the

successive

Journal Pre-proof

evaluations of 𝜷that characterizes the granularity in the accuracy of the method, and Q is the cardinality of A 𝑨𝒋).

urn al P

re-

pro

of

(𝑸

Fig. 2: Constrained Pattern Extension (CPE) Algorithm Fig.

2

demonstrates

the

accompanying minimization issue is settled

appropriates problem of the PAPR

technique,

Jo

flowchart of the proposed calculation

by

methods

for

issue given by making utilization of a CPE technique. The ideal arrangement is seen in based on Q-branch parallel calculation, where at qth branch the

Yielding the solution Yq*𝐦𝐢𝐧‖𝒄‖ 𝒚

a

CPE

Journal Pre-proof

CPE execution. Thus Y has the necessary

Concerning𝜷 𝜷𝒒 ,

estimations of the CPE scheme.

Where q= {0, 1, 2….Q-1}, and 𝜷𝒒 𝑸𝜹. Note that the quantity of

branches is Q, i.e., each branch limits

3.2. Constrained Pattern Extension Algorithm:

Step 1: Estimate the threshold

PAPR for a given estimation of𝜷 ∈ 𝑨. similarity with the same number of times as directed by Q and at qth branch, its related Yq is given by ‖𝑐 ‖

𝑦 𝛽 … (5)

Then the optimal solution 𝑦, 𝛽 has the minimum value boundary within the set 𝑦

is selected: 𝑦𝛽

equations, where𝐾

𝛾

urn al P

𝑆

given target BER using the following

arg min 𝑆 … (6)

Where min 𝑆 is the least value within the fixe d value 𝑆 , signified as Y*, and 𝑦, 𝛽 is the rowequivalentto𝑦 𝛽 .

As far as complexity in nature, the

critical point is to identify a set of little as

𝐾 2

𝛾

ln 𝐵𝐸𝑅

𝑒 𝑥 . 2. 𝐵𝐸𝑅

re-

𝑌

SNR (i.e., region boundaries) for the

pro

Accordingly, the issue is settled in

of

𝟏

1 ;𝑛 𝛾

5 .

… (7) 0,1,2,3. . 𝑚,

∞

Step 2: Implement N-point constellation mapping using M-QAM and M-PSK modulation added with cyclic prefix and FFT to find the best performance using Cm (0) Step 3: Determine the average SNR of the received signal using

could reasonably be expected, which

implies a high granularity. As we

Jo

diminish the estimation of δ, we have a superior guess to the consistent case, while for the set decreases to Q focuses: 𝐴𝑗. At that point the higher the esteem, the lower the handling time related to the

𝛾

… (8)

Step 4: Compare this received average SNR with threshold SNR and select the constellation size M. If 𝛾

𝛾 then no transmission

Journal Pre-proof

If 𝛾

𝛾

𝛾 then M = 2 (BPSK

to the specified object BER (P target) control is

or 2QAM) 𝛾

𝛾 then M = 4 (QPSK

𝛼

or 4QAM) 𝛾

If

𝛾

𝛾 then

M = 16

(16QAM) and so on.

.

𝑙𝑜𝑔

1 … (10)

.

of

If 𝛾

The spectral efficiency (amount of

Step 5: Perform the adaptive modulation

bits

concerning the size M.

equivalentto𝛼, below the concept that the

Step 6: Execution of Constellation points

character interval is mutual of the

for all amplitude and phase variation.

substation and bandwidth. Here the

second

per

Hz)

is

pro

every

4.1. PROPOSED CONSTRAINED PATTERN EXTENSION

re-

spectral efficiency is stationary through the communication. The spectral efficiency of the

TECHNIQUE estimated

urn al P

The overall Bit error rate can be using

Gaussian

random

variable G [m, k] in the instance of nonadaptive modulation, where 𝑚, 𝑘

projectedCPE with has been resulting tentatively and it is communicated as follows.

𝛼

𝛼

is continuous for entire n and k. Hence systematic BER estimation is as follows, 𝑃 .

… (9)

,

𝑝

𝑙𝑜𝑔

.

|

, | .

1 … (11)

,

Jo

.

𝐸

,

In the non-adaptive modulation, the spectral efficiency is derived. The transmission of determined amount of bits

The noise rate can be reported as the average value of the γ (ε) SNR can be rated under Additive white Gaussian noise (AWGN) 𝛾 𝜀

… (12)

Journal Pre-proof

Wherever /

Simulation is performed to assess

… (13)

The mean ratio of SNR 𝛾 𝜀 without the cyclic factor𝐶

prefix

is

reduced

by

the

0 . The CPE will directly

influence the acquired average SNRwide. Because of this, the versatile adjustment

the average SNR within sight of CPE. In this work, CPE is used to appraise the PAPR.

of

0

The

proposed

multipurpose

adjustment calculation for the OFDM

pro

𝐶

5. RESULTS AND DISCUSSION

without CPE revision won't expand the

framework has been actualized, and the

phantom

outcomes are approved utilizing Matlab

proficiency.

The

proposed

2017a. The channel is thought to be

re-

technique compensations the CPE before the estimation of CSI that is a limit is measured after the CPE revision. In this

Rayleigh

manner by presenting the CPE adjustment

commotion is believed to be AWGN. The

urn al P

in versatile balance, the lessening of SNR

is refunded, and accordingly, the strange ability is made strides. This shade ability

fading

channel,

and

the

simulation parameters are compressed in Table 1.

change is approved utilizing broad

Jo

regeneration approaches.

Table 1 Simulation Constraint values during simulation

Journal Pre-proof

Constraint factor

Value

1.

Guard interval period

0.8 μs

2.

Modulation method

Constellation extension

of

S.no

modulation technique (M-QAM,

3.

Bandwidth for each user

4.

subcarrier count

5.

frequency spacing of Subcarrier

6.

Fast Fourier Transform time

pro

M-PSK) 20MHz

64

urn al P

re-

0.3125 MHz

To measure the boundary SNR

3.2 μs

extension based modulation systems

regions for CPE modulation, the OFDM

such as M-PSK and M-QAM as shown

system has been implemented with

in figure 3.

Jo

different points of constellation

Journal Pre-proof

various tweak methods. It indicates that the BER rate relies upon the group of stars measure M. BPSK gives excellent BER However,

its

of

execution.

unearthly

productivity is just 1bps/Hz, which is low

pro

contrasted with other regulation plans. In the meantime, 64QAM will ready to give better otherworldly effectiveness that is

Figure 3 SNR versus BER for the OFDM system using different

Figure

excellent BER execution and therefore low QoS. These regulation strategies are

urn al P

modulation schemes

re-

6bps/Hz, yet it neglects to keep up

3

demonstrates

the

Jo

correlation of SNR versus BER for

settled tweak procedures.

Journal Pre-proof

Figure. 4. Comparison of the CCDFs for

Complexity

reduction

regarding

percentage is calculated by the formula given

different PAPR reduction techniques

below:

Figure 4 shows even more improved performance in case of Pre-coding +

of

Complexity reduction in % = (1-

AEXP hybrid.

(Iconst/ Itotal)) x 100 %… (14)

pro

Here, best results for PAPR and CCDF of PAPR is at d =0.2and with DHT. The

Where Iconst= Iteration from which BER is

enhancement in PAPR by = 22.2db,

constant

and CCDF of PAPR = 8.88 dB, while

Itotal = 8 (Total number of iterations

18.5686 dB

considered for simulation)

re-

the SNR at BER 10-4, deteriorated by -

urn al P

Table 3: Comparison of VARIOUS Algorithm with required iterations

Performance metrics

METHOD

SNR

BER

Computational time delay(s)

CLIPPING

5

8.9  10-2

50

SLM

5

9.1  10-2

43

5

9.3  10-2

30

5

9.4  10-2

25

5

9.7  10-2

20

TI

Jo

TR

Proposed CPE

Fig. 4 looks at the CCDFs of

OFDM framework with n-point carriers

various PAPR decrease methods for an

and 16-QAM modification. It is apparent

Journal Pre-proof

from the assumption that all the PAPR

execution utilizing the TI system can be

lessening methods moderate the PAPR to

additionally enhanced yet at the cost of

a great extent; in any case, their

sizeable

comparing error displays, information

nature. It is watched that the proposed

rate

strategy gives vast PAPR diminishment

are

computational

extraordinary.

For

instance, the sectioning procedure can additionally enhance the PAPR execution

of

complexities

and

complexity

contrasted and SLM, TI, and cut-out PAPR decrease systems.

pro

troubles,

computational

Table.2. PAPR reduction compared

severely corrupt the BER execution of the

with SLM, TI, and clipping PAPR

framework. Correspondingly, the PAPR

reduction techniques

urn al P

re-

by lessening its cut-out level, which will

strategy has low computational many-

method, and other surely understood

sided quality. It is additionally evident

PAPR lessening strategies as far as BER,

from that the proposed method does not

information

many-sided

corrupt error execution. It is furthermore

computational quality. A synopsis of

watched that the proposed plan does not

correlation is exhibited in Table 2, which

diminish information rate as without

depends on this dialog the proposed

lateral

Jo

In this section, we contrast our proposed

rate,

and

data

is

mandatory

to

be

Journal Pre-proof

communicated. In this way, the proposed

CPE plot anywhere the iterative method

system offers better execution factors

needs fast severe Fourier transformation

relative

calculations, the proposed conspire is

the

other

PAPR

executed just once to get the ideal

diminishment procedures.

arrangement. Also, a low-unpredictability

6. CONCLUSION

of

than

usage is intended to decrease the

the attention is on evaluating the channel drive response to recover the transmitted information

flag

precisely

at

the

REFERENCES

1. "Energy Efficiency of MIMO Systems," Apurva S. Gowda, Professor Andrea Goldsmith.,

re-

collector's end. The Constrained example

escalated IFFT calculation.

pro

In any communication framework,

expansion (CPE) conspire compelling methods for diminishing the PAPR

Wireless Communication.

2. “Multiple Antenna Technique(MIMO)”, Ibn Azad

data. Be that as it may, current ACE plans

Muhammad Razin.

urn al P

deprived of the requirement for parallel include a tedious emphasis method. The

3. Siddeeq Y. Ameen, Mohammed

proposed inspection of a novel approach,

K. Yousif, “Decode and Forward

alongside

Cooperative

a

low-complexity

nature

Protocol

execution, for OFDM frameworks, where

enhancement using interference

the modulated signal-collecting system is

cancellation,"

embraced towards expanding the points

Journal of Electrical, Robotics,

of chance in the enhancement procedure.

Electronics and Communications

This investigation displays a power

Engineering Vol:8 No:2, 2014

Jo

reduction decrease conspire for the

4. Ankur

Bansal,

International

Manav

R.

OFDM frameworks in light of the CPE

Bhatnagar†,

approach, where subcarrier gathering and

Hjørungnes,“Low

curved

are

Decoding in DF MIMO Relaying

embraced. As opposed to the customary

System” IEEE Transactions on

streamlining

strategies

Are Complexity

Journal Pre-proof

Vehicular Technology, AUGUST

Transmission

24, 2012.

Decoding" IEEE Transactions on

MaYimin D. Zhang, Himal A. Suraweera and Moeness G. Amin, Performance

2, February 2004. 9. Andrew Sendonaris, ElzaErkip, and BehnaamAazhang, Fellow,

Boundaries of OSTBC Based AF

IEEE

MIMO Relay System With Energy

pro

"Optimum

Harvesting

Receiver,"

Transactions

IEEE

on

Signal

Processing, VOL. 61, NO. 17,

Diversity-Part

Cooperation

I:

System

Description" IEEE Transactions on Communications, VOL. 51, NO. 11, November 2003.

Krishnamurthy,

10. Tuan-Duc Nguyen, Olivier Berder

Rajeshwari.S.S “New Approach

and Olivier Sentieys, "Cooperative

To Joint MIMO Precoding For 2-

MIMO schemes optimal selection

way AF Relay Systems”.

for wireless sensor networks."

urn al P

6. Giridhar

“User

re-

SEPTEMBER 1, 2013.

Iterative

Signal Processing, VOL. 52, NO.

of

5. Batu Krishna Chalise, Wing-Kin

and

7. AlessioZappone,

Pancho

and

11. Hsin-Yi Shen, Haiming Yang,

Eduard A. Jorswieck “Energy

"Energy

Efficiency Optimization in Relay-

MIMO Systems."

Assisted MIMO Systems With

Efficient

cooperative

12. F. H. Raabet al., “Power

Perfect and Statistical CSI," IEEE

amplifiers and transmitters for RF

Transactions

Signal

and microwave,” IEEE Trans.

NO.2,

Microw. Theory Tech., vol. 50,

on

Processing,VOL.

62,

JANUARY 15, 2014.

Jo

8. Mohammad

Janani,

AhmadrezaHedayat,

Todd

Hunter

Nosratinia,

and

Aria

E.

no. 3, pp. 814– 826, Mar. 2002. 13. D. Wulich and L. Goldfeld, “Reduction of peak factor in orthogonalmulticarrier

“Coded Cooperation in Wireless

modulation by amplitude limiting

Communications:Space-Time

and coding,” IEEE

Journal Pre-proof

Trans.Commun., vol. 47, no. 1,

for peak-to-average ratio reduction

pp. 18–21, Jan. 1999.

in OFDM,” IEEE Commun. Lett.,

14. C.-P. Li, S.-H. Wang, and C.-L.

vol. 14, no. 1, pp. 39–41, Jan. 2010.

SLMschemes for PAPR reduction

19. B. M. Kang. “A PAPR reduction

of

Wang, “Novel low-complexity

method using new ACE with the

SignalProcess., vol. 58, no. 5, pp.

higher level constellation,” IEEE

2916–2921, May 2010.

pro

in OFDM systems,” IEEE Trans.

Int. Conf. on Signal Processing

15. S.-H. Wang and C.-P. Li, “A

and Commun.,pp.724-727, Nov.

low-complexity PAPR reduction

2007.

systems,” IEEE Signal Process.

20. C. Li, T. Jiang, Y. Zhou, and H. Li,

re-

scheme for SFBC MIMO-OFDM

“A

novel

constellation

Lett., vol. 16,no. 11, pp. 941–944,

reshaping

Nov. 2009.

reduction of OFDM signals,”

Chan,

urn al P

16. C.-P. Li, S.-H. Wang, and K.-C. “Low

complexity

transmitterarchitectures for SFBC

method

for

PAPR

IEEE Trans. SignalProcess., vol. 59, no. 6, pp. 2710-2719, June 2011.

MIMO-OFDM systems,” IEEE

21. A. Aggarwal and T. H. Meng,

Trans. Commun.,vol. 60, no. 6, pp.

“Minimizing the peak-to-average

1712–1718, June 2012.

power ratio of OFDM signals

17. S. H. M¨uller and J. B. Huber,

using convex optimization,” IEEE

"OFDM with a reduced peak-to-

Trans. SignalProcess., vol. 54, no.

average power ratio by optimum

8, pp. 3099–3110, Aug. 2006.

combination of partial transmit

22. S. Boyd and L. Vandenberghe, Convex

no. 5, pp. 368–369, Feb. 1997.

:Cambridge Univ. Press, [Online].

18. K. Bae, J. G. Andrews, and E. J.

Available:http://www.stanford.ed

Jo

sequence,”Electron. Lett., vol. 33,

Powers,

“Adaptive

constellationextension

active algorithm

Optimization,2003

u/˜boyd/cvxbook/bv cvxbook.pdf

Journal Pre-proof

23. M. S. Lobo, L. Vandenberghe, S. Boyd,

and

“Applications cone

H. of

 

Lebret,

second-order

programming,”

Linear

3,

pp.

193–228,

Nov.

of

Algebra Applicat.,vol. 284, no. 1– 1998

Available:http://www.stanford.ed u/˜boyd/SOCP.html 24. M. Sharif, M. Gharavi-Alkhansari, and B. H. Khalaj, “On the peak-to-

re-

average power of OFDM signals

based on oversampling,” IEEE Trans.Commun., vol. 51, no. 1, pp.

urn al P

72–78, Jan. 2003. Conflict of Interest 

As opposed to the customary CPE plot anywhere the iterative method needs fast severe

Fourier

transformation

calculations, the proposed conspire is

executed just once to get the ideal arrangement. Also, a low-unpredictability

usage is intended to decrease the escalated IFFT calculation. 

Jo

pro

[Online].