Home
  • English
  • ÄŒeÅ¡tina
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • LatvieÅ¡u
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Log In
    New user? Click here to register. Have you forgotten your password?
Home
  • Browse Our Collections
  • Publications
  • Researchers
  • Research Data
  • Institutions
  • Statistics
    • English
    • ÄŒeÅ¡tina
    • Deutsch
    • Español
    • Français
    • Gàidhlig
    • LatvieÅ¡u
    • Magyar
    • Nederlands
    • Português
    • Português do Brasil
    • Suomi
    • Log In
      New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Resources
  3. UniMAP Index Publications
  4. Publications 2023
  5. PAPR Reduction in Cyclic Prefix OFDM (5G) System using Group Codeword Shifting Technique
 
Options

PAPR Reduction in Cyclic Prefix OFDM (5G) System using Group Codeword Shifting Technique

Journal
Journal of Advanced Research in Applied Mechanics
Date Issued
2023-07-01
Author(s)
Yusof A.
Abdullah E.
Idris A.
Wan Azani Wan Mustafa
Universiti Malaysia Perlis
DOI
10.37934/aram.107.1.3040
Handle (URI)
https://hdl.handle.net/20.500.14170/5943
Abstract
Cyclic Prefix Orthogonal Frequency Division Multiplexing (CPOFDM) is a 5G multicarrier waveform that enables high data rates and spectrum efficiency improvements. The primary drawback of CPOFDM is that it has a high peak to average power ratio (PAPR), which is a characteristic of all multicarrier modulation techniques. We study the application of a Group Codeword Shift (GCS) approach to reduce the peak to average power ratio (PAPR) in a CPOFDM system in this article. Additionally, we compared the results of peak to average power ratio (PAPR) reduction with low complexity in CPOFDM using a Group Codeword Shift (GCS) approach, Selective Codeword Shift (SCS), Median Codeword and Conventional CPOFDM.
Funding(s)
Universiti Teknologi MARA
Subjects
  • Cyclic Prefix Orthogo...

File(s)
Research repository notification.pdf (4.4 MB)
google-scholar
Views
Downloads
  • About Us
  • Contact Us
  • Policies