基于A*算法的分组编码CDMA的最大似然检测

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI:10.1109/ISIT.2001.935951

Peter Németh, L. Rasmussen, T. Aulin

{"title":"基于A*算法的分组编码CDMA的最大似然检测","authors":"Peter Németh, L. Rasmussen, T. Aulin","doi":"10.1109/ISIT.2001.935951","DOIUrl":null,"url":null,"abstract":"Maximum-likelihood soft-decision decoding of block coded CDMA using the A* algorithm is considered. Different heuristic functions are considered, applied to coded and uncoded CDMA. The average complexity involved in ML detection for both uncoded and coded CDMA is investigated. The (23,12) Golay code is used in the coded case.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Maximum-likelihood detection of block coded CDMA using the A* algorithm\",\"authors\":\"Peter Németh, L. Rasmussen, T. Aulin\",\"doi\":\"10.1109/ISIT.2001.935951\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Maximum-likelihood soft-decision decoding of block coded CDMA using the A* algorithm is considered. Different heuristic functions are considered, applied to coded and uncoded CDMA. The average complexity involved in ML detection for both uncoded and coded CDMA is investigated. The (23,12) Golay code is used in the coded case.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.935951\",\"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. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.935951","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

研究了用A*算法实现分组编码CDMA的最大似然软判决译码。考虑了不同的启发式函数，分别应用于编码和非编码CDMA。研究了编码CDMA和未编码CDMA的机器学习检测的平均复杂度。在编码的情况下使用(23,12)Golay代码。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Maximum-likelihood detection of block coded CDMA using the A* algorithm

Maximum-likelihood soft-decision decoding of block coded CDMA using the A* algorithm is considered. Different heuristic functions are considered, applied to coded and uncoded CDMA. The average complexity involved in ML detection for both uncoded and coded CDMA is investigated. The (23,12) Golay code is used in the coded case.

求助全文

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

来源期刊

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

自引率

0.00%

发文量

期刊最新文献

A simple encodable/decodable OFDM QPSK code with low peak-to-mean envelope power ratio The effect of redundancy on measurement Decision directed algorithms for multiuser detection A new modulation scheme using asymmetric error correcting code embedded in optical orthogonal code for optical CDMA Matrix CUSUM: a recursive multi-hypothesis change detection algorithm