Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

Open Access Open Access

Abstract

We present an iterative retrieval algorithm based on data constraint for ultrashort pulse characterization using dispersion scan (d-scan). The proposed algorithm is much faster and leads to a drastic reduction of retrieval times, but, compared to the standard algorithm, it performs less robustly in the retrieval of noisy d-scan traces. The algorithm is tested on several simulated cases and in two different experimental cases in the few-cycle regime.

© 2016 Optical Society of America

1. INTRODUCTION

The last few decades have seen the development and improvement of numerous ultrashort laser-pulse characterization techniques. Still, temporal characterization of ultrashort laser pulses can be challenging, especially in the few-cycle regime. Options range from classic techniques, such as FROG [1,2], SPIDER [3], and other spectral interferometry approaches (e.g., [4,5]), to more complex techniques based on photoionization [68], which allow for direct measurement of the electric field. Different techniques have different strengths, such as speed, experimental simplicity, and robustness. Another relatively recent approach is to use the pulse compressor itself, such as multiphoton intrapulse interference phase scan (MIIPS) [9], chirp-scan [10], and d-scan [11].

Ultrashort pulse characterization techniques that use the compressor itself as a diagnostic tool have the benefit of experimental simplicity, since minimal extra components are needed. These work by applying a set of distinct spectral phases, using either a pulse-shaping device or passive elements, and looking at the resulting second-harmonic generation (SHG) spectra. These are usually scanning methods, but single-shot approaches have also been devised [12].

Such techniques retrieve the pulse iteratively, either by physically compressing the pulse [9] or by numerically finding which pulse originates the set of measured nonlinear (usually SHG) traces [10,11]. Our original implementation of the d-scan retrieval assumed an accurately measured fundamental spectrum, and tried to recreate the measured d-scan trace by iteratively applying spectral phases [11,13]. Loriot et al. showed that the spectral intensity can also be retrieved from such traces [10] if the trace is calibrated, in principle making a separate measurement of the fundamental spectrum unnecessary. In both cases, the pulse retrieval is treated as a generic optimization problem, where an iterative algorithm tries to find which pulse best recreates the measured scans. This is in contrast to some FROG algorithms [1,1416], which use more elegant approaches.

In this work, we present a new algorithm to retrieve ultrashort pulses from dispersion scans (d-scan). It is based on a data constraint approach to phase recovery, similar to what has been applied previously to FROG traces. The approach is inspired by decades-old techniques used in phase recovery of diffraction problems, most famously the Gerchberg–Saxton algorithm [17]. In the context of ultrashort pulse measurement, this approach is used in most FROG retrieval algorithms [1] as well as more recently developed algorithms, for example, based on ptychography [18,19].

The algorithm iterates between a representation of the pulse (in the time or frequency domain) and its corresponding d-scan trace, i.e., its second-harmonic as a function of spectral phase. Calculating a d-scan trace from an ultrashort pulse is straightforward. However, and unlike linear problems such as diffraction or holography, finding the ultrashort pulse from a d-scan is not straightforward, even if the complex d-scan trace (i.e., intensity and phase) is known. The electric field generated from the SHG process is modeled as the square of the driving field; therefore, even if the SHG field is known, there is ambiguity as to which driving field generated it. This step is arguably the crucial one in other retrieval techniques used in FROG.

2. FUNDAMENTAL CONCEPTS

We define the unknown pulse as the complex field

E˜(ω)=|E˜(ω)|exp[iψ(ω)]
and the glass spectral phase as a function of frequency ω, and glass thickness z is modeled as a complex function
Φ(ω,z)=exp[izk(ω)].
Applying the spectral phase of different thicknesses of glass corresponds to translating wedges in the experimental measurement of a d-scan trace. The complex d-scan, which is a set of complex SHG spectra, is given by
S(ω,z)=F{F1{E˜(ω)Φ(ω,z)}2},
where F{} is the Fourier transform operator, and the corresponding ideally measured d-scan trace is
I(ω,z)=|S(ω,z)|2.

By integrating a trace over the insertion z from the minimum L to the maximum glass insertion +L we get the frequency marginal

M(ω)=L+LI(ω,z)dz.
We show in Appendix A that, for large enough values of L, the marginal M(ω) is independent of the spectral phase of the pulse. It is thus a useful quantity that allows us to calibrate a d-scan trace.

Despite being a straightforward-to-implement technique, several experimental problems can arise. Depending on the particular case, it might be difficult to measure a SHG signal that follows the simple model of Eq. (4), due to phase-matching bandwidth, spectrometer calibration, contamination by the fundamental spectrum in the case of octave-spanning spectra, etc. It is thus a major advantage if the algorithm can deal with traces that are not ideal.

To investigate this, we consider three different scenarios:

  • 1. The d-scan trace is well calibrated, without any clipping.
  • 2. The d-scan trace is not calibrated, but it is not clipped, and the fundamental spectrum is properly measured.
  • 3. The d-scan trace is possibly not calibrated, it is clipped, and the fundamental spectrum is properly measured.

