代码搜索：N1
找到约 6,450 项符合「N1」的源代码
代码结果 6,450
www.eeworm.com/read/283873/8984076
m impseq.m
function [x,n]=impseq(n0,n1,n2)
n=[n1:n2];
x=[(n-n0)==0];
www.eeworm.com/read/426835/8996507
cpp str2bcd.cpp
#include "stdafx.h"
#include "ComOperate.h"
#include
#include "str2bcd.h"
byte str2BCD ( bank1 byte *indata, byte inlen, bank1 byte *buff, byte blen)
{
// 此函数将字符串指针转换成压缩BC
www.eeworm.com/read/376901/9301569
m chuanxinlvmppm.m
N=2:6;
a=zeros(1,length(N));
for m=2:6
k=2^m;
N1(m-1)=k;
k1=(2^m-2);
b=1;
while (k>1)
b=b*k*(k-1);
k=k-2;
end
b1=1;
while (k1>1)
if k1>0
b1=b1*k1*(k1-1);
k1=k1-2;
end
end
a(m-1)=b
www.eeworm.com/read/363717/9939228
c fft2r21.c
void fft2r21(double A[2][N1],double B[2][N1],int ifft)
{
unsigned long int k,j;
double c[2][N1];
if (ifft!=-1)
{
for(k=0;k
www.eeworm.com/read/363717/9939361
c fft2r21.c
void fft2r21(double A[2][N1],double B[2][N1],int ifft)
{
unsigned long int k,j;
double c[2][N1];
if (ifft!=-1)
{
for(k=0;k
www.eeworm.com/read/167784/9952748
m wav2.m
%wav2.m
%constructs the tree structered wavelet transform of
%the input matrix (down to given level)
function [gout]=wav2(gr1,level)
[N1 N2]=size(gr1);
if (N1>level),
gr2=wav1(gr1);
sb1=gr2(1:N1/2
www.eeworm.com/read/362152/10015628
m acf.m
function [ak, lags] = acf(x, m, w)
%ACF compute autocorrelation function at m lags
%--- via Rader's method based on the FFT.
% ==> works for complex-valued signals
%
% Usage: [ak, lags
www.eeworm.com/read/362152/10015685
m acf.m
function [ak, lags] = acf(x, m, w)
%ACF compute autocorrelation function at m lags
%--- via Rader's method based on the FFT.
% ==> works for complex-valued signals
%
% Usage: [ak, lags
www.eeworm.com/read/356649/10223522
m impseq.m
function[x,n]=impseq(n0,n1,n2)
n=[n1:n2];
x=[(n-n0)==0];
www.eeworm.com/read/356649/10223531
m stepseq.m
function[x,n]=stepseq(n0,n1,n2)
n=[n1:n2];
x=[(n-n0)>=0];