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

2011 ◽  
Vol 284 (21) ◽  
pp. 5121-5124 ◽  
Author(s):  
Zhang Lili ◽  
Hu Guijun ◽  
Shi Jian ◽  
Wu Chao
2014 ◽  
Vol 989-994 ◽  
pp. 2161-2164
Author(s):  
Wei Wei ◽  
Wen Dong An

For the greedy algorithm required a large number of iterations, this paper proposed one adaptive bit allocation algorithm based on Hughes-Hartogs algorithm which was improved greedy algorithm .Under the constraint of bit error rate and data transmission rate, the algorithm first used the Chow algorithm to allocate some of the bits, and then used the greedy algorithm to allocate the remaining bits. When minimize the total power by this algorithm, the iterations of this algorithm were significantly less than the greedy algorithm. By computer simulation, the results showed that performance of this algorithm was very close to the greedy algorithm, and the number of this algorithm’s iterations was 7.4%~34% of the greedy algorithm.


2013 ◽  
Vol 765-767 ◽  
pp. 444-447
Author(s):  
Juan Wen ◽  
Qi Ming Tian

In this paper, we propose a fast and optimal adaptive transmit power and bit allocation algorithm, which is called Bisection Searching Level (BSL) for wireless OFDMA systems. The algorithm aims at maximization of data rate under the constraints of total transmit power and bit error rate (BER). BSL is based on water pouring approach, and adopt bisection algorithm to find the water pouring level under discrete bit restriction. Both theoretical analysis and simulation results demonstrate the optimality of our proposed algorithm.


2009 ◽  
Vol 28 (2) ◽  
pp. 146-153 ◽  
Author(s):  
Wei Xie ◽  
Guijun Hu ◽  
Mingjie Xing ◽  
Zhaoxi Li

2009 ◽  
Author(s):  
Shumin Zou ◽  
Nan Chi ◽  
Yufeng Shao ◽  
Xi Zheng ◽  
Junwen Zhang ◽  
...  

2008 ◽  
Author(s):  
Zhengrong Tong ◽  
Qi Yang ◽  
Yiran Ma ◽  
William Shieh
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document