z-logo
open-access-imgOpen Access
Computationally efficient method for Fourier transform of highly chirped pulses for laser and parametric amplifier modeling
Author(s) -
Alexey V. Andrianov,
Áron Szabó,
A. S. Sergeev,
A. V. Kim,
V. Chvykov,
M. P. Kalashnikov
Publication year - 2016
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.24.025974
Subject(s) - fourier transform , optics , fractional fourier transform , discrete fourier transform (general) , short time fourier transform , fast fourier transform , discrete time fourier transform , non uniform discrete fourier transform , parametric statistics , cooley–tukey fft algorithm , computer science , amplifier , algorithm , fourier analysis , physics , mathematics , mathematical analysis , telecommunications , bandwidth (computing) , statistics
We developed an improved approach to calculate the Fourier transform of signals with arbitrary large quadratic phase which can be efficiently implemented in numerical simulations utilizing Fast Fourier transform. The proposed algorithm significantly reduces the computational cost of Fourier transform of a highly chirped and stretched pulse by splitting it into two separate transforms of almost transform limited pulses, thereby reducing the required grid size roughly by a factor of the pulse stretching. The application of our improved Fourier transform algorithm in the split-step method for numerical modeling of CPA and OPCPA shows excellent agreement with standard algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here