High speed k-winner-take-all competitive learning in reconfigurable hardware

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A novel hardware architecture of the competitive learning (CL) algorithm with k-winners-take-all activation is presented in this paper. It is used as a custom logic block in the arithmetic logic unit (ALU) of the softcore NIOS processor for CL training. Both the partial distance search (PDS) module and hardware divider adopt finite precision calculation for area cost reduction at the expense of slight degradation in training performance. The PDS module also employs subspace search and multiple-coefficient accumulation techniques for effective reduction of the computation latency for the PDS search. Experiment results show that the CPU time is lower than that of Pentium IV processors running the CL training program without the support of custom hardware. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Li, H. Y., Yeh, Y. J., Hwang, W. J., & Yang, C. T. (2009). High speed k-winner-take-all competitive learning in reconfigurable hardware. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5579 LNAI, pp. 594–603). https://doi.org/10.1007/978-3-642-02568-6_60

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