在集成電路內(nèi)建自測試的過程中，電路的測試功耗通常顯著高于正常模式產(chǎn)生的功耗，因此低功耗內(nèi)建自測試技術(shù)已成為當(dāng)前的一個研究熱點(diǎn)。為了減少被測電路內(nèi)部節(jié)點(diǎn)的開關(guān)翻轉(zhuǎn)活動率，研究了一種隨機(jī)單輸入跳變（Random Single Input Change，RSIC）測試向量生成器的設(shè)計(jì)方案，利用VHDL語言描述了內(nèi)建自測試結(jié)構(gòu)中的測試向量生成模塊，進(jìn)行了計(jì)算機(jī)模擬仿真并用FPGA（EP1C6Q240C8）加以硬件實(shí)現(xiàn)。實(shí)驗(yàn)結(jié)果證實(shí)了這種內(nèi)建自測試原理電路的正確性和有效性。
“抓住它”小遊戲，a applet that plays a game called Catch the Crearure. have the crature appear at a ramdom lacation for a random durarion. the goal is to catch the creature by pressing the moouse button while the mouce pointer is on the creature
Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
尋找函數(shù)的全局極小值，global minimization of contrast function with random restarts the data are assumed whitened (i.e. with identity covariance matrix). The output is such that Wopt*x are the independent sources.
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
Example of a digital data transmission implementing GMSK modulation
This Simulink model simulates as an example the transmission and reception of random digital data modulated with GMSK. The purpose of this model is to illustrate how part of the GSM transmission and reception works. It also measures the BER, affected by an AWGN channel
