FFTConvolver Class Reference

Implementation of a partitioned FFT convolution algorithm with uniform block size. More...

Public Member Functions
bool	init (size_t blockSize, const Sample *ir, size_t irLen)
	Initializes the convolver. More...
void	process (const Sample *input, Sample *output, size_t len)
	Convolves the the given input samples and immediately outputs the result. More...
void	reset ()
	Resets the convolver and discards the set impulse response.

Detailed Description

Implementation of a partitioned FFT convolution algorithm with uniform block size.

Some notes on how to use it:

• After initialization with an impulse response, subsequent data portions of arbitrary length can be convolved. The convolver internally can handle this by using appropriate buffering.
• The convolver works without "latency" (except for the required processing time, of course), i.e. the output always is the convolved input for each processing call.
• The convolver is suitable for real-time processing which means that no "unpredictable" operations like allocations, locking, API calls, etc. are performed during processing (all necessary allocations and preparations take place during initialization).

Member Function Documentation

bool init	(	size_t	blockSize,
		const Sample *	ir,
		size_t	irLen
	)

Initializes the convolver.

Parameters

blockSize	Block size internally used by the convolver (partition size)
ir	The impulse response
irLen	Length of the impulse response

Returns

true: Success - false: Failed

void process	(	const Sample *	input,
		Sample *	output,
		size_t	len
	)

Convolves the the given input samples and immediately outputs the result.

Parameters

input	The input samples
output	The convolution result
len	Number of input/output samples