| 2/2016 - 12 |
A PEG Construction of LDPC Codes Based on the Betweenness Centrality MetricBHURTAH-SEEWOOSUNGKUR, I.   , CATHERINE, P. C. , SOYJAUDAH, K. M. S. |
View the paper record and citations in  |
| Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF  (1,737 KB) | Citation | Downloads: 755 | Views: 2,995 |
Author keywords
AWGN channels, block codes, channel coding, error correction codes, parity check codes
References keywords
codes(22), ldpc(18), algorithm(10), information(9), theory(8), communications(8), quasi(4), progressive(4), processing(4), growth(4)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2016-05-31
Volume 16, Issue 2, Year 2016, On page(s): 85 - 92
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2016.02012
Web of Science Accession Number: 000376996100012
SCOPUS ID: 84974834729
Abstract
Progressive Edge Growth (PEG) constructions are usually based on optimizing the distance metric by using various methods. In this work however, the distance metric is replaced by a different one, namely the betweenness centrality metric, which was shown to enhance routing performance in wireless mesh networks. A new type of PEG construction for Low-Density Parity-Check (LDPC) codes is introduced based on the betweenness centrality metric borrowed from social networks terminology given that the bipartite graph describing the LDPC is analogous to a network of nodes. The algorithm is very efficient in filling edges on the bipartite graph by adding its connections in an edge-by-edge manner. The smallest graph size the new code could construct surpasses those obtained from a modified PEG algorithm - the RandPEG algorithm. To the best of the authors' knowledge, this paper produces the best regular LDPC column-weight two graphs. In addition, the technique proves to be competitive in terms of error-correcting performance. When compared to MacKay, PEG and other recent modified-PEG codes, the algorithm gives better performance over high SNR due to its particular edge and local graph properties. |
| References | | | Cited By «-- Click to see who has cited this paper |
| [1] R. Gallager, "Low-density parity-check codes," IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21-28, 1962. [CrossRef] [SCOPUS Times Cited 5345] [2] D. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Transactions on Information Theory, vol. 45, no. 2, pp. 399-431, 1999. [CrossRef] [Web of Science Times Cited 2423] [SCOPUS Times Cited 3093] [3] J. M. F. Moura, J. Lu, H. Zhang, "Structured low-density parity-check codes," in IEEE Signal Processing Magazine, vol. 21, no.1, pp. 42-55, 2004. [CrossRef] [Web of Science Times Cited 45] [SCOPUS Times Cited 61] [4] C. A. Cole, S. G. Wilson, E. K. Hall, T. R. Giallorenzi, "Analysis and Design of Moderate Length Regular LDPC Codes with Low Error Floors," in 40th Annual Conference on Information Sciences and Systems, Princeton, NJ, 2006, pp. 823-828. [CrossRef] [Web of Science Times Cited 8] [SCOPUS Times Cited 18] [5] C. -C. Wang, S. R. Kulkarni, H. V. Poor, "Finding all small errorprone substructures in ldpc codes," IEEE Transactions on Information Theory, vol. 55, no. 5, pp. 1976-1999, 2009. [CrossRef] [Web of Science Times Cited 35] [SCOPUS Times Cited 46] [6] J. Campello, D. S. Modha, S. Rajagopalan, "Designing ldpc codes using bit-filling," in IEEE International Conference on Communications, Helsinki, 2001, pp. 55-59. [CrossRef] [7] J. Campello, D. S. Modha, "Extended bit-filling and ldpc code design," in IEEE Global Telecommunications Conference (GLOBECOM '01), San Antonio, TX, 2001, pp. 985-989. [CrossRef] [8] Y. Kou, S. Lin, M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 2711-2736, 2001. [CrossRef] [Web of Science Times Cited 861] [SCOPUS Times Cited 1118] [9] R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, D. J. Costello, "Ldpc block and convolutional codes based on circulant matrices," IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 2966-2984, 2004. [CrossRef] [Web of Science Times Cited 394] [SCOPUS Times Cited 504] [10] H. -Y. Liu, X. -Y. Lin, L. -R. Ma, J. Chen, "On the stopping distance and stopping redundancy of finite geometry ldpc codes," IEICE Trans. Fundam. Electron. Commun. Comput. Sci., vol. E91-A, no. 8, pp. 2159-2166, 2008. [CrossRef] [Web of Science Times Cited 4] [SCOPUS Times Cited 5] [11] Y. Cui, X. Si, Y. Shen, "A novel algorithm of constructing ldpc codes with graph theory," in IEEE Conference on Cybernetics and Intelligent Systems, Chengdu, Sept. 2008, pp. 602-605. [CrossRef] [SCOPUS Times Cited 3] [12] X. -Y. Hu, E. Eleftheriou, D. Arnold, "Regular and irregular progressive edge-growth tanner graphs," IEEE Transactions on Information Theory, vol. 51, no. 1, pp. 386-398, 2005. [CrossRef] [Web of Science Times Cited 1046] [SCOPUS Times Cited 1311] [13] A. Venkiah, D. Declercq, C. Poulliat, "Design of cages with a randomized progressive edge-growth algorithm," IEEE Communications Letters, vol. 12, no. 4, pp. 301-303, 2008. [CrossRef] [Web of Science Times Cited 45] [SCOPUS Times Cited 50] [14] P. Prompakdee, W. Phakphisut, P. Supnithi, "Quasi cyclic-ldpc codes based on peg algorithm with maximized girth property," in International Symposium on Intelligent Signal Processing and Communications Systems (ISPACS), Chiang Mai, Dec. 2011, pp. 1-4. [CrossRef] [SCOPUS Times Cited 8] [15] Z. Fan, W. Zhang, X. Liu, H. Cheng, "An improved algorithm for constructing qc-ldpc codes based on the peg algorithm," in Fourth International Conference on Communications and Networking in China (ChinaCOM), Aug. 2009, pp. 1-4. [CrossRef] [SCOPUS Times Cited 5] [16] Y. Huang, Y. Cheng, Y. Zhang, H. Han, "Construction of non-binary quasi-cyclic ldpc codes based on peg algorithm," in 12th IEEE International Conference on Communication Technology (ICCT), Nanjing, Nov. 2010, pp. 266-268. [CrossRef] [SCOPUS Times Cited 3] [17] L. Huang, Y. Wang, P. Gong, "An improved construction method of qc-ldpc codes based on the peg algorithm," in Third Pacific-Asia Conference on Circuits, Communications and System (PACCS), Wuhan, July 2011, pp. 1-4. [CrossRef] [SCOPUS Times Cited 9] [18] Z. Zhou, X. Li, D. Zheng, K. Chen, J. Li, "Extended peg algorithm for high rate ldpc codes," in IEEE International Symposium on Parallel and Distributed Processing with Applications, Chengdu, Aug. 2009, pp. 494-498. [CrossRef] [Web of Science Times Cited 3] [SCOPUS Times Cited 7] [19] P. C. Catherine, K. M. S. Soyjaudah, "A density-based progressive edge-growth matrix creation technique for ldpc codes," in 6th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), Brest, Sept. 2010, pp. 211-215. [CrossRef] [SCOPUS Times Cited 1] [20] C. T. Healy, R. C. de Lamare, "Decoder optimised progressive edge growth algorithm," in IEEE 73rd Vehicular Technology Conference (VTC Spring), Yokohama, May 2011, pp. 1-5. [CrossRef] [SCOPUS Times Cited 3] [21] S. Khazraie, R. Asvadi, A. H. Banihashemi, "A peg construction of finite-length ldpc codes with low error floor," IEEE Communications Letters, vol. 16, no. 8, pp. 1288-1291, 2012. [CrossRef] [Web of Science Times Cited 32] [SCOPUS Times Cited 38] [22] G. Srirutchataboon, A. Bajpai, L. Wuttisittikulkij, P. Kovintavewat, "Peg-like algorithm for ldpc codes," in International Electrical Engineering Congress (IEECON), Chonburi, March 2014, pp. 1-4. [CrossRef] [SCOPUS Times Cited 4] [23] M. Kas, S. Appala, C. Wang, K. M. Carley, L. R. Carley, O. K. Tonguz, "What if wireless routers were social? approaching wireless mesh networks from a social networks perspective," in IEEE Wireless Communications, vol. 19, no. 6, pp. 36-43, Dec. 2012. [CrossRef] [Web of Science Times Cited 19] [SCOPUS Times Cited 24] [24] T. V. Nguyen, A. Nosratinia, "Rate-compatible short-length protograph ldpc codes," IEEE Communications Letters, vol. 17, no. 5, pp. 948-951, 2013. [CrossRef] [Web of Science Times Cited 35] [SCOPUS Times Cited 46] [25] I. Diop, S. M. Farssi, M. Ba, H. B. Diouf, "Construction of codes protographes ldpc quasi-cycliques based on an arithmetic progression," in Second International Conference on Innovative Computing Technology (INTECH), Casablanca, Sept. 2012, pp. 194-199. [Online]. [CrossRef] [SCOPUS Times Cited 1] [26] M. Karimi, A. H. Banihashemi, "On the girth of quasi-cyclic protograph ldpc codes," IEEE Transactions on Information Theory, vol. 59, no. 7, pp. 4542-4552, 2013. [CrossRef] [Web of Science Times Cited 66] [SCOPUS Times Cited 75] Web of Science® Citations for all references: 5,016 TCR SCOPUS® Citations for all references: 11,778 TCR Web of Science® Average Citations per reference: 186 ACR SCOPUS® Average Citations per reference: 436 ACR TCR = Total Citations for References / ACR = Average Citations per Reference We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more Citations for references updated on 2024-04-13 14:29 in 156 seconds. Note1: Web of Science® is a registered trademark of Clarivate Analytics. Note2: SCOPUS® is a registered trademark of Elsevier B.V. Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site. |
Copyright ©2001-2024
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
