962 resultados para PCR Arrays
Resumo:
The limitations of classical diagnostic methods for invasive Candida infections have led to the development of molecular techniques such as real-time PCR to improve diagnosis. However, the detection of low titres of Candida DNA in blood from patients with candidaemia requires the use of extraction methods that efficiently lyse yeast cells and recover small amounts of DNA suitable for amplification. In this study, a Candida-specific real-time PCR assay was used to detect Candida albicans DNA in inoculated whole blood specimens extracted using seven different extraction protocols. The yield and quality of total nucleic acids were estimated using UV absorbance, and specific recovery of C. albicans genomic DNA was estimated quantitatively in comparison with a reference (Qiagen kit/lyticase) method currently in use in our laboratory. The extraction protocols were also compared with respect to sensitivity, cost and time required for completion. The TaqMan PCR assay used to amplify the DNA extracts achieved high levels of specificity, sensitivity and reproducibility. Of the seven extraction protocols evaluated, only the MasterPure yeast DNA extraction reagent kit gave significantly higher total nucleic acid yields than the reference method, although nucleic acid purity was highest using either the reference or YeaStar genomic DNA kit methods. More importantly, the YeaStar method enabled C. albicans DNA to be detected with highest sensitivity over the entire range of copy numbers evaluated, and appears to be an optimal method for extracting Candida DNA from whole blood.
Resumo:
In view of both the delay in obtaining identification by conventional methods following blood-culture positivity in patients with candidaemia and the close relationship between species and fluconazole (FLC) susceptibility, early speciation of positive blood cultures has the potential to influence therapeutic decisions. The aim was to develop a rapid test to differentiate FLC-resistant from FLC-sensitive Candida species. Three TaqMan-based real-time PCR assays were developed to identify up to six Candida species directly from BacT/Alert blood-culture bottles that showed yeast cells on Gram staining at the time of initial positivity. Target sequences in the rRNA gene complex were amplified, using a consensus two-step PCR protocol, to identify Candida albicans, Candida parapsilosis, Candida tropicalis, Candida dubliniensis, Candida glabrata and Candida krusei; these are the most commonly encountered Candida species in blood cultures. The first four of these (the characteristically FLC-sensitive group) were identified in a single reaction tube using one fluorescent TaqMan probe targeting 1 8S rRNA sequences conserved in the four species. The FLC-resistant species C. krusei and C. glabrata were detected in two further reactions, each with species-specific probes. This method was validated with clinical specimens (blood cultures) positive for yeast (n=33 sets) and the results were 100% concordant with those of phenotypic identification carried out concomitantly. The reported assay significantly reduces the time required to identify the presence of C. glabrata and C. krusei in comparison with a conventional phenotypic method, from ~72 to
Resumo:
We investigate the collective optomechanics of an ensemble of scatterers inside a Fabry-Pérot resonator and identify an optimized configuration where the ensemble is transmissive, in contrast to the usual reflective optomechanics approach. In this configuration, the optomechanical coupling of a specific collective mechanical mode can be several orders of magnitude larger than the single-element case, and long-range interactions can be generated between the different elements since light permeates throughout the array. This new regime should realistically allow for achieving strong single-photon optomechanical coupling with massive resonators, realizing hybrid quantum interfaces, and exploiting collective long-range interactions in arrays of atoms or mechanical oscillators.
Resumo:
The initial part of this paper reviews the early challenges (c 1980) in achieving real-time silicon implementations of DSP computations. In particular, it discusses research on application specific architectures, including bit level systolic circuits that led to important advances in achieving the DSP performance levels then required. These were many orders of magnitude greater than those achievable using programmable (including early DSP) processors, and were demonstrated through the design of commercial digital correlator and digital filter chips. As is discussed, an important challenge was the application of these concepts to recursive computations as occur, for example, in Infinite Impulse Response (IIR) filters. An important breakthrough was to show how fine grained pipelining can be used if arithmetic is performed most significant bit (msb) first. This can be achieved using redundant number systems, including carry-save arithmetic. This research and its practical benefits were again demonstrated through a number of novel IIR filter chip designs which at the time, exhibited performance much greater than previous solutions. The architectural insights gained coupled with the regular nature of many DSP and video processing computations also provided the foundation for new methods for the rapid design and synthesis of complex DSP System-on-Chip (SoC), Intellectual Property (IP) cores. This included the creation of a wide portfolio of commercial SoC video compression cores (MPEG2, MPEG4, H.264) for very high performance applications ranging from cell phones to High Definition TV (HDTV). The work provided the foundation for systematic methodologies, tools and design flows including high-level design optimizations based on "algorithmic engineering" and also led to the creation of the Abhainn tool environment for the design of complex heterogeneous DSP platforms comprising processors and multiple FPGAs. The paper concludes with a discussion of the problems faced by designers in developing complex DSP systems using current SoC technology. © 2007 Springer Science+Business Media, LLC.
Resumo:
The use of systolic arrays of 1-bit cells to implement a range of important signal processing functions is demonstrated. Two examples, a pipelined multiplier and a pipelined bit-slice transform circuit, are given. This approach has many important implications for silicon technology, and these are outlined.
Resumo:
Bit level systolic array structures for computing sums of products are studied in detail. It is shown that these can be sub-divided into two classes and that, within each class, architectures can be described in terms of a set of constraint equations. It is further demonstrated that high performance system level functions with attractive VLSI properties can be constructed by matching data flow geometries in bit level and word level architectures.
Resumo:
Bit-level systolic-array structures for computing sums of products are studied in detail. It is shown that these can be subdivided into two classes and that within each class architectures can be described in terms of a set of constraint equations. It is further demonstrated that high-performance system-level functions with attractive VLSI properties can be constructed by matching data-flow geometries in bit-level and word-level architectures.
Resumo:
A systolic array is an array of individual processing cells each of which has some local memory and is connected only to its nearest neighbours in the form of a regular lattice. On each cycle of a simple clock every cell receives data from its neighbouring cells and performs a specific processing operation on it. The resulting data is stored within the cell and passed on to neighbouring cells on the next clock cycle. This paper gives an overview of work to date and illustrates the application of bit-level systolic arrays by means of two examples: (1) a pipelined bit-slice circuit for computing matrix x vector transforms; and (2) a bit serial structure for multi-bit convolution.
Resumo:
The mapping of matrix multiplied by matrix multiplication onto both word and bit level systolic arrays has been investigated. It has been found that well defined word and bit level data flow constraints must be satisfied within such circuits. An efficient and highly regular bit level array has been generated by exploiting the basic compatibilities in data flow symmetries at each level of the problem. A description of the circuit which emerges is given and some details relating to its practical implementation are discussed.
Resumo:
The use of bit-level systolic array circuits as building blocks in the construction of larger word-level systolic systems is investigated. It is shown that the overall structure and detailed timing of such systems may be derived quite simply using the dependence graph and cut-set procedure developed by S. Y. Kung (1988). This provides an attractive and intuitive approach to the bit-level design of many VLSI signal processing components. The technique can be applied to ripple-through and partly pipelined circuits as well as fully systolic designs. It therefore provides a means of examining the relative tradeoff between levels of pipelining, chip area, power consumption, and throughput rate within a given VLSI design.
Resumo:
A bit-level systolic array system for performing a binary tree vector quantization (VQ) codebook search is described. This is based on a highly regular VLSI building block circuit. The system in question exhibits a very high data rate suitable for a range of real-time applications. A technique is described which reduces the storage requirements of such a system by 50%, with a corresponding decrease in hardware complexity.
Resumo:
This paper describes the design and the architecture of a bit-level systolic array processor. The bit-level systolic array described is directly applicable to a wide range of image processing operations where high performance and throughput are essential. The architecture is illustrated by describing the operation of the correlator and convolver chips which are being developed. The advantage of the system is also discussed.
Resumo:
A novel bit-level systolic array architecture for implementing IIR (infinite-impulse response) filter sections is presented. A first-order section achieves a latency of only two clock cycles by using a radix-2 redundant number representation, performing the recursive computation most significant digit first, and feeding back each digit of the result as soon as it is available. The design is extended to produce a building block from which second- and higher-order sections can be connected.