IDEAS home Printed from https://ideas.repec.org/a/epw/ejeng0/v7y2022i2id62767.html

Dispersion Compensation Algorithm for Single Mode Fiber

Author

Listed:
  • Remigius O. Okeke

    (University of Port Harcourt, Nigeria)

  • Ugochukwu C. Nnamdi

    (University of Port Harcourt, Nigeria)

  • Praise I. Onu

    (University of Port Harcourt, Nigeria)

Abstract

Optical fibers enable the transmission of data through a long distance at very high speed and very low latency. However, this can be limited as a result of dispersion. This paper presents a dynamic MATLAB script that can mitigate against the dispersion in a single mode fiber (SMF)by calculating the length of dispersion compensation fiber (DCF) needed to offset the dispersion. It also calculates the number of amplifiers needed and the positions the amplifiers are to be placed. The results from the MATLAB script were also authenticated using Opti system. The average Bit error rate (BER) values gotten with simulation parameters of different scenarios shown in tables 1 and 2 are 7.6857e-17 and 5.8036e-10 respectively. The average Quality factor (Q-Factor) values of 10.046203 and 7.286533 were also gotten respectively. This showed that the effect of dispersion was compensated using the DCF thus proving the validity of the script.

Suggested Citation

  • Remigius O. Okeke & Ugochukwu C. Nnamdi & Praise I. Onu, 2022. "Dispersion Compensation Algorithm for Single Mode Fiber," European Journal of Engineering and Technology Research, European Open Science, vol. 7(2), pages 92-98, March.
    • Handle: RePEc:epw:ejeng0:v:7:y:2022:i:2:id:62767
    DOI: 10.24018/ejeng.2022.7.2.2767
    as

    Download full text from publisher

    File URL: https://eu-opensci.org/index.php/ejeng/article/view/62767
    File Function: Abstract page
    Download Restriction: no
    File URL: https://eu-opensci.org/index.php/ejeng/article/download/62767/12793
    File Function: Full text
    Download Restriction: no
    File URL: https://libkey.io/10.24018/ejeng.2022.7.2.2767?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:epw:ejeng0:v:7:y:2022:i:2:id:62767. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Support (email available below). General contact details of provider: https://eu-opensci.org/index.php/ejeng .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.