Case 1 is the simplest one to implement numerically, and does not require an independent measurement of the fundamental spectrum. It is also the most closely related to FROG and ptychographic algorithms. The algorithm is described in Section 3. Case 2 requires an independent measurement of the fundamental spectrum. There are then two options: one is to use the marginals to calibrate the d-scan trace, and then we have again Case 1. The other option is to change the retrieval algorithm to project the retrieved fundamental spectrum at each iteration (keeping the retrieved phase and applying the measured amplitude), while adapting the measured d-scan trace.

Case 3 is the most complex one, where data from some spectral regions of the d-scan trace are missing or unreliable. In this case, the areas of the trace which are not considered reliable are discarded and marked as such. The algorithm then replaces those by the simulated scan generated by the current guess. Successful retrieval of such traces depends on the d-scan trace having sufficient redundancy. Both Cases 2 and 3 are discussed in Section 4.

3. BASIC ALGORITHM

The basic algorithm is used in Case 1, when the trace is calibrated.

We start with a guess; for iteration l=0,

E˜l=0(ω).

From the d-scan trace we can estimate the width of the fundamental spectrum, and assume a Gaussian spectrum with that width as a first guess. A MIIPS analysis can be used for a first approximation to the spectral phase [9].

From this, we simulate a matrix of the field after propagation through a thickness z. A phase matrix, corresponding to the spectral phase introduced by this propagation is

Φ(ω,z)=exp[izk(ω)],
so after propagation, the original field will have the extra spectral phase term as a function of glass thickness
U˜l(ω,z)=E˜l(ω)Φ(ω,z),
giving a corresponding time-domain matrix
Ul(t,z)=F1{U˜l(ω,z)},
where the Fourier transform operator is applied over ω. Then the SHG signal is calculated,
UlSHG(t,z)=Ul2(t,z),
and a complex d-scan trace is calculated,
Sl(ω,z)=F{UlSHG(t,z)}.
Now, the phase is kept and the amplitude substituted by the measured trace
Sl(ω,z)=Smeas(ω,z)exp{iarg[Sl(ω,z)]},
where Smeas(ω,z)=Imeas(ω,z). At each z, we calculate a new guess for the SHG field
UlSHG(t,z)=F1{Sl(ω,z)}.
The most challenging part is to get the fundamental field that gives rise to that SHG field. By multiplying each field UlSHG(t,z) by the complex conjugate of Ul(t,z) (which was our best guess so far),
Pl(t,z)=UlSHG(t,z)Ul*(t,z),
we hoped to get a better new guess for the phase, but the amplitude is off. To correct this, we take the cube root of the amplitude of this term, and the next guess for the field at z is
Ul(t,z)=|Pl(t,z)|1/3exp{iarg[Pl(t,z)]}.
Now we go again to the frequency domain by Fourier transforming
U˜l(ω,z)=F{Ul(t,z)},
and the phase from the glass is removed:
U˜l(ω,z)=U˜l(ω,z)Φ*(ω,z).
Finally, a new guess for the field is obtained by averaging over all the guesses corresponding to each glass insertion z,
E˜l+1(ω)=1ΔzzU˜l(ω,z)dz,
and the loop is repeated [from Eq. (8)] until a specified convergence criterion is met.

A. Error Calculation

At each iteration, the rms difference between measured and simulated traces can be calculated. The error is given by

G2=1NjNkj,k(Imeas(ωj,zk)μIretr(ωj,zk))2,
where μ is the constant that minimizes the error G, which can be found by differentiating G with respect to μ:
μ=j,kImeas(ωj,zk)Iretr(ωj,zk)j,kIretr(ωj,zk).

B. Simulated Examples

Figure 1 shows an example of a simulated pulse and corresponding simulated and retrieved d-scan traces. The spectral intensity is an actual measurement of an ultrafast titanium:sapphire oscillator with a Fourier limit duration of less than 6 fs full width at half-maximum (FWHM), representative of modern systems. This spectrum (amplitude and phase) will be used as a basis for more examples throughout this paper. The algorithm ran for 100 iterations, with a grid size of 256 points in the frequency domain and 200 glass insertions.

 figure: Fig. 1.

Fig. 1. Example of (a) simulated and (b) retrieved d-scan traces. (c) Both spectral intensity (blue) and phase (orange) are precisely retrieved, as well as the corresponding pulse in the time domain. (d) Retrieved fields are plotted in lighter colors. Note that in this plot the simulated and retrieved fields overlap almost exactly and cannot be easily distinguished.

Download Full Size | PDF

The algorithm accurately retrieved the spectral intensity and phase. The rms difference between the simulated and retrieved scans was about 1E-6.

We also tested the basic algorithm on a double pulse (Fig. 2). The pulse is the same as the previous case (Fig. 1), but duplicated and delayed by 100 fs. The only difference from the previous case was that a higher sampling rate was needed in the spectral domain (2048 points), which made the retrieval slower. rms error was approximately 1E-3.

 figure: Fig. 2.

