FPGA Central - World's 1st FPGA / CPLD Portal

FPGA Central

World's 1st FPGA Portal

 

Go Back   FPGA Groups > NewsGroup > FPGA

FPGA comp.arch.fpga newsgroup (usenet)

Reply
 
LinkBack Thread Tools Display Modes
  #1 (permalink)  
Old 10-10-2003, 09:35 PM
D Lee
Guest
 
Posts: n/a
Default Questions on Function Approximation (using FPGAs)

Dear all,

I am working on (compound) function approximation with one input
variable using piecewise polynomial approximation with non-linear
joints. These approximations are implemented in hardware using Xilinx FPGAs.

Example of such functions include: f(x)=sqrt(-ln(x)) or
f(x)=x*ln(x) where x = [0,1), which are used for Gaussian noise
generation (Box-Muller method) and Entropy calculation
respectively.

Does anyone know any other real-life applications where compound
functions need to be approximated?

My second question is on the function f(x)=sqrt(-ln(x)) over x =
[0,1). This function is highly non-linear and approaches infinity
as x gets close to zero. This requires floating point
implementation (due to the large polynomial coefficients, which I
want to avoid). Are there any transformations I am apply to the
function to decompose it 2 or more functions that are more linear?
(Note that ln(x) is also highly non-linear over x = [0,1))


Regards,

Dong-U Lee
Reply With Quote
  #2 (permalink)  
Old 10-10-2003, 10:22 PM
Terje Mathisen
Guest
 
Posts: n/a
Default Re: Questions on Function Approximation (using FPGAs)

D Lee wrote:

> Dear all,
>
> I am working on (compound) function approximation with one input
> variable using piecewise polynomial approximation with non-linear
> joints. These approximations are implemented in hardware using Xilinx FPGAs.
>
> Example of such functions include: f(x)=sqrt(-ln(x)) or
> f(x)=x*ln(x) where x = [0,1), which are used for Gaussian noise
> generation (Box-Muller method) and Entropy calculation
> respectively.
>
> Does anyone know any other real-life applications where compound
> functions need to be approximated?


sqrt(1/x) is used so often that more than one modern cpu contains
built-in lookup tables to generate a good starting point for a NR iteration.

> My second question is on the function f(x)=sqrt(-ln(x)) over x =
> [0,1). This function is highly non-linear and approaches infinity
> as x gets close to zero. This requires floating point
> implementation (due to the large polynomial coefficients, which I
> want to avoid). Are there any transformations I am apply to the
> function to decompose it 2 or more functions that are more linear?
> (Note that ln(x) is also highly non-linear over x = [0,1))


My first guess would be to look for some kind of rational approximation,
even if this does require a final division.

Terje

--
- <[email protected]>
"almost all programming can be viewed as an exercise in caching"

Reply With Quote
Reply

Bookmarks


Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are On
Pingbacks are On
Refbacks are On


Similar Threads
Thread Thread Starter Forum Replies Last Post
Why not DDR in FPGAs? itsme FPGA 4 07-05-2003 03:29 PM


All times are GMT +1. The time now is 12:15 PM.


Powered by vBulletin® Version 3.8.0
Copyright ©2000 - 2024, Jelsoft Enterprises Ltd.
Search Engine Friendly URLs by vBSEO 3.2.0
Copyright 2008 @ FPGA Central. All rights reserved