LX3JL/xlxd
1
0
Fork 0
mirror of https://github.com/LX3JL/xlxd.git synced 2026-04-06 15:04:12 +00:00
Code Issues Projects Releases Packages Wiki Activity

Back to block processing, more efficient and does not introduce delay

Browse source
This commit is contained in:
Geoffrey Merck 2020-04-04 16:16:46 +02:00
parent 1770dc188f
commit 042188770b
9 changed files with 85 additions and 57 deletions
Download patch file Download diff file Expand all files Collapse all files

40
ambed/cfirfilter.cpp
View file

@ -43,27 +43,33 @@ CFIRFilter::~CFIRFilter()
delete[] m_buffer;
}
inline float CFIRFilter::ProcessSample(float inputSample)
inline void CFIRFilter::ProcessSampleBlock(uint8* voice, int length)
{
float output = 0.0f;
int iTaps = 0;
// Buffer latest sample into delay line
m_buffer[m_currentBufferPosition] = inputSample;
for(int i = m_currentBufferPosition; i >= 0; i--)
for(int i = 0; i < length; i++)
{
output += m_taps[iTaps++] * m_buffer[i];
}
float input = (float)(short)MAKEWORD(voice[i+1], voice[i]);
float output = 0.0f;
int iTaps = 0;
for(int i = m_tapsLength - 1; i > m_currentBufferPosition; i--)
{
output += m_taps[iTaps++] * m_buffer[i];
}
m_currentBufferPosition = (m_currentBufferPosition + 1) % m_tapsLength;
// Buffer latest sample into delay line
m_buffer[m_currentBufferPosition] = input;
return output;
for(int i = m_currentBufferPosition; i >= 0; i--)
{
output += m_taps[iTaps++] * m_buffer[i];
}
for(int i = m_tapsLength - 1; i > m_currentBufferPosition; i--)
{
output += m_taps[iTaps++] * m_buffer[i];
}
m_currentBufferPosition = (m_currentBufferPosition + 1) % m_tapsLength;
//write processed sample back
voice[i] = HIBYTE((short)output);
voice[i+1] = LOBYTE((short)output);
}
}