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:43Z | |
dc.date.available | 2019-04-08T07:48:43Z | |
dc.date.issued | 2008 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/45095 | |
dc.description.abstract | The Lee metric measures the circular distance between two elements in a cyclic group and is particularly appropriate as a measure of distance for data transmission under phase-shift-keying modulation over a white noise channel. In this paper, using newly derived properties on Newton's identities, we initially investigate the Lee distance properties of a class of BCH codes and show that (for an appropriate range of parameters) their minimum Lee distance is at least twice their designed Hamming distance. We then make use of properties of these codes to devise an efficient algebraic decoding algorithm that successfully decodes within the above lower bound of the Lee error-correction capability. Finally, we propose an attractive design for the corresponding VLSI architecture that is only mildly more complex than popular decoder architectures under the Hamming metric; since the proposed architecture can also be used for decoding under the Hamming metric without extra hardware, one can use the proposed architecture to decode under both distance metrics (Lee and Hamming). © 2008 IEEE. | en |
dc.source | IEEE Transactions on Communications | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-58049209266&doi=10.1109%2fTCOMM.2008.041227&partnerID=40&md5=9c7e00ad1a319c8c2d35cc9dd595e098 | |
dc.subject | Architecture | en |
dc.subject | Hamming distance | en |
dc.subject | Control theory | en |
dc.subject | Proposed architectures | en |
dc.subject | Decoding | en |
dc.subject | Lower bounds | en |
dc.subject | Codes (symbols) | en |
dc.subject | Error correction | en |
dc.subject | Modulation | en |
dc.subject | Algebraic decoder | en |
dc.subject | Bch codes | en |
dc.subject | Cyclic groups | en |
dc.subject | Data transmissions | en |
dc.subject | Decoder architecture | en |
dc.subject | Decoding algorithms | en |
dc.subject | Derived properties | en |
dc.subject | Distance metrics | en |
dc.subject | Hamming metric | en |
dc.subject | Iterative decoding | en |
dc.subject | Lee distance | en |
dc.subject | Lee metric | en |
dc.subject | Meats | en |
dc.subject | Mergers and acquisitions | en |
dc.subject | Noise channels | en |
dc.subject | Phase-shift | en |
dc.subject | Vlsi architectures | en |
dc.title | Decoding algorithm and architecture for BCH codes under the Lee metric | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1109/TCOMM.2008.041227 | |
dc.description.volume | 56 | |
dc.description.issue | 12 | |
dc.description.startingpage | 2050 | |
dc.description.endingpage | 2059 | |
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.Commun. | en |
dc.contributor.orcid | Hadjicostis, Christoforos N. [0000-0002-1706-708X] | |
dc.gnosis.orcid | 0000-0002-1706-708X | |