2015 Annual IEEE India Conference (INDICON) 2015
DOI: 10.1109/indicon.2015.7443458
|View full text |Cite
|
Sign up to set email alerts
|

A low-complexity modified SLM with new phase sequences for PAPR reduction in OFDM system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…SIMULATION RESULTS In this section, several simulation results are presented to illustrate the performance of the proposed ADMM-Direct and ADMM-Relax. We compare the proposed algorithms with the RCF approach [10], Aggarwal SOCP approach [14], simplified OICF approach [17], modified SLM approach [28] and lowcomplexity tone injection scheme [29].…”
Section: Computementioning
confidence: 99%
“…SIMULATION RESULTS In this section, several simulation results are presented to illustrate the performance of the proposed ADMM-Direct and ADMM-Relax. We compare the proposed algorithms with the RCF approach [10], Aggarwal SOCP approach [14], simplified OICF approach [17], modified SLM approach [28] and lowcomplexity tone injection scheme [29].…”
Section: Computementioning
confidence: 99%
“…Riemann matrix (R) is used to provide phase sequence set. In the proposed method, the rows of normalized Riemann matrix (A) [28] are selected as the phase sequence vector [29] in the SLM technique for PAPR reduction [28], [29].The Riemann matrix (A)of the size NxN is obtained by removing the first row and first column of matrix (R) of size (N+1) X (N+1) [30].Where…”
Section: Riemann Matrix Phase Sequence Set Generationmentioning
confidence: 99%
“…Binary string is used to represent the compress string in the system and to reduce the overall number of bits used to encode the string. The Huffman coding is then used to find the minimum length of bit string which can be used to encode the string of symbols [23], [24]. In other words, Huffman coding uses the table of frequency occurrence to derive the input from processing a large number of symbols [23].…”
Section: Huffman Coding Techniquementioning
confidence: 99%
“…This Huffman coding tends to cause the probability to fluctuate around. And need an exhaustive starch through the code work that make the storing of the lookup table to be larger than Arithmetic coding [23]. From the simulation results, the Arithmetic Coding has been chooses to be the Probability Distribution Equalization (PDE) due to the high reduction of the PAPR in the system [12].…”
Section: Papr Performance Using F-ofdm Without Block Coding Techniquementioning
confidence: 99%