Fig. 2. Example of (a) simulated and (b) retrieved scans of a double pulse. The retrieved spectral intensity and phase are shown in (c) in light colors, as well as the corresponding spectral intensity for an isolated pulse. The corresponding pulses in the time domain are shown in (d).

Download Full Size | PDF

C. Variations of the Basic Algorithm

The previously presented basic algorithm can be used with some modifications. The first we consider is averaging the guesses in the time domain instead of doing it in the frequency domain. The step depicted in Eq. (18) is replaced by its equivalent in time. Instead of integrating over U˜l(w,z), an extra step is taken: first, go to the time domain, integrate over z, and go back to the frequency domain for the new E˜l(w). The two approaches are equivalent, so if no other operation is performed, there is no reason to do so. However, if some constraint is known in the time domain, it can be enforced here.

The other variation we tried is to give different weights to the different guesses. For example, if the data is noisy, one might wish to give a higher weight to the regions with more signal. Equation (18) would then be replaced by

E˜l(ω)=zU˜l(ω,z)w(z)dzzw(z)dz,
where w(z) is the weight attributed to each spectral measurement, for example,
w(z)=ωSmeas(ω,z)dω.
In the case of third-harmonic generation (THG) d-scan, the steps in Eqs. (14) and (15) are replaced by
Pl(t,z)=UlTHG(t,z)[Ul*(t,z)]2
and
Ul(t,z)=|Pl(t,z)|1/5exp{iarg[Pl(t,z)]}.
These options will not be explored further in this work, and are mentioned only for completeness.

4. ALGORITHM FOR NONCALIBRATED TRACE

In the case of a noncalibrated trace, a retrieved trace will differ from the measured trace as [20,21]

Imeas(ω,z)=Iretr(ω,z)R(ω),
where R(ω) is a spectral response curve that includes factors such as phase-matching bandwidth, spectrometer sensitivity, coupling efficiency, etc. Since a simulated trace will be inherently calibrated, it will never recreate a noncalibrated measured trace, and the basic algorithm will not work properly.

One way around it is to use the trace’s marginals [11] to calibrate the trace. In some cases, however (i.e., the trace was not measured with a large enough range of glass insertions), this might not be practical, so a similar approach to the one used in previous work [11] can be adapted to the new algorithm.

A modified error expression is often used with d-scan retrieval [11,13], which minimizes the error at each frequency

G2=1NjNkj,k(Imeas(ωj,zk)μ(ωj)Iretr(ωj,zk))2.
Similar to Eq. (20), μ(ωj) can easily be found by differentiation
μ(ωj)=kImeas(ωj,zk)Iretr(ωj,zk)kIretr(ωj,zk).
If the trace is not calibrated and not clipped, then the retrieved response curve μ(ωj) can be used to calibrate Iretr(ωj,zk). It will only give the correct response after a successful retrieval, but if used within the retrieval algorithm, it will, it is hoped, be a better guess at each iteration.

For a successful retrieval of a noncalibrated trace, a separate measurement of the fundamental spectrum is needed—this guarantees that the generated trace is itself calibrated. Two extra steps are added to the algorithm. First, before a new d-scan guess is generated, the current guess of E˜i(ω) is updated with the measured spectrum, i.e., its phase is kept and its amplitude is replaced by the measured one:

E˜l(ω)=|E˜meas(ω)|exp{iarg[E˜l(ω)]}.
The d-scan guess is generated, and it is used to calibrate the measured trace. So an extra step is added, where the measured trace is replaced by the corresponding calibrated one,
Imeas(ω,z)=Imeas(ω,z)/μ(ω),
where the current guess of I(ω,z) [calculated from S(ω,z) in Eq. (11)] is used to calculate μ(ω).

In case some signal is missing or for some reason unreliable (for example, being contaminated by the fundamental spectrum in case of an octave-spanning pulse), those spectral regions cannot be used (Case 3). In this case, those areas are marked as unreliable and not substituted by the measured data in the data constraint step in Eq. (12).

Figure 3 shows an example using this variation of the algorithm, where the simulated trace was multiplied by a phase-matching curve, and spectrally clipped. Even in the absence of a significant portion of the trace, the pulse is accurately retrieved. The rms error in this case is obtained by ignoring the clipped regions, and after calibration of the simulated trace, giving an error of 0.01.

 figure: Fig. 3.

Fig. 3. Example of (a) simulated trace where a spectral filter was applied, simulating phase-matching and clipping. The algorithm uses the known fundamental spectrum (c) and retrieves a trace (b) very similar to the original trace. The corresponding pulse in the time domain is shown in (d).

Download Full Size | PDF

5. NOISE

We found that the basic algorithm is not particularly robust to noise. Figure 4 shows an example of a retrieval using the basic algorithm. Noise was added with a standard deviation of 10% of the peak intensity of the trace. The spectral intensity retrieval especially is strongly affected. The rms error in this case is 0.09.

 figure: Fig. 4.

Fig. 4. Example of (a) simulated trace with added noise and (b) corresponding retrieved trace. The basic algorithm retrieves (c) both spectral amplitude and phase, but especially the spectral amplitude (light-colored line) is not retrieved very accurately. In the time domain (d) the main features are reproduced but much less accurately than in the noiseless cases.

