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
上傳用戶：金宜
問題描述
序列Z=<B，C，D，B>是序列X=<A，B，C，B，D，A，B>的子序列，相應(yīng)的遞增下標(biāo)序列為<2，3，5，7>。
一般地，給定一個(gè)序列X=<x1,x2,…,xm>，則另一個(gè)序列Z=<z1,z2,…,zk>是X的子序列，是指存在一個(gè)嚴(yán)格遞增的下標(biāo)序列〈i1,i2,…,ik〉使得對于所有j=1,2,…,k使Z中第j個(gè)元素zj與X中第ij個(gè)元素相同。
給定2個(gè)序列X和Y，當(dāng)另一序列Z既是X的子序列又是Y的子序列時(shí)，稱Z是序列X和Y的公共子序列。
你的任務(wù)是：給定2個(gè)序列X、Y，求X和Y的最長公共子序列Z。
標(biāo)簽：
lt
序列
上傳時(shí)間：
2014-01-25
上傳用戶：netwolf
