2013
DOI: 10.1016/j.future.2012.04.003
|View full text |Cite
|
Sign up to set email alerts
|

An optimal PSO distributed precoding algorithm in QRD-based multi-relay system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 26 publications
0
7
0
Order By: Relevance
“…c 0 ; c 1 and c 2 are, respectively, the inertia factor, the cognitive (individual) and the social (group) learning rates. r swarm are, respectively, the best previously obtained position of the particle i and the best obtained position in the entire swarm at the current iteration ' where [15,16]:…”
Section: Pso Optimizationmentioning
confidence: 99%
“…c 0 ; c 1 and c 2 are, respectively, the inertia factor, the cognitive (individual) and the social (group) learning rates. r swarm are, respectively, the best previously obtained position of the particle i and the best obtained position in the entire swarm at the current iteration ' where [15,16]:…”
Section: Pso Optimizationmentioning
confidence: 99%
“…Vanneschi et al [31] compared four parallel and distributed PSOs which inspires our work. Zhang et al [32] improved the PSO and deployed it into distributed spatial precoding. Sheng et al [33] used the standard PSO and map-reduce (MR) framework for prediction intervals (PIs) construction, which does not implement the parallelization of PSO.…”
Section: Decentralized Training Algorithmmentioning
confidence: 99%
“…Sun et al [10] proposed quantum-behaved particle swarm optimization (QPSO) as well as additional algorithms that improved QPSO. Although similar variants were continually devised [11][12][13][14], most of the improved PSO methods increased the complexity of the algorithm. This need not be the case, however, and Pedersen and Chipperfield [15] presented a simplified PSO called many optimizing liaisons (MOL) which is similar to "social-only" PSO: the only difference was that the search range would be decreased for all dimensions simultaneously by multiplying with a factor for each failure to improve the fitness.…”
Section: Previous Work On Particle Swarm Optimizationmentioning
confidence: 99%