Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Optics Communication...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Optics Communications
Article . 2011 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
https://dx.doi.org/10.1016/j.o...
Article
Data sources: Microsoft Academic Graph
 View all 1 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Adaptive Bit allocation algorithm based on unsaturated bandwidth of multimode fiber for optical OFDM system

descriptionPublicationkeyboard_double_arrow_right Article 01 Oct 2011 English Publisher:Elsevier BVJournal:Optics Communications, volume 284, pages 5,121-5,124 (issn: 0030-4018, Copyright policy )
Authors: Zhang Lili; Hu Guijun; Shi Jian; Wu Chao;

doi: 10.1016/j.optcom.2011.07.032

Adaptive Bit allocation algorithm based on unsaturated bandwidth of multimode fiber for optical OFDM system

Abstract

Abstract An adaptive bit allocation algorithm for Orthogonal Frequency Division Multiplexing (OFDM) multimode fiber communication system is proposed in this paper, aimed at utilizing the infinite bandwidth of multimode fiber in high frequency region. The algorithm breaks through the limitation that bits are formerly allocated only in fixed bandwidth, and is proved to be effective by simulation. Compared with greedy algorithm, new algorithm is easy to implement, and lowers bit error rate (BER) of each subcarrier effectively.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 1
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
1
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!
uploadUpload now