Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Analysis of complex multidimensional optical spectra by linear prediction

Published

Author(s)

Ethan Swagel, Jagannath Paul, Alan Bristow, Jared Wahlstrand

Abstract

We apply Linear Prediction from Singular Value Decomposition (LPSVD) to the analysis of two-dimensional complex optical spectra. LPSVD is a non-iterative procedure that fits time-domain complex data to the sum of damped sinusoids, or Lorentzian peaks in the spectral domain. Because the fitting is linear, it is not necessary to give initial guess parameters as in nonlinear fits. Although LPSVD is a one-dimensional algorithm, it can be performed column-wise on two-dimensional data. The method has been extensively used in NMR spectroscopy, where spectral peaks are typically nearly ideal Lorentzians, but to our knowledge has not been applied in the analogous optical technique, where peaks can be far from Lorentzian. We apply LPSVD to the analysis of zero, one, and two quantum electronic two-dimensional spectra from a semiconductor microcavity. The spectra consist of non-ideal, often overlapping peaks. We find that LPSVD achieves a very good fit even on non-ideal data. It reduces noise and eliminates discrete distortions inherent in the discrete Fourier transformation (DFT). We use it to isolate and analyze weak features of interest.
Citation
Optics Express
Volume
29
Issue
23

Keywords

multidimensional spectroscopy, data analysis, optical spectroscopy

Citation

Swagel, E. , Paul, J. , Bristow, A. and Wahlstrand, J. (2021), Analysis of complex multidimensional optical spectra by linear prediction, Optics Express, [online], https://doi.org/10.1364/OE.442532, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=933154 (Accessed June 30, 2022)
Created October 27, 2021, Updated March 31, 2022