归一化阈值广义选择组合的实现复杂度分析

PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI:10.1109/PACRIM.2005.1517332

Lei Xiao, X. Dong

{"title":"归一化阈值广义选择组合的实现复杂度分析","authors":"Lei Xiao, X. Dong","doi":"10.1109/PACRIM.2005.1517332","DOIUrl":null,"url":null,"abstract":"The implementation complexity of normalized threshold generalized threshold generalized selection combining (NT-GSC) is studied via calculating statistics of the number of combined branches. Using the probability space partition approach, the average number of combined branches and the variance on the number of combined branches are derived in compact forms. The resultant formulae is applicable to arbitrary fading channels provided that the independence of the fading is met.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"1 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Implementation complexity analysis of normalized threshold generalized selection combining\",\"authors\":\"Lei Xiao, X. Dong\",\"doi\":\"10.1109/PACRIM.2005.1517332\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The implementation complexity of normalized threshold generalized threshold generalized selection combining (NT-GSC) is studied via calculating statistics of the number of combined branches. Using the probability space partition approach, the average number of combined branches and the variance on the number of combined branches are derived in compact forms. The resultant formulae is applicable to arbitrary fading channels provided that the independence of the fading is met.\",\"PeriodicalId\":346880,\"journal\":{\"name\":\"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.\",\"volume\":\"1 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.2005.1517332\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2005.1517332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

通过计算组合分支数的统计量，研究了归一化阈值广义阈值广义选择组合算法的实现复杂度。利用概率空间划分的方法，以紧凑的形式导出了组合分支的平均数目和组合分支数目的方差。所得公式适用于任意衰落信道，只要满足衰落的独立性。

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

查看原文本刊更多论文

Implementation complexity analysis of normalized threshold generalized selection combining

The implementation complexity of normalized threshold generalized threshold generalized selection combining (NT-GSC) is studied via calculating statistics of the number of combined branches. Using the probability space partition approach, the average number of combined branches and the variance on the number of combined branches are derived in compact forms. The resultant formulae is applicable to arbitrary fading channels provided that the independence of the fading is met.

求助全文

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

来源期刊

PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.

自引率

0.00%

发文量