This string-include defines all string functions as inline functions. Use gcc. It also assumes ds=es=data space, this should be normal. Most of the string-functions are rather heavily hand-optimized, see especially strtok,strstr,str[c]spn. They should work, but are not very easy to understand. Everything is done entirely within the register set, making the functions fast and clean.
标签： functions string-include defines assumes
上传时间： 2014-01-09
上传用户：tedo811
Back in 2002, the 6502 disappeared out of all catalogues. Wanted to know, if it s possible to build a binary compatible CPU with the things I had in the drawer: 74LS parts, 27C512 EPROMs and a fast static RAM from an old 80386 motherboard. Now here the results. Note, that the Bus timing is different from the 6502.
标签： disappeared catalogues possible Wanted
上传时间： 2016-04-09
上传用户：hn891122
Nagios is a powerful host and service monitoring program designed to run on most *NIX systems. It is written in C and designed to be fast and flexible. It has the ability to contact administrators via email, pager, or other user-defined methods.
标签： monitoring designed powerful service
上传时间： 2016-04-11
上传用户：lepoke
DFT(Discrete Fourier Transformation)是数字信号分析与处理如图形、语音及图像等领域的重要变换工具，直接计算DFT的计算量与变换区间长度N的平方成正比。当N较大时，因计算量太大，直接用DFT算法进行谱分析和信号的实时处理是不切实际的。快速傅立叶变换(Fast Fourier Transformation，简称FFT)使DFT运算效率提高1～2个数量级。其原因是当N较大时，对DFT进行了基4和基2分解运算。FFT算法除了必需的数据存储器ram和旋转因子rom外，仍需较复杂的运算和控制电路单元，即使现在,实现长点数的FFT仍然是很困难。本文提出的FFT实现算法是基于FPGA之上的，算法完成对一个序列的FFT计算，完全由脉冲触发，外部只输入一脉冲头和输入数据，便可以得到该脉冲头作为起始标志的N点FFT输出结果。由于使用了双ram，该算法是流型(Pipelined)的，可以连续计算N点复数输入FFT，即输入可以是分段N点连续复数数据流。采用DIF(Decimation In Frequency)-FFT和DIT(Decimation In Time)-FFT对于算法本身来说是无关紧要的，因为两种情况下只是存储器的读写地址有所变动而已，不影响算法的结构和流程，也不会对算法复杂度有何影响。
标签： Transformation Discrete Fourier DFT
上传时间： 2016-04-12
上传用户：lx9076
时间序列分析G-P method to calculate the correlation dimension of Matlab (Mex version) not use "temporary separation," use of the correlation integral Mex documents fast
标签： correlation calculate dimension temporary
上传时间： 2016-04-25
上传用户：Late_Li
Different methods for generating pyramid data structure have been analysed, these effects in image matching are compared, also a fast
标签： generating Different structure analysed
上传时间： 2016-04-26
上传用户：LIKE
HTML Parser is a Java library used to parse HTML in either a linear or nested fashion. Primarily used for transformation or extraction, it features filters, visitors, custom tags and easy to use JavaBeans. It is a fast, robust and well tested package.
标签： HTML Primarily fashion library
上传时间： 2016-05-03
上传用户：coeus
FreeTTS is a speech synthesis system written entirely in the Java programming language. It is based upon Flite, a small, fast, run-time speech synthesis engine, which in turn is based upon University of Edinburgh s Festival Speech Synthesis System and Carnegie Mellon University s FestVox project.
标签： programming synthesis entirely language
上传时间： 2014-08-29
上传用户：cylnpy
miXo is a buzz machine (www.buzzmachines.com) - a plugin for the freely available jeskola buzz tracker. it allows using the pc keyboard as a mixer which comes in handy when doing live performances with buzz.
标签： buzz buzzmachines available machine
上传时间： 2016-05-10
上传用户：牧羊人8920
c的快速傅立叶变换程序包，the file FFT.ZIP contains C source code for performing Discrete Fast Fourier Transforms (DFFTs) and inverse DFFTs.
上传时间： 2014-01-07
上传用户：Altman
