This is GPS Matlab findPreambles finds the first preamble occurrence in the bit stream of each channel. The preamble is verified by check of the spacing between preambles [6sec] and parity checking of the first two words in a subframe. At the same time function returns list of channels, that are in tracking state and with valid preambles in the nav data stream.
標(biāo)簽： findPreambles occurrence the preamble
上傳時間： 2013-12-23
上傳用戶：秦莞爾w
The Bit Array structure provides a compacted arrays of Booleans, with one bit for each Boolean value. A 0 [1] bit corresponds to the Boolean value false [true], respectively. We can look at a stream of bytes as a stream of bits each byte contains 8 bits, so any n bytes hold n*8 bits. And the operation to manipulate this stream or bits array is so easy, jut read or change the bits state or make any Boolean operation on the whole bits array, like 鈥楢ND鈥? 鈥極R鈥? or 鈥榅OR鈥?
標(biāo)簽： structure compacted Booleans provides
上傳時間： 2014-01-15
上傳用戶：壞天使kk
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
上傳時間： 2014-06-02
上傳用戶：yd19890720
it is a verilog code written for traffic light controller will synthesize in xinlix ise 8.2i.i have tested it om my kit.[i mae my own kit for spartan2 device].it is a state machine based code.
標(biāo)簽： controller synthesize verilog traffic
上傳時間： 2017-03-22
上傳用戶：xymbian
The main MIPS processor of SMP8630 comes with a JTAG interface, allowing: access to caches and data bus (DRAM) with a bandwidth of about 200kbit/s examining the processor state whatever the execution mode (monice) connecting to monice using mdi-server and using a gdb client on the processor to step and break accurately whatever the execution mode running semi-hosted applications fl ash write tool memory testing (MT command) real-time traces: has not been built in CPU (Config3_TL=0) and only supported by MajicPLUS probes (maybe built into emulator?)
標(biāo)簽： interface processor allowing access
上傳時間： 2013-12-19
上傳用戶：youke111
(有源代碼)數(shù)值分析作業(yè),本文主要包括兩個部分,第一部分是常微分方程(ODE)的三個實驗題,第二部分是有關(guān)的拓展討論,包括高階常微分的求解和邊值問題的求解(BVP).文中的算法和算例都是基于Matlab計算的.ODE問題從剛性(STIFFNESS)來看分為非剛性的問題和剛性的問題,剛性問題(如大系數(shù)的VDP方程)用通常的方法如ODE45來求解,效率會很低,用ODE15S等,則效率會高多了.而通常的非剛性問題,用ODE45來求解會有很好的效果.從階次來看可以分為高階微分方程和一階常微分方程,高階的微分方程一般可以化為狀態(tài)空間(STATE SPACE)的低階微分方程來求解.從微分方程的性態(tài)看來,主要是微分方程式一階導(dǎo)系數(shù)大的時候,步長應(yīng)該選得響應(yīng)的小些.或者如果問題的性態(tài)不是太好估計的話,用較小的步長是比較好的,此外的話Adams多步法在小步長的時候效率比R-K(RUNGE-KUTTA)方法要好些,而精度也高些,但是穩(wěn)定區(qū)間要小些.從初值和邊值來看,也是顯著的不同的.此外對于非線性常微分方程還有打靶法,胞映射方法等.而對于微分方程穩(wěn)定性的研究,則諸如相平面圖等也是不可缺少的工具.值得提出的是,除了用ode系類函數(shù)外,用simulink等等模塊圖來求解微分方程也是一種非常不錯的方法,甚至是更有優(yōu)勢的方法(在應(yīng)用的角度來說).
上傳時間： 2014-01-05
上傳用戶：caixiaoxu26
A Design and Implementation of The Online Shopping System Abstract: Along with the development of the computer ,the database technique is widespread in the application of Internet, more and more , providing more thoughtful and humanized service for the large network customer. Characteristic services have already become gradually the current as the application of Wed nowadays. This text studied a method of project which composed of characteristic page and dynamic state of technical customer according to the data connection rule, compared with some projects that adopt already on present nets, this project have the advantage of providing customers more simple ,reflective obvious meticulous use and so on..
標(biāo)簽： Implementation development Abstract Shopping
上傳時間： 2014-12-04
上傳用戶：410805624
開發(fā)人員使用JavaScript的一個主要原因就是可以避免回發(fā)過程中帶來的頁面刷新。例如我們可以根據(jù)用戶的需要使用Treeview控件來展開和折疊相應(yīng)的數(shù)據(jù)節(jié)點。當(dāng)你展開一個節(jié)點時，該Treeview控件將會利用JavaScript讀取服務(wù)器上的子節(jié)點信息，然后平滑無刷新地插入這些新節(jié)點。如果沒有使用JavaScript的話，Treeview控件將會因為頁面的回發(fā)而重新構(gòu)建。不但用戶會發(fā)現(xiàn)因頁面刷新而帶來的延遲，而且頁面極有可能回復(fù)到原來的狀態(tài)，即丟失前面所展開的那些子節(jié)點信息。對于服務(wù)器端來說，因為每次回發(fā)的過程中都要處理大量的視圖狀態(tài)（View State）信息，這也會嚴(yán)重影響程序的整體執(zhí)行性能。在ASP.NET 2.0中，引入了一個稱為"客戶端回調(diào)"的功能，利用這個內(nèi)建的解決方案我們可以輕松實現(xiàn)客戶端腳本和服務(wù)器端代碼間的交互，從而避免了頁面因回發(fā)帶來的頻繁刷新。
標(biāo)簽： JavaScript Treeview 節(jié)點 過程
上傳時間： 2017-05-24
上傳用戶：彭玖華
If you d like to know where visitors to your site live, add this to your feedback forms. They just choose a region, and the second menu changes appropriately, allowing them to choose their country. (If they choose USA, it allows them to select their state) Neat!
標(biāo)簽： your feedback to visitors
上傳時間： 2017-06-11
上傳用戶：wfeel
This tutorial explains how to communicate with IO devices on the DE2 Board and how to deal with interrupts using C and the Altera Monitor Program. Two example programs are given that diplay the state of the toggle switches on the red LEDs. The fi rst program uses the programmed I/O approach and the second program uses interrupts.
標(biāo)簽： with communicate how tutorial
上傳時間： 2013-12-13
上傳用戶：熊少鋒
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