Download Full Size | PDF

If the fundamental spectrum is separately measured, then it can be integrated in the retrieval process as in the previous case [Eq. (28)]. An example is shown in Fig. 5. The rms error is now lower, 0.07.

 figure: Fig. 5.

Fig. 5. Same as previous case, but with known fundamental spectrum. The algorithm variation that includes projection of the fundamental spectrum was used, yielding a much better reconstruction.

Download Full Size | PDF

If the fundamental spectrum is not available, a composite algorithm can be used. From Fig. 4, we can see that the spectral phase retrieval is reasonably accurate, and this is very often the case even for very noisy traces. A simple approach is to take this retrieval and afterward use a generic optimization algorithm to optimize the spectral intensity. Figure 6 shows an example.

 figure: Fig. 6.

Fig. 6. Same as previous case, but using a mixed algorithm. After the retrieval using the basic algorithm, a multidimensional algorithm optimizes the spectral intensity. The retrieved spectral phase is left unchanged, and a generic optimization algorithm minimizes the error between (a) simulated and (b) retrieved scans by applying a filter curve to the previously retrieved spectral intensity.

Download Full Size | PDF

A generic optimization algorithm takes the retrieved spectral amplitude from the basic algorithm and changes it, multiplying it by a response curve. In this case, the curve was defined by 10 control points and interpolated using spline interpolation. This results in much better retrieval, and can be done quite fast. The rms error is 0.075.

A. Background Subtraction

We finish this section by briefly discussing an important but often overlooked issue. When dealing with experimental data, the question arises of what to do with negative experimental values that arise from background subtraction.

In our previous work [11,13], we found that it is important not to coerce to zero the experimental values of the d-scan trace, i.e., after subtracting the average noise value, negative values are kept negative, instead of being replaced by zero.

Let us assume we have an ideal trace, and look at a region where the values are zero. If noise with an average value of zero is added and then the resulting values are coerced to zero, the average will not be zero any longer. This would make the algorithm try to create signal in those regions (see, for example, Ref. [22]). In the case of a data constraint algorithm, where the measured amplitude is needed, this poses a problem, as a square root of the measured intensity is needed.

Our approach is to keep track of which values of the experimental trace are negative, and flip the sign of the complex scan when the data constraint step is performed. So the measured amplitude becomes

Smeas(ω,z)=|Imeas(ω,z)|,
and the data constraint step on Eq. (12) becomes
Sl(ω,z)=Smeas(ω,z)exp{iarg[Sl(ω,z)]}sgn[Imeas(ω,z)].

We found this change to have a large impact on the retrieval of noisy traces.

6. EXPERIMENTAL RESULTS

A. OPCPA System

The algorithm was tested on two different systems: the first is a chirped pulse optical parametric amplifier (OPCPA) codeveloped with Venteon GmBH [23]. It delivers around 5 μJ of energy per pulse at a repetition rate of 200 kHz. The results are shown in Fig. 7.

 figure: Fig. 7.

Fig. 7. Characterization of the output from an OPCPA system, with (b) retrieved trace very similar to (a) measured trace. (c) Retrieved spectral intensity and phase (light colored) are compared to the directly measured spectrum (dark color). (d) The shortest pulse (obtained at insertion 0) is 6.3 fs FWHM.

Download Full Size | PDF

The measured pulses have a FWHM duration of 6.3 fs. In this case, only the retrieval using the basic algorithm is shown. The grid size was 256 spectral points and 150 insertions, and the rms error was 0.01. The retrieved spectrum is similar to the measured one, but the differences are clear. A possible explanation for the discrepancy is that either the fundamental or the SHG spectra are not properly calibrated. OPCPA sources are difficult to work with due to spatiotemporal couplings, making it hard to make sure that all the spectral content of the source contributes equally to the SHG signal. In any case, very similar results are obtained by instead using the previous algorithm [13] or the previously described variation for noncalibrated traces.

B. Hollow-Fiber Compressor

The second system is a hollow-fiber compressor [24] capable of delivering around 200 μJ at a repetition rate of 1 kHz. In previous work, water was used to correct the third-order dispersion of the system [24,25]. Here, we used a z-cut KDP crystal (so that light travels with polarization on the ordinary axis), which has similar third order dispersion (TOD)/group delay dispersion (GDD) ratio to water. The results are shown in Fig. 8. The grid size was higher than previously, with 512 spectral points and 200 insertions. Two variations of the algorithm were used: the basic algorithm, and the modified algorithm, using the measured spectrum and assuming the trace might not be calibrated. Both gave a very similar result, with a retrieved duration of 3.0 fs FWHM in both cases (the retrieved trace in Fig. 8(b) is the one obtained from the basic algorithm). In both cases, the rms error was 0.02. The retrieved spectrum using the basic algorithm closely resembles the measured spectrum, except below 500 nm, which lies outside the chirped mirrors specifications. This causes this spectral region to contribute very little to the main pulse, making it harder for the algorithm to retrieve it.

 figure: Fig. 8.

