Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 0.595
JCR 5-Year IF: 0.661
Issues per year: 4
Current issue: Nov 2017
Next issue: Feb 2018
Avg review time: 106 days


PUBLISHER

Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229
ROMANIA

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


TRAFFIC STATS

1,789,941 unique visits
513,976 downloads
Since November 1, 2009



No robots online now


SJR SCImago RANK

SCImago Journal & Country Rank


SEARCH ENGINES

aece.ro - Google Pagerank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 Volume 17 (2017)
 
     »   Issue 4 / 2017
 
     »   Issue 3 / 2017
 
     »   Issue 2 / 2017
 
     »   Issue 1 / 2017
 
 
 Volume 16 (2016)
 
     »   Issue 4 / 2016
 
     »   Issue 3 / 2016
 
     »   Issue 2 / 2016
 
     »   Issue 1 / 2016
 
 
 Volume 15 (2015)
 
     »   Issue 4 / 2015
 
     »   Issue 3 / 2015
 
     »   Issue 2 / 2015
 
     »   Issue 1 / 2015
 
 
 Volume 14 (2014)
 
     »   Issue 4 / 2014
 
     »   Issue 3 / 2014
 
     »   Issue 2 / 2014
 
     »   Issue 1 / 2014
 
 
  View all issues  


FEATURED ARTICLE

Wind Speed Prediction with Wavelet Time Series Based on Lorenz Disturbance, ZHANG, Y., WANG, P., CHENG, P., LEI, S.
Issue 3/2017

AbstractPlus






LATEST NEWS

2017-Jun-14
Thomson Reuters published the Journal Citations Report for 2016. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.595, and the JCR 5-Year Impact Factor is 0.661.

2017-Apr-04
We have the confirmation Advances in Electrical and Computer Engineering will be included in the EBSCO database.

2017-Feb-16
With new technologies, such as mobile communications, internet of things, and wide applications of social media, organizations generate a huge volume of data, much faster than several years ago. Big data, characterized by high volume, diversity and velocity, increasingly drives decision making and is changing the landscape of business intelligence, from governments to private organizations, from communities to individuals. Big data analytics that discover insights from evidences has a high demand for computing efficiency, knowledge discovery, problem solving, and event prediction. We dedicate a special section of Issue 4/2017 to Big Data. Prospective authors are asked to make the submissions for this section no later than the 31st of May 2017, placing "BigData - " before the paper title in OpenConf.

2017-Jan-30
We have the confirmation Advances in Electrical and Computer Engineering will be included in the Gale database.

2016-Dec-17
IoT is a new emerging technology domain which will be used to connect all objects through the Internet for remote sensing and control. IoT uses a combination of WSN (Wireless Sensor Network), M2M (Machine to Machine), robotics, wireless networking, Internet technologies, and Smart Devices. We dedicate a special section of Issue 2/2017 to IoT. Prospective authors are asked to make the submissions for this section no later than the 31st of March 2017, placing "IoT - " before the paper title in OpenConf.

Read More »


    
 

  2/2016 - 12

A PEG Construction of LDPC Codes Based on the Betweenness Centrality Metric

BHURTAH-SEEWOOSUNGKUR, I. See more information about BHURTAH-SEEWOOSUNGKUR, I. on SCOPUS See more information about BHURTAH-SEEWOOSUNGKUR, I. on IEEExplore See more information about BHURTAH-SEEWOOSUNGKUR, I. on Web of Science, CATHERINE, P. C. See more information about  CATHERINE, P. C. on SCOPUS See more information about  CATHERINE, P. C. on SCOPUS See more information about CATHERINE, P. C. on Web of Science, SOYJAUDAH, K. M. S. See more information about SOYJAUDAH, K. M. S. on SCOPUS See more information about SOYJAUDAH, K. M. S. on SCOPUS See more information about SOYJAUDAH, K. M. S. on Web of Science
 
Click to see author's profile on See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (1,737 KB) | Citation | Downloads: 189 | Views: 678

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
Quick view
Full text preview
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 3585]


[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 1946] [SCOPUS Times Cited 2490]


[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 38] [SCOPUS Times Cited 53]


[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 Record] [SCOPUS Times Cited 13]


[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 27] [SCOPUS Times Cited 36]


[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] [SCOPUS Times Cited 894]


[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 298] [SCOPUS Times Cited 355]


[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 3] [SCOPUS Times Cited 3]


[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 687] [SCOPUS Times Cited 908]


[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 34] [SCOPUS Times Cited 40]


[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 5]


[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 1]


[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 8]


[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 2] [SCOPUS Times Cited 6]


[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 14] [SCOPUS Times Cited 16]


[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 1]


[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] [SCOPUS Times Cited 16]


[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 10] [SCOPUS Times Cited 11]


[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 21] [SCOPUS Times Cited 21]




References Weight

Web of Science® Citations for all references: 3,080 TCR
SCOPUS® Citations for all references: 8,475 TCR

Web of Science® Average Citations per reference: 114 ACR
SCOPUS® Average Citations per reference: 314 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 2017-12-12 21:17 in 177 seconds.




Note1: Web of Science® is a registered trademark of Thomson Reuters.
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-2017
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.




Website loading speed and performance optimization powered by: