Verilog HDL: Magnitude For a vector (a,b), the magnitude representation is the following: A common approach to implementing these arithmetic functions is to use the Coordinate Rotation Digital Computer (CORDIC) algorithm. The CORDIC algorithm calculates the trigonometric functions of sine, cosine, magnitude, and phase using an iterative process. It is made up of a series of micro-rotations of the vector by a set of predetermined constants, which are powers of two. Using binary arithmetic, this algorithm essentially replaces multipliers with shift and add operations. In a Stratix™ device, it is possible to calculate some of these arithmetic functions directly, without having to implement the CORDIC algorithm.
標(biāo)簽： representation Magnitude the magnitude
上傳時(shí)間： 2013-12-24
上傳用戶：金宜
design LP,HP,B S digital Butterworth and Chebyshev filter. All array has been specified internally,so user only need to input f1,f2,f3,f4,fs(in hz), alpha1,alpha2(in db) and iband (to specify the type of to design). This program output hk(z)=bk(z)/ak(z),k=1,2,..., ksection and the freq.
標(biāo)簽： Butterworth internally Chebyshev specified
上傳時(shí)間： 2015-11-08
上傳用戶：253189838
About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses memory mapped I/O (if available), supports cursors, and can create in-memory databases. Release focus: Major feature enhancements Changes: This release comes with many changes and new features. It can manage multiple databases in one file. A new flag (HAM_LOCK_EXCLUSIVE) places an exclusive lock on the file. hamsterdb was ported to Windows CE, and the Solution file for Visual Studio 2005 now supports builds for x64. Several minor bugs were fixed, performance was improved, and small API changes occurred. Pre-built libraries for Windows (32-bit and 64-bit) are available for download. Author: cruppstahl
標(biāo)簽： C. hamsterdb structure database
上傳時(shí)間： 2013-12-11
上傳用戶：LouieWu
windows開源代碼 Microsoft Windows is a complex operating system. It offers so many features and does so much that it s impossible for any one person to fully understand the entire system. This complexity also makes it difficult for someone to decide where to start concentrating the learning effort. Well, I always like to start at the lowest level by gaining a solid
標(biāo)簽： Microsoft operating features windows
上傳時(shí)間： 2015-11-24
上傳用戶：zhuyibin
Floyd-Warshall算法描述 1)適用范圍： a)APSP(All Pairs Shortest Paths) b)稠密圖效果最佳 c)邊權(quán)可正可負(fù) 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法結(jié)束：dis即為所有點(diǎn)對(duì)的最短路徑矩陣 3)算法小結(jié)：此算法簡(jiǎn)單有效，由于三重循環(huán)結(jié)構(gòu)緊湊，對(duì)于稠密圖，效率要高于執(zhí)行|V|次Dijkstra算法。時(shí)間復(fù)雜度O(n^3)。 考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個(gè)判斷I,j是否有通路的矩陣。更簡(jiǎn)單的，我們可以把dis設(shè)成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來(lái)代替算法描述中的藍(lán)色部分，可以更直觀地得到I,j的連通情況。
標(biāo)簽： Floyd-Warshall Shortest Pairs Paths
上傳時(shí)間： 2013-12-01
上傳用戶：dyctj
As science advances, novel experiments are becoming more and more complex, requiring a zoo of control devices and electronics executing complicated sequences of steps. Device availability and monetary constrains usually lead to a highly heterogeneous setup with components from several different manufacturers using many different protocols and interfacing mechanisms. This often results in control software being puzzled together to use and provide a multitude of interfacing and control functionality, each using their own calling conventions, data structures, etc. To make matters worse, usually a group of relatively independent programmers is trying to write and maintain the code base. Often this causes extensive duplication of effort as program segments are hard to reuse, since unpredictable changes to the segments by the original authors might compromise other code using these segments.
標(biāo)簽： more experiments requiring advances
上傳時(shí)間： 2013-12-24
上傳用戶：qilin
basic.c */ /**//* Project:NeuroBasic, basic package*//**/ /* Survey:This is a simple Basic b-code compiler which*/ /*can be used as a comfortable command shell for */ /* any program. The actual compiler is found in */ /*compiler.c.*/ /*The functions m_fctptr() and user_server()*/ /*build an interface to an
標(biāo)簽： basic NeuroBasic Project package
上傳時(shí)間： 2017-02-15
上傳用戶：xymbian
該程序用以查找任意兩個(gè)整數(shù)之間的所有素?cái)?shù)。 Prime number finder can find all primes between a and b and will write the results to the file PRIMES.TXT
標(biāo)簽： and between number finder
上傳時(shí)間： 2014-01-14
上傳用戶：cccole0605
Video-DVM is a very cheap DVM that shows how an output as complex as a videocomposite signal can be generated entirely in software: two I/O pins and three resistors are all the hardware required. Connected to any TV set it displays voltages, included max and min peaks, using both giant digits and an analog bar-display . A serial data output for computer data logging is provided, too.
標(biāo)簽： videocomposite Video-DVM complex output
上傳時(shí)間： 2014-12-09
上傳用戶：xuan‘nian
Despite its highly adaptable and flexible nature, C++ is also one of the more complex programming languages to learn. Once mastered, however, it can help you organize and process information with amazing efficiency and quickness.
標(biāo)簽： programming adaptable flexible Despite
上傳時(shí)間： 2013-12-31
上傳用戶：zhyiroy
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