Fig. 8. Characterization of the output from a hollow-core fiber compressor. (a) Measured and (b) retrieved trace using the basic algorithm. Light colored lines correspond to the retrieval done with the basic algorithm (i.e., without using the measured spectrum). Dark colored lines correspond to the retrieval using the algorithm variation for noncalibrated traces, which uses the measured spectrum. The retrieved pulse durations in both cases is 3.0 fs FWHM.

Download Full Size | PDF

7. DISCUSSION

The algorithm is not flawless, and sometimes it converges to local minima, and other times it does not converge at all. We found that a reasonable first guess helps in both cases. In the presented cases, it was enough to assume a Gaussian spectrum, transform-limited at the insertion corresponding to the peak of the d-scan signal as a first guess for the spectral phase.

The basic algorithm does not use all the information contained in a d-scan trace: the drop in intensity as a function of dispersion carries information that is not taken into account. Each spectral line is independently used for a new guess, so from the algorithm point of view, the most important thing is that each spectral measurement is reproduced. If, for example, a trace had each spectral measurement normalized (which would give a physically impossible trace), the algorithm would still converge (although the error would not converge to zero).

Many of the steps of the algorithm can be done numerically in parallel, which can considerably speed up the retrieval. This is especially useful with modern multiprocessor computers.

8. CONCLUSION

We presented a new retrieval algorithm for ultrashort pulses using the d-scan technique, capable of retrieving both spectral intensity and spectral phase, and successfully applied it to simulated and real pulses. We also show that the frequency marginal of a d-scan trace is independent of the spectral phase of the pulse.

The algorithm can be implemented using different variations, depending on what data is available. It is much faster than our previous algorithms [11,13], although, in its basic form, less robust to noise.

The algorithm was tested on experimental setups, representative of some of today’s most challenging ultrashort pulse measurements.

APPENDIX A: PHASE INDEPENDENCE OF THE FREQUENCY MARGINAL

In this appendix, we show that the integral of the d-scan trace |S(ω,z)|2 over the glass thickness z is independent of the phase ψ(ω) of the pulse. More precisely, we show that

LLdz|S(ω,z)|2=A(ω)log2L(ω)+B(ω)+O(L1),
where
(ω)=τ2|k(ω2)|,A(ω)=12π|k(ω2)||E˜(ω2)|4,
and
B(ω)=dω1π[|E˜(ω2+ω1)|2|E˜(ω2ω1)|2|k(ω2+ω1)k(ω2ω1)||E˜(ω2)|4e2τ2ω12|2ω1k(ω2)|].
In these equations, τ is an arbitrary time scale independent of L. One can easily check that the derivative of Eq. (A1) with respect to τ yields zero.

The derivation starts by rewriting Eq. (3) for S(ω,z) as a convolution in the time domain

dω12πE˜(ω2+ω1)E˜(ω2ω1)eiz[k(ω2+ω1)+k(ω2ω1)].
Our goal is to compute the following triple integral in the limit of large L,
LLdz|S(ω,z)|2=dω1dω2(2π)2LLdzG(ω,ω1,ω2,z),
where
G(ω,ω1,ω2,z)=eiz[k(ω2+ω1)+k(ω2ω1)k(ω2+ω2)k(ω2ω2)]E˜(ω2+ω1)E˜(ω2ω1)E˜*(ω2+ω2)E˜*(ω2ω2).
If we naively set L= in Eq. (36), the z-integral produces the following δ-function,
δ(k(ω2+ω1)+k(ω2ω1)k(ω2+ω2)k(ω2ω2)).
Assuming that k(ω) is a convex function, this δ-function simplifies to
δ(ω2ω1)+δ(ω2+ω1)|k(ω2+ω1)k(ω2ω1)|.
This simplifies Eq. (A5) to
dω1π|E˜(ω2+ω1)|2|E˜(ω2ω1)|2|k(ω2+ω1)k(ω2ω1)|,
which diverges from the region around ω1=0. In order to tame this divergence, we write the integrand in Eq. (A5) as follows:
G(ω,ω1,ω2,z)|E˜(ω2)|4eiz(ω12ω22)k(ω2)τ2(ω12+ω22)
+|E˜(ω2)|4eiz(ω12ω22)k(ω2)τ2(ω12+ω22).
The triple integral of the first line can now be computed directly in the limit L, and it gives the finite result in Eq. (A3). On the other hand, the triple integral of the second line must be evaluated, keeping L finite. After performing the Gaussian integrals over ω1 and ω2, we are left with the simple integral
12A(ω)LLdz1z2+2(ω)=A(ω)logL+L2+2(ω)(ω),
where we have used the definitions in Eq. (A2). Finally, expanding at large L, we recover Eq. (A1).

Funding

European Research Council (ERC) (PALP); Knut och Alice Wallenbergs Stiftelse; Vetenskapsrådet (VR); Fundação para a Ciência e a Tecnologia (FCT); Horizon 2020 (654148).

REFERENCES

