This paper examines the asymptotic (large sample) performance of a family of non-data aided feedforward (NDA FF) nonlinear least-squares (NLS) type carrier frequency estimators for burst-mode phase shift keying (PSK) modulations transmitted through AWGN and flat Ricean-fading channels. The asymptotic performance of these estimators is established in closed-form expression and compared with the modified Cram`er-Rao bound (MCRB). A best linear unbiased estimator (BLUE), which exhibits the lowest asymptotic variance within the family of NDA FF NLS-type estimators, is also proposed.
标签： performance asymptotic examines non-data
上传时间： 2015-12-30
上传用户：225588
本程序实做MLP(Multi-layer perceptron)算法，使用者可以自行设定训练数据集与测试数据集，将训练数据集加载，在2、3维下可以显示其分布状态，并分别设定键节值、学习率、迭代次数来训练其类神经网络，最后可观看辨识率与RMSE（Root Mean squared error）来判别训练是否可以停止。
标签： Multi-layer perceptron MLP 程序
上传时间： 2013-12-24
上传用户：caozhizhi
Comparison of the performances of the LS and the MMSE channel estimators for a 64 sub carrier OFDM system based on the parameter of Mean square error
标签： the performances Comparison estimators
上传时间： 2016-02-01
上传用户：hgy9473
Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.
标签： interesting Traveling classical Salesman
上传时间： 2016-02-06
上传用户：rocwangdp
PCA and PLS aims:to get some insight into the bilinear factor models Principal Component Analysis (PCA) and Partial Least Squares (PLS) regression, focusing on the mathematics and numerical aspects rather than how s and why s of data analysis practice. For the latter part it is assumed (but not absolutely necessary) that the reader is already familiar with these methods. It also assumes you have had some preliminary experience with linear/matrix algebra.
标签： Component Principal Analysis bilinear
上传时间： 2016-02-07
上传用户：zuozuo1215
μC/OS-II Goals Probably the most important goal of μC/OS-II was to make it backward compatible with μC/OS (at least from an application’s standpoint). A μC/OS port might need to be modified to work with μC/OS-II but at least, the application code should require only minor changes (if any). Also, because μC/OS-II is based on the same core as μC/OS, it is just as reliable. I added conditional compilation to allow you to further reduce the amount of RAM (i.e. data space) needed by μC/OS-II. This is especially useful when you have resource limited products. I also added the feature described in the previous section and cleaned up the code. Where the book is concerned, I wanted to clarify some of the concepts described in the first edition and provide additional explanations about how μC/OS-II works. I had numerous requests about doing a chapter on how to port μC/OS and thus, such a chapter has been included in this book for μC/OS-II.
标签： OS-II compatible important Probably
上传时间： 2013-12-02
上传用户：jkhjkh1982
均值漂移算法的详细介绍，论证均值漂移算法的收敛性，介绍mean-shift算法在图像分割，目标跟踪领域的应用
上传时间： 2016-03-04
上传用户：jing911003
The Fuzzy Clustering and Data Analysis Toolbox is a collection of Matlab functions. Its propose is to divide a given data set into subsets (called clusters), hard and fuzzy partitioning mean, that these transitions between the subsets are crisp or gradual.
标签： Clustering collection functions Analysis
上传时间： 2016-03-19
上传用户：1427796291
This example demo code is provided as is and has no warranty, implied or otherwise. You are free to use/modify any of the provided code at your own risk in your applications with the expressed limitation of liability (see below) so long as your product using the code contains at least one uPSD products (device).
标签： otherwise provided warranty example
上传时间： 2014-11-17
上传用户：hoperingcong
1) Write a function reverse(A) which takes a matrix A of arbitrary dimensions as input and returns a matrix B consisting of the columns of A in reverse order. Thus for example, if A = 1 2 3 then B = 3 2 1 4 5 6 6 5 4 7 8 9 9 8 7 Write a main program to call reverse(A) for the matrix A = magic(5). Print to the screen both A and reverse(A). 2) Write a program which accepts an input k from the keyboard, and which prints out the smallest fibonacci number that is at least as large as k. The program should also print out its position in the fibonacci sequence. Here is a sample of input and output: Enter k>0: 100 144 is the smallest fibonacci number greater than or equal to 100. It is the 12th fibonacci number.
标签： dimensions arbitrary function reverse
上传时间： 2016-04-16
上传用户：waitingfy
