vxworks源代碼，比較老的一個(gè)版本，里邊包含TARGET、source、include
上傳時(shí)間： 2013-12-27
上傳用戶：電子世界
2007年全國(guó)大學(xué)生電子設(shè)計(jì)大賽，A題音頻信號(hào)分析儀的全部源程序。 單片機(jī)為c8051f120，系統(tǒng)時(shí)鐘倍頻至96MHZ。 main.c是一個(gè)包含五級(jí)菜單的主函數(shù)。 FFT.C是進(jìn)行fft變換，將時(shí)域信號(hào)變換成頻域信號(hào)。 flash.c是讀寫(xiě)片外flash存儲(chǔ)器的程序,可以將分析結(jié)果保存,以備調(diào)用. z7290.c是周立功7290鍵盤(pán)芯片的驅(qū)動(dòng)程序. FFT_xgjis.c是對(duì)變換后的頻譜進(jìn)行分析和運(yùn)算. FFT_CodeTable.c是一個(gè)正弦表,在FFT的時(shí)候調(diào)用. LCD320240.c是320*240的液晶驅(qū)動(dòng)程序,液晶的控制器是SED1335. 所有的.h文件提供了子函數(shù)的定義. 本程序用KEIL3 802版本編譯通過(guò)，將所有的.C文件添加到工程中，并編譯main.c 注意兩點(diǎn):1.器件選擇c8051f120. 2.在TARGET中將時(shí)鐘設(shè)為96M.同時(shí)必須將Memory Model 改成large--XDATA.默認(rèn)的是small. 因?yàn)楸驹O(shè)計(jì)占用的資源是非常大的. Program Size: data=81.3 xdata=6811 code=43056
標(biāo)簽： 2007 大學(xué)生電子 設(shè)計(jì)大賽
上傳時(shí)間： 2014-01-05
上傳用戶：manlian
A Genetic Algorithm finding Strings. Enter any Word it will search this string using fitness function as TARGET string.
標(biāo)簽： Algorithm Genetic finding Strings
上傳時(shí)間： 2017-05-06
上傳用戶：qlpqlq
interrupt application code * compile : * $/usr/local/arm/2.95.3/bin/arm-linux-gcc -o interrupt interrupt.c * $cp interrupt /tftpboot/examples * run in TARGET: * #mount 192.168.1.180:/tftpboot/ /mnt/nfs * #cd /mnt/nfs/examples * #insmod eintdrv.o * #mknod eint c 98 0 * #./interrupt
標(biāo)簽： arm-linux-gcc application interrupt compile
上傳時(shí)間： 2017-05-07
上傳用戶：sunjet
Index NAME 總覽 (SYNOPSIS) 警告 (WARNING) 描述 (DESCRIPTION) 選項(xiàng) (OPTIONS) 總體選項(xiàng) (Overall Option) 語(yǔ)言選項(xiàng) (LANGUAGE OPTIONS) 預(yù)處理器選項(xiàng) (Preprocessor Option) 匯編器選項(xiàng) (ASSEMBLER OPTION) 連接器選項(xiàng) (LINKER OPTION) 目錄選項(xiàng) (DIRECTORY OPTION) 警告選項(xiàng) (WARNING OPTION) 調(diào)試選項(xiàng) (DEBUGGING OPTION) 優(yōu)化選項(xiàng) (OPTIMIZATION OPTION) 目標(biāo)機(jī)選項(xiàng) (TARGET OPTION) 機(jī)器相關(guān)選項(xiàng) (MACHINE DEPENDENT OPTION) 代碼生成選項(xiàng) (CODE GENERATION OPTION) PRAGMAS 文件 (FILE) 另見(jiàn) (SEE ALSO) BUGS 版權(quán) (COPYING) 作者 (AUTHORS) [中文版維護(hù)人] [中文版最新更新] 《中國(guó)Linux論壇man手冊(cè)頁(yè)翻譯計(jì)劃》 NAME gcc,g++-GNU 工程的 C和 C++編譯器(egcs-1.1.2
標(biāo)簽： DESCRIPTION SYNOPSIS OPTIONS Overall
上傳時(shí)間： 2014-01-03
上傳用戶：evil
A certification path is an ordered list of certificates starting with a certificate issued by the relying party s trust root, and ending with the TARGET certificate that needs to be validated. Certification path validation procedures are based on the algorithm supplied in ITU-T Recommendation X.509 and further defined in Internet Engineering Task Force (IETF) Request for Comments (RFC) 3280. Certification path processing verifies the binding between the subject distinguished name and/or subject alternative name and the subject public key defined in the TARGET certificate. The binding is limited by constraints, which are specified in the certificates that comprise the path, and inputs that are specified by the relying party. To ensure secure interoperation of PKI-enabled applications, the path validation must be done in accordance with the X.509 and RFC 3280 specifications. This document provides the test assertions and the test cases for testing path validation software against these specifications.
標(biāo)簽： certification certificates certificate starting
上傳時(shí)間： 2017-07-31
上傳用戶：清風(fēng)冷雨
Solve the 8-puzzle problem using A * algorithme. Input: Program reads start state and goal state and heuristic (N or S) from EightPuzzle.INP file.0 representing blank. There are 2 Heuristic: 1. N: Number of misplaced tiles 2. S: Sum of Manhattan distance of current location and TARGET location. Format: The first line write type of heuristic (N or S). Next is the status of departing and landing status. Between 2 states of 1 line blank. See examples EightPuzzle.INP
標(biāo)簽： state algorithme Program problem
上傳時(shí)間： 2017-08-12
上傳用戶：jjj0202
Synchronous Serial Communications (SSC) is a synchronous serial communications protocol between a TARGET PICmicro microcontroller unit and the PICkit 1 or 2.
標(biāo)簽： Communications communications Synchronous synchronous
上傳時(shí)間： 2013-12-18
上傳用戶：
Program helping you to remember the route. It cab be route from conference room to coffee-room, it can be tourist trip, it can be pathway in labyrinth. during first traversal you make notes in you phone, specifying direction of movement and TARGET of each step. Phone remembers how much time each steps takes. Then you can just inspect information about this trip and check duration of each stage and the whole trip. You can also replay it in forward and backward direction. So if somebody show you the shortest way to coffee machine, you can easily find the way back and can repeat this trip in future.
標(biāo)簽： route coffee-room conference remember
上傳時(shí)間： 2014-01-05
上傳用戶：1159797854
The OpenMAX DL (Development Layer) APIs contain a comprehensive set of audio, video, signal processing function primitives which can be implemented and optimized on various CPUs and hardware engines and then used for accelerated codec functionality. API functions TARGET key algorithms in such codecs as H.264, MPEG-4, AAC, MP3, and JPEG.
標(biāo)簽： comprehensive Development processi OpenMAX
上傳時(shí)間： 2017-09-20
上傳用戶：dancnc
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