1. R. Trebino and D. J. Kane, “Using phase retrieval to measure the intensity and phase of ultrashort pulses: frequency-resolved optical gating,” J. Opt. Soc. Am. A 10, 1101–1111 (1993). [CrossRef]  

2. S. Akturk, C. D’Amico, and A. Mysyrowicz, “Measuring ultrashort pulses in the single-cycle regime using frequency-resolved optical gating,” J. Opt. Soc. Am. B 25, A63–A69 (2008). [CrossRef]  

3. C. Iaconis and I. A. Walmsley, “Spectral phase interferometry for direct electric field reconstruction of ultrashort optical pulses,” Opt. Lett. 23, 792–794 (1998). [CrossRef]  

4. T. Witting, F. Frank, C. A. Arrell, W. A. Okell, J. P. Marangos, and J. W. G. Tisch, “Characterization of high-intensity sub-4-fs laser pulses using spatially encoded spectral shearing interferometry,” Opt. Lett. 36, 1680–1682 (2011). [CrossRef]  

5. A. Moulet, S. Grabielle, C. Cornaggia, N. Forget, and T. Oksenhendler, “Single-shot, high-dynamic-range measurement of sub-15 fs pulses by self-referenced spectral interferometry,” Opt. Lett. 35, 3856–3858 (2010). [CrossRef]  

6. J. Itatani, F. Quéré, G. L. Yudin, M. Y. Ivanov, F. Krausz, and P. B. Corkum, “Attosecond streak camera,” Phys. Rev. Lett. 88, 173903 (2002). [CrossRef]  

7. Y. Mairesse and F. Quéré, “Frequency-resolved optical gating for complete reconstruction of attosecond bursts,” Phys. Rev. A 71, 011401(R) (2005). [CrossRef]  

8. A. S. Wyatt, T. Witting, A. Schiavi, D. Fabris, P. Matia-Hernando, I. A. Walmsley, J. P. Marangos, and J. W. G. Tisch, “Attosecond sampling of arbitrary optical waveforms,” Optica 3, 303–310 (2016). [CrossRef]  

9. V. V. Lozovoy, I. Pastirk, and M. Dantus, “Multiphoton intrapulse interference. IV. Ultrashort laser pulse spectral phase characterization and compensation,” Opt. Lett. 29, 775–777 (2004). [CrossRef]  

10. V. Loriot, G. Gitzinger, and N. Forget, “Self-referenced characterization of femtosecond laser pulses by chirp scan,” Opt. Express 21, 24879–24893 (2013). [CrossRef]  

11. M. Miranda, T. Fordell, C. Arnold, A. L’Huillier, and H. Crespo, “Simultaneous compression and characterization of ultrashort laser pulses using chirped mirrors and glass wedges,” Opt. Express 20, 688–697 (2012). [CrossRef]  

12. D. Fabris, W. Holgado, F. Silva, T. Witting, J. W. G. Tisch, and H. Crespo, “Single-shot implementation of dispersion-scan for the characterization of ultrashort laser pulses,” Opt. Express 23, 32803–32808 (2015). [CrossRef]  

13. M. Miranda, C. L. Arnold, T. Fordell, F. Silva, B. Alonso, R. Weigand, A. L’Huillier, and H. Crespo, “Characterization of broadband few-cycle laser pulses with the d-scan technique,” Opt. Express 20, 18732–18743 (2012). [CrossRef]  

14. K. W. DeLong, D. N. Fittinghoff, R. Trebino, B. Kohler, and K. Wilson, “Pulse retrieval in frequency-resolved optical gating based on the method of generalized projections,” Opt. Lett. 19, 2152–2154 (1994). [CrossRef]  

15. D. J. Kane, G. Rodriguez, A. J. Taylor, and T. S. Clement, “Simultaneous measurement of two ultrashort laser pulses from a single spectrogram in a single shot,” J. Opt. Soc. Am. B 14, 935–943 (1997). [CrossRef]  

16. D. J. Kane, “Real-time measurement of ultrashort laser pulses using principal component generalized projections,” IEEE J. Sel. Top. Quantum Electron. 4, 278–284 (1998). [CrossRef]  

17. R. W. Gerchberg and W. O. Saxton, “A practical algorithm for the determination of phase from image and diffraction plane pictures,” Optik 35, 237–246 (1972).

18. D. Spangenberg, E. Rohwer, M. H. Brügmann, and T. Feurer, “Ptychographic ultrafast pulse reconstruction,” Opt. Lett. 40, 1002–1005 (2015). [CrossRef]  

19. T. Witting, D. Greening, D. Walke, P. Matia-Hernando, T. Barillot, J. P. Marangos, and J. W. G. Tisch, “Time-domain ptychography of over-octave-spanning laser pulses in the single-cycle regime,” Opt. Lett. 41, 4218–4221 (2016). [CrossRef]  

20. A. Weiner, “Effect of group velocity mismatch on the measurement of ultrashort optical pulses via second harmonic generation,” IEEE J. Quantum Electron. 19, 1276–1283 (1983). [CrossRef]  

