本文介紹一種基于PCI Express 總線的高速數(shù)據(jù)采集卡的設(shè)計(jì)方案及功能實(shí)現(xiàn)。給出系統(tǒng)的基本結(jié)構(gòu)及單元組成，重點(diǎn)闡述系統(tǒng)硬件設(shè)計(jì)的關(guān)鍵技術(shù)和本地總線的控制邏輯，詳細(xì)探討了基于DriverWorks 的設(shè)備驅(qū)動(dòng)程序的開發(fā)以及上層應(yīng)用軟件的設(shè)計(jì)。該系統(tǒng)通過實(shí)踐驗(yàn)證，可用于衛(wèi)星下行高速數(shù)據(jù)的接收并可適用于其他高速數(shù)據(jù)采集與處理系統(tǒng)。關(guān)鍵詞：PCI Express 總線 PCIE PEX8311 DMA 板卡驅(qū)動(dòng) 隨著空間科學(xué)和空間電子學(xué)技術(shù)的飛速發(fā)展，空間科學(xué)實(shí)驗(yàn)的種類和數(shù)量以及科學(xué)實(shí)驗(yàn)所產(chǎn)生的數(shù)據(jù)量不斷增加。為了使地面接收處理系統(tǒng)能夠?qū)崟r(shí)處理和顯示科學(xué)圖像數(shù)據(jù)，必須要設(shè)計(jì)出新的地面數(shù)據(jù)接收處理系統(tǒng)，實(shí)現(xiàn)大量高速數(shù)據(jù)的正確接收采集、處理以及存儲(chǔ)。為了滿足地面系統(tǒng)的要求，并為以后的計(jì)算機(jī)系統(tǒng)升級(jí)提供更廣闊的空間，本系統(tǒng)擬采用第三代I/O 互連技術(shù)PCI Express（簡(jiǎn)稱PCI-E）作為本數(shù)據(jù)采集卡的進(jìn)機(jī)總線形式。本文通過對(duì)PCI-E 總線專用接口芯片PLX 公司的PEX8311 性能分析，特別是對(duì)突發(fā)讀、寫和DMA讀操作的時(shí)序研究，設(shè)計(jì)出本地總線的可編程控制邏輯，并詳細(xì)討論了整個(gè)PCI-E 高速數(shù)據(jù)采集卡的硬件設(shè)計(jì)方案，以及WDM 驅(qū)動(dòng)程序和上層應(yīng)用程序的設(shè)計(jì)方法。
標(biāo)簽： Express PCI 總線 卡的設(shè)計(jì)
上傳時(shí)間： 2013-10-28
上傳用戶：tianyi996
The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first character in the decree specifies whether a must come ( B )Before b in the new alphabet or ( A )After b . The second character determines the relative placement of b and c , etc. So, for example, "BAA" means that a must come Before b , b must come After c , and c must come After d . Any letters beyond these requirements are to be excluded, so if the decree specifies k comparisons then the new alphabet will contain the first k+1 lowercase letters of the current alphabet. Create a class Alphabet that contains the method choices that takes the decree as input and returns the number of possible new alphabets that conform to the decree. If more than 1,000,000,000 are possible, return -1. Definition
標(biāo)簽： government streamline important alphabet
上傳時(shí)間： 2015-06-09
上傳用戶：weixiao99
* 高斯列主元素消去法求解矩陣方程AX=B,其中A是N*N的矩陣,B是N*M矩陣 * 輸入: n----方陣A的行數(shù) * a----矩陣A * m----矩陣B的列數(shù) * b----矩陣B * 輸出: det----矩陣A的行列式值 * a----A消元后的上三角矩陣 * b----矩陣方程的解X
上傳時(shí)間： 2015-07-26
上傳用戶：xauthu
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
PCI驅(qū)動(dòng)，包括PCI的實(shí)現(xiàn)過程和實(shí)現(xiàn)細(xì)節(jié)
標(biāo)簽： PCI 驅(qū)動(dòng)
上傳時(shí)間： 2014-01-02
上傳用戶：
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
標(biāo)簽： represented integers group items
上傳時(shí)間： 2016-01-17
上傳用戶：jeffery
PCI Bus Demystified ，PCI總線技術(shù)參數(shù)及編程范例
標(biāo)簽： Demystified PCI Bus
上傳時(shí)間： 2016-02-08
上傳用戶：qoovoop
(1) 、用下述兩條具體規(guī)則和規(guī)則形式實(shí)現(xiàn).設(shè)大寫字母表示魔王語言的詞匯 小寫字母表示人的語言詞匯 希臘字母表示可以用大寫字母或小寫字母代換的變量.魔王語言可含人的詞匯. (2) 、B→tAdA A→sae (3) 、將魔王語言B(ehnxgz)B解釋成人的語言.每個(gè)字母對(duì)應(yīng)下列的語言.
上傳時(shí)間： 2013-12-30
上傳用戶：ayfeixiao
本文介紹了基于PCI總線，利用PCI總線拉制器S592。和DSP芯片TMS32OC31所設(shè)計(jì)的 DYB流洽成卡，并提供了55920、TMS320C31以及該卡的硬件說明.
上傳時(shí)間： 2016-04-07
上傳用戶：270189020
The Lite Evaluation/Demonstration Kit is intended to illustrate use of the AN3042. The AN3042 is compliant to the PCI 2.1 Local Bus specification. Included in the kit is a PCI add-in card, Windows drivers, demonstration applications, and documentation of the hardware and software provided. The microprocessor used on the PCI add-in card is the Motorola MPC860. The applications themselves serve as documentation on how to interface with the drivers, and also may be used to test the AN3042 on the user s prototype board.
標(biāo)簽： 3042 Demonstration Evaluation illustrate
上傳時(shí)間： 2016-04-08
上傳用戶：二驅(qū)蚊器
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
