DocumentCode :
3063950
Title :
Analysis of a bound of Voronoi region V(C0) and proposal of sub-optimum decoding algorithm
Author :
Wille, E.
fYear :
2001
fDate :
36982
Firstpage :
690
Lastpage :
693
Abstract :
The objective of the paper is to analyze the bound of addition proposed by D.J. Barros et al. (1997) in contrast to the GMD bound (G.D. Forney Jr., 1966) and the cone bound (W. Godoy Jr., 1990) which shows the Voronoi region of the zero code-word for a specific vector. A new algorithm, which associates the ZNA algorithm (L.B. Levitin and C.R.P. Hartmann, 1985) with the bound of addition, is proposed for soft decision techniques
Keywords :
computational geometry; decision theory; decoding; error correction codes; GMD bound; Voronoi region bound analysis; ZNA algorithm; cone bound; error control codes; error correcting codes; soft decision techniques; sub-optimum decoding algorithm; zero code-word; Algorithm design and analysis; Binary phase shift keying; Decoding; Equations; Error correction; Error correction codes; Phase modulation; Phase shift keying; Proposals; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology: Coding and Computing, 2001. Proceedings. International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
0-7695-1062-0
Type :
conf
DOI :
10.1109/ITCC.2001.918878
Filename :
918878
Link To Document :
بازگشت