Improve Sum-Product Algorithm and Genetics-Aided for LDPC Codes
In this letter, we analyze the performance of two improved Sum-Product (SP) based decoding algorithms for LDPC codes. In order to improve the decoding operation and fast convergence decoder At First, Using Averaging and using bits in the wrong equations for improve the bit node update And then by using a genetic algorithm. We corrected value bits decoding mistake is detected and value soft decision is less than 2. The decoding performance of GA-SP algorithm is superior to original SP algorithms by about 2 dB and is very close to the performance of ML decoding for (2640, 1320) Tanner LDPC code.
C. E. Shannon, A Mathematical Theory of Communication," Bell system Technical Journal, vol. 27, pp. 379-423 and 623-656, July and October 1948.
R. Gallager, “Low-Density Parity-Check Codes”, Cambridge, MA: MIT Press, 1963.
D. J. C. MacKay and R. M. Neal, Near Shannon Limit Performance of Low Density Parity Check Codes," Electronics Letters, vol. 32, no. 18, pp. 1645-1646, August 1996.
C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon limit error-correction coding and decoding: Turbo-codes," in IEEE International Conference on Communications, 1993, vol. 2, May 1993, pp. 1064-1070.
Air Inference for fixed and mobile broadband wireless access systems, IEEE Std.802.16e, 2005.
Information technology-telecommunications and information exchange between system --Local and metropolitan area networks, IEEE Std.802.11n, 2007.
Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Access Method and Physical Layer Specifications, IEEE Std. 802.3an, 2006.
C. Stark, S. Jonathan and W. Yige. “ML decoding via mixed-integer adaptive linear programming,” IEEE Trans. Commun., pp. 1308-1317, Jul. 2007.
X. Y. Hu, E. Eleftheriou, D. M. Arnold, and A. Dholakia, “Efficient implementation of the sum-product algorithm for decoding LDPC codes,” IEEE GLOBECOM’01, vol. 02, pp. 1036-1036E, Nov. 2001.
J. Chen and M. P.C. Fossorier, “Near optimum universal belief propagation based decoding of low-density parity check codes,” IEEE Trans. on Commun., vol. 50, pp. 583-587, no.3 Mar. 2002.
Z. Deng, L. Xingcheng and T.Man, “Modified BP decoding algorithms combined with GA for low-density parity check codes,” International Conference on Computational Intelligence and Security, pp. 371-375, Dec. 2008.
N. Varnica, P. C. Marc, and K. Aleksandar, “Augmented belief propagation decoding of low-density parity check codes,” IEEE Trans. Commun., pp. 1308–1317, Jul. 2007.
R. Tanner, “A recursive approach to low complexity codes”. IEEE Transactions on information theory, 27(5), pp.533-547.1981
D. Whitley, “A genetic algorithm tutorial”. Statistics and computing,4(2), pp.65-85, 1994.
P.Civicioglu, "Transforming geocentric cartesian coordinates to geodetic coordinates by using differential search algorithm." Computers & Geosciences 46 (2012): 229-247.
J P. Martins, and A CB. Delbem, "Pairwise independence and its impact on Estimation of Distribution Algorithms." Swarm and Evolutionary Computation 27 (2016): 80-96.
M. Pelikan, D E. Goldberg, and E Cantú-Paz. "BOA: The Bayesian optimization algorithm." In Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation-Volume 1, pp. 525-532. Morgan Kaufmann Publishers Inc., 1999.
B. Tomoiagă, M. Chindriş, A. Sumper, A. Sudria-Andreu, and R. Villafafila-Robles. "Pareto optimal reconfiguration of power distribution systems using a genetic algorithm based on NSGA-II." Energies6, no. 3 (2013): 1439-1455.
A.E, Eiben, P-E. Raue, and Zs Ruttkay. "Genetic algorithms with multi-parent recombination." In International Conference on Parallel Problem Solving from Nature, pp. 78-87. Springer Berlin Heidelberg, 1994.
CH. Ting, "On the mean convergence time of multi-parent genetic algorithms without selection." In European Conference on Artificial Life, pp. 403-412. Springer Berlin Heidelberg, 2005.
R. Akbari, and K. Ziarati. "A multilevel evolutionary algorithm for optimizing numerical functions." International Journal of Industrial Engineering Computations 2, no. 2 (2011): 419-430.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.