Skip to main content

Using Probabilistic Optimization Algorithms to Reduce PAPR in OFDM System

  • Conference paper
  • First Online:
Computational Intelligence, Communications, and Business Analytics (CICBA 2018)

Abstract

Orthogonal frequency division multiplexing (OFDM) is a swiftly growing multi-carrier modulation technique. OFDM gives high data rate for transmission of information from one location to another. Peak to average power ratio (PAPR) has been a constraining component of OFDM. Various techniques have been proposed to reduce PAPR. Partial Transmit Sequence (PTS) is a distortion less technique that improves PAPR performance. The PTS technique reduces PAPR by a fair margin. However, the major drawback of PTS is that for large number of IFFT calculations the computational complexity increases. Various optimization techniques have been implemented to reduce the complexity in PTS technique. In this paper, we propose an Ant Colony Optimization (ACO) based PTS technique to achieve least PAPR in OFDM. The simulation results confirm that the proposed technique can accomplish the noteworthy PAPR diminishment with less computational complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Muller, S.H., Huber, J.B.: A comparison of peak power reduction schemes for OFDM. In: Global Telecommunications Conference, GLOBECOM, vol. 1, pp. 1–5. IEEE (1997)

    Google Scholar 

  2. Ochiai, H., Imai, H.: Performance of the deliberate clipping with adaptive symbol selection for strictly band-limited OFDM systems. IEEE J. Sel. Areas Commun. 18(11), 2270–2277 (2000)

    Google Scholar 

  3. Pamungkasari, P.D., Sanada, Y.: Time domain cyclic-selective mapping for PAPR reduction using delayed correlation with matched filter in OFDM system. In: 22nd International Conference on Telecommunications (ICT), pp. 373–377. IEEE, Sydney, AU (2015)

    Google Scholar 

  4. Kang, S.G., Kim, J.G., Joo, E.K.: A novel subblock partition scheme for partial transmit sequence OFDM. IEEE Trans. Broadcast. 45(3), 333–338 (1999)

    Google Scholar 

  5. Yoo, S., Yoon, S., Kim, S.Y., Song, I.: A novel PAPR reduction scheme for OFDM systems: selective mapping of partial tones (SMOPT). IEEE Trans. Consum. Electron. 52(1), 40–43 (2006)

    Google Scholar 

  6. Ann, P.P. and Jose, R.: Comparison of PAPR reduction techniques in OFDM systems. In: International Conference on Communication and Electronics Systems (ICCES), pp. 1–5 (2016)

    Google Scholar 

  7. Lain, J.-K., Wu, S.-Y., Yang, P.-H.: PAPR reduction of OFDM signals using PTS: a real-valued genetic approach. EURASIP J. Wirel. Commun. Netw. 2011(16), 126 (2011)

    Google Scholar 

  8. Wang, Y., Chen, W., Tellambura, C.: A PAPR reduction method based on artificial bee colony algorithm for OFDM signals. IEEE Trans. Wirel. Commun. 9(110), 2994–2999 (2010)

    Google Scholar 

  9. Liang, H., Chen, Y.R., Huang, Y.F., Cheng, C.H.: A modified genetic algorithm PTS technique for PAPR reduction in OFDM systems. In: 15th Asia-Pacific Conference on Communications, APCC 2009, pp. 182–185 (2009)

    Google Scholar 

  10. Jiang, T., Xiang, W., Richardson, P.C., Guo, J., Zhu, G.: PAPR reduction of OFDM signals using partial transmit sequences with low computational complexity. IEEE Trans. Broadcast. 53(3), 719–724 (2007)

    Google Scholar 

  11. Joshi, A., Saini, D.S.: GA-PTS using novel mapping scheme for PAPR reduction of OFDM signals without SI. Wirel. Pers. Commun. 92(2), 639–651 (2017)

    Google Scholar 

  12. Hung, H.-L., Huang, Y.-F., Yeh, C.-M., Tan, T.-H.: Performance of particle swarm optimization techniques on PAPR reduction for OFDM systems. In: IEEE International Conference on Systems, Man and Cybernetics, SMC 2008, pp. 2390–2395 (2008)

    Google Scholar 

  13. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 26(1), 29–41 (1996)

    Google Scholar 

  14. Kermani, E.M., Salehinejad, H., Talebi, S.: PAPR reduction of OFDM signals using harmony search algorithm. In: 18th International Conference on Telecommunications (ICT), pp. 90–94 (2011)

    Google Scholar 

  15. Muller, S.H., Huber, J.B.: OFDM with reduced peak-to-average power ratio by optimum combination of partial transmit sequences. Electron. Lett. 33(5), 368–369 (1997)

    Google Scholar 

  16. Shi, Y., et al.: Particle swarm optimization: developments, applications and resources. In: Proceedings of the 2001 Congress on Evolutionary Computation, vol. 1, pp. 81–86. IEEE (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ashim Kumar Mahato .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mahato, A.K., Naafi, S., Das, D. (2019). Using Probabilistic Optimization Algorithms to Reduce PAPR in OFDM System. In: Mandal, J., Mukhopadhyay, S., Dutta, P., Dasgupta, K. (eds) Computational Intelligence, Communications, and Business Analytics. CICBA 2018. Communications in Computer and Information Science, vol 1030. Springer, Singapore. https://doi.org/10.1007/978-981-13-8578-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-8578-0_21

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-8577-3

  • Online ISBN: 978-981-13-8578-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics