Aegisub/aegisub/src/fft.h

62 lines
2.3 KiB
C
Raw Normal View History

2006-01-16 22:02:54 +01:00
// Copyright (c) 2005, Rodrigo Braz Monteiro
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither the name of the Aegisub Group nor the names of its contributors
// may be used to endorse or promote products derived from this software
// without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
// Aegisub Project http://www.aegisub.org/
2006-01-16 22:02:54 +01:00
//
// $Id$
/// @file fft.h
/// @see fft.cpp
/// @ingroup utility
///
2006-01-16 22:02:54 +01:00
2006-01-16 22:02:54 +01:00
#ifndef AGI_PRE
2006-01-16 22:02:54 +01:00
#include <stdlib.h> // size_t
#endif
2006-01-16 22:02:54 +01:00
/// DOCME
/// @class FFT
/// @brief DOCME
///
/// DOCME
2006-01-16 22:02:54 +01:00
class FFT {
private:
void DoTransform(size_t n_samples,float *input,float *output_r,float *output_i,bool inverse);
public:
void Transform(size_t n_samples,float *input,float *output_r,float *output_i);
void InverseTransform(size_t n_samples,float *input,float *output_r,float *output_i);
bool IsPowerOfTwo(unsigned int x);
unsigned int NumberOfBitsNeeded(unsigned int n_samples);
unsigned int ReverseBits(unsigned int index, unsigned int bits);
float FrequencyAtIndex(unsigned int baseFreq, unsigned int n_samples, unsigned int index);
};