Show simple item record

dc.contributor.authorTakos, G.en
dc.contributor.authorHadjicostis, Christoforos N.en
dc.creatorTakos, G.en
dc.creatorHadjicostis, Christoforos N.en
dc.date.accessioned2019-04-08T07:48:25Z
dc.date.available2019-04-08T07:48:25Z
dc.date.issued2008
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/44934
dc.description.abstractThis paper analyzes the effects of quantization or other low-level noise on the error correcting capability of a popular class of real-number Bose-Chaudhuri-Hocquenghem (BCH) codes known as discrete Fourier transform (DFT) codes. In the absence of low-level noise, a modified version of the Peterson-Gorenstein-Zierler (PGZ) algorithm allows the correction of up to ⌊ (N-K)/2⌋ corrupted entries in the real-valued code vector of an (N, K) DFT code. In this paper, we analyze the performance of this modified PGZ algorithm in the presence of low-level (quantization or other) noise that might affect each entry of the code vector (and not simply ⌊ (N - K)/2⌋ of them). We focus on the part of the algorithm that determines the number of errors that have corrupted the real-number codeword. Our approach for determining the number of errors is more effective than existing systematic approaches in the literature and results in an explicit lower bound on the precision needed to guarantee the correct determination of the number of errors; our simulations suggest that this bound can be tight. Finally, we prove that the optimal bit allocation for DFT codes (in terms of correctly determining the number of errors) is the uniform one. © 2008 IEEE.en
dc.sourceIEEE Transactions on Signal Processingen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-40749092834&doi=10.1109%2fTSP.2007.908939&partnerID=40&md5=dd00f4caad1eb0482b92cf16d50b3c29
dc.subjectComputer simulationen
dc.subjectVector quantizationen
dc.subjectCodes (symbols)en
dc.subjectError correctionen
dc.subjectPeterson-gorenstein-zierler (pgz) algorithmen
dc.subjectBose-chaudhuri-hocquenghem (bch) codesen
dc.subjectBose-chaudhuri-hocquenghem codesen
dc.subjectCode vectoren
dc.subjectDiscrete fourier transform (dft) codesen
dc.subjectDiscrete fourier transformsen
dc.subjectPeterson-gorenstein-zierler algorithmen
dc.subjectQuantization noiseen
dc.subjectReal-number codesen
dc.titleDetermination of the number of errors in DFT codes subject to low-level quantization noiseen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1109/TSP.2007.908939
dc.description.volume56
dc.description.issue3
dc.description.startingpage1043
dc.description.endingpage1054
dc.author.facultyΠολυτεχνική Σχολή / Faculty of Engineering
dc.author.departmentΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.type.uhtypeArticleen
dc.source.abbreviationIEEE Trans Signal Processen
dc.contributor.orcidHadjicostis, Christoforos N. [0000-0002-1706-708X]
dc.gnosis.orcid0000-0002-1706-708X


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record