@article{MAKHILLIJSC201813221442,
    title = {Analysis on Effective Implementation of IFFT in Various PAPR Reduction
Methods for OFDM System},
    journal = {International Journal of Soft Computing},
    volume = {13},
    number = {2},
    pages = {48-50},
    year = {2018},
    issn = {1816-9503},
    doi = {ijscomp.2018.48.50},
    url = {https://makhillpublications.co/view-article.php?issn=1816-9503&doi=ijscomp.2018.48.50},
    author = {A. and},
    keywords = {OFDM,ACE,QAM,SLM,PAPR,SNR,BER},
    abstract = {In this study, we proposed a comparative performance analysis on how effectively a fast Fourier
transform and inverse fast Fourier transform is used and implemented in various digital transmission techniques
and in popular OFDM applications for wideband communications today. In many broadband wireless
communication networks Orthogonal Frequency Division Multiplexing (OFDM) technique is very popular and
powerful transmission technique. In OFDM modulation scheme there is a major disadvantage which is referred
as Peak-to-Average Power Ratio (PAPR) is due to multiple numbers of subcarriers. In many PAPR reduction
methods Inverse Fast Fourier Transform (IFFT) and Inverse Discrete Fourier Transform (IDFT) are implemented.
In Transmitter (Tx) side FFT algorithm and Receiver (Rx) side IFFT Algorithm is used to reduce the number of
complex additions and multiplications. Hence, to reduce the computational complexity many PAPR reduction
schemes involving N-Point IFFT based on decimation in-time algorithm were discussed in this study with
simulation parameters and mathematical modeling. IFFT stages are must to generate alternative OFDM signal
vectors which reduces the computational complexity. Unlike other techniques, the implementation of IFFT
employs and achieves significant Bit Error Rate (BER) improvement with low computational complexity.}
    }