一种基于二维链表的稀疏矩阵模半板类设计 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
