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.
标签： essentially algorithm describe suitably
上传时间： 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.
标签： different computer acquired sampling
上传时间： 2013-12-28
上传用户：来茴
SQL中的单记录函数 1.ASCII 返回与指定的字符对应的十进制数 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 给出整数,返回对应的字符 SQL> select chr(54740) zhao,chr(65) chr65 from dual ZH C -- -
上传时间： 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.
上传时间： 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.
标签： implementation instruction multiple purpose
上传时间： 2017-04-18
上传用户：731140412
(有源代码)数值分析作业,本文主要包括两个部分,第一部分是常微分方程(ODE)的三个实验题,第二部分是有关的拓展讨论,包括高阶常微分的求解和边值问题的求解(BVP).文中的算法和算例都是基于Matlab计算的.ODE问题从刚性(STIFFNESS)来看分为非刚性的问题和刚性的问题,刚性问题(如大系数的VDP方程)用通常的方法如ODE45来求解,效率会很低,用ODE15S等,则效率会高多了.而通常的非刚性问题,用ODE45来求解会有很好的效果.从阶次来看可以分为高阶微分方程和一阶常微分方程,高阶的微分方程一般可以化为状态空间(STATE SPACE)的低阶微分方程来求解.从微分方程的性态看来,主要是微分方程式一阶导系数大的时候,步长应该选得响应的小些.或者如果问题的性态不是太好估计的话,用较小的步长是比较好的,此外的话Adams多步法在小步长的时候效率比R-K(RUNGE-KUTTA)方法要好些,而精度也高些,但是稳定区间要小些.从初值和边值来看,也是显著的不同的.此外对于非线性常微分方程还有打靶法,胞映射方法等.而对于微分方程稳定性的研究,则诸如相平面图等也是不可缺少的工具.值得提出的是,除了用ode系类函数外,用simulink等等模块图来求解微分方程也是一种非常不错的方法,甚至是更有优势的方法(在应用的角度来说).
上传时间： 2014-01-05
上传用户：caixiaoxu26
oracle中常用函数说明. SQL中的单记录函数 1.ASCII 返回与指定的字符对应的十进制数 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 给出整数,返回对应的字符 SQL> select chr(54740) zhao,chr(65) chr65 from dual ZH C -- - 赵 A 3.CONCAT 连接两个字符串 SQL> select concat( 010- , 88888888 )|| 转23 高乾竞电话 from dual 高乾竞电话 ---------------- 010-88888888转23
上传时间： 2014-11-23
上传用户：zhangyigenius
FLASH+SwiftMP3波形同步播放器模型 功能说明：FLASH+SwiftMP3波形同步的原理其实很简单，SwiftMP3把MP3转换成SWF的时候，把mp3中的音频数据以变量s0、s1、s2、s3、……、s17共18个变量储存，然后我们就可以根据这些变量的值即时设置波谱柱的高度了。注意我只是提供一个模型，解决了主要的技术内核，但这个播放器离实际应用还有一段距离，需要你自己去完善。 使用方法： 1，用SwiftMP3转换音乐后，请在flash_boXing.xml文件中修改你的音乐名字和路径，我设置最多为三条音乐，当然，相信聪明的你有了源文件，一定能自己随便改：）。 2，“SwiftMP3-1.0”文件夹中是用来转换MP3音乐的工具，你必须注册，不然每次只能转换一小段。 特别鸣谢sxl001 ，参考教程：http://space.flash8.net/bbs/thread-307160-1-1.html
上传时间： 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.
标签： Traditionally planning Sensing motion
上传时间： 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.
标签： point-to-point trajectory algorithm proposes
上传时间： 2013-12-21
上传用户：chenxichenyue