21. A. Baltuška, M. S. Pshenichnikov, and D. A. Wiersma, “Amplitude and phase characterization of 4.5-fs pulses by frequency-resolved optical gating,” Opt. Lett. 23, 1474–1476 (1998). [CrossRef]  

22. D. E. Wilcox and J. P. Ogilvie, “Comparison of pulse compression methods using only a pulse shaper,” J. Opt. Soc. Am. B 31, 1544–1554 (2014). [CrossRef]  

23. P. Rudawski, A. Harth, C. Guo, E. Lorek, M. Miranda, C. Heyl, E. Larsen, J. Ahrens, O. Prochnow, T. Binhammer, U. Morgner, J. Mauritsson, A. L’Huillier, and C. L. Arnold, “Carrier-envelope phase dependent high-order harmonic generation with a high-repetition rate OPCPA-system,” Eur. Phys. J. D 69, 70 (2015). [CrossRef]  

24. M. Louisy, C. L. Arnold, M. Miranda, E. W. Larsen, S. N. Bengtsson, D. Kroon, M. Kotur, D. Guénot, L. Rading, P. Rudawski, F. Brizuela, F. Campi, B. Kim, A. Jarnac, A. Houard, J. Mauritsson, P. Johnsson, A. L’Huillier, and C. M. Heyl, “Gating attosecond pulses in a noncollinear geometry,” Optica 2, 563–566 (2015). [CrossRef]  

25. F. Silva, M. Miranda, B. Alonso, J. Rauschenberger, V. Pervak, and H. Crespo, “Simultaneous compression, characterization and phase stabilization of GW-level 1.4 cycle VIS-NIR femtosecond pulses using a single dispersion-scan setup,” Opt. Express 22, 10181–10191 (2014). [CrossRef]  

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (8)

Fig. 1.
Fig. 1. Example of (a) simulated and (b) retrieved d-scan traces. (c) Both spectral intensity (blue) and phase (orange) are precisely retrieved, as well as the corresponding pulse in the time domain. (d) Retrieved fields are plotted in lighter colors. Note that in this plot the simulated and retrieved fields overlap almost exactly and cannot be easily distinguished.
Fig. 2.
Fig. 2. Example of (a) simulated and (b) retrieved scans of a double pulse. The retrieved spectral intensity and phase are shown in (c) in light colors, as well as the corresponding spectral intensity for an isolated pulse. The corresponding pulses in the time domain are shown in (d).
Fig. 3.
Fig. 3. Example of (a) simulated trace where a spectral filter was applied, simulating phase-matching and clipping. The algorithm uses the known fundamental spectrum (c) and retrieves a trace (b) very similar to the original trace. The corresponding pulse in the time domain is shown in (d).
Fig. 4.
Fig. 4. Example of (a) simulated trace with added noise and (b) corresponding retrieved trace. The basic algorithm retrieves (c) both spectral amplitude and phase, but especially the spectral amplitude (light-colored line) is not retrieved very accurately. In the time domain (d) the main features are reproduced but much less accurately than in the noiseless cases.
Fig. 5.
Fig. 5. Same as previous case, but with known fundamental spectrum. The algorithm variation that includes projection of the fundamental spectrum was used, yielding a much better reconstruction.
Fig. 6.
Fig. 6. Same as previous case, but using a mixed algorithm. After the retrieval using the basic algorithm, a multidimensional algorithm optimizes the spectral intensity. The retrieved spectral phase is left unchanged, and a generic optimization algorithm minimizes the error between (a) simulated and (b) retrieved scans by applying a filter curve to the previously retrieved spectral intensity.
Fig. 7.
Fig. 7. Characterization of the output from an OPCPA system, with (b) retrieved trace very similar to (a) measured trace. (c) Retrieved spectral intensity and phase (light colored) are compared to the directly measured spectrum (dark color). (d) The shortest pulse (obtained at insertion 0) is 6.3 fs FWHM.
Fig. 8.
Fig. 8. Characterization of the output from a hollow-core fiber compressor. (a) Measured and (b) retrieved trace using the basic algorithm. Light colored lines correspond to the retrieval done with the basic algorithm (i.e., without using the measured spectrum). Dark colored lines correspond to the retrieval using the algorithm variation for noncalibrated traces, which uses the measured spectrum. The retrieved pulse durations in both cases is 3.0 fs FWHM.

Equations (43)

Equations on this page are rendered with MathJax. Learn more.

