Pascal de Koster
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pascal de Koster has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Sander Wahls
Karlsruhe Institute of Technology
3 shared publications Elizaveta Wobbes
Department of Applied Mathematics, Section of Numerical Analysis, Delft University of Technology, Delft, The Netherlands
2 shared publicationsMatthias Möller
Department of Applied Mathematics, Section of Numerical Analysis, Delft University of Technology, Delft, The Netherlands
2 shared publicationsRoel Tielen
Department of Applied Mathematics, Section of Numerical Analysis, Delft University of Technology, Delft, The Netherlands
2 shared publicationsSander Wahls
2 shared publicationsJonas Koch
Chair of Communications, Christian-Albrechts-Universitat zu Kiel, Kaiserstraße 2, Kiel, Germany
1 shared publication
Latest Publications
- Open Access
- 2 February 2024
- Published by Elsevier in Wave Motion
- Vol. 127
Data-driven identification of the spectral operator in AKNS Lax pairs using conserved quantities
- 2 February 2024
- Published by Elsevier in Wave Motion
- Vol. 127
Open AccessData-driven identification of the spectral operator in AKNS Lax pairs using conserved quantities
- Open Access
- 9 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Photonics Journal
- Vol. 15 (6) , 1-13
Fast Single-Mode Fiber Nonlinearity Monitoring: An Experimental Comparison Between Split-Step and Nonlinear Fourier Transform-Based Methods
We experimentally investigate the problem of monitoring the Kerr-nonlinearity coefficient γ from transmitted and received data for a single-mode fiber link of 1600km length. We compare the accuracy and speed of three different approaches. First, a standard split-step Fourier method is used to predict the output at various γ values, which are then compared to the measured output. Second, a recently proposed nonlinear Fourier transform (NFT)-based method, which matches solitonic eigenvalues in the transmitted and received signals for various γ values. Third, a novel fast version of the NFT-based method, which only matches the highest few eigenvalues. Although the NFT-basedmethodsdonotscalewithlinklength,wedemonstrate that the SSFM-based method is significantly faster than the basic NFT-based method for the considered link of 1600km, and outperforms even the faster version. However, for a simulated link of 8000km, the fast NFT-based method is shown to be faster than the SSMF-based method, although at the cost of a small loss in accuracy.
- 9 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Photonics Journal
- Vol. 15 (6) , 1-13
Open AccessFast Single-Mode Fiber Nonlinearity Monitoring: An Experimental Comparison Between Split-Step and Nonlinear Fourier Transform-Based Methods
We experimentally investigate the problem of monitoring the Kerr-nonlinearity coefficient γ from transmitted and received data for a single-mode fiber link of 1600km length. We compare the accuracy and speed of three different approaches. First, a standard split-step Fourier method is used to predict the output at various γ values, which are then compared to the measured output. Second, a recently proposed nonlinear Fourier transform (NFT)-based method, which matches solitonic eigenvalues in the transmitted and received signals for various γ values. Third, a novel fast version of the NFT-based method, which only matches the highest few eigenvalues. Although the NFT-basedmethodsdonotscalewithlinklength,wedemonstrate that the SSFM-based method is significantly faster than the basic NFT-based method for the considered link of 1600km, and outperforms even the faster version. However, for a simulated link of 8000km, the fast NFT-based method is shown to be faster than the SSMF-based method, although at the cost of a small loss in accuracy.
- 13 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 41 (20) , 6586-6598
Fast and Reliable Detection of Significant Solitons in Signals With Large Time-Bandwidth Products
We present a fast method to calculate the significantly large solitonic components of signals with large time-bandwidth products governed by the nonlinear Schrödinger equation, for which the computation typically becomes prohibitively expensive and/or numerically unstable. We partition the full signal in both frequency and time to obtain short signals with a constant number of samples, independent of the size of the full signal. The solitons within each short signal are computed using a conventional nonlinear Fourier transform (NFT) algorithm. The partitioning in general leads to spurious solitons not present in the full signal. We therefore design an acceptance scheme that removes spurious solitons. The remaining solitons are attributed to the full signal. Solitons that are too wide to fit into the short signals cannot be detected by this approach, but since wide solitons must be of low amplitude, the significant solitons will be found. This approach only requires $\mathcal {O}(N)$ floating point operations, with $N$ the number of signal samples. It can furthermore be applied to signals with large time-bandwidth products for which conventional NFT algorithms become unreliable or even fail. When applying our proposed method to a signal of 15,000 samples, the significant solitonic components were computed 14 times faster than when considering the whole signal, for which the conventional algorithm furthermore provided wrong results. We found that time-partitioning yields accurate results, while frequency-partitioning causes a small loss in accuracy. Combined frequency-time partitioning leads to the fastest computation, but also suffers from the same loss in accuracy as with frequency-partitioning. As time-partitioning yields a significant speed-up at nearly no loss in accuracy, we regard this as the method of choice in most practical scenarios.
- 13 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 41 (20) , 6586-6598
Fast and Reliable Detection of Significant Solitons in Signals With Large Time-Bandwidth Products
We present a fast method to calculate the significantly large solitonic components of signals with large time-bandwidth products governed by the nonlinear Schrödinger equation, for which the computation typically becomes prohibitively expensive and/or numerically unstable. We partition the full signal in both frequency and time to obtain short signals with a constant number of samples, independent of the size of the full signal. The solitons within each short signal are computed using a conventional nonlinear Fourier transform (NFT) algorithm. The partitioning in general leads to spurious solitons not present in the full signal. We therefore design an acceptance scheme that removes spurious solitons. The remaining solitons are attributed to the full signal. Solitons that are too wide to fit into the short signals cannot be detected by this approach, but since wide solitons must be of low amplitude, the significant solitons will be found. This approach only requires $\mathcal {O}(N)$ floating point operations, with $N$ the number of signal samples. It can furthermore be applied to signals with large time-bandwidth products for which conventional NFT algorithms become unreliable or even fail. When applying our proposed method to a signal of 15,000 samples, the significant solitonic components were computed 14 times faster than when considering the whole signal, for which the conventional algorithm furthermore provided wrong results. We found that time-partitioning yields accurate results, while frequency-partitioning causes a small loss in accuracy. Combined frequency-time partitioning leads to the fastest computation, but also suffers from the same loss in accuracy as with frequency-partitioning. As time-partitioning yields a significant speed-up at nearly no loss in accuracy, we regard this as the method of choice in most practical scenarios.
- 1 January 2022
- Published by Optica Publishing Group
- p. W2A.39
Experimental validation of nonlinear Fourier transform-based Kerr-nonlinearity identification over a 1600 km SSMF link
Recently, a nonlinear Fourier transform-based Kerr-nonlinearity identification algorithm was demonstrated for a 1000 km NZDSF link with accuracy of 75%. Here, we demonstrate an accuracy of 99% over 1600 km SSMF. Reasons for improved accuracy are discussed.
- 1 January 2022
- Published by Optica Publishing Group
- p. W2A.39
Experimental validation of nonlinear Fourier transform-based Kerr-nonlinearity identification over a 1600 km SSMF link
Recently, a nonlinear Fourier transform-based Kerr-nonlinearity identification algorithm was demonstrated for a 1000 km NZDSF link with accuracy of 75%. Here, we demonstrate an accuracy of 99% over 1600 km SSMF. Reasons for improved accuracy are discussed.
- Open Access
- 26 March 2020
- Published by Elsevier in Computational Particle Mechanics
- Vol. 8 (2) , 273-288
Extension of B-spline Material Point Method for unstructured triangular grids using Powell–Sabin splines
- 26 March 2020
- Published by Elsevier in Computational Particle Mechanics
- Vol. 8 (2) , 273-288
Open AccessExtension of B-spline Material Point Method for unstructured triangular grids using Powell–Sabin splines
- 9 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 38 (12) , 3252-3260
Dispersion and Nonlinearity Identification for Single-Mode Fibers Using the Nonlinear Fourier Transform
Efficient fiber-optic communication requires precise knowledge of the fiber coefficients, but these often change over time due to factors such as aging or bending. We propose a novel algorithm that identifies the average second-order dispersion and Kerr nonlinearity coefficient of a fiber, without employing any special training signals. Instead, ordinary input and output data recorded during normal operation is used. To the best of our knowledge, this is the first such algorithm. The algorithm is based on the nonlinear Fourier spectrum of the signal, which is known to evolve trivially as the signal propagates through an idealized model of the fiber. The algorithm varies the values of the fiber coefficients until the corresponding nonlinear Fourier spectrum at transmitter and receiver match optimally. We test the algorithm on simulated transmission data over a 1600 km link, and accurately identify the fiber coefficients. The identification algorithm is in particular well suited for providing a fiber model for nonlinear Fourier transform-based communication.
- 9 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 38 (12) , 3252-3260
Dispersion and Nonlinearity Identification for Single-Mode Fibers Using the Nonlinear Fourier Transform
Efficient fiber-optic communication requires precise knowledge of the fiber coefficients, but these often change over time due to factors such as aging or bending. We propose a novel algorithm that identifies the average second-order dispersion and Kerr nonlinearity coefficient of a fiber, without employing any special training signals. Instead, ordinary input and output data recorded during normal operation is used. To the best of our knowledge, this is the first such algorithm. The algorithm is based on the nonlinear Fourier spectrum of the signal, which is known to evolve trivially as the signal propagates through an idealized model of the fiber. The algorithm varies the values of the fiber coefficients until the corresponding nonlinear Fourier spectrum at transmitter and receiver match optimally. We test the algorithm on simulated transmission data over a 1600 km link, and accurately identify the fiber coefficients. The identification algorithm is in particular well suited for providing a fiber model for nonlinear Fourier transform-based communication.
- Open Access
Extension of B-spline Material Point Method for unstructured triangular grids using Powell-Sabin splines
The Material Point Method (MPM) is a numerical technique that combines a fixed Eulerian background grid and Lagrangian point masses to simulate materials which undergo large deformations. Within the original MPM, discontinuous gradients of the piecewise-linear basis functions lead to so-called `grid-crossing errors' when particles cross element boundaries. Previous research has shown that B-spline MPM (BSMPM) is a viable alternative not only to MPM, but also to more advanced versions of the method that are designed to reduce the grid-crossing errors. In contrast to many other MPM-related methods, BSMPM has been used exclusively on structured rectangular domains, considerably limiting its range of applicability. In this paper, we present an extension of BSMPM to unstructured triangulations. The proposed approach combines MPM with $C^1$-continuous high-order Powell-Sabin (PS) spline basis functions. Numerical results demonstrate the potential of these basis functions within MPM in terms of grid-crossing-error elimination and higher-order convergence.
Open AccessExtension of B-spline Material Point Method for unstructured triangular grids using Powell-Sabin splines
The Material Point Method (MPM) is a numerical technique that combines a fixed Eulerian background grid and Lagrangian point masses to simulate materials which undergo large deformations. Within the original MPM, discontinuous gradients of the piecewise-linear basis functions lead to so-called `grid-crossing errors' when particles cross element boundaries. Previous research has shown that B-spline MPM (BSMPM) is a viable alternative not only to MPM, but also to more advanced versions of the method that are designed to reduce the grid-crossing errors. In contrast to many other MPM-related methods, BSMPM has been used exclusively on structured rectangular domains, considerably limiting its range of applicability. In this paper, we present an extension of BSMPM to unstructured triangulations. The proposed approach combines MPM with $C^1$-continuous high-order Powell-Sabin (PS) spline basis functions. Numerical results demonstrate the potential of these basis functions within MPM in terms of grid-crossing-error elimination and higher-order convergence.