Related Experiment Video
Updated: Jun 23, 2026

06:20
Flapping Soft Fin Deformation Modeling using Planar Laser-Induced Fluorescence Imaging
Published on: April 28, 2022
Fourier decomposition algorithm for leaky modes of fibres with arbitrary geometry
Optics Express
|May 14, 2009
Summary
A novel algorithm calculates confinement loss in optical fibres using a polar-coordinate Fourier decomposition method. This approach accurately models leaky modes in complex fibre structures, advancing photonic device analysis.
Area of Science:
- Photonics and Optical Engineering
- Computational Electromagnetics
Background:
- Accurate calculation of confinement loss is crucial for designing optical fibres, especially those with complex structures like microstructured fibres.
- Leaky modes in optical fibres represent energy that radiates outwards, contributing to signal loss and impacting device performance.
Purpose of the Study:
- To introduce a new algorithm for calculating the confinement loss of leaky modes in arbitrary fibre structures.
- To implement the algorithm within the scalar wave approximation for efficient computation.
Main Methods:
- The study employs a polar-coordinate Fourier decomposition method.
- Adjustable boundary conditions (ABC-FDM) are utilized to model outward radiating fields.
- The scalar wave approximation is applied for computational tractability.
Main Results:
- The developed algorithm successfully calculates leaky modes in various microstructured fibre designs.
- Demonstrated accuracy in modeling outward radiating fields for confinement loss estimation.
- The method is applicable to fibres with diverse and complex hole geometries.
Conclusions:
- The proposed algorithm provides an effective tool for analyzing confinement loss in leaky-mode optical fibres.
- The polar-coordinate Fourier decomposition method with ABC-FDM offers a robust approach for arbitrary fibre structures.
- This work contributes to the precise design and optimization of advanced photonic fibres.
Related Concept Videos
Fast Fourier Transform
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
Parseval's Theorem for Fourier transform
Parseval's theorem is a fundamental principle in signal processing that enables the calculation of a signal's energy in either the time domain or the frequency domain. This theorem is pivotal in demonstrating energy conservation between these two domains, ensuring that the computed energy value remains consistent regardless of the domain of analysis.
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a signal's...
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a signal's...
Trigonometric Fourier series
Fourier series is a foundational mathematical technique that decomposes periodic functions into an infinite series of sinusoidal harmonics. This method enables the representation of complex periodic signals as sums of simple sine and cosine functions, facilitating their analysis and interpretation in various fields, including signal processing, acoustics, and electrical engineering.
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
Discrete Fourier Transform
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Modes of Standing Waves - I
A close look at earthquakes provides evidence for the conditions appropriate for resonance, standing waves, and constructive and destructive interference. A building may vibrate for several seconds with a driving frequency matching the building's natural frequency of vibration; this produces a resonance that results in one building collapsing while the neighboring buildings do not. Often, buildings of a certain height are devastated, while other taller buildings remain intact. This phenomenon...
Properties of Fourier Transform I
The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...

