DXSXSY_XT_CH2-3

TD-SCDMA系统无线接口技术规范 TD-SCDMA System Radio Interface Technical Specification (TD-SCDMA system, the wireless interface specifications TD-SCDMA System Radio Interface Technical Specification)

说明：  的支持是我前进的动力！ 欢迎你来灌水！ 如果想和我交换链接，请在留言区留言！ 本blog资料的解压密码为sagestar！(support is the driving force for me! You are welcome to irrigation! If I want to exchange links, the voice-mail! This blog information extracting passwords sagestar!)

Many synthetic aperture radar (SAR) image formation algorithms require the computation of a multidimensional Fourier transform of irregularly-sampled or unequally-spaced data samples. We apply a recently developed algorithm, the unequally-spaced FFT (USFFT),2 to SAR image formation and compare its accuracy and complexity to a conventional algorithm. We find that the USFFT algorithm allows comparable accuracy to traditional approaches at a slightly reduced computational cost. We briefly discuss extensions of the USFFT algorithm to multiresolution SAR imaging

ldpc码通过瑞利衰落信道功能分析BPSK 调制解调(LDPC MATLAB)

毕设，圆拟合程序，使用最小二乘法。 输出圆心，半径。(Picasso, circle fitting procedures set, using least-square method. Output circle, radius.)

nift presented fingeprint matlab code, useful

经典的k均值聚类算法，用于无监督学习和数据分类，广泛应用于数据处理和模式识别领域(Classical k-means clustering algorithm for unsupervised learning and data classification, widely used in data processing and pattern recognition)

matlab小波分析程序，主要是基于mtlab的程序，基于互功率谱的时延估计，一种流形学习算法（很好用），旋转机械二维全息谱计算。( matlab wavelet analysis program, Mainly based on the mtlab procedures, Based on the time delay estimation of power spectrum, A fluid manifold learning algorithm (good use), Rotating machinery 2-d holographic spectrum calculation.)

matlab code, discrete time processing vverlap and add example

行商问题是一个经典的NP完全问题,多人旅行商问题的求解则更具挑战性。以往对求解多人旅行商问题的研究局限于以所有成员路径总和最小为优化标准(Salesmen problem is a classical NP complete problem, many people are solving the traveling salesman problem more challenging. Solving the traveling salesman problem of many previous studies limited to minimize the sum of all the members of the paths to optimize the standard)