Please use this identifier to cite or link to this item: https://dspace.upt.ro/xmlui/handle/123456789/1508
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBaltă, Horia Gheorghe-
dc.contributor.authorDouillard, Catherine-
dc.contributor.authorKovaci, Maria-
dc.date.accessioned2020-04-09T07:51:46Z-
dc.date.accessioned2021-03-01T08:37:11Z-
dc.date.available2020-04-09T07:51:46Z-
dc.date.available2021-03-01T08:37:11Z-
dc.date.issued2006-
dc.identifier.citationBaltă, Horia Gheorghe. The minimum likelihood APP based early stopping criterion for multi-binary turbo codes. Timişoara: Editura Politehnica, 2006en_US
dc.identifier.urihttp://primo.upt.ro:1701/primo-explore/search?query=any,contains,The%20minimum%20likelihood%20APP%20based%20early%20stopping%20criterion%20for%20multi-binary%20turbo%20codes&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo-
dc.description.abstractThis paper presents a simple and efficient criterion for stopping the iteration process in multibinary symbol turbo-decoding with a negligible degradation of the error performance. The criterion is devised starting to minimum log-likelihood ratio (LLR) based stopping criterion used for binary turbo codes (BTC). Two variants consist in particularizations of the same idea in the MAP and MaxLogMAP decoding algorithm cases. The proposed two variants criterion has efficiency close to the optimum (genie) criterion and is simple to perform.en_US
dc.language.isoenen_US
dc.publisherTimişoara: Editura Politehnicaen_US
dc.relation.ispartofseriesSeria electronică şi telecomunicaţii, Tom 51(65), fasc. 2 (2006)-
dc.subjectIterative decodingen_US
dc.subjectStopping criterionen_US
dc.subjectMulti-binary turbo codeen_US
dc.titleThe minimum likelihood APP based early stopping criterion for multi-binary turbo codes [articol]en_US
dc.typeArticleen_US
Appears in Collections:Articole științifice/Scientific articles

Files in This Item:
File Description SizeFormat 
BUPT_ART_Balta_f.pdf1.9 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.