• DocumentCode
    3063739
  • Title

    An agent based particle swarm optimization for PAPR reduction of OFDM systems

  • Author

    Taghipour, J. ; Parandoosh, A.A. ; Vakili, Vahid Tabataba

  • Author_Institution
    Dept. of Telecommun., Iran Univ. of Sci. & Technol. (IUST), Tehran, Iran
  • fYear
    2012
  • fDate
    20-22 Nov. 2012
  • Firstpage
    839
  • Lastpage
    842
  • Abstract
    Orthogonal frequency division multiplexing (OFDM) is usually regarded as a spectral efficient multicarrier modulation technique, yet it suffers from a high peak to average power ratio (PAPR) problem. Partial transmit sequences (PTS) is one of the most well-known schemes to reduce the PAPR in OFDM systems. However, the conventional PTS scheme requires an exhaustive searching over all combinations of allowed phase factors. Consequently, the computational complexity increases exponentially with the number of the sub-blocks. Particle swarm optimization (PSO) algorithm is a recently proposed approach to solve the optimization problem of finding the phase factors of the PTS. In this paper, we propose an agent based particle swarm optimization for reducing computational complexity of the original PSO (OPSO) technique. Simulation results show that the agent based PSO (APSO) compare to the original PSO can effectively reduce the computational complexity of finding phase factors of the PTS.
  • Keywords
    OFDM modulation; computational complexity; particle swarm optimisation; OFDM systems; PAPR reduction; PTS; agent based particle swarm optimization; computational complexity; exhaustive searching; multicarrier modulation technique; orthogonal frequency division multiplexing; partial transmit sequences; Computational complexity; Optimization; Partial transmit sequences; Particle swarm optimization; Peak to average power ratio; Simulation; OFDM; PAPR; PTS; Particle Swarm Optimization (PSO);
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Telecommunications Forum (TELFOR), 2012 20th
  • Conference_Location
    Belgrade
  • Print_ISBN
    978-1-4673-2983-5
  • Type

    conf

  • DOI
    10.1109/TELFOR.2012.6419338
  • Filename
    6419338