Journals
Publish with us
Publishing partnerships
About us
Blog
Journal of Computer Networks and Communications
Journal overview
For authors
For reviewers
For editors
Table of Contents
Special Issues
Journal of Computer Networks and Communications
/
2011
/
Article
/
Tab 4
/
Research Article
A Novel SLM Scheme for PAPR Reduction in OFDM Systems
Table 4
Computational complexity of the SLM schemes in [
11
] and the novel SLM schemes when
𝑁
=
2
5
6
and 1024.
SLM in [
11
],
𝐾
=
3
1
Novel SLM,
𝐾
=
5
CCRR
SLM in [
11
],
𝐾
=
6
6
Novel SLM,
𝐾
=
7
CCRR
IFFTs
1
5
1
7
𝑁
=
2
5
6
Complex multiplications
1,024
2,048
−100%
1,024
2,560
−150%
Complex additions
25,856
15,360
40.6%
52,736
28,160
46.6%
𝑁
=
1
0
2
4
Complex multiplications
5,120
9,216
−80%
5,120
11,264
−120%
Complex additions
105,472
63,488
39.8%
212,992
114,688
46.2%