Re: Best processors for trig?
- From: Anton Erasmus <nobody@xxxxxxxxxxxxxxxx>
- Date: Mon, 02 Apr 2007 21:27:51 +0200
On Fri, 30 Mar 2007 20:06:57 GMT, Tauno Voipio
<tauno.voipio@xxxxxxxxxxxxx> wrote:
larwe wrote:
On Mar 30, 1:46 pm, Tim Wescott <t...@xxxxxxxxxxxxxxxx> wrote:
A floating point DSP, as noted.
What's the canonical method of doing this? Taylor series
approximations?
Of course, the arguments have to be reduced first to
the range of the period (2 * pi for sin and cos, pi
for tan). The reduced range is often split into some
sub-ranges with different coefficients.
The least-maximum error polynomial for approximation
is obtained by developing the function to a series
of Chebysev polynomials. This method gives less error
than a corresponding Taylor or MacLaurin series.
The trig functions and exponential are quite polynomial-
friendly. The most difficult of the elementary functions
is the logarithm, its Taylor series uses half of an
infinity to converge.
You can also look at CORDIC functions. These can be implimented in
an FPGA. Apparently the first HP calculators used this method to
calculate all the normal trig functions to high precision using CORDIC
functions.
Regards
Anton Erasmus
.
- Follow-Ups:
- Re: Best processors for trig?
- From: Roberto Waltman
- Re: Best processors for trig?
- Prev by Date: Re: A hobbyist's viewpoint, was: Re: Who is working with the SAM9263?
- Next by Date: Re: Best processors for trig?
- Previous by thread: Re: Best processors for trig?
- Next by thread: Re: Best processors for trig?
- Index(es):
Relevant Pages
|