Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 0.459
JCR 5-Year IF: 0.442
Issues per year: 4
Current issue: Nov 2016
Next issue: Feb 2017
Avg review time: 98 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: 644266260
doi: 10.4316/AECE


TRAFFIC STATS

1,465,576 unique visits
469,971 downloads
Since November 1, 2009



Robots online now
Yahoo! Slurp


SJR SCImago RANK

SCImago Journal & Country Rank


SEARCH ENGINES

aece.ro - Google Pagerank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 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
 
 
 Volume 13 (2013)
 
     »   Issue 4 / 2013
 
     »   Issue 3 / 2013
 
     »   Issue 2 / 2013
 
     »   Issue 1 / 2013
 
 
  View all issues  








LATEST NEWS

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

2015-Dec-04
Starting with Issue 2/2016, the article processing charge is 300 EUR for each article accepted for publication. The charge of 25 EUR per page for papers over 8 pages will not be changed. Details are available in the For authors section.

2015-Jun-10
Thomson Reuters published the Journal Citations Report for 2014. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.529, and the JCR 5-Year Impact Factor is 0.476.

2015-Feb-09
Starting on the 9th of February 2015, we require all authors to identify themselves, when a submission is made, by entering their SCOPUS Author IDs, instead of the organizations, when available. This information will let us better know the publishing history of the authors and better assign the reviewers on different topics.

2015-Feb-08
We have more than 500 author names on the ban-list for cheating, including plagiarism, false signatures on the copyright form, false E-mail addresses and even tentative to impersonate well-known researchers in order to become a reviewer of our Journal. We maintain a full history of such incidents.

Read More »


    
 

  1/2014 - 21
View TOC | « Previous Article | Next Article »

Threshold Based Iteration Stopping Criterion for Turbo Codes and for Scheme Combining a Turbo Code and a Golden Space-Time Block Code

SAVIN, A. See more information about SAVIN, A. on SCOPUS See more information about SAVIN, A. on IEEExplore See more information about SAVIN, A. on Web of Science, TRIFINA, L. See more information about  TRIFINA, L. on SCOPUS See more information about  TRIFINA, L. on SCOPUS See more information about TRIFINA, L. on Web of Science, ANDREI, M. See more information about ANDREI, M. on SCOPUS See more information about ANDREI, M. on SCOPUS See more information about ANDREI, M. 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 (653 KB) | Citation | Downloads: 287 | Views: 1,867

Author keywords
average number of iterations, space-time block codes, stopping criterion, threshold, turbo codes

References keywords
turbo(15), decoding(13), stopping(11), codes(8), communications(7), letters(6), criterion(6), iterative(5), soft(4), isscs(4)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2014-02-28
Volume 14, Issue 1, Year 2014, On page(s): 139 - 142
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2014.01021
Web of Science Accession Number: 000332062300021
SCOPUS ID: 84894607425

Abstract
Quick view
Full text preview
This paper proposes an iteration stopping criterion for turbo decoding with Benedetto's decoding algorithm based on a posteriori probabilities. This stopping criterion is used in two schemes. Firstly, it is used in a classical turbo code scheme on additive white gaussian noise (AWGN) channel. Secondly, it is used in a scheme combining a turbo code and a Golden space-time block code on fast Rayleigh fading multiple input multiple output (MIMO) channel. Simulation results with different thresholds for the stopping criterion show that a threshold of 1.2 and 1.4 in the first and second scheme, respectively, are sufficient for obtaining the same bit error rate and frame error rate performance like in the case of using the ideal genie stopping criterion. The difference between the average number of iterations for these thresholds and for the genie stopping criterion is at most 1.5 and 1.25, respectively.


References | Cited By  «-- Click to see who has cited this paper

[1] C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error correcting coding and decoding: Turbo-codes", IEEE Proceedings of International Conference on Communications ICC 1993, Geneva, Switzerland, vol. 2, pp. 1064 -1070, 23-26 May 1993.
[CrossRef]


[2] S. Benedetto, D. Divsalar, G. Montorsi and F. Pollara, "A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes", TDA Progress Report 42-127, Nov. 1996

[3] S. Benedetto, D. Divsalar, G. Montorsy and F. Pollara, "A soft-input soft-output APP module for iterative decoding of concatenated codes", IEEE Communications Letters, vol.1, no.1, pp. 22-24, Jan. 1997.
[CrossRef] [Web of Science Times Cited 334] [SCOPUS Times Cited 405]


[4] P. Robertson, E. Villebrun and P. Hoeher, "A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain", IEEE Proceedings of International Conference on Communications ICC 1995, Seattle, Washington, pp. 1009-1013, June 1995.
[CrossRef]


[5] K. Amis, G. Sicot and D. Leroux, „Reduced complexity near-optimal iterative receiver for Wimax full-rate space-time code", 5th International Symposium on Turbo Codes and Related Topics, Lausanne, pp. 102-106, 1-5 Sept. 2008.
[CrossRef] [Web of Science Times Cited 3] [SCOPUS Times Cited 2]


