//--------------------------------------------------------------------------
//Kernel行列の計算
static Complex[,] calcKernel_matrix(double[] freqs)
{
//窓幅N[k]の最大値
int fftlen = (int)(Math.Pow(2, Math.Ceiling((Math.Log(fs * Q / freqs[0], 2)))));
Complex[,] kernel = new Complex[freqs.Length, fftlen];
Complex[] tmp_kernel = new Complex[fftlen];
for (int k = 0; k < freqs.Length; k++)
{
double freq = freqs[k];
int N_k = (int)((double)(fs * Q) / freq); //窓幅
int start_win = (fftlen - N_k) / 2; //FFT窓の中心を解析部分に合わせる
double[] hamming = new double[N_k];
for (int i = 0; i < N_k; i++)
{
hamming[i] = 1;
}
Nm.Windowing(hamming, Nm.DataWindowType.Hamming);
for (int i = start_win; i < start_win + N_k; i++)
{
tmp_kernel[i] = hamming[i - start_win] / N_k * Complex.Exp(2 * Math.PI * Complex.ImaginaryOne * Q * (i - start_win) / N_k);
}
tmp_kernel = Nm.FastFourierTransform(tmp_kernel, false); //sw==falseでfftlenで割る
double[] d = new double[tmp_kernel.Length];
for (int i = 0; i < tmp_kernel.Length; i++)
{
d[i] = tmp_kernel[i].Magnitude;
}
double max = d.Max();
for (int i = 0; i < fftlen; i++)
{
//if (tmp_kernel[i].Magnitude <= 0.0054)
// kernel[k, i] = Complex.Zero;
//else
kernel[k, i] = Complex.Conjugate(tmp_kernel[i]);
}
}
return(kernel);
}
