By Topic

Application of the CMAC input encoding scheme in the N-tuple approximation network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Kolcz ; Dept. of Electron., York Univ., UK ; N. M. Allinson

The N-tuple approximation network offers many advantages over conventional neural networks in terms of speed of operation and its ability to realise arbitrary nonlinear mappings. However, its generalisation/selectivity properties depend strongly on the form of input encoding being used in the system. The paper analyses the suitability of use of the CMAC code for the N-tuple networks, and compares its properties with existing schemes. It is argued that the application of this type of encoding can provide desirable monotonic mapping between input and pattern space distances without the penalty of very long binary patterns as is the case for bar-chart encoding. Additionally, similarities between the classic N-tuple and CMAC networks are highlighted

Published in:

IEE Proceedings - Computers and Digital Techniques  (Volume:141 ,  Issue: 3 )