This a collection of MATLAB functions for extended Kalman filtering, unscented Kalman filtering, particle filtering, and miscellaneous other things. These utilities are designed for reuse and I have found them very useful in many projects. The code has been vectorised for speed and is stable and fast.
標(biāo)簽： filtering Kalman collection functions
上傳時(shí)間： 2013-12-23
上傳用戶(hù)：ljmwh2000
Solving Engineering Problems Using MATLAB C++ Math Library Introduction In the previous article, we studied how can use MATLAB C API to solve engineering problems. In this article I will show you how can use MATLAB C++ math library. The MATLAB® C++ Math Library serves two separate constituencies: MATLAB programmers seeking more speed or complete independence from interpreted MATLAB, and C++ programmers who need a fast, easy-to-use matrix math library. To each, it offers distinct advantages.
標(biāo)簽： Introduction Engineering Problems previous
上傳時(shí)間： 2014-12-02
上傳用戶(hù)：13160677563
As all of you know, MATLAB is a powerful engineering language. Because of some limitation, some tasks take very long time to proceed. Also MATLAB is an interpreter not a compiler. For this reason, executing a MATLAB program (m file) is time consuming. For solving this problem, Mathworks provides us C Math Library or in common language, MATLAB API. A developer can employ these APIs to solve engineering problems very fast and easy. This article is about how can use these APIs.
標(biāo)簽： some engineering limitation language
上傳時(shí)間： 2013-12-06
上傳用戶(hù)：huql11633
AutoBoot is a generic boot loader that automatically locates, loads, and executes object files from multiple types of media. AutoBoot provides a simple, fast, and functional means of loading an OS image while maintaining a small Flash memory footprint. This binary release contains a stand-alone version of AutoBoot for the DbAu1200 development board, designed to replace the YAMON boot loader.
標(biāo)簽： automatically AutoBoot executes generic
上傳時(shí)間： 2014-01-14
上傳用戶(hù)：海陸空653
When working with mathematical simulations or engineering problems, it is not unusual to handle curves that contains thousands of points. Usually, displaying all the points is not useful, a number of them will be rendered on the same pixel since the screen precision is finite. Hence, you use a lot of resource for nothing! This article presents a fast 2D-line approximation algorithm based on the Douglas-Peucker algorithm (see [1]), well-known in the cartography community. It computes a hull, scaled by a tolerance factor, around the curve by choosing a minimum of key points. This algorithm has several advantages: 這是一個(gè)基于Douglas-Peucker算法的二維估值算法。
標(biāo)簽： mathematical engineering simulations problems
上傳時(shí)間： 2013-12-20
上傳用戶(hù)：changeboy
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.
標(biāo)簽： functions string-include defines assumes
上傳時(shí)間： 2014-01-09
上傳用戶(hù)：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.
標(biāo)簽： disappeared catalogues possible Wanted
上傳時(shí)間： 2016-04-09
上傳用戶(hù)：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.
標(biāo)簽： monitoring designed powerful service
上傳時(shí)間： 2016-04-11
上傳用戶(hù)：lepoke
DFT(Discrete Fourier Transformation)是數(shù)字信號(hào)分析與處理如圖形、語(yǔ)音及圖像等領(lǐng)域的重要變換工具，直接計(jì)算DFT的計(jì)算量與變換區(qū)間長(zhǎng)度N的平方成正比。當(dāng)N較大時(shí)，因計(jì)算量太大，直接用DFT算法進(jìn)行譜分析和信號(hào)的實(shí)時(shí)處理是不切實(shí)際的。快速傅立葉變換(Fast Fourier Transformation，簡(jiǎn)稱(chēng)FFT)使DFT運(yùn)算效率提高1～2個(gè)數(shù)量級(jí)。其原因是當(dāng)N較大時(shí)，對(duì)DFT進(jìn)行了基4和基2分解運(yùn)算。FFT算法除了必需的數(shù)據(jù)存儲(chǔ)器ram和旋轉(zhuǎn)因子rom外，仍需較復(fù)雜的運(yùn)算和控制電路單元，即使現(xiàn)在,實(shí)現(xiàn)長(zhǎng)點(diǎn)數(shù)的FFT仍然是很困難。本文提出的FFT實(shí)現(xiàn)算法是基于FPGA之上的，算法完成對(duì)一個(gè)序列的FFT計(jì)算，完全由脈沖觸發(fā)，外部只輸入一脈沖頭和輸入數(shù)據(jù)，便可以得到該脈沖頭作為起始標(biāo)志的N點(diǎn)FFT輸出結(jié)果。由于使用了雙ram，該算法是流型(Pipelined)的，可以連續(xù)計(jì)算N點(diǎn)復(fù)數(shù)輸入FFT，即輸入可以是分段N點(diǎn)連續(xù)復(fù)數(shù)數(shù)據(jù)流。采用DIF(Decimation In Frequency)-FFT和DIT(Decimation In Time)-FFT對(duì)于算法本身來(lái)說(shuō)是無(wú)關(guān)緊要的，因?yàn)閮煞N情況下只是存儲(chǔ)器的讀寫(xiě)地址有所變動(dòng)而已，不影響算法的結(jié)構(gòu)和流程，也不會(huì)對(duì)算法復(fù)雜度有何影響。
標(biāo)簽： Transformation Discrete Fourier DFT
上傳時(shí)間： 2016-04-12
上傳用戶(hù)：lx9076
Squaring circuits are an important building block for impulse-radio UWB non-coherent receivers. This work proposes a squarer, based on the quadratic law of saturated transistors. Such a circuit has already been proposed for lower frequency applications, therefore this work focuses on the extension to ultra wide bandwidth, with particular care to the consequences related to the deviation from the ideal quadratic law of 0.18μm CMOS transistors.
標(biāo)簽： impulse-radio non-coherent important receivers
上傳時(shí)間： 2013-12-24
上傳用戶(hù)：kikye
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
