Fourier Transform and Laplace distribution

Dear all,

I am not a math professional but would like some help if possible.

I am working with two sets of numbers that I would like to transform, I will be declaring them in an array.

The sets of numbers will be 1 to 5

The both sets set will decrease from 5 to 1

Both numbers in each set are equi-distant form each other

The pattern will look like Laplace distribution.
set1 array set 2 array
5,4,3,2,1 1,2,3,4,5
10,8,6,4,2 3,5,7,9,11

I would like to transform the numbers in the array, then find a strength between the transformed distribution and the laplace distribution on the original numbers

Second
Work with 2 sets of transformed numbers.
one being the master the other the slave, the pattern would look like

master 100,101,99,101,99,101,99
slave 1, 1, 2, 3, 3, 3,

so the master changes indepentely of the slave, but the slave cannot change with out the master doing so

So I would like to find the strength of the slave, when it gets stronger to the master.

Please can you help me.

2) I am looking to write this in C#, so any free .net package that I can call will be the easiest way for me.

3) I don't know which inputs to take out of FFT and into Laplace so I would like instructions on that too, please feel free to ask questions.

Many thanks

Tinkerz

Quote:

---

Originally Posted by Tinkerz

Dear all,

I am not a math professional but would like some help if possible.

I am working with two sets of numbers that I would like to transform, I will be declaring them in an array.

The sets of numbers will be 1 to 5

The both sets set will decrease from 5 to 1

Both numbers in each set are equi-distant form each other

The pattern will look like Laplace distribution.
set1 array set 2 array
5,4,3,2,1 1,2,3,4,5
10,8,6,4,2 3,5,7,9,11

I would like to transform the numbers in the array, then find a strength between the transformed distribution and the laplace distribution on the original numbers

Second
Work with 2 sets of transformed numbers.
one being the master the other the slave, the pattern would look like

master 100,101,99,101,99,101,99
slave 1, 1, 2, 3, 3, 3,

so the master changes indepentely of the slave, but the slave cannot change with out the master doing so

So I would like to find the strength of the slave, when it gets stronger to the master.

Please can you help me.

2) I am looking to write this in C#, so any free .net package that I can call will be the easiest way for me.

3) I don't know which inputs to take out of FFT and into Laplace so I would like instructions on that too, please feel free to ask questions.

Many thanks

Tinkerz

---

I think you will have to explain what you are trying to do a bit more clearly.

CB

My Apologies for not making it clear

I have been looking at what I want to do again and it comes down to the fourier transform.

I am coding in C#, and would like to input an array of data and return the amplitude of that data

Koders Code Search: Fourier.cs - C#

I have found the above code, but don't understand the inputs needed to return the answer I am looking for.

More specifically I am looking for the amplitude in a non-continuous time frame even though I want to pass in a set of data in an array that would be fixed, lets say 128 records.

So then the transform will return the amplitude of that data set.

Therefore I need in the array Time and Size, it looks like fourier is the what I want, but I don't understand the inputs and outputs

Thanks

Tinkerz

Doing a bit more searching

Continuous Wavelet Transform

This is probably better, is the any free statistical libarys that can make this easier out there?

Quote:

---

Originally Posted by Tinkerz

My Apologies for not making it clear

I have been looking at what I want to do again and it comes down to the fourier transform.

I am coding in C#, and would like to input an array of data and return the amplitude of that data

Koders Code Search: Fourier.cs - C#

I have found the above code, but don't understand the inputs needed to return the answer I am looking for.

More specifically I am looking for the amplitude in a non-continuous time frame even though I want to pass in a set of data in an array that would be fixed, lets say 128 records.

So then the transform will return the amplitude of that data set.

Therefore I need in the array Time and Size, it looks like fourier is the what I want, but I don't understand the inputs and outputs

Thanks

Tinkerz

---

Tell us what the real problem is, what you are posting is still incomprehensible.

CB

Ok sorry I will try again.

I want to find the amplitude of a set of numbers and compare to the amplitude of another set of numbers.

One set of numbers will change independently of the other. the other will only change when the first set changes, so I want to compare the strength of the second set to the first.

The numbers will be dependent on the time they occur, so it needs to fit to time/frequency and the first order of differences.

I hope that explains more, what I am i missing?

Tinkerz

Quote:

---

Originally Posted by Tinkerz

Ok sorry I will try again.

I want to find the amplitude of a set of numbers and compare to the amplitude of another set of numbers.

One set of numbers will change independently of the other. the other will only change when the first set changes, so I want to compare the strength of the second set to the first.

The numbers will be dependent on the time they occur, so it needs to fit to time/frequency and the first order of differences.

I hope that explains more, what I am i missing?

Tinkerz

---

Sorry, but what does "the amplitude of a set of numbers" mean?

CB

Fourier transform - Wikipedia, the free encyclopedia

I mean the oscillation, the height of the waveform.