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
上傳時(shí)間： 2017-03-02
上傳用戶：litianchu
In computer vision, sets of data acquired by sampling the same scene or object at different times, or from different perspectives, will be in different coordinate systems. Image registration is the process of transforming the different sets of data into one coordinate system. Registration is necessary in order to be able to compare or integrate the data obtained from different measurements. Image registration is the process of transforming the different sets of data into one coordinate system. To be precise it involves finding transformations that relate spatial information conveyed in one image to that in another or in physical space. Image registration is performed on a series of at least two images, where one of these images is the reference image to which all the others will be registered. The other images are referred to as target images.
標(biāo)簽： different computer acquired sampling
上傳時(shí)間： 2013-12-28
上傳用戶：來茴
SQL中的單記錄函數(shù) 1.ASCII 返回與指定的字符對(duì)應(yīng)的十進(jìn)制數(shù) SQL> select ascii( A ) A,ascii( a ) a,ascii( 0 ) zero,ascii( ) space from dual A A ZERO SPACE --------- --------- --------- --------- 65 97 48 32 2.CHR 給出整數(shù),返回對(duì)應(yīng)的字符 SQL> select chr(54740) zhao,chr(65) chr65 from dual ZH C -- -
標(biāo)簽： ascii SQL select ASCII
上傳時(shí)間： 2017-04-14
上傳用戶：330402686
There are _NO_ standard sample rate for the samples used in modules. But most often the samples are done on the rate called C-3 (which is about 16574 Hz if you have a PAL machine). Sometimes drums are sampled at A-3 (around 28 kHz), and some sounds are at ~8 kHz or anything else to save space.
標(biāo)簽： samples are the standard
上傳時(shí)間： 2017-04-14
上傳用戶：稀世之寶039
The purpose of this project is to explore the issues and implementation of a multiple instruction stream, single data stream processor. We are running two instruction streams on two CPUs which share an address space. The processors share a second level cache, and maintain coherence at the L1 cache with a write-invalidate policy. The L2 cache is two-way set associative, with a block size of 8 words, and a total capacity of 512 words.
標(biāo)簽： implementation instruction multiple purpose
上傳時(shí)間： 2017-04-18
上傳用戶：731140412
(有源代碼)數(shù)值分析作業(yè),本文主要包括兩個(gè)部分,第一部分是常微分方程(ODE)的三個(gè)實(shí)驗(yàn)題,第二部分是有關(guān)的拓展討論,包括高階常微分的求解和邊值問題的求解(BVP).文中的算法和算例都是基于Matlab計(jì)算的.ODE問題從剛性(STIFFNESS)來看分為非剛性的問題和剛性的問題,剛性問題(如大系數(shù)的VDP方程)用通常的方法如ODE45來求解,效率會(huì)很低,用ODE15S等,則效率會(huì)高多了.而通常的非剛性問題,用ODE45來求解會(huì)有很好的效果.從階次來看可以分為高階微分方程和一階常微分方程,高階的微分方程一般可以化為狀態(tài)空間(STATE SPACE)的低階微分方程來求解.從微分方程的性態(tài)看來,主要是微分方程式一階導(dǎo)系數(shù)大的時(shí)候,步長應(yīng)該選得響應(yīng)的小些.或者如果問題的性態(tài)不是太好估計(jì)的話,用較小的步長是比較好的,此外的話Adams多步法在小步長的時(shí)候效率比R-K(RUNGE-KUTTA)方法要好些,而精度也高些,但是穩(wěn)定區(qū)間要小些.從初值和邊值來看,也是顯著的不同的.此外對(duì)于非線性常微分方程還有打靶法,胞映射方法等.而對(duì)于微分方程穩(wěn)定性的研究,則諸如相平面圖等也是不可缺少的工具.值得提出的是,除了用ode系類函數(shù)外,用simulink等等模塊圖來求解微分方程也是一種非常不錯(cuò)的方法,甚至是更有優(yōu)勢(shì)的方法(在應(yīng)用的角度來說).
上傳時(shí)間： 2014-01-05
上傳用戶：caixiaoxu26
oracle中常用函數(shù)說明. SQL中的單記錄函數(shù) 1.ASCII 返回與指定的字符對(duì)應(yīng)的十進(jìn)制數(shù) SQL> select ascii( A ) A,ascii( a ) a,ascii( 0 ) zero,ascii( ) space from dual A A ZERO SPACE --------- --------- --------- --------- 65 97 48 32 2.CHR 給出整數(shù),返回對(duì)應(yīng)的字符 SQL> select chr(54740) zhao,chr(65) chr65 from dual ZH C -- - 趙 A 3.CONCAT 連接兩個(gè)字符串 SQL> select concat( 010- , 88888888 )|| 轉(zhuǎn)23 高乾競電話 from dual 高乾競電話 ---------------- 010-88888888轉(zhuǎn)23
標(biāo)簽： ascii SQL oracle select
上傳時(shí)間： 2014-11-23
上傳用戶：zhangyigenius
FLASH+SwiftMP3波形同步播放器模型 功能說明：FLASH+SwiftMP3波形同步的原理其實(shí)很簡單，SwiftMP3把MP3轉(zhuǎn)換成SWF的時(shí)候，把mp3中的音頻數(shù)據(jù)以變量s0、s1、s2、s3、……、s17共18個(gè)變量儲(chǔ)存，然后我們就可以根據(jù)這些變量的值即時(shí)設(shè)置波譜柱的高度了。注意我只是提供一個(gè)模型，解決了主要的技術(shù)內(nèi)核，但這個(gè)播放器離實(shí)際應(yīng)用還有一段距離，需要你自己去完善。 使用方法： 1，用SwiftMP3轉(zhuǎn)換音樂后，請(qǐng)?jiān)趂lash_boXing.xml文件中修改你的音樂名字和路徑，我設(shè)置最多為三條音樂，當(dāng)然，相信聰明的你有了源文件，一定能自己隨便改：）。 2，“SwiftMP3-1.0”文件夾中是用來轉(zhuǎn)換MP3音樂的工具，你必須注冊(cè)，不然每次只能轉(zhuǎn)換一小段。 特別鳴謝sxl001 ，參考教程：http://space.flash8.net/bbs/thread-307160-1-1.html
標(biāo)簽： SwiftMP FLASH 波形 同步播放
上傳時(shí)間： 2013-12-09
上傳用戶：璇珠官人
Sensing and planning are at the core of robot motion. Traditionally, mobile robots have been used for performing various tasks with a general-purpose processor on-board. This book grew out of our research enquiry into alternate architectures for sensor-based robot motion. It describes our research starting early 2002 with the objectives of obtaining a time, space and energy-efficient solution for processing sensor data for various robotic tasks. New algorithms and architectures have been developed for exploration and other aspects of robot motion. The research has also resulted in design and fabrication of an FPGA-based mobile robot equipped with ultrasonic sensors. Numerous experiments with the FPGA-based mobile robot have also been performed and they confirm the efficacy of the alternate architecture.
標(biāo)簽： Traditionally planning Sensing motion
上傳時(shí)間： 2013-12-20
上傳用戶：古谷仁美
This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3-link robot arm. The objective function for the proposed GA is to minimizing traveling time and space, while not exceeding a maximum pre-defined torque, without collision with any obstacle in the robot workspace.
標(biāo)簽： point-to-point trajectory algorithm proposes
上傳時(shí)間： 2013-12-21
上傳用戶：chenxichenyue
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
