{"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}
引用次数: 6
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
