Real-time particle swarm optimization on FPGA for the optimal message-chain structure

13Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This paper addresses the real-time optimization problem of the message-chain structure to maximize the throughput in data communications based on half-duplex command-response protocols. This paper proposes a new variant of the particle swarm optimization (PSO) algorithm to resolve real-time optimization, which is implemented on field programmable gate arrays (FPGA) to be performed faster in parallel and to avoid the delays caused by other tasks on a central processing unit. The proposed method was verified by finding the optimal message-chain structure much faster than the original PSO, as well as reliably with different system and algorithm parameters.

Cite

CITATION STYLE

APA

Lee, H., Kim, K., Kwon, Y., & Hong, E. (2018). Real-time particle swarm optimization on FPGA for the optimal message-chain structure. Electronics (Switzerland), 7(11). https://doi.org/10.3390/electronics7110274

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free