[6] A. Savin and L. Trifina, "Scheme combining a turbo code and a golden space-time block code with different interleavers", IEEE International Symposium on Signals, Circuits and Systems ISSCS 2013, Iasi, Romania, pp. 37-40, 11-12 July 2013.
[CrossRef] [Web of Science Times Cited 1] [SCOPUS Times Cited 1]


[7] L. Trifina, D. Tarniceriu and H. Balta, "Threshold determining for minabsLLR stopping criterion for turbo codes", Frequenz, vol. 67, no. 9-10, pp. 321-326, Sept. 2013.
[CrossRef] [Web of Science Times Cited 3] [SCOPUS Times Cited 3]


[8] H. Balta, C. Douillard and M. Kovaci, "The minimum likelihood APP based early stopping criterion for multi-binary turbo codes", Scientific Bulletin of "Politehnica" University from Timisoara, vol. 51(65), no. 1-2, pp. 199-203, 21-22 Sept. 2006

[9] A. Matache, S. Dolinar and F. Pollara, "Stopping rules for turbo decoders," JPL TMO Progress Report, vol. 42, pp.1-22, Aug. 2000

[10] L. Trifina, H.G. Balta and A. Ruºinaru, "Decreasing of the turbo MAP decoding time by using an iterations stopping criterion", IEEE International Symposium on Signals, Circuits and Systems ISSCS 2005, Iasi, Romania, pp. 371-374, 14-15 July 2005.
[CrossRef] [SCOPUS Times Cited 8]


[11] J. Hagenauer, E. Offer and L. Papke, "Iterative decoding of binary block and convolutional codes", IEEE Transactions on Information Theory, vol. 42, no. 2, pp. 429-445, Mar. 1996.
[CrossRef] [Web of Science Times Cited 1319] [SCOPUS Times Cited 1603]


[12] R. Y. Shao, S. Lin and M. P. C. Fossorier, "Two simple stopping criteria for turbo decoding," IEEE Transactions on Communications, vol. 47, no. 8, pp. 1117-1120, Aug. 1999.
[CrossRef] [Web of Science Times Cited 151] [SCOPUS Times Cited 206]


[13] Y. Wu, B. D. Woerner and W. J. Ebel, "A simple stopping criterion for turbo decoding", IEEE Communications Letters, vol. 4, no. 8, pp. 258-260, Aug. 2000.
[CrossRef] [Web of Science Times Cited 72] [SCOPUS Times Cited 108]


[14] T. M. N. Ngatched and F. Takawira, "Simple stopping criterion for turbo decoding", IEE Electronics Letters, vol. 37, no. 22, pp. 1350-1351, Oct. 2001.
[CrossRef] [Web of Science Times Cited 22] [SCOPUS Times Cited 40]


[15] A. Taffin, "Generalised stopping criterion for iterative decoders", IEE Electronics Letters, vol. 39, no. 13, pp. 993-994, June 2003.
[CrossRef] [Web of Science Times Cited 4] [SCOPUS Times Cited 6]


[16] A. Shibutani, H. Suda and F. Adachi, "Reducing average number of turbo decoding iterations," IEE Electronics Letters, vol. 35, no. 9, pp. 701-702, Apr. 1999.
[CrossRef] [Web of Science Times Cited 45] [SCOPUS Times Cited 58]


[17] Z. Ma, W. H. Mow and P. Fan, "On the complexity reduction of turbo decoding for wideband CDMA", IEEE Transactions on Wireless Communications, vol. 4, no. 2, pp. 353-356, Mar. 2005.
[CrossRef] [Web of Science Times Cited 8] [SCOPUS Times Cited 10]


[18] F. M. Li and A. Y. Wu, "On the new stopping criteria of iterative turbo decoding by using decoding threshold," IEEE Transactions on Signal Processing, vol. 55, no. 11, pp. 5506-5516, Nov. 2007.
[CrossRef] [Web of Science Times Cited 19] [SCOPUS Times Cited 28]


[19] L. Guerrieri, D. Veronesi and P. Bisaglia, "Stopping rules for duo-binary turbo codes and application to HomePlug AV", IEEE Global Telecommunications Conference GLOBECOM 2008, pp. 2911-2915, 30 Nov. - 4 Dec. 2008.
[CrossRef] [Web of Science Times Cited 4] [SCOPUS Times Cited 1]


[20] D. H. Kim and S. W. Kim, "Bit-level stopping of turbo decoding", IEEE Communications Letters, vol. 10, no. 3, pp. 183-185, Mar. 2006.
[CrossRef] [SCOPUS Times Cited 14]




References Weight

Web of Science® Citations for all references: 1,985 TCR
SCOPUS® Citations for all references: 2,493 TCR

Web of Science® Average Citations per reference: 95 ACR
SCOPUS® Average Citations per reference: 119 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 2016-12-10 04:01 in 93 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-2016
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: