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
