代码搜索：Raspberry Pi
找到约 10,000 项符合「Raspberry Pi」的源代码
代码结果 10,000
www.eeworm.com/read/453434/7420751
m fig3_42.m
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Figure 3.42
% Initial 40dB Chebychev pattern with eight nulls equispaced over the sector(0.22,0.36). Sidelobe cancellation=51dB
% Lillian Xiaolan Xu 3/24/99
%
www.eeworm.com/read/453434/7420755
m fig3_32.m
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Figure 3.32
% Desired beam pattern and synthesized patterns
% using the Fourier series method and Woodward
% sampling technique
% (a) N =
www.eeworm.com/read/453433/7420795
m fig4_28.m
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Fig 4.28
% Sampling on 2-dimension T-C, using ifft to get weight
% and get the reconstructed beampattern using fft
% Xiaomin Lu 1
www.eeworm.com/read/453433/7420804
m fig4_27.m
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%
%%%% Fig 4.27
%%%% Pattern sampling on psi space, using ifft to get weight
%%%% and get the reconstructed beampattern using fft
www.eeworm.com/read/452878/7431510
m butterworth.m
function butterworth ( mode , freq , alphap , alphas , fp , fs , fp2)
%用法：butterworth ( mode , freq , alphap , alphas , fp , fs , fp2)
%mode用来选择滤波器模式，1为低通，2为高通，3为带通
%freq:采样频率 alphap:通带衰减 alphas:阻带
www.eeworm.com/read/452877/7431511
m chebyshev.m
function chebyshev ( mode , freq , alphap , alphas , fp , fs , fp2)
%用法：chebyshev ( mode , freq , alphap , alphas , fp , fs , fp2)
%mode用来选择滤波器模式，1为低通，2为高通，3为带通
%freq:采样频率 alphap:通带衰减 alphas:阻带衰减
www.eeworm.com/read/452284/7442663
m hgls2.m
function h = hgls2(L,x,wp)
% HGLS2
% MATLAB m-file for fractional delay approximation
% using the GENERAL LEAST SQUARES method
% Format: h = hgls2(L,x,wp)
% Input: L = filter length (filter order
www.eeworm.com/read/452266/7443632
m gao.m
function G = Gao(X,U,xie,m,n,k)
for i = 1:n
for j=1:k
G(i,j) = exp((-1/2).*(X(i,:)- U(j,:))*pinv(xie(:,:,j))*(X(i,:)-U(j,:)).')*1/((2*pi).^(m/2)*sqrt(det(xie(:,:,j))));
end
end
www.eeworm.com/read/452050/7449033
cpp 2320501_wa.cpp
#include
#include
int n;
char map[101][101];
int f, ans;
struct node
{
int i, j;
}queue[10001];
bool cmp(struct node a,struct node b)
{
if(a.i==b.i)
return a.
www.eeworm.com/read/452050/7449593
cc 2256592_ac_2389ms_8448k.cc
# include
int m, n;
long p, pz[1001][1001];
long a[1000001], b[1000001];
int pi, pj;
long res;
void merge(long begin,long mid,long end)
{
long i, j, k = 0;
for(i = begin, j