start

对随机信源进行16QAM调制，送入高斯信道，解调后计算误码率(Random source for 16QAM modulation, into the Gaussian channel, demodulation error rate were calculated)

excitation generatrice asychrone

matlab程序设计以及绘图方面的相关基础资料，使用于初学者(matlab program design and drawing of the underlying data used for beginners)

Calculate the permissible actions of electron self pipeline

针对标准的Capon 波束形成在阵列导向矢量存在误差时出现严重性能退化, 本文从权矢量模约束和不确定集两个角度出发, 提出矢量最优化稳健波束形成方法, 并通过二阶锥规划进行有效求解.(When there exists the array steering vector error , the performance of standard Capon beamforming will be severely degraded .In this paper , in the view of the constraints on the weight vector and the uncertainty sets , we propose a new approach, which is called Vector Optimization Robust Beamforming.It is shown that the proposed algorithm can be reformulated in a convex form as the so-called Second-Order Cone (SOC)program and solved efficiently using the well-established optimization tool , sedumi.)

The method works as follows. 1. For a data set with dimensionality, d, compute the variance of data in each dimension (column). 2. Find the column with maximum variance call it cvmax and sort it in any order. 3. Divide the data points of cvmax into K subsets, where K is the desired number of clusters. 4. Find the median of each subset. 5. Use the corresponding data points (vectors) for each median to initialize the cluster centers.

说明：  最小二乘一次完成算法，压缩包里以给出数据，可以运行试试看。(A complete least-squares algorithm, data compression is given a bag, you can try to run.)

数字信号处理书籍的matlab程序,内含许多数字信号处理内容,值得下载(Kam-Li jin 氲?嚬鞛?scorpion 靹濍彣 matlab 雱?Saitama, 旖旊驳 Ji Li Kam 霚?catties 氲?嚬鞛快綌頊? so 霃?Gou tong)

This paper is the result of a literature study carried out by the authors. It is a review of the dierent attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with dierent representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with dierent standard examples using combination of crossover and mutation operators in relation with path representation. Keywords: Travelling Salesman Problem Genetic Algorithms Binary representation Path representation Adjacency representation Ordinal representation Matrix representation Hybridation. 1 1 Introduction In nature, there exist many processes which seek a stable state. These processes can be seen as natural optimization processes. Over the last...

—This paper shows a proposal for Type-reduction of an Interval Type-2 fuzzy set composed from α -cuts done over its primary membership functions. The defi nition of available Type-reduction methods for Interval Type-2 fuzzy sets are based on an homogeneous subdivision of the universe of discourse, so we propose an approximation algorithm for Type-reduction of an Interval type-2 fuzzy set through its primary α -cuts. Some defi nitions about the α -cut of a Type-2 fuzzy set are provided and used for computing the centroid of an Interval Type-2 fuzzy set through a mapping of its membership function, instead of its universe of discourse.