DCTOpenSource

说明：  this document about Brain waves alpha,beta,theta and delta and their frequencies range and how to detect them using any software labview and matlab

The sample source of "Contemporary Communication Systems"

说明：  标准label propagation的一个实现版本，实现为函数，可以直接调用即可。(As a standard implementation of label propagation algorihtm, you could integrate into your work freely.)

给定矩阵A, A存于数据文件jacobi.dat中。编写jacobi法的函数jacobi(Given matrix A, A is stored in the data file jacobi.dat. Write jacobi law function jacobi)

自己编写的一个matlab实现手写数字的识别(I have written a matlab achieve recognition of handwritten digits)

说明：  120多个用MATLAB编写的信号处理程序，它们是本书各个章节的大部分例题。用MATLAB编写的程序的名称由“exa”开头，接下来是所在的章、节及例题的序号，如exa010101,指的是第1章第1节（即1.1节）的第1个例题，即例1.1.1。如果该程序是为了说明某一个m文件的应用，则在上述名称的后面跟一个下划线，再在后面加上所说明的MATLAB文件的名称，如exa011001_rand，即是例1.10.1,该例用来说明rand.m文件的应用。(More than 120 signal processing programs written in MATLAB are most of the examples in each chapter of this book. The name of the program written in MATLAB begins with "exa", followed by the ordinal number of the chapters, sections and examples, such as exa0101, which refers to the first example of chapter 1, section 1 (i.e. section 1.1), namely example 1.1.1. If the program is to illustrate the application of an M file, then follow the above name with an underscore, and then add the name of the MATLAB file, such as exa011001_rand, which is Example 1.10.1. This example is used to illustrate the application of rand.m file.)

通过matlab中的gui功能实现的史密斯圆图的匹配等功能的操作界面(Gui in matlab functions through the implementation of the Smith chart of the matching function interface)

说明：  为Matlab的日历显示加上农历信息。 (There is a command named "calendar" in MATLAB for get calendar infomation. This code improve the calendar information with the lunar.)

说明：  图像处理应用及相关说明，matlab相关函数的应用及说明(Image processing applications)

QC-LDPC码生成矩阵编程，围长为12，无4环(The program searches for a girth 12 QC-LDPC code given size of sub-matrix, row and column weights. The configuration of sub-matrices could also be changed. The program offers flexibility in constructing girth-12 QC-LDPC codes compared to other algorithms. The program builds a Tanner graph by connecting groups of rows and columns. A connection is made if it does not form less than twelve-cycles. The program may fail to find a code given particular parameters. It also does not find the smallest codes compared to other algorithms. )