-
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.
標簽：
representation
Magnitude
the
magnitude
上傳時間：
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.
標簽：
Butterworth
internally
Chebyshev
specified
上傳時間：
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
標簽：
C.
hamsterdb
structure
database
上傳時間：
2013-12-11
上傳用戶：LouieWu
-
The Original USB 2.0 specification released on April 27, 2000
Errata to the USB 2.0 specification as of December 7, 2000
Mini-B connector Engineering Change Notice to the USB 2.0 specification.
Pull-up/pull-down Resistors Engineering Change Notice to the USB 2.0 specification.
Errata to the USB 2.0 specification as of May 28, 2002
Interface Association Descriptor Engineering Change Notice to the USB 2.0 specification.
Rounded Chamfer Engineering Change Notice to the USB 2.0 specification as of October 8, 2003
Unicode Engineering Change Notice to the USB 2.0 specification as of February 21, 2005
Inter-Chip USB Supplement Revision 1.0 as of March 13, 2006
Revision 1.3 of the USB On-The-Go Supplement as of December 5, 2006
Revision 1.01 of the Micro-USB Cables and Connectors Specification as of April 4, 2007
USB 2.0 Link Power Management Addendum Engineering Change Notice to the USB 2.0 specification as of July 16, 2007.
標簽：
specification
2.0
USB
Original
上傳時間：
2013-12-31
上傳用戶：familiarsmile
-
16 relay output channels and 16 isolated digital input channels
LED indicators to show activated relays
Jumper selectable Form A/Form B-type relay output channel
Output status read-back
Keep relay output values when hot system reset
High-voltage isolation on input channels(2,500 VDC)
Hi ESD protection(2,00VDC)
High over-voltage protection(70VDC)
Wide input range(10~50VDC)
Interrupt handling capability
High-density DB-62 connector
Board ID
標簽：
channels
indicators
activated
isolated
上傳時間：
2016-02-15
上傳用戶：dongbaobao
-
Floyd-Warshall算法描述
1)適用范圍：
a)APSP(All Pairs Shortest Paths)
b)稠密圖效果最佳
c)邊權可正可負
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)算法結束：dis即為所有點對的最短路徑矩陣
3)算法小結：此算法簡單有效，由于三重循環結構緊湊，對于稠密圖，效率要高于執行|V|次Dijkstra算法。時間復雜度O(n^3)。
考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個判斷I,j是否有通路的矩陣。更簡單的，我們可以把dis設成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來代替算法描述中的藍色部分，可以更直觀地得到I,j的連通情況。
標簽：
Floyd-Warshall
Shortest
Pairs
Paths
上傳時間：
2013-12-01
上傳用戶：dyctj
-
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
標簽：
basic
NeuroBasic
Project
package
上傳時間：
2017-02-15
上傳用戶：xymbian
-
Instead of finding the longest common
subsequence, let us try to determine the
length of the LCS.
Then tracking back to find the LCS.
Consider a1a2…am and b1b2…bn.
Case 1: am=bn. The LCS must contain am,
we have to find the LCS of a1a2…am-1 and
b1b2…bn-1.
Case 2: am≠bn. Wehave to find the LCS of
a1a2…am-1 and b1b2…bn, and a1a2…am and
b b b
b1b2…bn-1
Let A = a1 a2 … am and B = b1 b2 … bn
Let Li j denote the length of the longest i,g g
common subsequence of a1 a2 … ai and b1 b2
… bj.
Li,j = Li-1,j-1 + 1 if ai=bj
max{ L L } a≠b i-1,j, i,j-1 if ai≠j
L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.
標簽：
the
subsequence
determine
Instead
上傳時間：
2013-12-17
上傳用戶：evil
-
該程序用以查找任意兩個整數之間的所有素數。 Prime number finder can find all primes between a and b and will write the results to the file PRIMES.TXT
標簽：
and
between
number
finder
上傳時間：
2014-01-14
上傳用戶：cccole0605
-
Computing and the way people use C for doing it keeps changing as years go by. So overwhelming has been the response to all the previous editions of “Let Us C” that I have now decided that each year I would come up with a new edition of it so that I can keep the readers abreast with the way C is being used at that point in time.
標簽：
overwhelming
Computing
changing
people
上傳時間：
2013-12-23
上傳用戶：epson850
