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.
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.
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.
DFT(Discrete Fourier Transformation)是數(shù)字信號分析與處理如圖形、語音及圖像等領(lǐng)域的重要變換工具,直接計算DFT的計算量與變換區(qū)間長度N的平方成正比。當(dāng)N較大時,因計算量太大,直接用DFT算法進(jìn)行譜分析和信號的實時處理是不切實際的。快速傅立葉變換(Fast Fourier Transformation,簡稱FFT)使DFT運算效率提高1~2個數(shù)量級。其原因是當(dāng)N較大時,對DFT進(jìn)行了基4和基2分解運算。FFT算法除了必需的數(shù)據(jù)存儲器ram和旋轉(zhuǎn)因子rom外,仍需較復(fù)雜的運算和控制電路單元,即使現(xiàn)在,實現(xiàn)長點數(shù)的FFT仍然是很困難。本文提出的FFT實現(xiàn)算法是基于FPGA之上的,算法完成對一個序列的FFT計算,完全由脈沖觸發(fā),外部只輸入一脈沖頭和輸入數(shù)據(jù),便可以得到該脈沖頭作為起始標(biāo)志的N點FFT輸出結(jié)果。由于使用了雙ram,該算法是流型(Pipelined)的,可以連續(xù)計算N點復(fù)數(shù)輸入FFT,即輸入可以是分段N點連續(xù)復(fù)數(shù)數(shù)據(jù)流。采用DIF(Decimation In Frequency)-FFT和DIT(Decimation In Time)-FFT對于算法本身來說是無關(guān)緊要的,因為兩種情況下只是存儲器的讀寫地址有所變動而已,不影響算法的結(jié)構(gòu)和流程,也不會對算法復(fù)雜度有何影響。
時間序列分析G-P method to calculate the correlation dimension of Matlab (Mex version) not use "temporary separation," use of the correlation integral Mex documents fast
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.
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.
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.