17 February 2023 Solution of fiber Raman amplifier model using binary search equation-based adaptive artificial bee colony algorithm
Vehbi Yolcu, Murat Yücel, Doğan Aydın
Author Affiliations +
Abstract

Due to the need for high bandwidth, there is growing interest in distributed fiber Raman amplifiers (FRA). In addition to having wide bandwidth, FRAs have the advantages of a low noise factor and simplicity of use. However, the optimization of the wavelength and power values of the pump lasers to be used in FRAs for a broadband and flat gain region is an important problem to be solved. In this study, a distributed FRA system was set using 100 signals with a 50-km propagation distance and 8 pump signals in the opposite direction, which were gain-flattened. The attenuation coefficient of SMF-28 type optical fiber was used in the system. First, optimum pump wavelengths and power levels were found by the binary search equation based adaptive artificial bee colony algorithm. Then, the FRA boundary value problem (BVP) was solved with the MATLAB BVP solver. Finally, the analytical Jacobian matrix required for the solution of the equation was included in the system, and faster and more effective results were obtained. The results show that the gain ripple of 100 optical signals was 0.5 dB at the maximum.

© 2023 Society of Photo-Optical Instrumentation Engineers (SPIE)
Vehbi Yolcu, Murat Yücel, and Doğan Aydın "Solution of fiber Raman amplifier model using binary search equation-based adaptive artificial bee colony algorithm," Optical Engineering 62(2), 026105 (17 February 2023). https://doi.org/10.1117/1.OE.62.2.026105
Received: 15 September 2022; Accepted: 30 January 2023; Published: 17 February 2023
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Raman amplifiers

Fiber amplifiers

Signal attenuation

Optical fibers

Matrices

Optical engineering

RELATED CONTENT


Back to Top