-
關于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
上傳時間：
2014-01-01
上傳用戶：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盤。
標簽：
Visual
Basic
6.0
API
上傳時間：
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.
標簽：
input
cases
test
The
上傳時間：
2015-10-18
上傳用戶：三人用菜
-
編譯原理詞法和語法分析，體內容是產生一個二元式文本文件，擴展名為dyd，可將Pascal程序(測試程序)分解成為一個一個的單詞，并查“單詞符號與種別對照表”得出其種別，用一數字表示，范圍1-56（52-56分別對應保留字Integer、real、boolean、char）。
標簽：
編譯原理
分
上傳時間：
2013-12-11
上傳用戶：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
