基于石英挠性加速度计A/D与I/F数据采集系统的对比研究

为满足对寻北仪导航系统中加速度计采集数据的高精度要求,提出了基于石英挠性加速度计的A/D采集系统与I/F数据采集系统的对比研究;系统采用了高精度A/D转换芯片AD7693和V/F高精度转换芯片LM331分别对石英挠性加速度计采集的数据进行处理转换,以FPGA芯片XC7Z020为逻辑控制核心对转换的数据进行编帧处理,通过RS232总线将处理的数据发送到上位机;测试结果表明,在相同条件下,I/F采集系统转换的精度99.99％优于A/D采集系统转换的精度98.7％;短时间内,I/F采集系统采集的数据变化不大,A/D采集系统采集的数据变化大,所以I/F采集系统稳定性更好.     

MCS-51单片机实现16位A/D转换的简易方法

<正> MCS-51单片机已广泛应用于各个领域,尤其是应用在智能仪器仪表中。然而,高精度的智能仪表往往需要高精度的A/D 转换,但目前采用16位A/D 转换电路的仪表却不多。原因是成本高、硬件开销大,有的占用单片机I/O 口多,甚至要扩展I/O 口才能完成A/D 转换功能。如果能解决16位A/D 转换电路的成     

ADμC812芯片实践中几点注意

ADμC812是美国ADI公司一款十分优秀的数据采集芯片,它将12位A/D转换器和8051单片机内核集成在一起,另外配有UART串行I/O,I2C兼容和SPI串行I/O,看门狗定时器和电源监视器,构成一个完整的数据采集系统。它的高性能和高集成度,使数据采集系统实现高性能、微型化,十分富有竞争力。     

基于S3C44BO的糖厂pH值控制器的设计

介绍了一种基于ARM7微处理器S3C4480的pH值控制器的构成,包括CPLD(Complex Programmable Logical Device)芯片EPM7128S、A/D转换芯片AD7874以及D/A转换芯片DAC8420等接口芯片的软硬件设计.通过EPM7128S的多电压I/0接口,不仅解决了微处理器I/O的扩展问题,同时还解决了微处理器I/O输出电平与外设驱动电平不匹配问题.     

一种多通道自动扫描A/D转换模块的设计

A/D转换模块用于扩展CompactPCI计算机系统的数据采集功能;该模块通过CompactPCI总线与主机通讯,通过AD7612实现750ksps、16Bit的模拟/数字转换,完成数据采集功能;在设计上采用CPLD、FIFO和RAM实现多通道的自动扫描,提高了模块数据采集的智能化设计;采用磁隔离器件实现A/D转换的数据和控制信号的隔离,提高了数据采集的精度;该模块已经在产品上应用,性能稳定。     

基于FPGA的A/D转换采集控制模块设计

采用FPGA器件EP1C3T144C8N处理器,对A/D转换芯片AD7714进行采样控制.整个设计在Quartus I平台下进行软件编程,采用Verilog语言描述,实现正确的AD7714转换的工作时序控制过程,并将采样的数据存储起来进行处理.本设计可用于微弱信号采集和实时监控方面,仿真结果显示该模块工作性能稳定、可靠性高、使用方便.     

高速A/D数据采集的SOPC设计

本论文对高速 A/D 数据采集的 SOPC 系统进行了设计。本设计以美国模拟器件公司的高速 AD 芯片 AD9433为转换芯片,在 Stratix EP2S180 DSP 开发板上进行设计。AD9433直接从信号源采集一个模拟信号转换为12位数据。软件设计中对采集到的数据原封不动地从 DAC904数模转换器输出,从而可以得出输入输出的波形完全一致。     

基于McBSP实现DSPs与串行AD/DA的接口设计

重点介绍了利用DSPs的多通道缓冲串口McBSP实现与A/D、D/A串行接口的设计.TI公司TMS320C67x系列DSPs的McBSP有两种配置方式,一种是配置成串口的模式,一种是配置成通用I/O的模式,本文分别用这两种模式进行了A/D和D/A接口的设计,其硬件及软件的实现方法简单、方便,可节省程序代码空间和CPU运行时间.     

可测上升流的海流传感器系统设计

针对上升流引起的微弱信号在A/D转换前容易被传感器系统噪声所淹没的问题,将滤波、放大和A/D转换电路采用集成芯片AD7195处理,减少分立器件噪声,AD7195芯片内部集成差分放大器、交流激励和数字滤波器,同时具有24位高精度A/D转换功能.通过搭建实验装置,采集数据和分析,测试了系统准确度.实验结果表明:该系统能够识别输入信号的误差为±0.4μV,满足设计要求.     

基于单片机I/O口实现A/D转换方法

引言 在某些特定的场合（主要是在数字电子应用方面）,需要一个模拟信号输入来进行一些基本模拟量的测量,或者是提供可控的方式使用外部电位器。像这样的需求,由一个内置A/D（模/数）转换器的单片机就能很好地实现;当然,也可以使用一些经济的外部器件,由一个标准的数字I／O口来实现简单的A／D转换功能。     

M/G/c/K blocking probability models and system performance

An exact solution for the M/G/c/K model is only possible for special cases, such as exponential service, a single server, or no waiting room at all. Instead of basing the approximation on an infinite capacity queue as is often the case, an approximation based on a closed-form expression derivable from the finite capacity exponential queue is presented. Properties of the closed-form expression along with its use in approximating the blocking probability of M/G/c/K systems are discussed. Extensive experiments are provided to test and verify the efficacy of our approximate results.     

