关于FPGA流水线设计的论文 This work investigates the use of very deep pipelines for implementing circuits in FPGAs, where each pipeline stage is limited to a single FPGA logic element (LE). The architecture and VHDL design of a parameterized INTEGER array multiplier is presented and also an IEEE 754 compliant 32-bit floating-point multiplier. We show how to write VHDL cells that implement such approach, and how the array multiplier architecture was adapted. Synthesis and simulation were performed for Altera Apex20KE devices, although the VHDL code should be portable to other devices. For this family, a 16 bit INTEGER multiplier achieves a frequency of 266MHz, while the floating point unit reaches 235MHz, performing 235 MFLOPS in an FPGA. Additional cells are inserted to synchronize data, what imposes significant area penalties. This and other considerations to apply the technique in real designs are also addressed.
标签： investigates implementing pipelines circuits
上传时间： 2015-07-26
上传用户：CHINA526
Individual files are available in the following links: Bessjy -- Bessel functions Jn and Yn for real argument and INTEGER or real order. Bessik -- Modified Bessel function In and Kn for real argument and INTEGER or real order. CBessjy -- Bessel functions Jv and Yv for real or complex arguments and real order. CBessik -- Modified Bessel functions Iv and Kv for complex arguments and real order.
标签： Individual available following functions
上传时间： 2013-12-13
上传用户：hewenzhi
/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */
标签： APPROXIMATE ALGORITHM THE SOLUTION
上传时间： 2015-08-20
上传用户：zhangliming420
ACM试题An Easy Problem Description As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive INTEGERs and its binary form. Given a positive INTEGER I, you task is to find out an INTEGER J, which is the minimum INTEGER greater than I, and the number of 1 s in whose binary form is the same as that in the binary form of I. For example, if "78" is given, we can write out its binary form, "1001110". This binary form has 4 1 s. The minimum INTEGER, which is greater than "1001110" and also contains 4 1 s, is "1010011", i.e. "83", so you should output "83".
标签： Description computers Problem binary
上传时间： 2013-12-11
上传用户：libenshu01
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an INTEGER m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an INTEGER h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签： Implemented following compile command
上传时间： 2013-12-31
上传用户：lhc9102
Visual Basic 6.0可以通过调用API函数格式化一个磁盘，无论是软盘还是硬盘。 打开一个新的项目(工程1) ，如果你没有更改过缺省模式，那么Visual Basic 6.0会自动添加一个form1文件，在form1上添加一个命令控件，将下面的代码拷入。 Option Explicit Private Declare Function SHFormatDrive Lib"shell32"( ByVal Hend AS Long,ByVal Drive AS Long,ByVal FormatID AS Long,ByVal Options AS Long) as Long Private Sub FormatDisk(intDrive as INTEGER,blnQuickFormat as Boolean) dim lngReturn As Long if (blnQuickFormat) then lngReturn= SHFormatDrive(0,intDrive,0&,1&) else lngReturn= SHFormatDrive(0,intDrive,0&,0&) end if end Sub Private Sub Command1_Click() call FormatDisk(0,True) End Sub 运行此程序。 注意FormatDisk函数的第一个变量很重要，他的值是0,1,2时代表格式化的分别是：A、B、C盘。
上传时间： 2015-10-05
上传用户：kytqcool
This unit uses an array of bytes to represent a LARGE number. The number is binairy-stored in the array, with the Least Significant Byte (LSB) first and the Most Significant Byte (MSB) last, like all Intel-INTEGER types.
标签： number binairy-stored represent LARGE
上传时间： 2015-10-08
上传用户：xieguodong1234
HDOJ ACM input:The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an INTEGER N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive INTEGERs s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.
上传时间： 2015-10-18
上传用户：三人用菜
编译原理词法和语法分析，体内容是产生一个二元式文本文件，扩展名为dyd，可将Pascal程序(测试程序)分解成为一个一个的单词，并查“单词符号与种别对照表”得出其种别，用一数字表示，范围1-56（52-56分别对应保留字INTEGER、real、boolean、char）。
上传时间： 2013-12-10
上传用户：003030
4、 编写一个过程。要求：有一个输入参数和一个输出参数，过程里面要有自定义异常。从学生表中（tab_student）中寻找符合指定学号等于输入参数的值，然后将找到的学生的姓名赋予输出参数，如果没有符合条件的值则触发异常。 Create table tab_student (sno char(8), sname varchar2(20), age INTEGER, province varchar2(60), sex char(4)) insert into tab_student values(‘001’,’zhou’,20,’江苏徐州’,’男’) 上述表已经创建，只需针对此表编写即可。
上传时间： 2015-11-13
上传用户：362279997
