dc.contributor.author | Wu, Y. | en |
dc.contributor.author | Hadjicostis, Christoforos N. | en |
dc.creator | Wu, Y. | en |
dc.creator | Hadjicostis, Christoforos N. | en |
dc.date.accessioned | 2019-04-08T07:48:44Z | |
dc.date.available | 2019-04-08T07:48:44Z | |
dc.date.issued | 2007 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/45097 | |
dc.description.abstract | Order-w reprocessing is a suboptimal soft-decision decoding approach for binary linear block codes in which up to w bits are systematically flipped on the so-called most reliable (information) basis (MRB). This correspondence first incorporates two preprocessing rules into order-w reprocessing and shows that, with appropriate choice of parameters, the proposed order-w reprocessing with preprocessing requires comparable complexity to order-w reprocessing but achieves asymptotically the performance of order-(w + 2) reprocessing. To complement the MRB, a second basis is employed for practical SNRs and this approach is systematically extended to a multibasis order-w reprocessing scheme for high signal-to-noise ratios (SNRs). It is shown that the proposed multibasis scheme significantly enlarges the error-correction radius, a commonly used measure of performance at high SNRs, over the original (single-basis) order-w reprocessing. As a by-product, this approach also precisely characterizes the asymptotic performance of the well-known Chase and generalized minimum distance (GMD) decoding algorithms. The proposed algorithm successfully decodes the (192, 96) Reed-Solomon concatenated code and the (256, 147) extended BCH code in near optimal manner (within 0.01 dB at a block-error rate of 10-5) with affordable computational cost. © 2007 IEEE. | en |
dc.source | IEEE Transactions on Information Theory | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-33846119146&doi=10.1109%2fTIT.2006.887478&partnerID=40&md5=626d6d877a6be0f2a90134f0b0b4d4ba | |
dc.subject | Algorithms | en |
dc.subject | Decoding | en |
dc.subject | Computational complexity | en |
dc.subject | Signal to noise ratio | en |
dc.subject | Block codes | en |
dc.subject | Error correction | en |
dc.subject | Decoding algorithms | en |
dc.subject | Binary codes | en |
dc.subject | Binary linear block codes | en |
dc.subject | Most reliable basis | en |
dc.subject | Soft-decision decoding | en |
dc.subject | Asymptotic performance | en |
dc.subject | Multibasis | en |
dc.subject | Preprocessing | en |
dc.title | Soft-decision decoding of linear block codes using preprocessing and diversification | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1109/TIT.2006.887478 | |
dc.description.volume | 53 | |
dc.description.issue | 1 | |
dc.description.startingpage | 378 | |
dc.description.endingpage | 393 | |
dc.author.faculty | Πολυτεχνική Σχολή / Faculty of Engineering | |
dc.author.department | Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering | |
dc.type.uhtype | Article | en |
dc.source.abbreviation | IEEE Trans.Inf.Theory | en |
dc.contributor.orcid | Hadjicostis, Christoforos N. [0000-0002-1706-708X] | |
dc.gnosis.orcid | 0000-0002-1706-708X | |