IP核！！高速傅立叶变换的VHDL源代码 可以综合

很简单的东西 decode的代码 是一个例题 -very simple things decode the code is one of excellence

这是一份爱的礼物，收到礼物的人，打开应用程序，便能在屏幕上看到i love you的字样。-This is a gift of love, those who receive the gift, open applications, will be able to see on the screen the words i love you.

商业版可以向你的网站发送假的请求，大幅度的增加你的网站的点击率和排名 name:www.mycodes.net sn:042392934239-Commercial version could be sent to your Web site leave request, a substantial increase in your site s click-through rate and ranking name: www.mycodes.netsn:042392934239

系统图标参考，里面包含多种bmp格式的图标，如主页，设置等-icon and bmp

建立arm－linux的gnu开发工具链的详细步骤-building arm- linux the gnu development tools chain and the detailed steps

通过界面配置，生成一个隐蔽查找文件及特征关键词的控制台程序。通过运行该控制台程序，就可将查找到的文件名保存到C:\_log.txt文件中了。-through the interface configuration, generating a concealed documents and search features keyword console procedures. By running the console procedures, it can find the file name to save to C : _log.txt the document.

基于MATLAB的2PSK调制,调制解调部分源文件-based on MATLAB 2PSK modulation, modulation and demodulation part of the source document

算法实现题 最长公共子序列问题 给定两个序列 X = { x1 , x2 , ... , xm } Y = { y1 , y2 , ... , yn } 求X和Y的一个最长公共子序列 举例 X = { a , b , c , b , d , a , b } Y = { b , d , c , a , b , a } 最长公共子序列为 LSC = { b , c , b , a }-Algorithm to achieve the longest common sub-title sequence of the problem given two sequences X = (x1, x2, ..., xm) Y = (y1, y2, ..., yn) for X and Y, a maximum common substructure sequence, for example X = (a, b, c, b, d, a, b) Y = (b, d, c, a, b, a) the longest common sub-sequence for LSC = (b, c, b, a )

是一个用VB编写得银行ATM机交易的程序-VB is a preparation of a bank with ATM machine transactions

可以模拟薄膜的生长过程，和形成薄膜的外貌形状，-Can simulate the film growth process, and the formation of thin-film appearance of the shape,