Bounded-distance decoding: algorithms, decision regions, and pseudonearest neighbors
Amrani, O.
Be'ery, Y.
Dept. of Electr. Eng.-Syst., Tel Aviv Univ.;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Nov 1998
Volume: 44,
Issue: 7
On page(s): 3072-3082
ISSN: 0018-9448
References Cited: 13
CODEN: IETTAW
INSPEC Accession Number: 6178227
Digital Object Identifier: 10.1109/18.737536
Current Version Published: 2002-08-06
Abstract
For a code C, bounded distance decoding algorithms perform as
optimal algorithms within the balls B(c), centered at the codewords
c∈C, with radius equal to half the minimum Euclidean distance of
the code. Thus distinct bounded-distance algorithms vary in performance
due to their different behavior outside the balls B(c). We investigate
this issue by analyzing the decision regions of some known (e.g., GMD)
and some new bounded-distance algorithms presented in this work. In
particular, we show that there are three distinct types of nearest
neighbors and classify them according to their influence on the decision
region. Simulation results and computer-generated images of the decision
regions are provided to illustrate the analytical results for block and
lattice codes on additive white Gaussian noise (AWGN) channels
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
