基于蚁群算法的接收分集辅助STBC系统多用户检测

2009 ISECS International Colloquium on Computing, Communication, Control, and Management Pub Date : 2009-09-29 DOI:10.1109/CCCM.2009.5270406

Liu Hongwu

{"title":"基于蚁群算法的接收分集辅助STBC系统多用户检测","authors":"Liu Hongwu","doi":"10.1109/CCCM.2009.5270406","DOIUrl":null,"url":null,"abstract":"An ant colony optimization (ACO) based multiuser detection (MUD) for the receive-diversity aided space-time block coding (STBC) systems is proposed. The ants are allowed to deposit pheromone based on the concept of Pareto optimality, using the information from the individual antennas independently. Simulations show that detector employing the Pareto optimality has enhanced bit-error-rate (BER) performance. Beside, the proposed ACO-MUD not only outperforms the genetic algorithm approach in BER performance, but also avoids the BER floor that the genetic algorithm encountered.","PeriodicalId":268670,"journal":{"name":"2009 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An ACO based multiuser detection for receive-diversity aided STBC systems\",\"authors\":\"Liu Hongwu\",\"doi\":\"10.1109/CCCM.2009.5270406\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An ant colony optimization (ACO) based multiuser detection (MUD) for the receive-diversity aided space-time block coding (STBC) systems is proposed. The ants are allowed to deposit pheromone based on the concept of Pareto optimality, using the information from the individual antennas independently. Simulations show that detector employing the Pareto optimality has enhanced bit-error-rate (BER) performance. Beside, the proposed ACO-MUD not only outperforms the genetic algorithm approach in BER performance, but also avoids the BER floor that the genetic algorithm encountered.\",\"PeriodicalId\":268670,\"journal\":{\"name\":\"2009 ISECS International Colloquium on Computing, Communication, Control, and Management\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 ISECS International Colloquium on Computing, Communication, Control, and Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCCM.2009.5270406\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 ISECS International Colloquium on Computing, Communication, Control, and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCCM.2009.5270406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

针对接收分集辅助空时分组编码(STBC)系统，提出了一种基于蚁群优化的多用户检测方法。根据帕累托最优的概念，蚂蚁可以独立地使用来自单个天线的信息来存放信息素。仿真结果表明，采用Pareto最优算法的检测器具有较好的误码率性能。此外，ACO-MUD不仅在误码率性能上优于遗传算法，而且避免了遗传算法遇到的误码率下限。

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

查看原文本刊更多论文

An ACO based multiuser detection for receive-diversity aided STBC systems

An ant colony optimization (ACO) based multiuser detection (MUD) for the receive-diversity aided space-time block coding (STBC) systems is proposed. The ants are allowed to deposit pheromone based on the concept of Pareto optimality, using the information from the individual antennas independently. Simulations show that detector employing the Pareto optimality has enhanced bit-error-rate (BER) performance. Beside, the proposed ACO-MUD not only outperforms the genetic algorithm approach in BER performance, but also avoids the BER floor that the genetic algorithm encountered.

求助全文

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

来源期刊

2009 ISECS International Colloquium on Computing, Communication, Control, and Management

自引率

0.00%

发文量