Description The MUSIC algorithm, proposed by Schmidt, first estimates a basis for the noise subspace and then determines the peaks the associated angles provide the DOA estimates. The MATLAB code for the MUSIC algorithm is sampled by creating an array of steering vectors corresponding to the angles in the vector angles.
標(biāo)簽： Description algorithm estimates proposed
上傳時間： 2013-12-08
上傳用戶：hgy9473
Q: 我應(yīng)該怎樣處理內(nèi)存泄漏？ A: 很簡單，只要寫“不漏”的代碼就完事了啊。顯然，如果你的代碼到處是new、delete、指針運(yùn)算，那你想讓它“不漏”都難。不管你有多么小心謹(jǐn)慎，君為人，非神也，錯誤在所難免。最終你會被自己越來越復(fù)雜的代碼逼瘋的——你將投身于與內(nèi)存泄漏的奮斗之中，對bug們不離不棄，直至山峰沒有棱角，地球不再轉(zhuǎn)動。而能讓你避免這樣困境的技巧也不復(fù)雜：你只要倚重隱含在幕后的分配機(jī)制——構(gòu)造和析構(gòu)，讓C++的強(qiáng)大的類系統(tǒng)來助你一臂之力就OK了。標(biāo)準(zhǔn)庫中的那些容器就是很好的實(shí)例。它們讓你不必化費(fèi)大量的時間精力也能輕松愜意地管理內(nèi)存。我們來看看下面的示例代碼——設(shè)想一下，如果沒有了string和vector，世界將會怎樣？如果不用它們，你能第一次就寫出毫無內(nèi)存錯誤的同樣功能代碼嗎？
標(biāo)簽： 內(nèi)存泄漏
上傳時間： 2017-01-25
上傳用戶：alan-ee
粒子效果演示(附代碼) 利用C++所提供的一些標(biāo)準(zhǔn)容器很容易實(shí)現(xiàn)粒子效果. 簡單的說就是,將粒子數(shù)據(jù)寫在一個類里面,有一個粒子源,不停地生成粒子,然后放入一個stl::list中(push_back()方法), 然后在一個循環(huán)中遍例粒子鏈表,并渲染粒子,粒子的參數(shù)并不斷更新,如果粒子的ALPHA值小于0,即不可見了,即代表粒子已經(jīng)死亡, 即從list中刪去(erase()方法), 銷毀死去的粒子很重要, 如果搞忘了這一步, 你的內(nèi)存很快就會被吃掉干凈了. 第一個版本是用交錯平面畫的粒子. 第二個版本是用Point Spirit(點(diǎn)精靈)畫的粒子, 可以看看效果上面的區(qū)別 SPACE - 暫停粒子源發(fā)射粒子 LINK中忘記去掉cg.lib cgGL.lib 了, 此程序不需要CG, 如果要編譯請去掉.
上傳時間： 2013-12-15
上傳用戶：jing911003
本文檔介紹了如何使用各種內(nèi)嵌工具，函數(shù)和其他一些小技巧來加強(qiáng)使用matlab的速度和效率，是廣大愛好者必讀的文檔。具體內(nèi)容請參閱文檔。 Learn how to use the Profiler tool, vectorized functions, and other tricks to writing efficient MATLAB code. This article includes how to convert any array into a column vector, bounding a value without if statements, and repeating/tiling a vector without repmat. Contents: * The Profiler * Array Preallocation * JIT Acceleration * Vectorization * Inlining Simple Functions * Referencing Operations * Numerical Integration * Signal Processing * Miscellaneous Tricks
上傳時間： 2013-12-11
上傳用戶：cuiyashuo
A "code-what"? Unless you have spent some time working in the area of reverse engineering, chances are you have not heard of the term "codecave" before. If you have heard of it, you might not have read a clear definition of it or quite understand what it is or why it is useful. I have even asked seasoned assembly programmers about the term before and most of them had not heard of it. If it is new to you, do not worry, you are not the only one. It is a term that is scarcely used and is only useful in a reverse engineering context. Furthermore, is it "codecave" or "code cave"? I am not quite sure, but I will try my best to refer to it consistently as a "codecave". A space may sneak in there from time to time
標(biāo)簽： engineering code-what chances reverse
上傳時間： 2014-01-17
上傳用戶：hn891122
The basic principle using the branchand- bound strategy to solve the traveling salesperson optimization problem (TSP) consists of two parts. There is a way to split the solution space. There is a way to predict a lower bound for a class of solutions. There is also a way to find an upper bound of an optimal solution. If the lower bound of a solution exceeds this upper bound, this solution cannot be optimal. Thus, we should terminate the branching associated with this solution.
標(biāo)簽： salesperson principle branchand the
上傳時間： 2017-02-19
上傳用戶：comua
documentation for optimal filtering toolbox for mathematical software package Matlab. The methods in the toolbox include Kalman filter, extended Kalman filter and unscented Kalman filter for discrete time state space models. Also included in the toolbox are the Rauch-Tung-Striebel and Forward-Backward smoother counter-parts for each filter, which can be used to smooth the previous state estimates, after obtaining new measurements. The usage and function of each method are illustrated with five demonstrations problems. 1
標(biāo)簽： documentation mathematical for filtering
上傳時間： 2014-01-20
上傳用戶：changeboy
documentation for optimal filtering toolbox for mathematical software package Matlab. The methods in the toolbox include Kalman filter, extended Kalman filter and unscented Kalman filter for discrete time state space models. Also included in the toolbox are the Rauch-Tung-Striebel and Forward-Backward smoother counter-parts for each filter, which can be used to smooth the previous state estimates, after obtaining new measurements. The usage and function of each method are illustrated with five demonstrations problems. 1
標(biāo)簽： documentation mathematical for filtering
上傳時間： 2013-12-10
上傳用戶：zxc23456789
cordic methods describe essentially the same algorithm that with suitably chosen inputs can be used to calculate a whole range of scientific functions including sin, cos, tan, arctan, arcsin, arccos, sinh, cosh, tanh, arctanh, log, exp, square root and even multiply and divide. the method dates back to volder [1959], and due to its versatility and compactness, it made possible the microcoding of the hp35 pocket scientific calculator in 1972. here is some code to illustrate the techniques. ive split the methods into three parts linear, circular and hyperbolic. in the hp35 microcode these would be unified into one function (for space reasons). because the linear mode can perform multiply and divide, you only need add/subtract and shift to complete the implementation. you can select in the code whether to do the multiples and divides also by cordic means. other multiplies and divides are all powers of 2 (these dont count). to eliminate these too, would involve ieee hackery.
標(biāo)簽： essentially algorithm describe suitably
上傳時間： 2017-03-02
上傳用戶：litianchu
這是一個Quartus的工程文件和verilog代碼，講如何把memory 變成vector
標(biāo)簽： Quartus verilog 工程 代碼
上傳時間： 2017-03-07
上傳用戶：趙云興
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
