登录
首页 » matlab » qpsk

qpsk

于 2013-09-11 发布 文件大小:1KB
0 204
下载积分: 1 下载次数: 3

代码说明:

  this is simple qpsk for matlab code

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • dc_2
    采用SIMULINK仿真一个完整的GSM通信系统,有星座图和误码率输出(Using SIMULINK simulation of a complete GSM communications systems, there is the constellation diagram and bit error rate output)
    2009-01-13 07:09:26下载
    积分:1
  • suijifangfabijin
    用随机的方法逼近函数的matlab源程序(Approximation method with random function matlab source)
    2007-10-24 16:12:06下载
    积分:1
  • homework
    双目视觉三维重建程序,输入左右相机匹配点对矩阵,自动计算投影矩阵,并输出射影空间下的三维点坐标(Binocular vision three-dimensional reconstruction program, enter the matching points on the matrix around the camera to automatically calculate the projection matrix, and output under the three-dimensional projective space point coordinates)
    2010-11-09 15:38:51下载
    积分:1
  • matlab
    决策树C4.5和CART算法的m源码 (CART decision tree algorithm C4.5 and the source m)
    2010-12-13 01:04:36下载
    积分:1
  • Lagranges
    计算方法n次Lagrange插值多项式算法的matlab程序,含实验报告,里面有详细的设计过程(Calculation of n-Lagrange interpolation polynomial algorithm matlab procedures, including lab reports, which detail the design process)
    2010-05-23 10:38:02下载
    积分:1
  • signal_tb
    MATLAB Signal Processing Toolbox 文档 (MATLAB Signal Processing Toolbox )
    2013-10-02 09:49:09下载
    积分:1
  • matlab_code
    变压器经济运行分析软件,基于matlab的 GUI界面,填入变压器参数,运行即得到运行曲线和标注的最经济运行点。(Economic performance analysis of transformer)
    2014-06-04 09:27:52下载
    积分:1
  • xianxingfangchengzu
    说明:  本代码是GAUSS-SEIDEL迭代法、选主元JORDAN消去法、简单GAUSS消去法、选主元GAUSS消去法的MATLAB程序,有详细注释,可直接调用(This code is GAUSS-SEIDEL iteration, pivoting JORDAN elimination, simple GAUSS elimination, pivoting GAUSS elimination of the MATLAB program, with detailed notes, can be called directly)
    2010-04-27 16:35:44下载
    积分:1
  • Question1
    说明:  C++源代码,递归实现。原问题描述:鼓上蚤时迁到一个山洞里去盗宝,里面有n件宝贝,价值分别是a1,a2......an,并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包,能装的东西最大价值是K,他只能进洞一次,请问他最多能带出多少? 要求:输入K,n,a1,a2......an 输出:他能最多带出的宝物价值 (C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)
    2008-12-02 21:07:25下载
    积分:1
  • simmethod
    改进单纯形调优法程序,用于非线性数值优化问题(Modified simplex optimization method procedures for the nonlinear numerical optimization problems)
    2010-05-17 11:29:32下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载