-
關(guān)于FPGA流水線設(shè)計(jì)的論文
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.
標(biāo)簽：
investigates
implementing
pipelines
circuits
上傳時(shí)間：
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.
標(biāo)簽：
Individual
available
following
functions
上傳時(shí)間：
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.
*/
標(biāo)簽：
APPROXIMATE
ALGORITHM
THE
SOLUTION
上傳時(shí)間：
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".
標(biāo)簽：
Description
computers
Problem
binary
上傳時(shí)間：
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.
標(biāo)簽：
Implemented
following
compile
command
上傳時(shí)間：
2014-01-01
上傳用戶：lhc9102
-
Visual Basic 6.0可以通過調(diào)用API函數(shù)格式化一個(gè)磁盤，無論是軟盤還是硬盤。
打開一個(gè)新的項(xiàng)目(工程1) ，如果你沒有更改過缺省模式，那么Visual Basic 6.0會(huì)自動(dòng)添加一個(gè)form1文件，在form1上添加一個(gè)命令控件，將下面的代碼拷入。
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
運(yùn)行此程序。
注意FormatDisk函數(shù)的第一個(gè)變量很重要，他的值是0,1,2時(shí)代表格式化的分別是：A、B、C盤。
標(biāo)簽：
Visual
Basic
6.0
API
上傳時(shí)間：
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.
標(biāo)簽：
number
binairy-stored
represent
LARGE
上傳時(shí)間：
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.
標(biāo)簽：
input
cases
test
The
上傳時(shí)間：
2015-10-18
上傳用戶：三人用菜
-
編譯原理詞法和語法分析，體內(nèi)容是產(chǎn)生一個(gè)二元式文本文件，擴(kuò)展名為dyd，可將Pascal程序(測(cè)試程序)分解成為一個(gè)一個(gè)的單詞，并查“單詞符號(hào)與種別對(duì)照表”得出其種別，用一數(shù)字表示，范圍1-56（52-56分別對(duì)應(yīng)保留字INTEGER、real、boolean、char）。
標(biāo)簽：
編譯原理
分
上傳時(shí)間：
2013-12-11
上傳用戶：003030
-
4、 編寫一個(gè)過程。要求：有一個(gè)輸入?yún)?shù)和一個(gè)輸出參數(shù)，過程里面要有自定義異常。從學(xué)生表中（tab_student）中尋找符合指定學(xué)號(hào)等于輸入?yún)?shù)的值，然后將找到的學(xué)生的姓名賦予輸出參數(shù)，如果沒有符合條件的值則觸發(fā)異常。
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,’江蘇徐州’,’男’)
上述表已經(jīng)創(chuàng)建，只需針對(duì)此表編寫即可。
標(biāo)簽：
編寫
參數(shù)
過程
輸入
上傳時(shí)間：
2015-11-13
上傳用戶：362279997
