Skip to Main content Skip to Navigation
Conference papers

Tone Reservation's complexity reduction using fast calculation of maximal IDFT element

Abstract : High Peak to Average Power Ratio (PAPR) is a main area of concern in multi-carrier signals like Orthogonal Frequency Division Multiplexing (OFDM) modulated signals and several techniques have been devised to reduce PAPR. One of these PAPR reduction techniques is 'Tone Reservation' where PAPR is reduced by adding tones to the useful data tones to reduce the temporal signal's peak. IDFT is performed to see the effect of the added tones on temporal signal's peak and then the tones are adjusted in frequency domain accordingly to minimize this peak. Enormous use of IDFT operations to get optimized reserved tones makes Tone Reservation technique quite complex. During this optimization process, only the knowledge of maximal IDFT element is required though. Truncated IDFT algorithm calculates only this value and not the complete IDFT output and thus it makes the Tone Reservation's IDFT complexity O(1:5Nitr:N) instead of O(N:Nitr:log2(N)) where N and Nitr are size of IDFT and number of algorithm iterations respectively. This complexity reduction is achieved at the cost of less PAPR reduction. Afterwards, a combination of Truncated and classical IDFT algorithms is presented to be used for tone optimization which improves the PAPR reduction performance. It is observed that the complexity is reduced to half using this combination when compared to Tone Reservation classical IDFT complexity at the cost of 0:3dB performance loss.
Complete list of metadata
Contributor : Myriam Andrieux Connect in order to contact the contributor
Submitted on : Tuesday, October 7, 2008 - 8:48:38 AM
Last modification on : Thursday, January 20, 2022 - 12:54:05 PM


  • HAL Id : hal-00327003, version 1


Yves Louët, Sajjad Hussain. Tone Reservation's complexity reduction using fast calculation of maximal IDFT element. IWCMC 08, Aug 2008, Greece. ⟨hal-00327003⟩



Les métriques sont temporairement indisponibles