By Topic

Chebyshev Approximation and Threshold Functions

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
$31 $13
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)
Kaplan, K.R. ; RCA Labs., Princeton, N. J. ; Winder, R.O.

Where previous authors have considered linear approximations with a minimum sum of squared differences, we consider, instead, Chehyshev linear approximations, which minimize the maximum deviation. We obtain thus: 1) A new characterization of threshold functions, 2) A characterization of optimal threshold realizations as being virtually identical to the Chebyshev-best linear approximations, and 3) A new insight into the test-synthesis problem with which we opened this note.

Published in:

Electronic Computers, IEEE Transactions on  (Volume:EC-14 ,  Issue: 2 )