一種基于二維鏈表的稀疏矩陣模半板類設計 A template Class of sparse matrix. Key technology: bin,2-m linked matrix. constructors: 1.normal constuctor 2.copy constuctor. 3.assignment constructor. Basic operator: 1. addition(sub) of two matrix 2. inverse of a matrix. 3. multiply of two matrix. etc.
標簽： matrix technology template linked
上傳時間： 2013-12-13
上傳用戶：lwwhust
The Viterbi algorithm is the same as the binary case with one main difference: The survivor sequences include the uncoded bits, which are decided at each trellis stage when selecting one of two parallel branches with the largest correlation metric. Presently, only 8-PSK modulation is considered. Extensions to higher-order modulations can be implemented following a similar procedure.
標簽： difference The algorithm the
上傳時間： 2015-07-05
上傳用戶：qiaoyue
這是06年4月剛剛完成的程序，從opencore.org下載而來。用vhdl語言描寫，以及matlab仿真，testbench，以及在xinlinx上的綜合。 The MDCT core is two dimensional discrete cosine transform implementation designed for use in compression systems like JPEG. Architecture is based on parallel distributed arithmetic with butterfly computation.
標簽： 程序
上傳時間： 2013-12-16
上傳用戶：123啊
merge sort give a set S of n integers and another integer x, determine whether or not there exits two elements in S whose sum is exactly x.
標簽： determine integers another integer
上傳時間： 2013-12-23
上傳用戶：xmsmh
加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an RSA key cryptest g - To encrypt and decrypt a string using RSA cryptest r - To calculate MD5, SHS, and RIPEMD-160 message digests: cryptest m file - To encrypt and decrypt a string using DES-EDE in CBC mode: cryptest t - To encrypt or decrypt a file cryptest e|d input output - To share a file into shadows: cryptest s <pieces> <pieces-needed> file (make sure file has no extension, if you re running this under DOS) - To reconstruct a file from shadows: cryptest j output file1 file2 [....] - To gzip a file: cryptest z <compression-level> input output - To gunzip a file: cryptest u input output - To run validation tests: cryptest v - To run benchmarks: cryptest b [time for each benchmark in seconds]
標簽： Cryptographic Primitives generate Library
上傳時間： 2015-07-16
上傳用戶：wqxstar
All 3G and GSM specifications have a 3GPP specification number consisting of 4 or 5 digits. (e.g. 09.02 or 29.002). The first two digits define the series as listed in the table below. They are followed by 2 further digits for the 01 to 13 series or 3 further digits for the 21 to 55 series. The term "3G" means a 3GPP system using a UTRAN radio access network the term "GSM" means a 3GPP system using a GERAN radio access network. (Thus "GSM" includes GPRS and EDGE features.)
標簽： e.g. specifications specification consisting
上傳時間： 2015-08-11
上傳用戶：yoleeson
利用Atmel ATMega8 的定時器功能和PWM功能，制作頻率發生器。 有LCD顯示，并可實時調節ATMega8的各個相關的寄存器內容。 支持紅外遙控器輸入。 ..\頻率發生器.prj ......主芯片項目文件 ..\頻率發生器.c ......主芯片主程序 ..\頻率發生器.asm ......主芯片匯編文件(自動生成) ..\頻率發生器.hex ......可供燒錄的文件 ..\頻率發生器_client.prj ......副芯片項目文件 ..\頻率發生器_client.c ......副芯片主程序 ..\頻率發生器_client.asm ......副芯片匯編文件 ..\頻率發生器_client.hex ......可供燒錄的文件 ..\Config.h ......硬件配置文件 ..\Input.c ......接受紅外遙控器輸入并在LCD中顯示 ..\LCD_Interface.c ......LCD 1602 接口文件 ..\Menu.c ......在LCD中顯示菜單和其它信息 ..\Menu.h ......菜單定義文件 ..\Readme.txt ......本說明文件
上傳時間： 2013-12-12
上傳用戶：源弋弋
PIECEWISE_EVAL: evaluates a piecewise function of x usage: y = PIECEWISE_EVAL(x,breakpoints,funs) arguments (input) x - vector or array of points to evaluate though the function breakpoints - list of n breakpoints, -inf and +inf are implicitly
標簽： PIECEWISE_EVAL breakpoints evaluates piecewise
上傳時間： 2014-01-25
上傳用戶：xyipie
用匯編語言做的一個打字游戲。運行環境是MASN5.0。 1,用戶打開軟件時先出現歡迎界面,當用戶輸入字符’1’時,再進入打字界面 當用戶按的是”ESC”鍵時,退出打字游戲 當用戶輸入不是數字”1”或者不是按的”ESC”鍵時,屏幕不動作,直到用戶輸入數字”1”或者按的”ESC”鍵時 2,打字字符從第二行開始顯示(雙數行為顯示打字內容,單數行由用戶輸入) 打字內容:1), We will see his boat and then.We ll say goodbye to him. 2), He ll be away for two months.We are very proud of him. 3,用戶輸入的和上一行相對應相等時,表示輸入正確,否則輸入錯誤,則顯示’#’ 當用戶按下”ESC”鍵,退出打字程序 4,顯示用戶打字的正確性,假如錯誤數小于10字符,顯示” Very Good!” 否則顯示” Very Bad!” 5,當用戶輸入一次時,假如用戶還想重新打字游戲,請按數字鍵”3”,否則按”ESC”鍵退出打字程序
上傳時間： 2015-08-17
上傳用戶：dapangxie
/* * 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
