二维卷积算法的C#实现

double[] conv2(double[] X, double[] Y)
{
    double mid = 0;
    int index_X = 0, index_Y = 0;
    int long_X = 0, long_Y = 0;
    long_X = X.Length;
    long_Y = Y.Length;
    double[] Result = new double[long_X + long_Y - 1];

    if (long_X >= long_Y)

        for (int index_mid = 0; index_mid < (long_X + long_Y - 1); index_mid++)
        {
            index_X = index_mid;
            index_Y = 0;

            for (int conv = 0; conv < long_Y; conv++)
            {
                if (index_X < 0 | index_X >= long_X)
                { }
                else
                {
                    mid += X[index_X] * Y[index_Y];
                }
                index_X--;
                index_Y++;
            }
            Result[index_mid] = mid;
            mid = 0;
        }