Decoding algorithm and architecture for BCH codes under the Lee metric
Ημερομηνία
2008Source
IEEE Transactions on CommunicationsVolume
56Issue
12Pages
2050-2059Google Scholar check
Keyword(s):
Metadata
Εμφάνιση πλήρους εγγραφήςΕπιτομή
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.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.
-
Article
Soft-decision decoding using ordered recodings on the most reliable basis
Wu, Y.; Hadjicostis, Christoforos N. (2007)This correspondence investigates soft-decision decoding of binary linear block codes using ordered recodings of test error patterns on the so-called "most reliable basis." The analysis demonstrates the optimality of the ...
-
Article
Soft-decision decoding of linear block codes using preprocessing and diversification
Wu, Y.; Hadjicostis, Christoforos N. (2007)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 ...
-
Conference Object
On the channel capacity of wireless fading channels
Charalambous, Charalambos D.; Denic, S. (2002)The objectives of this paper are twofold. First, to point out the significance of certain results on stochastic processes in computing the channel capacity for flat fading wireless channels. Second, to design an optimal ...