代码搜索：DLT 614
找到约 1,473 项符合「DLT 614」的源代码
代码结果 1,473
www.eeworm.com/read/181456/9254739
m ltable.m
function [dlt,slt] = ltable(md,s,varargin)
%LTABLE Space-time code look-up table generator.
% [DLT,SLT] = LTABLE(MD,S) creates MD, S-states space-time code data
% and state look-up tables. MD cor
www.eeworm.com/read/163426/10162343
m ltable.m
function [dlt,slt,md]=ltable(option,sim_options)
switch option
case '4_State_4PSK'
md=4;
s=4;
case '8_State_4PSK'
md=4;
s=8;
case '16_State_4PSK
www.eeworm.com/read/355209/10285370
m ltable.m
function [dlt,slt,md]=ltable(option,sim_options)
switch option
case '4_State_4PSK'
md=4;
s=4;
case '8_State_4PSK'
md=4;
s=8;
case '16_State_4PSK
www.eeworm.com/read/422731/10615407
htm 13.20 年份加减函数.htm
var d=new Date() //获取当天日期
document.write(""); //输出一个下拉框
var int;
int=new Array() //创建数
www.eeworm.com/read/159592/10637782
c funct.c
#include "stdio.h"
#include "stdlib.h"
#include "math.h"
const int kkg=2;
const int qkg=1;
double r0;
double f(double x[])
{double ff;
ff=pow((x[0]-4),2)+pow((x[0]-5),2);
return(ff);
}
vo
www.eeworm.com/read/349004/10856251
c funct.c
#include "stdio.h"
#include "stdlib.h"
#include "math.h"
const int kkg=2;
const int qkg=1;
double r0;
double f(double x[])
{double ff;
ff=pow((x[0]-4),2)+pow((x[0]-5),2);
return(ff);
}
vo
www.eeworm.com/read/272715/10946742
m ltable.m
function [dlt,slt,md]=ltable(option,sim_options)
switch option
case '4_State_4PSK'
md=4;
s=4;
case '8_State_4PSK'
md=4;
s=8;
case '16_State_4PSK
www.eeworm.com/read/418162/10962826
htm 13.20 年份加减函数.htm
var d=new Date() //获取当天日期
document.write(""); //输出一个下拉框
var int;
int=new Array() //创建数
www.eeworm.com/read/146545/6956194
m ltable.m
function [dlt,slt] = ltable(md,s,varargin)
%LTABLE Space-time code look-up table generator.
% [DLT,SLT] = LTABLE(MD,S) creates MD, S-states space-time code data
% and state look-up tables. MD cor
www.eeworm.com/read/464179/7167952
h shell.h
#include
//-------------------------------固定增量排序函数--------------------------------------//
void shellinsert(node *d,int num,int inc,int &jc,int &bc)
{//以给定增量inc作一趟希尔排序
int i,j;
for(i=