This paper presents several low-latency mixed-timing FIFO (first-in–first-out) interfaces designs that interface systems on a chip working at different speeds. The connected systems can be either synchronous or asynchronous. The designs are then adapted to work between systems with very long interconnect delays, by migrating a single-clock solution by Carloni et al. (1999, 2000, and 2001) (for “l(fā)atency-insensitive” protocols) to mixed-timing domains. The new designs can be made arbitrarily robust with regard to metastability and interface operating speeds. Initial simulations for both latency and throughput are promising.
標(biāo)簽： mixed-timing low-latency interfaces first-out
上傳時(shí)間： 2015-10-08
上傳用戶：dapangxie
白盒測試(White-box Testing，又稱邏輯驅(qū)動(dòng)測試,結(jié)構(gòu)測試)是把測試對象看作一個(gè)打開的盒子。利用白盒測試法進(jìn)行動(dòng)態(tài)測試時(shí)，需要測試軟件產(chǎn)品的內(nèi)部結(jié)構(gòu)和處理過程，不需測試軟件產(chǎn)品的功能。白盒測試又稱為結(jié)構(gòu)測試和邏輯驅(qū)動(dòng)測試。
標(biāo)簽： White-box Testing 白盒測試
上傳時(shí)間： 2015-10-12
上傳用戶：er1219
目錄結(jié)構(gòu) ├─WuYuFei ├─WuYufei_matlab ├─cap_turbo ├─mother └─paper constituent_decoder_SemiTh.m constituent_decoder_logmap.m constituent_decoder_max.m constituent_decoder_Th.m 這四個(gè)文件是子譯碼器 interleaver_3GPP.m 3GPP標(biāo)準(zhǔn)的交織器。Turbo.m中可以選擇是用偽隨機(jī)交織還是3GPP標(biāo)準(zhǔn)交織 decoder_all_algorithm.m 譯碼器，其中包含了3種譯碼算法 test_OverLoad_menu.m 對運(yùn)算負(fù)荷的測試程序 test_algorithm_menu.m 對算法的測試程序 Shannon_Limit.m 香農(nóng)限 test_uncoded_BPSK.m test_uncoded_BPSK_theory.m 未編碼BPSK的性能，一個(gè)是理論的，另外一個(gè)是測試的。
標(biāo)簽： constituent_decoder_SemiTh WuYufei_matlab cap_turbo WuYuFei
上傳時(shí)間： 2015-10-15
上傳用戶：從此走出陰霾
The purpose of this paper is to provide a practical introduction to the discrete Kalman filter. This introduction includes a description and some discussion of the basic discrete Kalman filter, a derivation, description and some discussion of the extended Kalman filter, and a relatively simple (tangible) example with real numbers & results.
標(biāo)簽： introduction practical discrete purpose
上傳時(shí)間： 2014-11-14
上傳用戶：familiarsmile
In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discrete-data linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area of autonomous or assisted navigation.
標(biāo)簽： R.E. discrete-dat describing published
上傳時(shí)間： 2015-10-22
上傳用戶：2404
In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discretedata linear filtering problem [Kalman60]. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area of autonomous or assisted navigation. A very “friendly” introduction to the general idea of the Kalman filter can be found in Chapter 1 of [Maybeck79], while a more complete introductory discussion can be found in [Sorenson70], which also contains some interesting historical narrative.
標(biāo)簽： R.E. discretedata describing published
上傳時(shí)間： 2015-10-22
上傳用戶：a673761058
his paper provides a tutorial and survey of methods for parameterizing surfaces with a view to applications in geometric modelling and computer graphics. We gather various concepts from di® erential geometry which are relevant to surface mapping and use them to understand the strengths and weaknesses of the many methods for parameterizing piecewise linear surfaces and their relationship to one another.
標(biāo)簽： parameterizing provides tutorial surfaces
上傳時(shí)間： 2014-11-09
上傳用戶：努力努力再努力
In this paper we propose to reduce the textural components by modelling the coefficients of a wedgelet based regression tree instead of the original pixel intensities
標(biāo)簽： coefficients components modelling the
上傳時(shí)間： 2015-10-22
上傳用戶：gxmm
in this paper,wo propose an extension of the zerotree-based space-frequency quantization algorithm by adding a wedgelet symbol to its tree-pruning optimization.
標(biāo)簽： space-frequency zerotree-based quantization algorithm
上傳時(shí)間： 2015-10-22
上傳用戶：yxgi5
in this paper,we show that an efficient multiscale wedgelet decomposition is possible if we carefully choose the set of possible wedgelet orientations.
標(biāo)簽： decomposition multiscale efficient carefull
上傳時(shí)間： 2015-10-22
上傳用戶：qweqweqwe
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
