Search - n2-1 - CodeBus

Search - n2-1 - List

[Communication] 2D_convolution DL : 0: 二维卷积运算之C语言实现若x为N1*M1的二维信号，y为N2*M2的二维信号，则卷积为(N1+N2-1)*(M1+M2-1)的信号-2D convolution operators on C language if x N1 * M1 to the two-dimensional signal y * M2 N2 for the two-dimensional signal, convolution (N1 N2-1) * (M1 M2 - 1) signal
Date : 2008-10-13 Size : 3.33kb User : 劉昱楓
[Communication] 2D_convolution DL : 0: 二维卷积运算之C语言实现若x为N1*M1的二维信号，y为N2*M2的二维信号，则卷积为(N1+N2-1)*(M1+M2-1)的信号-2D convolution operators on C language if x N1* M1 to the two-dimensional signal y* M2 N2 for the two-dimensional signal, convolution (N1 N2-1)* (M1 M2- 1) signal
Date : 2026-01-09 Size : 3kb User : 劉昱楓
[Communication] c_FFT DL : 0: The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.-The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.
Date : 2026-01-09 Size : 4kb User : ramya