Dynamic Scheduling Decoding of LDPC Codes Based on Tabu Search

2017 ◽  
Vol 65 (11) ◽  
pp. 4612-4621 ◽  
Author(s):  
Xingcheng Liu ◽  
Chunlei Fan ◽  
Xuechen Chen
Keyword(s):  
Tabu Search ◽  
Dynamic Scheduling ◽  
Ldpc Codes

scholarly journals A Tabu Search-Based Algorithm for Airport Gate Assignment: A Case Study in Kunming, China

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jun Bi ◽  
Zhen Wu ◽  
Lei Wang ◽  
Dongfan Xie ◽  
Xiaomei Zhao
Keyword(s):  
Tabu Search ◽  
Dynamic Scheduling ◽  
Programming Model ◽  
Algorithm Design ◽  
Neighborhood Structure ◽  
Important Place ◽  
Passenger Satisfaction ◽  
Actual Operation ◽  
Gate Assignment

An airport gate is the core resource of an airport operation, which is an important place for passengers to get on and off the aircraft and for maintaining aircraft. It is the prerequisite for other related dispatch. Effective and reasonable allocation of gates can reduce airport operating costs and increase passenger satisfaction. Therefore, an airport gate assignment problem (AGAP) needs to be urgently solved in the actual operation of the airport. In this paper, considering the actual operation of the airport, we formulate an integer programming model for AGAP by considering multiple constraints. The model aims to maximize the number of passengers on flights parked at the gate. A tabu search-based algorithm is designed to solve the problem. In the process of algorithm design, an effective initial solution is obtained. A unique neighborhood structure and search strategy for tabu search are designed. The algorithm can adapt to the dynamic scheduling of airports. Finally, tests are performed using actual airport data selected from Kunming Changshui International Airport in China. The experimental results indicate that the proposed method can enhance the local search ability and global search ability and get satisfactory results in a limited time. These results provide an effective support for the actual gate assignment in airport operations.

A BP Decoding Algorithm Based on Nodes Residual for LDPC Codes and its Hardware Implementation

2011 ◽  
Vol 128-129 ◽  
pp. 7-10
Author(s):  
Zhong Xun Wang ◽  
Xing Cheng Wang ◽  
Fang Qiang Zhu
Keyword(s):  
Hardware Implementation ◽  
Belief Propagation ◽  
Dynamic Scheduling ◽  
Ldpc Codes ◽  
Ldpc Code ◽  
Low Complexity ◽  
Decoding Algorithm ◽  
Fast Decoding ◽  
Good For

We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages，such as fast decoding, good performance, and low complexity. It is similar to residual belief propagation (RBP),but has some difference in computing the residual message. This paper further optimized the new algorithm on DSP of TMS320dm6446, and it is good for hardware implementation.

Effective Informed Dynamic Scheduling for Belief Propagation Decoding of LDPC Codes

2011 ◽  
Vol 59 (10) ◽  
pp. 2683-2691 ◽  
Author(s):  
Yi Gong ◽  
Xingcheng Liu ◽  
Weicai Ye ◽  
Guojun Han
Keyword(s):  
Belief Propagation ◽  
Dynamic Scheduling ◽  
Ldpc Codes

Two-staged informed dynamic scheduling for sequential belief propagation decoding of LDPC codes

2009 ◽  
Vol 13 (3) ◽  
pp. 193-195 ◽  
Author(s):  
Saejoon Kim ◽  
K. Ko ◽  
Jun Heo ◽  
Ji-hwan Kim
Keyword(s):  
Belief Propagation ◽  
Dynamic Scheduling ◽  
Ldpc Codes
Sign in / Sign up

Export Citation Format

Share Document