使用FPGA/CPLD設(shè)置語(yǔ)音AD、DA轉(zhuǎn)換芯片AIC23，F(xiàn)PGA/CPLD系統(tǒng)時(shí)鐘為24.576MHz 1、AIC系統(tǒng)時(shí)鐘為12.288MHz，SPI時(shí)鐘為6.144MHz 2、AIC處于主控模式 3、input bit length 16bit output bit length 16bit MSB first 4、幀同步在96KHz
上傳時(shí)間： 2013-12-20
上傳用戶：二驅(qū)蚊器
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
標(biāo)簽： fault-tolerant algorithms redundant underlyin
上傳時(shí)間： 2013-12-18
上傳用戶：jkhjkh1982
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
標(biāo)簽： Multiplicative undirected Shortest measured
上傳時(shí)間： 2017-04-08
上傳用戶：邶刖
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
標(biāo)簽： optimizing different the shortest
上傳時(shí)間： 2014-10-25
上傳用戶：1159797854
Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the edges in each of the cycle discovered. Input will be the adjacency matrix preceded by a 0 or 1 representing Directed or Undirected graphs respectively.
標(biāo)簽： undirected Disjoint directed Cycles
上傳時(shí)間： 2017-04-08
上傳用戶：13188549192
Java Media APIs: Cross-Platform Imaging, Media, and Visualization presents integrated Java media solutions that demonstrate the best practices for using this diverse collection. According to Sun MicroSystems, "This set of APIs supports the integration of audio and video clips, animated presentations, 2D fonts, graphics, and images, as well as speech input/output and 3D models." By presenting each API in the context of its appropriate use within an integrated media application, the authors both illustrate the potential of the APIs and offer the architectural guidance necessary to build compelling programs.
標(biāo)簽： Media Java Cross-Platform Visualization
上傳時(shí)間： 2013-12-04
上傳用戶：hanli8870
full wave rectifierDuring the period from 偽 to 蟺, the input voltage vs input current is are positive and the power flows from supply to the load. The converter is said to be operated at rectification mode .During the period from 蟺 to 蟺+偽 , the input voltage vs is negative and the input current is is positive and reverse power flows from load to the supply. The converter is said to be operated in inversion mode. Depending on the value of 偽, average output voltage can be either positive or negative and hence provides 2 quadrant operation.
標(biāo)簽： input rectifierDuring the positive
上傳時(shí)間： 2017-04-10
上傳用戶：alan-ee
A combined space鈥搕ime block coding (STBC) and eigen-space tracking (EST) scheme in multiple-input-multiple-output systems is proposed. It is proved that the STBC-EST is capable of shifting hardware complexity from the receiver to the transmitter without any bit error rate (BER) performance loss. A computation efficient EST algorithm is also proposed, which makes the STBC-EST affordable. Simulation results show that the STBC-EST with a modest feedback requirement results in a negligible BER performance loss compared with a dual system configuration.
標(biāo)簽： multiple-input-m eigen-space combined tracking
上傳時(shí)間： 2014-01-13
上傳用戶：磊子226
The LM35 of National Semiconductors that is used in this project is a precision centigrade temperature sensor, which has an analog output voltage. It has a range of -55潞C to +150潞C and a accuracy of 鹵0.5潞C . The output voltage is 10mV/潞C . The output voltage is converted by the AD convertor of the AT Mega8. The temperature is displayed on an LCD module. In this example the thermometer has a range of 0潞C to 40潞C and a resolution of 0.5潞C. If you want to have a readout in Fahrenheit you can use the LM34.
標(biāo)簽： Semiconductors centigrade precision temperatu
上傳時(shí)間： 2017-04-16
上傳用戶：D&L37
pHash is an implementation of various perceptual hashing algorithms. A perceptual hash is a fingerprint of an audio, video, or image file that is mathematically based on the audio or visual content contained within. Unlike cryptographic hash functions that rely on the avalanche effect of small changes in input leading to drastic changes in the output, perceptual hashes are "close" to one another if the inputs are visually or auditorily similar. As a result, perceptual hashes must also be robust enough to take into account transformations that could have been performed on the input.
標(biāo)簽： perceptual implementation algorithms fingerpr
上傳時(shí)間： 2013-12-08
上傳用戶：星仔
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
