Voronoi区域V(C/sub 0/)界的分析及次优译码算法的提出

Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI:10.1109/ITCC.2001.918878

W. Godoy, E. Wille

{"title":"Voronoi区域V(C/sub 0/)界的分析及次优译码算法的提出","authors":"W. Godoy, E. Wille","doi":"10.1109/ITCC.2001.918878","DOIUrl":null,"url":null,"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.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"332 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of a bound of Voronoi region V(C/sub 0/) and proposal of sub-optimum decoding algorithm\",\"authors\":\"W. Godoy, E. Wille\",\"doi\":\"10.1109/ITCC.2001.918878\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":318295,\"journal\":{\"name\":\"Proceedings International Conference on Information Technology: Coding and Computing\",\"volume\":\"332 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-04-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings International Conference on Information Technology: Coding and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITCC.2001.918878\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Conference on Information Technology: Coding and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCC.2001.918878","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文的目的是分析D.J. Barros等人(1997)提出的加法界，而不是GMD界(G.D. Forney Jr.， 1966)和锥界(W. Godoy Jr.， 1990)，后者显示了特定向量的零码字的Voronoi区域。将ZNA算法(L.B. Levitin和C.R.P. Hartmann, 1985)与加法界结合起来，提出了一种新的软决策算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Analysis of a bound of Voronoi region V(C/sub 0/) and proposal of sub-optimum decoding algorithm

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings International Conference on Information Technology: Coding and Computing

自引率

0.00%

发文量