E ˜ ( ω ) = | E ˜ ( ω ) | exp [ i ψ ( ω ) ]
Φ ( ω , z ) = exp [ i z k ( ω ) ] .
S ( ω , z ) = F { F 1 { E ˜ ( ω ) Φ ( ω , z ) } 2 } ,
I ( ω , z ) = | S ( ω , z ) | 2 .
M ( ω ) = L + L I ( ω , z ) d z .
E ˜ l = 0 ( ω ) .
Φ ( ω , z ) = exp [ i z k ( ω ) ] ,
U ˜ l ( ω , z ) = E ˜ l ( ω ) Φ ( ω , z ) ,
U l ( t , z ) = F 1 { U ˜ l ( ω , z ) } ,
U l SHG ( t , z ) = U l 2 ( t , z ) ,
S l ( ω , z ) = F { U l SHG ( t , z ) } .
S l ( ω , z ) = S meas ( ω , z ) exp { i arg [ S l ( ω , z ) ] } ,
U l SHG ( t , z ) = F 1 { S l ( ω , z ) } .
P l ( t , z ) = U l SHG ( t , z ) U l * ( t , z ) ,
U l ( t , z ) = | P l ( t , z ) | 1 / 3 exp { i arg [ P l ( t , z ) ] } .
U ˜ l ( ω , z ) = F { U l ( t , z ) } ,
U ˜ l ( ω , z ) = U ˜ l ( ω , z ) Φ * ( ω , z ) .
E ˜ l + 1 ( ω ) = 1 Δ z z U ˜ l ( ω , z ) d z ,
G 2 = 1 N j N k j , k ( I meas ( ω j , z k ) μ I retr ( ω j , z k ) ) 2 ,
μ = j , k I meas ( ω j , z k ) I retr ( ω j , z k ) j , k I retr ( ω j , z k ) .
E ˜ l ( ω ) = z U ˜ l ( ω , z ) w ( z ) d z z w ( z ) d z ,
w ( z ) = ω S meas ( ω , z ) d ω .
P l ( t , z ) = U l THG ( t , z ) [ U l * ( t , z ) ] 2
U l ( t , z ) = | P l ( t , z ) | 1 / 5 exp { i arg [ P l ( t , z ) ] } .
I meas ( ω , z ) = I retr ( ω , z ) R ( ω ) ,
G 2 = 1 N j N k j , k ( I meas ( ω j , z k ) μ ( ω j ) I retr ( ω j , z k ) ) 2 .
μ ( ω j ) = k I meas ( ω j , z k ) I retr ( ω j , z k ) k I retr ( ω j , z k ) .
E ˜ l ( ω ) = | E ˜ meas ( ω ) | exp { i arg [ E ˜ l ( ω ) ] } .
I meas ( ω , z ) = I meas ( ω , z ) / μ ( ω ) ,
S meas ( ω , z ) = | I meas ( ω , z ) | ,
S l ( ω , z ) = S meas ( ω , z ) exp { i arg [ S l ( ω , z ) ] } sgn [ I meas ( ω , z ) ] .
L L d z | S ( ω , z ) | 2 = A ( ω ) log 2 L ( ω ) + B ( ω ) + O ( L 1 ) ,
( ω ) = τ 2 | k ( ω 2 ) | , A ( ω ) = 1 2 π | k ( ω 2 ) | | E ˜ ( ω 2 ) | 4 ,
B ( ω ) = d ω 1 π [ | E ˜ ( ω 2 + ω 1 ) | 2 | E ˜ ( ω 2 ω 1 ) | 2 | k ( ω 2 + ω 1 ) k ( ω 2 ω 1 ) | | E ˜ ( ω 2 ) | 4 e 2 τ 2 ω 1 2 | 2 ω 1 k ( ω 2 ) | ] .
d ω 1 2 π E ˜ ( ω 2 + ω 1 ) E ˜ ( ω 2 ω 1 ) e i z [ k ( ω 2 + ω 1 ) + k ( ω 2 ω 1 ) ] .
L L d z | S ( ω , z ) | 2 = d ω 1 d ω 2 ( 2 π ) 2 L L d z G ( ω , ω 1 , ω 2 , z ) ,
G ( ω , ω 1 , ω 2 , z ) = e i z [ k ( ω 2 + ω 1 ) + k ( ω 2 ω 1 ) k ( ω 2 + ω 2 ) k ( ω 2 ω 2 ) ] E ˜ ( ω 2 + ω 1 ) E ˜ ( ω 2 ω 1 ) E ˜ * ( ω 2 + ω 2 ) E ˜ * ( ω 2 ω 2 ) .
δ ( k ( ω 2 + ω 1 ) + k ( ω 2 ω 1 ) k ( ω 2 + ω 2 ) k ( ω 2 ω 2 ) ) .
δ ( ω 2 ω 1 ) + δ ( ω 2 + ω 1 ) | k ( ω 2 + ω 1 ) k ( ω 2 ω 1 ) | .
d ω 1 π | E ˜ ( ω 2 + ω 1 ) | 2 | E ˜ ( ω 2 ω 1 ) | 2 | k ( ω 2 + ω 1 ) k ( ω 2 ω 1 ) | ,
G ( ω , ω 1 , ω 2 , z ) | E ˜ ( ω 2 ) | 4 e i z ( ω 1 2 ω 2 2 ) k ( ω 2 ) τ 2 ( ω 1 2 + ω 2 2 )
+ | E ˜ ( ω 2 ) | 4 e i z ( ω 1 2 ω 2 2 ) k ( ω 2 ) τ 2 ( ω 1 2 + ω 2 2 ) .
1 2 A ( ω ) L L d z 1 z 2 + 2 ( ω ) = A ( ω ) log L + L 2 + 2 ( ω ) ( ω ) ,
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.