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.
標簽： filtering Kalman collection functions
上傳時間： 2013-12-23
上傳用戶：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.
標簽： Introduction Engineering Problems previous
上傳時間： 2014-12-02
上傳用戶：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.
標簽： some engineering limitation language
上傳時間： 2013-12-06
上傳用戶：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.
標簽： automatically AutoBoot executes generic
上傳時間： 2014-01-14
上傳用戶：海陸空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: 這是一個基于Douglas-Peucker算法的二維估值算法。
標簽： mathematical engineering simulations problems
上傳時間： 2013-12-20
上傳用戶：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.
標簽： 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
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.
標簽： impulse-radio non-coherent important receivers
上傳時間： 2013-12-24
上傳用戶：kikye
