IFF-PTS algorithm for PAPR reduction of MIMO-OFDM signals

Document Type : Research Paper

Authors

1 Department of Electrical Engineering, University of Bonab, Bonab, Iran

2 Department of Computer Engineering, University of Bonab, Bonab, Iran

Abstract

MIMO-OFDM system uses the merits of both OFDM and MIMO systems and facilitates the high-rate data transmission capability by increasing the reliability of the communication systems. The MIMO system uses multiple antennas in the transmitter and receiver to create spatial diversity and reduce the destructive effects of fading in wireless communication channels. Besides these advantages, the MIMO-OFDM system faces a high PAPR problem like the OFDM system. One of the well-known methods for PAPR reduction in MIMO-OFDM systems is the partial transmit sequence (PTS). The PTS method searches all possible combinations of phase factors to find the minimum PAPR, which increases the computational complexity. To solve this challenge, we propose the IFF-PTS algorithm, which combines the PTS algorithm and an improved version of the firefly algorithm (IFF). The proposed IFF-PTS algorithm overcomes the computational complexity of the exhaustive search to find the optimal phase factors in the PTS and significantly reduces the PAPR metric. The proposed IFF-PTS algorithm is evaluated in different scenarios and compared with the state-of-the-art algorithms. The results of the simulations show the superiority of the proposed algorithm compared with the counterpart algorithms. When the number of subblocks is 8, the IFF-PTS algorithm has reduced the PAPR value to 6.8dB. The computational complexity of the proposed method is 2.4% of the complexity of OPTS and has significantly reduced the PAPR value. For the number of subblocks of 16, the IFF-PTS method has only 1.2% of the complexity of OPTS but has reduced the PAPR value to 6.4dB.

Keywords

Main Subjects



Articles in Press, Accepted Manuscript
Available Online from 17 November 2025
  • Receive Date: 07 March 2024
  • Revise Date: 19 October 2025
  • Accept Date: 17 November 2025