System identification with adaptive filter using full and partial-update recursive-Least-Squares
標簽： recursive-Least-Squares identification partial-update adaptive
上傳時間： 2013-12-30
上傳用戶：LouieWu
This toolbox contains Matlab code for several graph and mesh partitioning methods, including geometric, spectral, geometric spectral, and coordinate bisection. It also has routines to generate recursive multiway partitions, vertex separators, and nested dissection orderings and it has some sample meshes and mesh generators. The toolbox contains a Matlab interface to Leland and Hendrickson s Chaco partitioning package, but it doesn t contain Chaco itself. The file "chaco/README" tells how to install the interface to Chaco. It also contains a Matlab interface to Karypis et al. s Metis partitioning package, using Robert Bridson s "metismex" code.
標簽： partitioning including contains toolbox
上傳時間： 2015-05-25
上傳用戶：tzl1975
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
標簽： introduction the contains intended
上傳時間： 2013-12-23
上傳用戶：liansi
ReBEL is a Matlabtoolkit of functions and scripts, designed to facilitate sequential Bayesian inference (estimation) in general state space models. This software consolidates research on new methods for recursive Bayesian estimation and Kalman filtering by Rudolph van der Merwe and Eric A. Wan. The code is developed and maintained by Rudolph van der Merwe at the OGI School of Science & Engineering at OHSU (Oregon Health & Science University).
標簽： Matlabtoolkit facilitate sequential functions
上傳時間： 2015-08-31
上傳用戶：皇族傳媒
迭代自適應Simpson，Lobatto積分 In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm. We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (e.g. quad, quadv, and quadl). Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf.
上傳時間： 2014-10-25
上傳用戶：xc216
This function calculates Akaike s final prediction error ％ estimate of the average generalization error for network ％ models generated by NNARX, NNOE, NNARMAX1+2, or their recursive ％ counterparts. ％ ％ [FPE,deff,varest,H] = nnfpe(method,NetDef,W1,W2,U,Y,NN,trparms,skip,Chat) ％ produces the final prediction error estimate (fpe), the effective number ％ of weights in the network if it has been trained with weight decay, ％ an estimate of the noise variance, and the Gauss-Newton Hessian. ％
標簽： generalization calculates prediction function
上傳時間： 2016-12-27
上傳用戶：腳趾頭
This function applies the Optimal Brain Surgeon (OBS) strategy for ％ pruning neural network models of dynamic systems. That is networks ％ trained by NNARX, NNOE, NNARMAX1, NNARMAX2, or their recursive ％ counterparts.
標簽： function strategy Optimal Surgeon
上傳時間： 2013-12-19
上傳用戶：ma1301115706
The Kalman filter is a set of mathematical equations that provides an efficient computational [recursive] means to estimate the state of a process, in a way that minimizes the mean of the squared error. The filter is very powerful in several aspects: it supports estimations of past, present, and even future states, and it can do so even when the precise nature of the modeled system is unknown.
標簽： computational mathematical equations efficient
上傳時間： 2014-06-02
上傳用戶：yd19890720
This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FFT) algorithm using C++ template metaprogramming. Thank to the recursive nature of the FFT, the source code is more readable and faster than the classical implementation. The efficiency is proved by performance benchmarks on different platforms.
標簽： implementation Cooley-Tukey describes efficient
上傳時間： 2013-12-23
上傳用戶：netwolf
基于FPGA設計的相關論文資料大全 84篇用FPGA實現FFT的研究 劉朝暉 韓月秋 摘 要 目的 針對高速數字信號處理的要求，給出了用現場可編程門陣列(FPGA)實現的 快速傅里葉變換(FFT)方案.方法 算法為按時間抽取的基4算法，采用遞歸結構的塊浮點運 算方案，蝶算過程只擴展兩個符號位以適應雷達信號處理的特點，乘法器由陣列乘法器實 現.結果 采用流水方式保證系統的速度，使取數據、計算旋轉因子、復乘、DFT等操作協 調一致，在計算、通信和存儲間取得平衡，避免了瓶頸的出現.結論 實驗表明，用FPGA 實現高速數字信號處理的算法是一個可行的方案. 關鍵詞 離散傅里葉變換； 快速傅里葉變換； 塊浮點運算； 可編程門陣列 分類號 TP39； TN957.511 Implementation of FFT with FPGA Technology Liu Zhaohui Han Yueqiu (Department of Electronics Engineering, Beijing Institute of Technology, Beijing 100081) Abstract Aim To propose a scheme for implementing FFT with FPGA in accor-dance with the requirement for high speed digital signal processing. Methods The structure of FPGA and requirement of system were considered in the experiment, radix-4 algorithm of DIT and recursive structure were adopted. The group float point arithmetic operation was used in the butterfly and the array multiplier was used to realize multiplication. Results The pipeline pattern was used to ensure the system speed, it made fetching data, calculating twiddle factor, complex multiplication and D
標簽： fpga
上傳時間： 2022-03-23
上傳用戶：
