代码搜索:complex

找到约 10,000 项符合「complex」的源代码

代码结果 10,000
www.eeworm.com/read/473219/6849172

m sdpvar.m

function sys = sdpvar(varargin) %SDPVAR Create symbolic decision variable % % You can create a sdpvar variable by: % X = SDPVAR(n) Symmetric nxn matrix % X = SDPVAR(n,n)
www.eeworm.com/read/473253/6849845

m cir_calculation.m

function [CIR] = CIR_calculation(complex_dist,logn4,logn4a,logn4b,logn4c,logn4d,logn4e,logn4f,mode) %mode 1 for distance dependence pathloss model if (mode==1) [CIR]=interference(
www.eeworm.com/read/295122/8186254

h signal.h

/* * Dsignal.h - Dsignal definitions(T and F area) * * Copyright (C) lartely * */ #include "complex.h" #include #include #include
www.eeworm.com/read/295122/8186265

h fft.h

/* * fft.h - fast fourier transformation definitions(base DIT) * * Copyright (C) lartely * */ #include "complex.h" #include #include #include "df
www.eeworm.com/read/295122/8186269

h dft.h

/* * dft.h - discrete fourier transformation definitions * * Copyright (C) lartely * */ #include "complex.h" #include #include #ifndef _DFT_DOT_
www.eeworm.com/read/295122/8186275

cpp dft.cpp

#include "stdafx.h" #include "dft.h" void CDFT::DFT_MAIN (complex *f, complex *F,int N ){ int n,k; complex wn; wn=exp(-complex(0.0,1.0)*2.0*M_PI/(double)N); for (k=0; k
www.eeworm.com/read/393873/8256412

m plotc.m

%PLOTC plots a complex signal in 2D projection with variable projection angle. %The angle can be modified at any time using the slider: % slider at bottom: angle=0 the projection is the real part of
www.eeworm.com/read/393873/8256546

c cio.c

/* * G. Rilling, last modification: 3.2007 * gabriel.rilling@ens-lyon.fr * * code based on a student project by T. Boustane and G. Quellec, 11.03.2004 * supervised by P. Chainais (ISIMA - LIMOS - Univ
www.eeworm.com/read/292658/8342655

cpp le_totalchoicegauss.cpp

//LE_TotalChoiceGauss.cpp 全选主元高斯消去法 #include //输入输出流头文件 #include "LinearEquation.h" //线性方程(组)求解头文件 void main() { int i; double a[4][4] = //实系数矩阵 { {0.2368, 0.2471,
www.eeworm.com/read/292658/8342669

cpp le_totalchoicegaussjordan.cpp

//LE_TotalChoiceGaussJordan.cpp 全选主元高斯-约当消去法 #include //输入输出流头文件 #include "LinearEquation.h" //线性方程(组)求解头文件 void main() { int i; double a[4][4] = //实系数矩阵 { {1.0,