Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^2: How to compare 2 wav files.

by bitingduck (Chaplain)
on Mar 15, 2015 at 09:11 UTC ( #1120096=note: print w/replies, xml ) Need Help??


in reply to (jcwren) Re: How to compare 2 wav files.
in thread How to compare 2 wav files.

UPDATE: late at night and didn't check the date to see that it was a zombie thread... post is still relevant in case someone looks...

FFT/DFTs are not difficult to implement, and while I'd tend to do it in C, I think Perl should do it pretty well.

It's not difficult, but I wouldn't bother implementing FFTs myself at all anymore, except as an excercise in implementing FFTs or if I needed to own the code. There are free libraries available, such as fftw that are already debugged, documented, and reasonably optimized. Fftw is pretty speedy - about 0.06 seconds to do a 2048x2048 2D-FFT on a new-ish (i7) Macbook.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1120096]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (10)
As of 2018-09-24 13:07 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Eventually, "covfefe" will come to mean:













    Results (191 votes). Check out past polls.

    Notices?
    • (Sep 10, 2018 at 22:53 UTC) Welcome new users!