多PN码的并行迭代获取算法

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI:10.1109/ITW2.2006.323694

Zhisong Bie, K. Niu, Weilin Wu

{"title":"多PN码的并行迭代获取算法","authors":"Zhisong Bie, K. Niu, Weilin Wu","doi":"10.1109/ITW2.2006.323694","DOIUrl":null,"url":null,"abstract":"Based on factor graph and sum-product algorithm, an iterative acquisition algorithm for multiple PN codes is proposed. This algorithm combines the BP decoding algorithm and the chip level MUD as an iterative loop to fulfil the task of parallel acquisition for multiple PN codes. Simulation and analysis results show that the performance of this algorithm is slightly poorer than the full parallel search method, but the computational costs are decreased dramatically","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Parallel Iterative Acquisition Algorithm for Multiple PN Codes\",\"authors\":\"Zhisong Bie, K. Niu, Weilin Wu\",\"doi\":\"10.1109/ITW2.2006.323694\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on factor graph and sum-product algorithm, an iterative acquisition algorithm for multiple PN codes is proposed. This algorithm combines the BP decoding algorithm and the chip level MUD as an iterative loop to fulfil the task of parallel acquisition for multiple PN codes. Simulation and analysis results show that the performance of this algorithm is slightly poorer than the full parallel search method, but the computational costs are decreased dramatically\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323694\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323694","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种基于因子图和和积算法的多PN码迭代获取算法。该算法将BP译码算法和片级MUD作为一个迭代循环来完成多个PN码的并行采集任务。仿真和分析结果表明，该算法的性能略低于全并行搜索方法，但计算量显著降低

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

查看原文本刊更多论文

A Parallel Iterative Acquisition Algorithm for Multiple PN Codes

Based on factor graph and sum-product algorithm, an iterative acquisition algorithm for multiple PN codes is proposed. This algorithm combines the BP decoding algorithm and the chip level MUD as an iterative loop to fulfil the task of parallel acquisition for multiple PN codes. Simulation and analysis results show that the performance of this algorithm is slightly poorer than the full parallel search method, but the computational costs are decreased dramatically

求助全文

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

来源期刊

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

自引率

0.00%

发文量