代码搜索：INTERVAL
找到约 8,094 项符合「INTERVAL」的源代码
代码结果 8,094
www.eeworm.com/read/203091/15365518
m ifft_cp_tx_blk.m
function ofdm_symbol = ifft_cp_tx_blk(inp_symbol,num_subc,guard_interval)
%------------------------------------------------------------
% IFFT and Circular Prefix Addition Block for Transmitter
% ----
www.eeworm.com/read/291881/8391185
h wg_timer.h
// wg_timer.h
//
// CTimer class interface
//
//
// Copyright (c) 2002 Rob Wiskow
// rob-dev@boxedchaos.com
//
// This library is free software; you can redistribute it and/or
// modify it under the t
www.eeworm.com/read/191513/8428473
txt convert_st_projects.txt
Version 2.0.0 of SimpleTimer is incompatible with older versions, which
means you will have to adjust your previous projects that use SimpleTimer.
1) The Start and Stop methods have been replace
www.eeworm.com/read/188324/8550584
m fnzeros.m
function z = fnzeros(f,interv)
%FNZEROS zeros of a function (in a given interval)
%
% Z = FNZEROS(F) or FNZEROS(F,[]) returns an ordered list of the zeros
% of the continuous univariate spline
www.eeworm.com/read/187156/8851557
h flsysfun.h
/******************************************************************************/
/* */
/* Copyright (C), 1995-2006, msyste
www.eeworm.com/read/427960/8908529
c williams.c
/*
* Program to factor big numbers using Williams (p+1) method.
* Works when for some prime divisor p of n, p+1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/427960/8908589
c pollard.c
/*
* Program to factor big numbers using Pollards (p-1) method.
* Works when for some prime divisor p of n, p-1 has itself
* only small factors.
* See "Speeding the Pollard and Elliptic Cu
www.eeworm.com/read/427960/8909050
cpp pollard.cpp
/*
* Program to factor big numbers using Pollards (p-1) method.
* Works when for some prime divisor p of n, p-1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/427960/8909717
cpp williams.cpp
/*
* Program to factor big numbers using Williams (p+1) method.
* Works when for some prime divisor p of n, p+1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/427909/8913478
m conf2mahal.m
% CONF2MAHAL - Translates a confidence interval to a Mahalanobis
% distance. Consider a multivariate Gaussian
% distribution of the form
%
% p(x) = 1/sqrt((2 * pi)^d *