-
System identification with adaptive filter using full and partial-update Recursive-Least-Squares
標(biāo)簽：
Recursive-Least-Squares
identification
partial-update
adaptive
上傳時(shí)間：
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.
標(biāo)簽：
partitioning
including
contains
toolbox
上傳時(shí)間：
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
標(biāo)簽：
introduction
the
contains
intended
上傳時(shí)間：
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).
標(biāo)簽：
Matlabtoolkit
facilitate
sequential
functions
上傳時(shí)間：
2015-08-31
上傳用戶：皇族傳媒
-
迭代自適應(yīng)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.
標(biāo)簽：
Simpson
迭代
上傳時(shí)間：
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.
％
標(biāo)簽：
generalization
calculates
prediction
function
上傳時(shí)間：
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.
標(biāo)簽：
function
strategy
Optimal
Surgeon
上傳時(shí)間：
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.
標(biāo)簽：
computational
mathematical
equations
efficient
上傳時(shí)間：
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.
標(biāo)簽：
implementation
Cooley-Tukey
describes
efficient
上傳時(shí)間：
2013-12-23
上傳用戶：netwolf
-
基于FPGA設(shè)計(jì)的相關(guān)論文資料大全 84篇用FPGA實(shí)現(xiàn)FFT的研究
劉朝暉 韓月秋
摘 要 目的 針對(duì)高速數(shù)字信號(hào)處理的要求，給出了用現(xiàn)場(chǎng)可編程門陣列(FPGA)實(shí)現(xiàn)的
快速傅里葉變換(FFT)方案.方法 算法為按時(shí)間抽取的基4算法，采用遞歸結(jié)構(gòu)的塊浮點(diǎn)運(yùn)
算方案，蝶算過(guò)程只擴(kuò)展兩個(gè)符號(hào)位以適應(yīng)雷達(dá)信號(hào)處理的特點(diǎn)，乘法器由陣列乘法器實(shí)
現(xiàn).結(jié)果 采用流水方式保證系統(tǒng)的速度，使取數(shù)據(jù)、計(jì)算旋轉(zhuǎn)因子、復(fù)乘、DFT等操作協(xié)
調(diào)一致，在計(jì)算、通信和存儲(chǔ)間取得平衡，避免了瓶頸的出現(xiàn).結(jié)論 實(shí)驗(yàn)表明，用FPGA
實(shí)現(xiàn)高速數(shù)字信號(hào)處理的算法是一個(gè)可行的方案.
關(guān)鍵詞 離散傅里葉變換； 快速傅里葉變換； 塊浮點(diǎn)運(yùn)算； 可編程門陣列
分類號(hào) 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
標(biāo)簽：
fpga
上傳時(shí)間：
2022-03-23
上傳用戶：
