-
37724076STTC
sttc，stbc blabst等的编码(sttc stbc)
- 2009-05-10 16:29:17下载
- 积分：1
-
my_pcalda
关于人脸识别的PCA-LDA算法，可成功运行。(a useful program, can be run successfully!)
- 2011-09-05 20:38:04下载
- 积分：1
-
Report-Milad-Vahedi
In this project an adaptive beamforming technique is proposed based on directly minimizing the BER1. A particular approach that has shown real promise in achieving substantial capacity enhancements is the use of adaptive antenna arrays. A beamformer appropriately combines the signals received by the different elements of an antenna array to form a single output. Classically, this has been achieved by minimizing the mean square error (MSE) between the desired output and the actual array output. It is demonstrated that minimum BER (MBER) approach utilizes the antenna array elements more intelligently than the standard MMSE2 approach, since it directly optimizes the system’s BER performance rather than minimizing the MSE, where the latter strategy often turns out to be deficient.
- 2020-08-03 21:08:34下载
- 积分：1
-
point
Simulation Of Patch Antenna Using MATLAB
- 2011-10-22 03:57:00下载
- 积分：1
-
TPParticleh
本文描述的是关于粒子滤波的源代码，，用MATLAB运行，会有很好的效果。
(This article describes the source code on the particle filter, using MATLAB running, there will be good results.)
- 2012-09-15 14:21:13下载
- 积分：1
-
cg
说明： 这是用于对球体重力进行反演的程序，所用算法是共轭梯度法(This is for the sphere of gravity inversion procedure, the algorithm used is the steepest descent method)
- 2016-04-07 09:42:19下载
- 积分：1
-
ejidaolib
基于LQR控制算法的二级倒立摆Simulink仿真模型(the double inverted pendulum Simulink simulation model based on LQR control algorithm)
- 2021-03-09 16:09:27下载
- 积分：1
-
huffman
说明： 图像的huffman编解码程序，希望能给大家提供帮助(Huffman encoding and decoding process the image, hope that they can help)
- 2011-04-01 15:37:54下载
- 积分：1
-
response-of-damped-system-to-harmonic-force
response of damped system to harmonic force
- 2012-06-27 10:56:56下载
- 积分：1
-
Travelling-salesman-problem-algorithm
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
- 2013-12-30 00:26:10下载
- 积分：1