设计模式变体的描述与验证*

为解决标准设计模式演化后难以检测的问题,引入设计模式变体思想,以Bridge模式为例,给出了八种常用的变体实现,并以人工形式挖掘了四种开源系统中Bridge模式变体的基准数,接着在Apache Ant1.6.2与JHotDraw5.1开源系统中通过六种主流设计模式检测工具进行了变体检测实验。试验结果表明,FCA-CBR方法简单有效,对2种开源系统中Bridge模式变体检测的精确率达到60%与48.1%,与先前方法相比有了较大的提高。     

(r∞, n12, s12) measurements on the 2-CPU CRAY X-MP

We report performance measurements made on the 2-CPU CRAY X-MP at ECMWF, Reading. Vector (SIMD) performance on one CPU is interpreted by the two parameters ($\text{r}{}_{\mathrm{\infty }}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$), and we find for dyadic operations using FORTRAN $\text{r}{}_{\mathrm{\infty }}\text{= 70}\text{Mflop/s}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 53}\text{flop}$. All vector triadic operations produce $\text{r}{}_{\mathrm{\infty }}\text{= 107}\text{Mflop/s}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 45}\text{flop}$; and a triadic operation with two vectors and one scalar gives r_∞ = 148 Mflop/s and $\text{n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 60}\text{flop}$. MIMD performance using both CPUs on one job is interpreted with the two parameters ($\text{r}{}_{\mathrm{\infty }}\text{, s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$), where $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ is the amount of arithmetic that could have been done during the time taken to synchronize the two CPUs. We find, for dyadic operations using the TSKSTART and TSKWAIT synchronization primitives, that r_∞ = 130 Mflop/s and $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 5700}\text{flop}$. This means that a job must contain more than ～ 6000 floating-point operations if it is to run at more than 50% of the maximum performance when split between both CPUs by this method. Less expensive synchronization methods using LOCKS and EVENTS reduces $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ to 4000 flop and 2000 flop respectively. A simplified form of LOCK synchronization written in CAL code further reduces $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ to 220 flop. This is probably the minimum possible value for synchronization overhead on the CRAY X-MP.     

Complex random sample scheduling and its application to an N/M/F/Fmax problem

“Complex Random Sample Scheduling(CRSS)” was proposed in this paper as an efficient heuristic method for solving any permutation scheduling problems. To show the effectiveness of the proposed CRSS, it was applied to an N-job, M-machine, permutation flowshop scheduling problem to minimize makespan, N/M/F/F_max. Numerical experiments made it clear that the proposed CRSS provides a schedule very close to the near-optimal schedule obtained by the existing promising heuristic methods such as taboo search and simulated annealing, within less computation time than these heuristic methods.     

On the M/Ck/1 queue

We obtain the exact analytic expression of the probability distribution of the number of units in a single server queue with Poisson arrivals and Coxian service time distribution (notated as M/C_k/1). A recursive procedure for calculating this probability distribution is given. The well-known queues M/E_k/1 and M/D/1 are re-derived as special cases of the M/C_k/1 queue. Finally, the cases of M/C₂/1 and M/C₃/1 are fully worked out.     

Geom/G/1/n system with LIFO discipline without interrupts and constrained total amount of customers

Consideration was given to the discrete-time queuing system with inversive servicing without interrupts, second-order geometrical arrivals, arbitrary (discrete) distribution of the customer length, and finite buffer. Each arriving customer has length and random volume. The total volume of the customers sojourning in the system is bounded by some value. Formulas of the stationary state probabilities and stationary distribution of the time of customer sojourn in the system were established.     

Properties and performance modelling of finite buffer M/G/1/K networks

Finite buffer, single-server queueing systems and networks are difficult to analyze since the length of time a customer spends in the system does not follow the Markovian property. A two-moment approximation schema is developed for the probability distribution of M/G/1/K systems and extended to the analysis of M/G/1/K   queueing networks. The general purpose of this paper is to develop a flexible and practical transform-free approach for computing the probability distribution and performance measures of the system as well as identify the underlying properties of these systems. It is shown that for most performance measures, a sigmoid or S-shaped curve with an inflection point at ρ=1$\rho =1$ appears as K→∞$K\to \infty$. This has direct implications for the analysis and optimization of such systems. The performance modelling of the M/G/1/K queueing networks of general topologies along with extensive numerical results accompany the paper along with the linear concave performance measures for these systems.     

Efficient implementation of Johnson''s rule for the n/2/F/Fmax scheduling problem

Several efficient algorithms of O(n log n) computational complexity, for the Johnson's rule to schedule a set of simultaneously available jobs on two machines in a flowship to minimize the maximum job flowtime have appeared in the literature. A modified version of one of these algorithms is presented which not only simplifies the programming effort for implementation but is also able to generate all possible optimal sequences obtainable from Johnson's rule.     

Intuitionistic fuzzy Hv-submodules

After the introduction of fuzzy sets by Zadeh, there have been a number of generalizations of this fundamental concept. The notion of intuitionistic fuzzy sets introduced by Atanassov is one among them. In this paper, we apply the concept of an intuitionistic fuzzy set to H_v-modules. The notion of an intuitionistic fuzzy H_v-submodule of an H_v-module is introduced, and some related properties are investigated. Characterizations of intuitionistic fuzzy H_v-submodules are given.