叶轮机械多级叶轮网格生成程序介绍 侯 乐 毅 非定常流课题组 本文开发的叶轮机械多级叶轮网格生成程序，采用的网格类型为H型，并在叶片前面/后面延伸区域设置平直网格数ID1和IDN。主程序MESH_BLADE_STAGES，分成三个部分，原始叶型及控制参数从输入程序INPUT输入，求解程序为GRID(ZERO)，输出程序为OUTPUT。
上传时间： 2013-12-03
上传用户：bjgaofei
In this project we analyze and design the minimum mean-square error (MMSE) multiuser receiver for uniformly quantized synchronous code division multiple access (CDMA) signals in additive white Gaussian noise (AWGN) channels.This project is mainly based on the representation of uniform quantizer by gain plus additive noise model. Based on this model, we derive the weight vector and the output signal-to-interference ratio (SIR) of the MMSE receiver. The effects of quantization on the MMSE receiver performance is characterized in a single parameter named 鈥漞quivalent noise variance鈥? The optimal quantizer stepsize which maximizes the MMSE receiver output SNR is also determined.
标签： mean-square multiuser receiver project
上传时间： 2014-11-21
上传用户：ywqaxiwang
This Telecommunication Standard [TS] describes the detailed mapping from input blocks of 160 speech samples in 13-bit uniform PCM format to encoded blocks of 95, 103, 118, 134, 148, 159, 204, and 244 bits and from encoded blocks of 95, 103, 118, 134, 148, 159, 204, and 244 bits to output blocks of 160 reconstructed speech samples
标签： Telecommunication describes Standard detailed
上传时间： 2013-12-12
上传用户：cuibaigao
3rd Generation Partnership Project Technical Specification Group Radio Access Network Spatial channel model for Multiple Input Multiple Output [MIMO] simulations
标签： Specification Partnership Generation Technical
上传时间： 2014-01-11
上传用户：nanfeicui
This is a source of 13.560MHz RFID card reader for TRH031M as ATMEGA8-16AU MPU. The title is 3Alogics TRH031M 13.56MHz RFID Reader V1.0. project : RFID Reader V2.0 Target : MEGA8-16AU Crystal: 16.000 Mhz Input : TRH031M RFID 13.56MHz Output : RS232C 115200,N,8,1 Compiler : ICC-AVR V6.26C // Pin configuration for ATMEGA8-16AU TQFP32 // #30 RXD <--- RXD (SP3232) // #31 TXD ---> TXD (SP3232) // #32 PD2/INT0 <--- INTR (TRH031M) // # 1 PD3/INT1 ---> RST (TRH031M) // # 2 PD4 ---> D4 (TRH031M) // # 9 PD5 ---> D5 (TRH031M) // #10 PD6 ---> D6 (TRH031M) // #11 PD7 ---> D7 (TRH031M) // #12 PB0 ---> D0 (TRH031M) // #13 PB1 ---> D1 (TRH031M) // #14 PB2 ---> D2 (TRH031M) // #15 PB3 ---> D3 (TRH031M) // #16 PB4 ---> CSB (TRH031M) // #17 PB5 ---> LED // #23 PC0 ---> A0 (TRH031M) // #24 PC1 ---> A1 (TRH031M) // #25 PC2 ---> A2 (TRH031M) // #26 PC3 ---> ALE (TRH031M) // #27 PC4 ---> /RD (TRH031M) // #28 PC5 ---> /WR (TRH031M)
标签： 13.560 ATMEGA 3Alogi source
上传时间： 2017-03-31
上传用户：s363994250
DESCRIPTION The DCP0105 family is a series of high efficiency, 5V input isolated DC/DC converters. In addition to 1W nominal galvanically isolated output power capability, the range of DC/DCs are also fully synchronizable. The devices feature thermal shutdown, and overload protection is implemented via watchdog circuitry. Advanced power-on reset techniques give superior reset performance and the devices will start into any capacitive load up to full power output. The DCP0105 family is implemented in standard- molded IC packaging, giving outlines suitable for high volume assembly.
标签： DESCRIPTION efficiency converters isolated
上传时间： 2013-11-28
上传用户：CHENKAI
使用FPGA/CPLD设置语音AD、DA转换芯片AIC23，FPGA/CPLD系统时钟为24.576MHz 1、AIC系统时钟为12.288MHz，SPI时钟为6.144MHz 2、AIC处于主控模式 3、input bit length 16bit output bit length 16bit MSB first 4、帧同步在96KHz
上传时间： 2013-12-20
上传用户：二驱蚊器
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.
标签： fault-tolerant algorithms redundant underlyin
上传时间： 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.
标签： Multiplicative undirected Shortest measured
上传时间： 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.
标签： optimizing different the shortest
上传时间： 2014-10-25
上传用户：1159797854
