Complexity reduction in radial basis function (RBF) networks by using radial B-spline functions

Saranli A., Baykal B.

NEUROCOMPUTING, vol.18, pp.183-194, 1998 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 18
  • Publication Date: 1998
  • Doi Number: 10.1016/s0925-2312(97)00078-7
  • Journal Name: NEUROCOMPUTING
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.183-194
  • Keywords: RBF, computational complexity, B-splines, CORDIC
  • Middle East Technical University Affiliated: No


In this paper, new basis consisting of radial cubic and quadratic B-spline functions are introduced together with the CORDIC algorithm, within the context of RBF networks as a means of reducing computational complexity in real-time signal-processing applications. The new basis are compared with two other existing and popularly used basis families, namely the Gaussian functions and the inverse multiquadratic functions (IVMQ) in terms of approximation performance and computational requirements. The new basis are shown to achieve approximation performance very similar to the Gaussian basis functions and are better than the IVMQ functions with less computational load and without any need for approximation methods such as table-lookup. (C) 1998 Elsevier Science B.V. All rights reserved.