Use FFT for calculating AKF
This commit is contained in:
1 parent
f2711c53cc
commit
b3da00e081
10 files changed
+1009
-9
No files matched your search
@@ -0,0 +1,180 @@
|
|||||||
|
/**********************************************************************
|
||||||
|
|
||||||
|
FFT.cpp
|
||||||
|
|
||||||
|
Dominic Mazzoni
|
||||||
|
|
||||||
|
September 2000
|
||||||
|
|
||||||
|
*******************************************************************//*!
|
||||||
|
|
||||||
|
\file FFT.cpp
|
||||||
|
\brief Fast Fourier Transform routines.
|
||||||
|
|
||||||
|
This file contains a few FFT routines, including a real-FFT
|
||||||
|
routine that is almost twice as fast as a normal complex FFT,
|
||||||
|
and a power spectrum routine when you know you don't care
|
||||||
|
about phase information.
|
||||||
|
|
||||||
|
Some of this code was based on a free implementation of an FFT
|
||||||
|
by Don Cross, available on the web at:
|
||||||
|
|
||||||
|
http://www.intersrv.com/~dcross/fft.html
|
||||||
|
|
||||||
|
The basic algorithm for his code was based on Numerican Recipes
|
||||||
|
in Fortran. I optimized his code further by reducing array
|
||||||
|
accesses, caching the bit reversal table, and eliminating
|
||||||
|
float-to-double conversions, and I added the routines to
|
||||||
|
calculate a real FFT and a real power spectrum.
|
||||||
|
|
||||||
|
*//*******************************************************************/
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <math.h>
|
||||||
|
|
||||||
|
#include "FFT.h"
|
||||||
|
|
||||||
|
#include "RealFFTf.h"
|
||||||
|
|
||||||
|
void DeinitFFT()
|
||||||
|
{
|
||||||
|
// Deallocate any unused RealFFTf tables
|
||||||
|
CleanupFFT();
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Real Fast Fourier Transform
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
void RealFFT(int NumSamples, float *RealIn, float *RealOut, float *ImagOut)
|
||||||
|
{
|
||||||
|
// Remap to RealFFTf() function
|
||||||
|
int i;
|
||||||
|
HFFT hFFT = GetFFT(NumSamples);
|
||||||
|
float *pFFT = new float[NumSamples];
|
||||||
|
// Copy the data into the processing buffer
|
||||||
|
for(i=0; i<NumSamples; i++)
|
||||||
|
pFFT[i] = RealIn[i];
|
||||||
|
|
||||||
|
// Perform the FFT
|
||||||
|
RealFFTf(pFFT, hFFT);
|
||||||
|
|
||||||
|
// Copy the data into the real and imaginary outputs
|
||||||
|
for(i=1;i<(NumSamples/2);i++) {
|
||||||
|
RealOut[i]=pFFT[hFFT->BitReversed[i] ];
|
||||||
|
ImagOut[i]=pFFT[hFFT->BitReversed[i]+1];
|
||||||
|
}
|
||||||
|
// Handle the (real-only) DC and Fs/2 bins
|
||||||
|
RealOut[0] = pFFT[0];
|
||||||
|
RealOut[i] = pFFT[1];
|
||||||
|
ImagOut[0] = ImagOut[i] = 0;
|
||||||
|
// Fill in the upper half using symmetry properties
|
||||||
|
for(i++ ; i<NumSamples; i++) {
|
||||||
|
RealOut[i] = RealOut[NumSamples-i];
|
||||||
|
ImagOut[i] = -ImagOut[NumSamples-i];
|
||||||
|
}
|
||||||
|
delete [] pFFT;
|
||||||
|
ReleaseFFT(hFFT);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* InverseRealFFT
|
||||||
|
*
|
||||||
|
* This function computes the inverse of RealFFT, above.
|
||||||
|
* The RealIn and ImagIn is assumed to be conjugate-symmetric
|
||||||
|
* and as a result the output is purely real.
|
||||||
|
* Only the first half of RealIn and ImagIn are used due to this
|
||||||
|
* symmetry assumption.
|
||||||
|
*/
|
||||||
|
void InverseRealFFT(int NumSamples, float *RealIn, float *ImagIn, float *RealOut)
|
||||||
|
{
|
||||||
|
// Remap to RealFFTf() function
|
||||||
|
int i;
|
||||||
|
HFFT hFFT = GetFFT(NumSamples);
|
||||||
|
float *pFFT = new float[NumSamples];
|
||||||
|
// Copy the data into the processing buffer
|
||||||
|
for(i=0; i<(NumSamples/2); i++)
|
||||||
|
pFFT[2*i ] = RealIn[i];
|
||||||
|
if(ImagIn == NULL) {
|
||||||
|
for(i=0; i<(NumSamples/2); i++)
|
||||||
|
pFFT[2*i+1] = 0;
|
||||||
|
} else {
|
||||||
|
for(i=0; i<(NumSamples/2); i++)
|
||||||
|
pFFT[2*i+1] = ImagIn[i];
|
||||||
|
}
|
||||||
|
// Put the fs/2 component in the imaginary part of the DC bin
|
||||||
|
pFFT[1] = RealIn[i];
|
||||||
|
|
||||||
|
// Perform the FFT
|
||||||
|
InverseRealFFTf(pFFT, hFFT);
|
||||||
|
|
||||||
|
// Copy the data to the (purely real) output buffer
|
||||||
|
ReorderToTime(hFFT, pFFT, RealOut);
|
||||||
|
|
||||||
|
delete [] pFFT;
|
||||||
|
ReleaseFFT(hFFT);
|
||||||
|
}
|
||||||
|
|
||||||
|
void RealInverseRealFFT(int NumSamples, float *In, float *Out){
|
||||||
|
// Remap to RealFFTf() function
|
||||||
|
int i;
|
||||||
|
HFFT hFFT = GetFFT(NumSamples);
|
||||||
|
float *pFFT = new float[NumSamples];
|
||||||
|
// Copy the data into the processing buffer
|
||||||
|
pFFT[0] = In[0];
|
||||||
|
for(i=1; i<NumSamples/2; i++){
|
||||||
|
pFFT[i] = In[i];
|
||||||
|
pFFT[NumSamples - i] = In[i];
|
||||||
|
}
|
||||||
|
pFFT[NumSamples/2] = In[NumSamples/2];
|
||||||
|
|
||||||
|
// Perform the FFT
|
||||||
|
RealFFTf(pFFT, hFFT);
|
||||||
|
|
||||||
|
// Copy the data into the output
|
||||||
|
for(i=1;i<NumSamples/2;i++) {
|
||||||
|
Out[i]=pFFT[hFFT->BitReversed[i]];
|
||||||
|
}
|
||||||
|
// Handle the (real-only) DC
|
||||||
|
Out[0] = pFFT[0];
|
||||||
|
delete [] pFFT;
|
||||||
|
ReleaseFFT(hFFT);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* PowerSpectrum
|
||||||
|
*
|
||||||
|
* This function computes the same as RealFFT, above, but
|
||||||
|
* adds the squares of the real and imaginary part of each
|
||||||
|
* coefficient, extracting the power and throwing away the
|
||||||
|
* phase.
|
||||||
|
*
|
||||||
|
* For speed, it does not call RealFFT, but duplicates some
|
||||||
|
* of its code.
|
||||||
|
*/
|
||||||
|
|
||||||
|
void PowerSpectrum(int NumSamples, float *In, float *Out)
|
||||||
|
{
|
||||||
|
// Remap to RealFFTf() function
|
||||||
|
int i;
|
||||||
|
HFFT hFFT = GetFFT(NumSamples);
|
||||||
|
float *pFFT = new float[NumSamples];
|
||||||
|
// Copy the data into the processing buffer
|
||||||
|
for(i=0; i<NumSamples; i++)
|
||||||
|
pFFT[i] = In[i];
|
||||||
|
|
||||||
|
// Perform the FFT
|
||||||
|
RealFFTf(pFFT, hFFT);
|
||||||
|
|
||||||
|
// Copy the data into the real and imaginary outputs
|
||||||
|
for(i=1;i<NumSamples/2;i++) {
|
||||||
|
Out[i]= (pFFT[hFFT->BitReversed[i] ]*pFFT[hFFT->BitReversed[i] ])
|
||||||
|
+ (pFFT[hFFT->BitReversed[i]+1]*pFFT[hFFT->BitReversed[i]+1]);
|
||||||
|
}
|
||||||
|
// Handle the (real-only) DC and Fs/2 bins
|
||||||
|
Out[0] = pFFT[0]*pFFT[0];
|
||||||
|
Out[i] = pFFT[1]*pFFT[1];
|
||||||
|
delete [] pFFT;
|
||||||
|
ReleaseFFT(hFFT);
|
||||||
|
}
|
||||||
@@ -0,0 +1,65 @@
|
|||||||
|
/**********************************************************************
|
||||||
|
|
||||||
|
FFT.h
|
||||||
|
|
||||||
|
Dominic Mazzoni
|
||||||
|
|
||||||
|
September 2000
|
||||||
|
|
||||||
|
This file contains a few FFT routines, including a real-FFT
|
||||||
|
routine that is almost twice as fast as a normal complex FFT,
|
||||||
|
and a power spectrum routine which is more convenient when
|
||||||
|
you know you don't care about phase information. It now also
|
||||||
|
contains a few basic windowing functions.
|
||||||
|
|
||||||
|
Some of this code was based on a free implementation of an FFT
|
||||||
|
by Don Cross, available on the web at:
|
||||||
|
|
||||||
|
http://www.intersrv.com/~dcross/fft.html
|
||||||
|
|
||||||
|
The basic algorithm for his code was based on Numerical Recipes
|
||||||
|
in Fortran. I optimized his code further by reducing array
|
||||||
|
accesses, caching the bit reversal table, and eliminating
|
||||||
|
float-to-double conversions, and I added the routines to
|
||||||
|
calculate a real FFT and a real power spectrum.
|
||||||
|
|
||||||
|
Note: all of these routines use single-precision floats.
|
||||||
|
I have found that in practice, floats work well until you
|
||||||
|
get above 8192 samples. If you need to do a larger FFT,
|
||||||
|
you need to use doubles.
|
||||||
|
|
||||||
|
**********************************************************************/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This is the function you will use the most often.
|
||||||
|
* Given an array of floats, this will compute the power
|
||||||
|
* spectrum by doing a Real FFT and then computing the
|
||||||
|
* sum of the squares of the real and imaginary parts.
|
||||||
|
* Note that the output array is half the length of the
|
||||||
|
* input array, and that NumSamples must be a power of two.
|
||||||
|
*/
|
||||||
|
|
||||||
|
void PowerSpectrum(int NumSamples, float *In, float *Out);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Computes an FFT when the input data is real but you still
|
||||||
|
* want complex data as output. The output arrays are the
|
||||||
|
* same length as the input, but will be conjugate-symmetric
|
||||||
|
* NumSamples must be a power of two.
|
||||||
|
*/
|
||||||
|
|
||||||
|
void RealFFT(int NumSamples,
|
||||||
|
float *RealIn, float *RealOut, float *ImagOut);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Computes an Inverse FFT when the input data is conjugate symmetric
|
||||||
|
* so the output is purely real. NumSamples must be a power of
|
||||||
|
* two.
|
||||||
|
* Requires: EXPERIMENTAL_USE_REALFFTF
|
||||||
|
*/
|
||||||
|
void InverseRealFFT(int NumSamples,
|
||||||
|
float *RealIn, float *ImagIn, float *RealOut);
|
||||||
|
|
||||||
|
void RealInverseRealFFT(int NumSamples, float *In, float *Out);
|
||||||
|
|
||||||
|
void DeinitFFT();
|
||||||
@@ -0,0 +1,299 @@
|
|||||||
|
Code in this folder is based on Code from Audacity.
|
||||||
|
License of that code is below:
|
||||||
|
|
||||||
|
------------------------------------------------------------------------
|
||||||
|
|
||||||
|
Note: Audacity is distributed under the terms of the GNU GPL.
|
||||||
|
This includes everything in the source code distribution
|
||||||
|
except code in the lib-src directory. Code in the lib-src
|
||||||
|
directory may be released under a different license
|
||||||
|
(which is GPL-compatible). For a summary, see the
|
||||||
|
README.txt file, and for specific details, see the license
|
||||||
|
information inside each subdirectory of lib-src.
|
||||||
|
|
||||||
|
Documentation is distributed under the Creative Commons license.
|
||||||
|
Please see here for that:
|
||||||
|
http://creativecommons.org/licenses/by/3.0/legalcode
|
||||||
|
|
||||||
|
The full text of the GNU GPL follows:
|
||||||
|
|
||||||
|
GNU GENERAL PUBLIC LICENSE
|
||||||
|
Version 2, June 1991
|
||||||
|
|
||||||
|
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
|
||||||
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
|
||||||
|
Everyone is permitted to copy and distribute verbatim copies
|
||||||
|
of this license document, but changing it is not allowed.
|
||||||
|
|
||||||
|
Preamble
|
||||||
|
|
||||||
|
The licenses for most software are designed to take away your
|
||||||
|
freedom to share and change it. By contrast, the GNU General Public
|
||||||
|
License is intended to guarantee your freedom to share and change free
|
||||||
|
software--to make sure the software is free for all its users. This
|
||||||
|
General Public License applies to most of the Free Software
|
||||||
|
Foundation's software and to any other program whose authors commit to
|
||||||
|
using it. (Some other Free Software Foundation software is covered by
|
||||||
|
the GNU Library General Public License instead.) You can apply it to
|
||||||
|
your programs, too.
|
||||||
|
|
||||||
|
When we speak of free software, we are referring to freedom, not
|
||||||
|
price. Our General Public Licenses are designed to make sure that you
|
||||||
|
have the freedom to distribute copies of free software (and charge for
|
||||||
|
this service if you wish), that you receive source code or can get it
|
||||||
|
if you want it, that you can change the software or use pieces of it
|
||||||
|
in new free programs; and that you know you can do these things.
|
||||||
|
|
||||||
|
To protect your rights, we need to make restrictions that forbid
|
||||||
|
anyone to deny you these rights or to ask you to surrender the rights.
|
||||||
|
These restrictions translate to certain responsibilities for you if you
|
||||||
|
distribute copies of the software, or if you modify it.
|
||||||
|
|
||||||
|
For example, if you distribute copies of such a program, whether
|
||||||
|
gratis or for a fee, you must give the recipients all the rights that
|
||||||
|
you have. You must make sure that they, too, receive or can get the
|
||||||
|
source code. And you must show them these terms so they know their
|
||||||
|
rights.
|
||||||
|
|
||||||
|
We protect your rights with two steps: (1) copyright the software, and
|
||||||
|
(2) offer you this license which gives you legal permission to copy,
|
||||||
|
distribute and/or modify the software.
|
||||||
|
|
||||||
|
Also, for each author's protection and ours, we want to make certain
|
||||||
|
that everyone understands that there is no warranty for this free
|
||||||
|
software. If the software is modified by someone else and passed on, we
|
||||||
|
want its recipients to know that what they have is not the original, so
|
||||||
|
that any problems introduced by others will not reflect on the original
|
||||||
|
authors' reputations.
|
||||||
|
|
||||||
|
Finally, any free program is threatened constantly by software
|
||||||
|
patents. We wish to avoid the danger that redistributors of a free
|
||||||
|
program will individually obtain patent licenses, in effect making the
|
||||||
|
program proprietary. To prevent this, we have made it clear that any
|
||||||
|
patent must be licensed for everyone's free use or not licensed at all.
|
||||||
|
|
||||||
|
The precise terms and conditions for copying, distribution and
|
||||||
|
modification follow.
|
||||||
|
|
||||||
|
GNU GENERAL PUBLIC LICENSE
|
||||||
|
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
||||||
|
|
||||||
|
0. This License applies to any program or other work which contains
|
||||||
|
a notice placed by the copyright holder saying it may be distributed
|
||||||
|
under the terms of this General Public License. The "Program", below,
|
||||||
|
refers to any such program or work, and a "work based on the Program"
|
||||||
|
means either the Program or any derivative work under copyright law:
|
||||||
|
that is to say, a work containing the Program or a portion of it,
|
||||||
|
either verbatim or with modifications and/or translated into another
|
||||||
|
language. (Hereinafter, translation is included without limitation in
|
||||||
|
the term "modification".) Each licensee is addressed as "you".
|
||||||
|
|
||||||
|
Activities other than copying, distribution and modification are not
|
||||||
|
covered by this License; they are outside its scope. The act of
|
||||||
|
running the Program is not restricted, and the output from the Program
|
||||||
|
is covered only if its contents constitute a work based on the
|
||||||
|
Program (independent of having been made by running the Program).
|
||||||
|
Whether that is true depends on what the Program does.
|
||||||
|
|
||||||
|
1. You may copy and distribute verbatim copies of the Program's
|
||||||
|
source code as you receive it, in any medium, provided that you
|
||||||
|
conspicuously and appropriately publish on each copy an appropriate
|
||||||
|
copyright notice and disclaimer of warranty; keep intact all the
|
||||||
|
notices that refer to this License and to the absence of any warranty;
|
||||||
|
and give any other recipients of the Program a copy of this License
|
||||||
|
along with the Program.
|
||||||
|
|
||||||
|
You may charge a fee for the physical act of transferring a copy, and
|
||||||
|
you may at your option offer warranty protection in exchange for a fee.
|
||||||
|
|
||||||
|
2. You may modify your copy or copies of the Program or any portion
|
||||||
|
of it, thus forming a work based on the Program, and copy and
|
||||||
|
distribute such modifications or work under the terms of Section 1
|
||||||
|
above, provided that you also meet all of these conditions:
|
||||||
|
|
||||||
|
a) You must cause the modified files to carry prominent notices
|
||||||
|
stating that you changed the files and the date of any change.
|
||||||
|
|
||||||
|
b) You must cause any work that you distribute or publish, that in
|
||||||
|
whole or in part contains or is derived from the Program or any
|
||||||
|
part thereof, to be licensed as a whole at no charge to all third
|
||||||
|
parties under the terms of this License.
|
||||||
|
|
||||||
|
c) If the modified program normally reads commands interactively
|
||||||
|
when run, you must cause it, when started running for such
|
||||||
|
interactive use in the most ordinary way, to print or display an
|
||||||
|
announcement including an appropriate copyright notice and a
|
||||||
|
notice that there is no warranty (or else, saying that you provide
|
||||||
|
a warranty) and that users may redistribute the program under
|
||||||
|
these conditions, and telling the user how to view a copy of this
|
||||||
|
License. (Exception: if the Program itself is interactive but
|
||||||
|
does not normally print such an announcement, your work based on
|
||||||
|
the Program is not required to print an announcement.)
|
||||||
|
|
||||||
|
These requirements apply to the modified work as a whole. If
|
||||||
|
identifiable sections of that work are not derived from the Program,
|
||||||
|
and can be reasonably considered independent and separate works in
|
||||||
|
themselves, then this License, and its terms, do not apply to those
|
||||||
|
sections when you distribute them as separate works. But when you
|
||||||
|
distribute the same sections as part of a whole which is a work based
|
||||||
|
on the Program, the distribution of the whole must be on the terms of
|
||||||
|
this License, whose permissions for other licensees extend to the
|
||||||
|
entire whole, and thus to each and every part regardless of who wrote it.
|
||||||
|
|
||||||
|
Thus, it is not the intent of this section to claim rights or contest
|
||||||
|
your rights to work written entirely by you; rather, the intent is to
|
||||||
|
exercise the right to control the distribution of derivative or
|
||||||
|
collective works based on the Program.
|
||||||
|
|
||||||
|
In addition, mere aggregation of another work not based on the Program
|
||||||
|
with the Program (or with a work based on the Program) on a volume of
|
||||||
|
a storage or distribution medium does not bring the other work under
|
||||||
|
the scope of this License.
|
||||||
|
|
||||||
|
3. You may copy and distribute the Program (or a work based on it,
|
||||||
|
under Section 2) in object code or executable form under the terms of
|
||||||
|
Sections 1 and 2 above provided that you also do one of the following:
|
||||||
|
|
||||||
|
a) Accompany it with the complete corresponding machine-readable
|
||||||
|
source code, which must be distributed under the terms of Sections
|
||||||
|
1 and 2 above on a medium customarily used for software interchange; or,
|
||||||
|
|
||||||
|
b) Accompany it with a written offer, valid for at least three
|
||||||
|
years, to give any third party, for a charge no more than your
|
||||||
|
cost of physically performing source distribution, a complete
|
||||||
|
machine-readable copy of the corresponding source code, to be
|
||||||
|
distributed under the terms of Sections 1 and 2 above on a medium
|
||||||
|
customarily used for software interchange; or,
|
||||||
|
|
||||||
|
c) Accompany it with the information you received as to the offer
|
||||||
|
to distribute corresponding source code. (This alternative is
|
||||||
|
allowed only for noncommercial distribution and only if you
|
||||||
|
received the program in object code or executable form with such
|
||||||
|
an offer, in accord with Subsection b above.)
|
||||||
|
|
||||||
|
The source code for a work means the preferred form of the work for
|
||||||
|
making modifications to it. For an executable work, complete source
|
||||||
|
code means all the source code for all modules it contains, plus any
|
||||||
|
associated interface definition files, plus the scripts used to
|
||||||
|
control compilation and installation of the executable. However, as a
|
||||||
|
special exception, the source code distributed need not include
|
||||||
|
anything that is normally distributed (in either source or binary
|
||||||
|
form) with the major components (compiler, kernel, and so on) of the
|
||||||
|
operating system on which the executable runs, unless that component
|
||||||
|
itself accompanies the executable.
|
||||||
|
|
||||||
|
If distribution of executable or object code is made by offering
|
||||||
|
access to copy from a designated place, then offering equivalent
|
||||||
|
access to copy the source code from the same place counts as
|
||||||
|
distribution of the source code, even though third parties are not
|
||||||
|
compelled to copy the source along with the object code.
|
||||||
|
|
||||||
|
4. You may not copy, modify, sublicense, or distribute the Program
|
||||||
|
except as expressly provided under this License. Any attempt
|
||||||
|
otherwise to copy, modify, sublicense or distribute the Program is
|
||||||
|
void, and will automatically terminate your rights under this License.
|
||||||
|
However, parties who have received copies, or rights, from you under
|
||||||
|
this License will not have their licenses terminated so long as such
|
||||||
|
parties remain in full compliance.
|
||||||
|
|
||||||
|
5. You are not required to accept this License, since you have not
|
||||||
|
signed it. However, nothing else grants you permission to modify or
|
||||||
|
distribute the Program or its derivative works. These actions are
|
||||||
|
prohibited by law if you do not accept this License. Therefore, by
|
||||||
|
modifying or distributing the Program (or any work based on the
|
||||||
|
Program), you indicate your acceptance of this License to do so, and
|
||||||
|
all its terms and conditions for copying, distributing or modifying
|
||||||
|
the Program or works based on it.
|
||||||
|
|
||||||
|
6. Each time you redistribute the Program (or any work based on the
|
||||||
|
Program), the recipient automatically receives a license from the
|
||||||
|
original licensor to copy, distribute or modify the Program subject to
|
||||||
|
these terms and conditions. You may not impose any further
|
||||||
|
restrictions on the recipients' exercise of the rights granted herein.
|
||||||
|
You are not responsible for enforcing compliance by third parties to
|
||||||
|
this License.
|
||||||
|
|
||||||
|
7. If, as a consequence of a court judgment or allegation of patent
|
||||||
|
infringement or for any other reason (not limited to patent issues),
|
||||||
|
conditions are imposed on you (whether by court order, agreement or
|
||||||
|
otherwise) that contradict the conditions of this License, they do not
|
||||||
|
excuse you from the conditions of this License. If you cannot
|
||||||
|
distribute so as to satisfy simultaneously your obligations under this
|
||||||
|
License and any other pertinent obligations, then as a consequence you
|
||||||
|
may not distribute the Program at all. For example, if a patent
|
||||||
|
license would not permit royalty-free redistribution of the Program by
|
||||||
|
all those who receive copies directly or indirectly through you, then
|
||||||
|
the only way you could satisfy both it and this License would be to
|
||||||
|
refrain entirely from distribution of the Program.
|
||||||
|
|
||||||
|
If any portion of this section is held invalid or unenforceable under
|
||||||
|
any particular circumstance, the balance of the section is intended to
|
||||||
|
apply and the section as a whole is intended to apply in other
|
||||||
|
circumstances.
|
||||||
|
|
||||||
|
It is not the purpose of this section to induce you to infringe any
|
||||||
|
patents or other property right claims or to contest validity of any
|
||||||
|
such claims; this section has the sole purpose of protecting the
|
||||||
|
integrity of the free software distribution system, which is
|
||||||
|
implemented by public license practices. Many people have made
|
||||||
|
generous contributions to the wide range of software distributed
|
||||||
|
through that system in reliance on consistent application of that
|
||||||
|
system; it is up to the author/donor to decide if he or she is willing
|
||||||
|
to distribute software through any other system and a licensee cannot
|
||||||
|
impose that choice.
|
||||||
|
|
||||||
|
This section is intended to make thoroughly clear what is believed to
|
||||||
|
be a consequence of the rest of this License.
|
||||||
|
|
||||||
|
8. If the distribution and/or use of the Program is restricted in
|
||||||
|
certain countries either by patents or by copyrighted interfaces, the
|
||||||
|
original copyright holder who places the Program under this License
|
||||||
|
may add an explicit geographical distribution limitation excluding
|
||||||
|
those countries, so that distribution is permitted only in or among
|
||||||
|
countries not thus excluded. In such case, this License incorporates
|
||||||
|
the limitation as if written in the body of this License.
|
||||||
|
|
||||||
|
9. The Free Software Foundation may publish revised and/or new versions
|
||||||
|
of the General Public License from time to time. Such new versions will
|
||||||
|
be similar in spirit to the present version, but may differ in detail to
|
||||||
|
address new problems or concerns.
|
||||||
|
|
||||||
|
Each version is given a distinguishing version number. If the Program
|
||||||
|
specifies a version number of this License which applies to it and "any
|
||||||
|
later version", you have the option of following the terms and conditions
|
||||||
|
either of that version or of any later version published by the Free
|
||||||
|
Software Foundation. If the Program does not specify a version number of
|
||||||
|
this License, you may choose any version ever published by the Free Software
|
||||||
|
Foundation.
|
||||||
|
|
||||||
|
10. If you wish to incorporate parts of the Program into other free
|
||||||
|
programs whose distribution conditions are different, write to the author
|
||||||
|
to ask for permission. For software which is copyrighted by the Free
|
||||||
|
Software Foundation, write to the Free Software Foundation; we sometimes
|
||||||
|
make exceptions for this. Our decision will be guided by the two goals
|
||||||
|
of preserving the free status of all derivatives of our free software and
|
||||||
|
of promoting the sharing and reuse of software generally.
|
||||||
|
|
||||||
|
NO WARRANTY
|
||||||
|
|
||||||
|
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
|
||||||
|
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
|
||||||
|
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
|
||||||
|
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
|
||||||
|
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
||||||
|
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
|
||||||
|
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
|
||||||
|
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
|
||||||
|
REPAIR OR CORRECTION.
|
||||||
|
|
||||||
|
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||||
|
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
|
||||||
|
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
|
||||||
|
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
|
||||||
|
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
|
||||||
|
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
|
||||||
|
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
|
||||||
|
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
|
||||||
|
POSSIBILITY OF SUCH DAMAGES.
|
||||||
|
|
||||||
|
END OF TERMS AND CONDITIONS
|
||||||
@@ -0,0 +1,388 @@
|
|||||||
|
/*
|
||||||
|
* Program: REALFFTF.C
|
||||||
|
* Author: Philip Van Baren
|
||||||
|
* Date: 2 September 1993
|
||||||
|
*
|
||||||
|
* Description: These routines perform an FFT on real data to get a conjugate-symmetric
|
||||||
|
* output, and an inverse FFT on conjugate-symmetric input to get a real
|
||||||
|
* output sequence.
|
||||||
|
*
|
||||||
|
* This code is for floating point data.
|
||||||
|
*
|
||||||
|
* Modified 8/19/1998 by Philip Van Baren
|
||||||
|
* - made the InitializeFFT and EndFFT routines take a structure
|
||||||
|
* holding the length and pointers to the BitReversed and SinTable
|
||||||
|
* tables.
|
||||||
|
* Modified 5/23/2009 by Philip Van Baren
|
||||||
|
* - Added GetFFT and ReleaseFFT routines to retain common SinTable
|
||||||
|
* and BitReversed tables so they don't need to be reallocated
|
||||||
|
* and recomputed on every call.
|
||||||
|
* - Added Reorder* functions to undo the bit-reversal
|
||||||
|
*
|
||||||
|
* Copyright (C) 2009 Philip VanBaren
|
||||||
|
*
|
||||||
|
* This program is free software; you can redistribute it and/or modify
|
||||||
|
* it under the terms of the GNU General Public License as published by
|
||||||
|
* the Free Software Foundation; either version 2 of the License, or
|
||||||
|
* (at your option) any later version.
|
||||||
|
*
|
||||||
|
* This program is distributed in the hope that it will be useful,
|
||||||
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
* GNU General Public License for more details.
|
||||||
|
*
|
||||||
|
* You should have received a copy of the GNU General Public License
|
||||||
|
* along with this program; if not, write to the Free Software
|
||||||
|
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <math.h>
|
||||||
|
|
||||||
|
#include "RealFFTf.h"
|
||||||
|
#ifdef EXPERIMENTAL_EQ_SSE_THREADED
|
||||||
|
#include "RealFFTf48x.h"
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef M_PI
|
||||||
|
#define M_PI 3.14159265358979323846 /* pi */
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Initialize the Sine table and Twiddle pointers (bit-reversed pointers)
|
||||||
|
* for the FFT routine.
|
||||||
|
*/
|
||||||
|
HFFT InitializeFFT(int fftlen)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
int temp;
|
||||||
|
int mask;
|
||||||
|
HFFT h;
|
||||||
|
|
||||||
|
if((h=(HFFT)malloc(sizeof(FFTParam)))==NULL)
|
||||||
|
{
|
||||||
|
fprintf(stderr,"Error allocating memory for FFT\n");
|
||||||
|
exit(8);
|
||||||
|
}
|
||||||
|
/*
|
||||||
|
* FFT size is only half the number of data points
|
||||||
|
* The full FFT output can be reconstructed from this FFT's output.
|
||||||
|
* (This optimization can be made since the data is real.)
|
||||||
|
*/
|
||||||
|
h->Points = fftlen/2;
|
||||||
|
|
||||||
|
if((h->SinTable=(fft_type *)malloc(2*h->Points*sizeof(fft_type)))==NULL)
|
||||||
|
{
|
||||||
|
fprintf(stderr,"Error allocating memory for Sine table.\n");
|
||||||
|
exit(8);
|
||||||
|
}
|
||||||
|
|
||||||
|
if((h->BitReversed=(int *)malloc(h->Points*sizeof(int)))==NULL)
|
||||||
|
{
|
||||||
|
fprintf(stderr,"Error allocating memory for BitReversed.\n");
|
||||||
|
exit(8);
|
||||||
|
}
|
||||||
|
|
||||||
|
for(i=0;i<h->Points;i++)
|
||||||
|
{
|
||||||
|
temp=0;
|
||||||
|
for(mask=h->Points/2;mask>0;mask >>= 1)
|
||||||
|
temp=(temp >> 1) + (i&mask ? h->Points : 0);
|
||||||
|
|
||||||
|
h->BitReversed[i]=temp;
|
||||||
|
}
|
||||||
|
|
||||||
|
for(i=0;i<h->Points;i++)
|
||||||
|
{
|
||||||
|
h->SinTable[h->BitReversed[i] ]=(fft_type)-sin(2*M_PI*i/(2*h->Points));
|
||||||
|
h->SinTable[h->BitReversed[i]+1]=(fft_type)-cos(2*M_PI*i/(2*h->Points));
|
||||||
|
}
|
||||||
|
|
||||||
|
return h;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Free up the memory allotted for Sin table and Twiddle Pointers
|
||||||
|
*/
|
||||||
|
void EndFFT(HFFT h)
|
||||||
|
{
|
||||||
|
if(h->Points>0) {
|
||||||
|
free(h->BitReversed);
|
||||||
|
free(h->SinTable);
|
||||||
|
}
|
||||||
|
h->Points=0;
|
||||||
|
free(h);
|
||||||
|
}
|
||||||
|
|
||||||
|
#define MAX_HFFT 10
|
||||||
|
static HFFT hFFTArray[MAX_HFFT] = { NULL };
|
||||||
|
static int nFFTLockCount[MAX_HFFT] = { 0 };
|
||||||
|
|
||||||
|
/* Get a handle to the FFT tables of the desired length */
|
||||||
|
/* This version keeps common tables rather than allocating a new table every time */
|
||||||
|
HFFT GetFFT(int fftlen)
|
||||||
|
{
|
||||||
|
int h,n = fftlen/2;
|
||||||
|
for(h=0; (h<MAX_HFFT) && (hFFTArray[h] != NULL) && (n != hFFTArray[h]->Points); h++);
|
||||||
|
if(h<MAX_HFFT) {
|
||||||
|
if(hFFTArray[h] == NULL) {
|
||||||
|
hFFTArray[h] = InitializeFFT(fftlen);
|
||||||
|
nFFTLockCount[h] = 0;
|
||||||
|
}
|
||||||
|
nFFTLockCount[h]++;
|
||||||
|
return hFFTArray[h];
|
||||||
|
} else {
|
||||||
|
// All buffers used, so fall back to allocating a new set of tables
|
||||||
|
return InitializeFFT(fftlen);;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Release a previously requested handle to the FFT tables */
|
||||||
|
void ReleaseFFT(HFFT hFFT)
|
||||||
|
{
|
||||||
|
int h;
|
||||||
|
for(h=0; (h<MAX_HFFT) && (hFFTArray[h] != hFFT); h++);
|
||||||
|
if(h<MAX_HFFT) {
|
||||||
|
nFFTLockCount[h]--;
|
||||||
|
} else {
|
||||||
|
EndFFT(hFFT);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Deallocate any unused FFT tables */
|
||||||
|
void CleanupFFT()
|
||||||
|
{
|
||||||
|
int h;
|
||||||
|
for(h=0; (h<MAX_HFFT); h++) {
|
||||||
|
if((nFFTLockCount[h] <= 0) && (hFFTArray[h] != NULL)) {
|
||||||
|
EndFFT(hFFTArray[h]);
|
||||||
|
hFFTArray[h] = NULL;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Forward FFT routine. Must call InitializeFFT(fftlen) first!
|
||||||
|
*
|
||||||
|
* Note: Output is BIT-REVERSED! so you must use the BitReversed to
|
||||||
|
* get legible output, (i.e. Real_i = buffer[ h->BitReversed[i] ]
|
||||||
|
* Imag_i = buffer[ h->BitReversed[i]+1 ] )
|
||||||
|
* Input is in normal order.
|
||||||
|
*
|
||||||
|
* Output buffer[0] is the DC bin, and output buffer[1] is the Fs/2 bin
|
||||||
|
* - this can be done because both values will always be real only
|
||||||
|
* - this allows us to not have to allocate an extra complex value for the Fs/2 bin
|
||||||
|
*
|
||||||
|
* Note: The scaling on this is done according to the standard FFT definition,
|
||||||
|
* so a unit amplitude DC signal will output an amplitude of (N)
|
||||||
|
* (Older revisions would progressively scale the input, so the output
|
||||||
|
* values would be similar in amplitude to the input values, which is
|
||||||
|
* good when using fixed point arithmetic)
|
||||||
|
*/
|
||||||
|
void RealFFTf(fft_type *buffer,HFFT h)
|
||||||
|
{
|
||||||
|
fft_type *A,*B;
|
||||||
|
fft_type *sptr;
|
||||||
|
fft_type *endptr1,*endptr2;
|
||||||
|
int *br1,*br2;
|
||||||
|
fft_type HRplus,HRminus,HIplus,HIminus;
|
||||||
|
fft_type v1,v2,sin,cos;
|
||||||
|
|
||||||
|
int ButterfliesPerGroup=h->Points/2;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Butterfly:
|
||||||
|
* Ain-----Aout
|
||||||
|
* \ /
|
||||||
|
* / \
|
||||||
|
* Bin-----Bout
|
||||||
|
*/
|
||||||
|
|
||||||
|
endptr1=buffer+h->Points*2;
|
||||||
|
|
||||||
|
while(ButterfliesPerGroup>0)
|
||||||
|
{
|
||||||
|
A=buffer;
|
||||||
|
B=buffer+ButterfliesPerGroup*2;
|
||||||
|
sptr=h->SinTable;
|
||||||
|
|
||||||
|
while(A<endptr1)
|
||||||
|
{
|
||||||
|
sin=*sptr;
|
||||||
|
cos=*(sptr+1);
|
||||||
|
endptr2=B;
|
||||||
|
while(A<endptr2)
|
||||||
|
{
|
||||||
|
v1=*B*cos + *(B+1)*sin;
|
||||||
|
v2=*B*sin - *(B+1)*cos;
|
||||||
|
*B=(*A+v1);
|
||||||
|
*(A++)=*(B++)-2*v1;
|
||||||
|
*B=(*A-v2);
|
||||||
|
*(A++)=*(B++)+2*v2;
|
||||||
|
}
|
||||||
|
A=B;
|
||||||
|
B+=ButterfliesPerGroup*2;
|
||||||
|
sptr+=2;
|
||||||
|
}
|
||||||
|
ButterfliesPerGroup >>= 1;
|
||||||
|
}
|
||||||
|
/* Massage output to get the output for a real input sequence. */
|
||||||
|
br1=h->BitReversed+1;
|
||||||
|
br2=h->BitReversed+h->Points-1;
|
||||||
|
|
||||||
|
while(br1<br2)
|
||||||
|
{
|
||||||
|
sin=h->SinTable[*br1];
|
||||||
|
cos=h->SinTable[*br1+1];
|
||||||
|
A=buffer+*br1;
|
||||||
|
B=buffer+*br2;
|
||||||
|
HRplus = (HRminus = *A - *B ) + (*B * 2);
|
||||||
|
HIplus = (HIminus = *(A+1) - *(B+1)) + (*(B+1) * 2);
|
||||||
|
v1 = (sin*HRminus - cos*HIplus);
|
||||||
|
v2 = (cos*HRminus + sin*HIplus);
|
||||||
|
*A = (HRplus + v1) * (fft_type)0.5;
|
||||||
|
*B = *A - v1;
|
||||||
|
*(A+1) = (HIminus + v2) * (fft_type)0.5;
|
||||||
|
*(B+1) = *(A+1) - HIminus;
|
||||||
|
|
||||||
|
br1++;
|
||||||
|
br2--;
|
||||||
|
}
|
||||||
|
/* Handle the center bin (just need a conjugate) */
|
||||||
|
A=buffer+*br1+1;
|
||||||
|
*A=-*A;
|
||||||
|
/* Handle DC bin separately - and ignore the Fs/2 bin
|
||||||
|
buffer[0]+=buffer[1];
|
||||||
|
buffer[1]=(fft_type)0;*/
|
||||||
|
/* Handle DC and Fs/2 bins separately */
|
||||||
|
/* Put the Fs/2 value into the imaginary part of the DC bin */
|
||||||
|
v1=buffer[0]-buffer[1];
|
||||||
|
buffer[0]+=buffer[1];
|
||||||
|
buffer[1]=v1;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/* Description: This routine performs an inverse FFT to real data.
|
||||||
|
* This code is for floating point data.
|
||||||
|
*
|
||||||
|
* Note: Output is BIT-REVERSED! so you must use the BitReversed to
|
||||||
|
* get legible output, (i.e. wave[2*i] = buffer[ BitReversed[i] ]
|
||||||
|
* wave[2*i+1] = buffer[ BitReversed[i]+1 ] )
|
||||||
|
* Input is in normal order, interleaved (real,imaginary) complex data
|
||||||
|
* You must call InitializeFFT(fftlen) first to initialize some buffers!
|
||||||
|
*
|
||||||
|
* Input buffer[0] is the DC bin, and input buffer[1] is the Fs/2 bin
|
||||||
|
* - this can be done because both values will always be real only
|
||||||
|
* - this allows us to not have to allocate an extra complex value for the Fs/2 bin
|
||||||
|
*
|
||||||
|
* Note: The scaling on this is done according to the standard FFT definition,
|
||||||
|
* so a unit amplitude DC signal will output an amplitude of (N)
|
||||||
|
* (Older revisions would progressively scale the input, so the output
|
||||||
|
* values would be similar in amplitude to the input values, which is
|
||||||
|
* good when using fixed point arithmetic)
|
||||||
|
*/
|
||||||
|
void InverseRealFFTf(fft_type *buffer,HFFT h)
|
||||||
|
{
|
||||||
|
fft_type *A,*B;
|
||||||
|
fft_type *sptr;
|
||||||
|
fft_type *endptr1,*endptr2;
|
||||||
|
int *br1;
|
||||||
|
fft_type HRplus,HRminus,HIplus,HIminus;
|
||||||
|
fft_type v1,v2,sin,cos;
|
||||||
|
|
||||||
|
int ButterfliesPerGroup=h->Points/2;
|
||||||
|
|
||||||
|
/* Massage input to get the input for a real output sequence. */
|
||||||
|
A=buffer+2;
|
||||||
|
B=buffer+h->Points*2-2;
|
||||||
|
br1=h->BitReversed+1;
|
||||||
|
while(A<B)
|
||||||
|
{
|
||||||
|
sin=h->SinTable[*br1];
|
||||||
|
cos=h->SinTable[*br1+1];
|
||||||
|
HRplus = (HRminus = *A - *B ) + (*B * 2);
|
||||||
|
HIplus = (HIminus = *(A+1) - *(B+1)) + (*(B+1) * 2);
|
||||||
|
v1 = (sin*HRminus + cos*HIplus);
|
||||||
|
v2 = (cos*HRminus - sin*HIplus);
|
||||||
|
*A = (HRplus + v1) * (fft_type)0.5;
|
||||||
|
*B = *A - v1;
|
||||||
|
*(A+1) = (HIminus - v2) * (fft_type)0.5;
|
||||||
|
*(B+1) = *(A+1) - HIminus;
|
||||||
|
|
||||||
|
A+=2;
|
||||||
|
B-=2;
|
||||||
|
br1++;
|
||||||
|
}
|
||||||
|
/* Handle center bin (just need conjugate) */
|
||||||
|
*(A+1)=-*(A+1);
|
||||||
|
/* Handle DC bin separately - this ignores any Fs/2 component
|
||||||
|
buffer[1]=buffer[0]=buffer[0]/2;*/
|
||||||
|
/* Handle DC and Fs/2 bins specially */
|
||||||
|
/* The DC bin is passed in as the real part of the DC complex value */
|
||||||
|
/* The Fs/2 bin is passed in as the imaginary part of the DC complex value */
|
||||||
|
/* (v1+v2) = buffer[0] == the DC component */
|
||||||
|
/* (v1-v2) = buffer[1] == the Fs/2 component */
|
||||||
|
v1=0.5f*(buffer[0]+buffer[1]);
|
||||||
|
v2=0.5f*(buffer[0]-buffer[1]);
|
||||||
|
buffer[0]=v1;
|
||||||
|
buffer[1]=v2;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Butterfly:
|
||||||
|
* Ain-----Aout
|
||||||
|
* \ /
|
||||||
|
* / \
|
||||||
|
* Bin-----Bout
|
||||||
|
*/
|
||||||
|
|
||||||
|
endptr1=buffer+h->Points*2;
|
||||||
|
|
||||||
|
while(ButterfliesPerGroup>0)
|
||||||
|
{
|
||||||
|
A=buffer;
|
||||||
|
B=buffer+ButterfliesPerGroup*2;
|
||||||
|
sptr=h->SinTable;
|
||||||
|
|
||||||
|
while(A<endptr1)
|
||||||
|
{
|
||||||
|
sin=*(sptr++);
|
||||||
|
cos=*(sptr++);
|
||||||
|
endptr2=B;
|
||||||
|
while(A<endptr2)
|
||||||
|
{
|
||||||
|
v1=*B*cos - *(B+1)*sin;
|
||||||
|
v2=*B*sin + *(B+1)*cos;
|
||||||
|
*B=(*A+v1)*(fft_type)0.5;
|
||||||
|
*(A++)=*(B++)-v1;
|
||||||
|
*B=(*A+v2)*(fft_type)0.5;
|
||||||
|
*(A++)=*(B++)-v2;
|
||||||
|
}
|
||||||
|
A=B;
|
||||||
|
B+=ButterfliesPerGroup*2;
|
||||||
|
}
|
||||||
|
ButterfliesPerGroup >>= 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void ReorderToFreq(HFFT hFFT, fft_type *buffer, fft_type *RealOut, fft_type *ImagOut)
|
||||||
|
{
|
||||||
|
// Copy the data into the real and imaginary outputs
|
||||||
|
for(int i=1;i<hFFT->Points;i++) {
|
||||||
|
RealOut[i]=buffer[hFFT->BitReversed[i] ];
|
||||||
|
ImagOut[i]=buffer[hFFT->BitReversed[i]+1];
|
||||||
|
}
|
||||||
|
RealOut[0] = buffer[0]; // DC component
|
||||||
|
ImagOut[0] = 0;
|
||||||
|
RealOut[hFFT->Points] = buffer[1]; // Fs/2 component
|
||||||
|
ImagOut[hFFT->Points] = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
void ReorderToTime(HFFT hFFT, fft_type *buffer, fft_type *TimeOut)
|
||||||
|
{
|
||||||
|
// Copy the data into the real outputs
|
||||||
|
for(int i=0;i<hFFT->Points;i++) {
|
||||||
|
TimeOut[i*2 ]=buffer[hFFT->BitReversed[i] ];
|
||||||
|
TimeOut[i*2+1]=buffer[hFFT->BitReversed[i]+1];
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -0,0 +1,23 @@
|
|||||||
|
#ifndef __realfftf_h
|
||||||
|
#define __realfftf_h
|
||||||
|
|
||||||
|
#define fft_type float
|
||||||
|
typedef struct FFTParamType {
|
||||||
|
int *BitReversed;
|
||||||
|
fft_type *SinTable;
|
||||||
|
int Points;
|
||||||
|
} FFTParam;
|
||||||
|
#define HFFT FFTParam *
|
||||||
|
|
||||||
|
HFFT InitializeFFT(int);
|
||||||
|
void EndFFT(HFFT);
|
||||||
|
HFFT GetFFT(int);
|
||||||
|
void ReleaseFFT(HFFT);
|
||||||
|
void CleanupFFT();
|
||||||
|
void RealFFTf(fft_type *,HFFT);
|
||||||
|
void InverseRealFFTf(fft_type *,HFFT);
|
||||||
|
void ReorderToTime(HFFT hFFT, fft_type *buffer, fft_type *TimeOut);
|
||||||
|
void ReorderToFreq(HFFT hFFT, fft_type *buffer, fft_type *RealOut, fft_type *ImagOut);
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
||||||
@@ -174,6 +174,8 @@
|
|||||||
<ClCompile Include="compatibility.cpp" />
|
<ClCompile Include="compatibility.cpp" />
|
||||||
<ClCompile Include="dywapitchtrack\dywapitchtrack.cpp" />
|
<ClCompile Include="dywapitchtrack\dywapitchtrack.cpp" />
|
||||||
<ClCompile Include="dywapitchtrack\ptDyWa.cpp" />
|
<ClCompile Include="dywapitchtrack\ptDyWa.cpp" />
|
||||||
|
<ClCompile Include="FFT\FFT.cpp" />
|
||||||
|
<ClCompile Include="FFT\RealFFTf.cpp" />
|
||||||
<ClCompile Include="Helper.cpp" />
|
<ClCompile Include="Helper.cpp" />
|
||||||
<ClCompile Include="performous\pitch.cc" />
|
<ClCompile Include="performous\pitch.cc" />
|
||||||
<ClCompile Include="ptAKF.cpp" />
|
<ClCompile Include="ptAKF.cpp" />
|
||||||
@@ -183,6 +185,8 @@
|
|||||||
<ClInclude Include="compatibility.h" />
|
<ClInclude Include="compatibility.h" />
|
||||||
<ClInclude Include="dywapitchtrack\dywapitchtrack.h" />
|
<ClInclude Include="dywapitchtrack\dywapitchtrack.h" />
|
||||||
<ClInclude Include="dywapitchtrack\ptDyWa.h" />
|
<ClInclude Include="dywapitchtrack\ptDyWa.h" />
|
||||||
|
<ClInclude Include="FFT\FFT.h" />
|
||||||
|
<ClInclude Include="FFT\RealFFTf.h" />
|
||||||
<ClInclude Include="Helper.h" />
|
<ClInclude Include="Helper.h" />
|
||||||
<ClInclude Include="performous\libda\fft.hpp" />
|
<ClInclude Include="performous\libda\fft.hpp" />
|
||||||
<ClInclude Include="performous\libda\sample.hpp" />
|
<ClInclude Include="performous\libda\sample.hpp" />
|
||||||
|
|||||||
@@ -28,6 +28,12 @@
|
|||||||
<Filter Include="Headerdateien\dywapitchtrack">
|
<Filter Include="Headerdateien\dywapitchtrack">
|
||||||
<UniqueIdentifier>{2a09cee1-51b7-4c24-aa9f-32bec53c3a36}</UniqueIdentifier>
|
<UniqueIdentifier>{2a09cee1-51b7-4c24-aa9f-32bec53c3a36}</UniqueIdentifier>
|
||||||
</Filter>
|
</Filter>
|
||||||
|
<Filter Include="Quelldateien\FFT">
|
||||||
|
<UniqueIdentifier>{498f64e2-ff83-41fd-be25-c613750f0e34}</UniqueIdentifier>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="Headerdateien\FFT">
|
||||||
|
<UniqueIdentifier>{0791b62f-ef8d-40e2-b67e-a6d9dead8720}</UniqueIdentifier>
|
||||||
|
</Filter>
|
||||||
</ItemGroup>
|
</ItemGroup>
|
||||||
<ItemGroup>
|
<ItemGroup>
|
||||||
<ClCompile Include="PitchWrapper.cpp">
|
<ClCompile Include="PitchWrapper.cpp">
|
||||||
@@ -51,6 +57,12 @@
|
|||||||
<ClCompile Include="Helper.cpp">
|
<ClCompile Include="Helper.cpp">
|
||||||
<Filter>Quelldateien</Filter>
|
<Filter>Quelldateien</Filter>
|
||||||
</ClCompile>
|
</ClCompile>
|
||||||
|
<ClCompile Include="FFT\FFT.cpp">
|
||||||
|
<Filter>Quelldateien\FFT</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="FFT\RealFFTf.cpp">
|
||||||
|
<Filter>Quelldateien\FFT</Filter>
|
||||||
|
</ClCompile>
|
||||||
</ItemGroup>
|
</ItemGroup>
|
||||||
<ItemGroup>
|
<ItemGroup>
|
||||||
<ClInclude Include="compatibility.h">
|
<ClInclude Include="compatibility.h">
|
||||||
@@ -77,6 +89,12 @@
|
|||||||
<ClInclude Include="dywapitchtrack\ptDyWa.h">
|
<ClInclude Include="dywapitchtrack\ptDyWa.h">
|
||||||
<Filter>Headerdateien\dywapitchtrack</Filter>
|
<Filter>Headerdateien\dywapitchtrack</Filter>
|
||||||
</ClInclude>
|
</ClInclude>
|
||||||
|
<ClInclude Include="FFT\FFT.h">
|
||||||
|
<Filter>Headerdateien\FFT</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="FFT\RealFFTf.h">
|
||||||
|
<Filter>Headerdateien\FFT</Filter>
|
||||||
|
</ClInclude>
|
||||||
</ItemGroup>
|
</ItemGroup>
|
||||||
<ItemGroup>
|
<ItemGroup>
|
||||||
<None Include="performous\pitch.hh">
|
<None Include="performous\pitch.hh">
|
||||||
|
|||||||
@@ -1,7 +1,6 @@
|
|||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
#include <cmath>
|
#include <cmath>
|
||||||
#include "../compatibility.h"
|
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* @file sample.hpp Sample format definition and format conversions.
|
* @file sample.hpp Sample format definition and format conversions.
|
||||||
|
|||||||
+23
-4
@@ -17,8 +17,13 @@
|
|||||||
#include "ptAKF.h"
|
#include "ptAKF.h"
|
||||||
#include <cmath>
|
#include <cmath>
|
||||||
|
|
||||||
|
#ifdef USE_FFT
|
||||||
|
#include "FFT/FFT.h"
|
||||||
|
#endif
|
||||||
|
|
||||||
static constexpr double BaseToneFrequency = 65.4064; // lowest (half-)tone to analyze (C2 = 65.4064 Hz)
|
static constexpr double BaseToneFrequency = 65.4064; // lowest (half-)tone to analyze (C2 = 65.4064 Hz)
|
||||||
static constexpr double HalftoneBase = 1.05946309436; // 2^(1/12) -> HalftoneBase^12 = 2 (one octave)
|
static constexpr double HalftoneBase = 1.05946309436; // 2^(1/12) -> HalftoneBase^12 = 2 (one octave)
|
||||||
|
|
||||||
int PtAKF::_InitCount = 0;
|
int PtAKF::_InitCount = 0;
|
||||||
float* restrict PtAKF::_SamplesPerPeriodPerTone = NULL;
|
float* restrict PtAKF::_SamplesPerPeriodPerTone = NULL;
|
||||||
float* restrict PtAKF::_SamplesPerPeriodPerToneFine = NULL;
|
float* restrict PtAKF::_SamplesPerPeriodPerToneFine = NULL;
|
||||||
@@ -41,9 +46,9 @@ PtAKF::PtAKF(unsigned step){
|
|||||||
_SamplesPerPeriodPerToneFine[2 * toneIndex + 1] = static_cast<float>(44100.0 / GetFrequencyFromTone(toneIndex + 1./3.)); // samples for a bit above exact frequency
|
_SamplesPerPeriodPerToneFine[2 * toneIndex + 1] = static_cast<float>(44100.0 / GetFrequencyFromTone(toneIndex + 1./3.)); // samples for a bit above exact frequency
|
||||||
}
|
}
|
||||||
_Window = new float[_SampleCt];
|
_Window = new float[_SampleCt];
|
||||||
double cosMult = 2. * M_PI / (_SampleCt - 1.); //To simplify and speed up
|
double cosMult = 2. * M_PI / (2 * _SampleCt - 1.); //To simplify and speed up; 2 * _SampleCt because we extend the data by a factor of 2
|
||||||
for (int i = 0; i < _SampleCt; i++) {
|
for (int i = 0; i < _SampleCt; i++) {
|
||||||
_Window[i] = static_cast<float>(0.64 - 0.36 * cos(i * cosMult));
|
_Window[i] = static_cast<float>(0.54 - 0.46 * cos(i * cosMult));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
_Step = step;
|
_Step = step;
|
||||||
@@ -149,12 +154,20 @@ int PtAKF::_GetNote(float samples[_SampleCt], float* restrict maxVolume, float w
|
|||||||
if(maxVolumeL < _VolTreshold)
|
if(maxVolumeL < _VolTreshold)
|
||||||
return -1;
|
return -1;
|
||||||
|
|
||||||
float samplesWindowed[_SampleCt];
|
float samplesWindowed[_SampleCt * 2];
|
||||||
|
|
||||||
for(int i = 0; i < _SampleCt; i++){
|
for(int i = 0; i < _SampleCt; i++){
|
||||||
samplesWindowed[i] = samples[i] * _Window[i];
|
samplesWindowed[i] = samples[i] * _Window[i];
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#ifdef USE_FFT
|
||||||
|
for(int i = _SampleCt; i < _SampleCt * 2; i++){
|
||||||
|
samplesWindowed[i] = 0.f;
|
||||||
|
}
|
||||||
|
float samplesFFT[_SampleCt+1]; // +1 for middle value!
|
||||||
|
PowerSpectrum(_SampleCt*2, samplesWindowed, samplesFFT);
|
||||||
|
RealInverseRealFFT(_SampleCt*2, samplesFFT, _AKFValues);
|
||||||
|
#endif
|
||||||
// Now analyze the samples and get peaks at the most appropriate tones
|
// Now analyze the samples and get peaks at the most appropriate tones
|
||||||
|
|
||||||
//Attention: We have a peak at lag 0 that might stretch that far, that we detect a wrong "peak" at _MaxHalfTone
|
//Attention: We have a peak at lag 0 that might stretch that far, that we detect a wrong "peak" at _MaxHalfTone
|
||||||
@@ -163,6 +176,7 @@ int PtAKF::_GetNote(float samples[_SampleCt], float* restrict maxVolume, float w
|
|||||||
float lastWeight = 1.f;
|
float lastWeight = 1.f;
|
||||||
float maxWeight = 0.f;
|
float maxWeight = 0.f;
|
||||||
|
|
||||||
|
//TODO: When using FFT this can be speed up a lot by only checking around the AKF peaks
|
||||||
#pragma omp parallel for schedule(static)
|
#pragma omp parallel for schedule(static)
|
||||||
for (int toneIndex = 0; toneIndex <= _MaxHalfTone; toneIndex++){
|
for (int toneIndex = 0; toneIndex <= _MaxHalfTone; toneIndex++){
|
||||||
float curWeight = _AnalyzeByTone(samples, samplesWindowed, toneIndex);
|
float curWeight = _AnalyzeByTone(samples, samplesWindowed, toneIndex);
|
||||||
@@ -307,6 +321,10 @@ float PtAKF::_AKFBySampleCt(float samples[_SampleCt], float samplesPerPeriodD){
|
|||||||
int samplesPerPeriod = static_cast<int>(samplesPerPeriodD);
|
int samplesPerPeriod = static_cast<int>(samplesPerPeriodD);
|
||||||
float fHigh = samplesPerPeriodD - samplesPerPeriod;
|
float fHigh = samplesPerPeriodD - samplesPerPeriod;
|
||||||
float fLow = 1.0f - fHigh;
|
float fLow = 1.0f - fHigh;
|
||||||
|
#ifdef USE_FFT
|
||||||
|
float akf2 = _AKFValues[samplesPerPeriod] * fLow + _AKFValues[samplesPerPeriod+1] * fHigh;
|
||||||
|
return akf2 / (_SampleCt * _SampleCt);
|
||||||
|
#else
|
||||||
|
|
||||||
float accumDist = 0; // accumulated distances
|
float accumDist = 0; // accumulated distances
|
||||||
|
|
||||||
@@ -322,10 +340,11 @@ float PtAKF::_AKFBySampleCt(float samples[_SampleCt], float samplesPerPeriodD){
|
|||||||
}
|
}
|
||||||
|
|
||||||
return accumDist / _SampleCt;
|
return accumDist / _SampleCt;
|
||||||
|
#endif
|
||||||
}
|
}
|
||||||
|
|
||||||
float PtAKF::_AMDFByTone(float samples[_SampleCt], int toneIndex){
|
float PtAKF::_AMDFByTone(float samples[_SampleCt], int toneIndex){
|
||||||
return _AKFBySampleCt(samples, _SamplesPerPeriodPerTone[toneIndex]);
|
return _AMDFBySampleCt(samples, _SamplesPerPeriodPerTone[toneIndex]);
|
||||||
}
|
}
|
||||||
|
|
||||||
float PtAKF::_AMDFBySampleCt(float samples[_SampleCt], float samplesPerPeriodD){
|
float PtAKF::_AMDFBySampleCt(float samples[_SampleCt], float samplesPerPeriodD){
|
||||||
|
|||||||
@@ -13,6 +13,8 @@
|
|||||||
# endif
|
# endif
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
#define USE_FFT
|
||||||
|
|
||||||
struct SPeak{
|
struct SPeak{
|
||||||
int toneIndex;
|
int toneIndex;
|
||||||
float weight;
|
float weight;
|
||||||
@@ -55,14 +57,17 @@ private:
|
|||||||
float _LastMaxVol;
|
float _LastMaxVol;
|
||||||
int _LastTones[_SmoothCt];
|
int _LastTones[_SmoothCt];
|
||||||
int _LastToneIndex;
|
int _LastToneIndex;
|
||||||
|
#ifdef USE_FFT
|
||||||
|
float _AKFValues[_SampleCt*2];
|
||||||
|
#endif
|
||||||
|
|
||||||
int _GetNote(float samples[_SampleCt], float* restrict maxVolume, float weights[_MaxHalfTone+1]);
|
int _GetNote(float samples[_SampleCt], float* restrict maxVolume, float weights[_MaxHalfTone+1]);
|
||||||
int _GetSmoothTone();
|
int _GetSmoothTone();
|
||||||
|
|
||||||
static float _AnalyzeBySampleCt(float samples[_SampleCt], float samplesWindowed[_SampleCt], float samplesPerPeriodD);
|
float _AnalyzeBySampleCt(float samples[_SampleCt], float samplesWindowed[_SampleCt], float samplesPerPeriodD);
|
||||||
static inline float _AnalyzeByTone(float samples[_SampleCt], float samplesWindowed[_SampleCt], int toneIndex);
|
inline float _AnalyzeByTone(float samples[_SampleCt], float samplesWindowed[_SampleCt], int toneIndex);
|
||||||
static float _AKFBySampleCt(float samples[_SampleCt], float samplesPerPeriodD);
|
float _AKFBySampleCt(float samples[_SampleCt], float samplesPerPeriodD);
|
||||||
static inline float _AKFByTone(float samples[_SampleCt], int toneIndex);
|
inline float _AKFByTone(float samples[_SampleCt], int toneIndex);
|
||||||
static float _AMDFBySampleCt(float samples[_SampleCt], float samplesPerPeriodD);
|
static float _AMDFBySampleCt(float samples[_SampleCt], float samplesPerPeriodD);
|
||||||
static inline float _AMDFByTone(float samples[_SampleCt], int toneIndex);
|
static inline float _AMDFByTone(float samples[_SampleCt], int toneIndex);
|
||||||
static inline void InitPeaks(SPeak peaks[_MaxPeaks]);
|
static inline void InitPeaks(SPeak peaks[_MaxPeaks]);
|
||||||
|
|||||||
Reference in new issue
Block a user