DocumentCode
292712
Title
Continuous polynomial approximation
Author
Grimm, Jimm H. ; Jacklin, William E. ; Patti, John J. ; Tyler, Stephen C. ; Ucci, Donald R.
Author_Institution
ECE Dept., Illinois Inst. of Technol., Chicago, IL, USA
Volume
1
fYear
1993
fDate
11-14 Oct 1993
Firstpage
283
Abstract
The continuous polynomial approximation (CPA) algorithm fits a concatenation of polynomial curves to discrete data. The resulting curve passes through every data point and has continuous derivatives everywhere. The algorithm is capable of obtaining a curve with continuous derivatives of any order, although the complexity increases as the number of continuous derivatives increase. A derivation of the algorithm is followed by application of the CPA to approximation of a cumulative distribution function (CDF) and probability density function (PDF) of random data, which are required in some communication receivers employing nonlinear processors. The authors demonstrate that for some applications endpoint problems may be resolved
Keywords
approximation theory; curve fitting; military communication; polynomials; radio receivers; algorithm; communication receivers; complexity; concatenation of polynomial curves; continuous derivatives; continuous polynomial approximation; cumulative distribution function; endpoint problems; nonlinear processors; random data; Approximation algorithms; Contracts; Distribution functions; Equations; Laboratories; Polynomials; Probability density function; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Military Communications Conference, 1993. MILCOM '93. Conference record. Communications on the Move., IEEE
Conference_Location
Boston, MA
Print_ISBN
0-7803-0953-7
Type
conf
DOI
10.1109/MILCOM.1993.408505
Filename
408505
Link To Document