40 resultados para Compact arrays
Resumo:
Indoor localization systems in nowadays is a huge area of interest not only at academic but also at industry and commercial level. The correct location in these systems is strongly influenced by antennas performance which can provide several gains, bandwidths, polarizations and radiation patterns, due to large variety of antennas types and formats. This paper presents the design, manufacture and measurement of a compact microstrip antenna, for a 2.4 GHZ frequency band, enhanced with the use of Electromagnetic Band-Gap (EBG) structures, which improve the electromagnetic behavior of the conventional antennas. The microstrip antenna with an EBG structure integrated allows an improvement of the location system performance in about 25% to 30% relatively to a conventional microstrip antenna.
Resumo:
Toxic amides, such as acrylamide, are potentially harmful to Human health, so there is great interest in the fabrication of compact and economical devices to measure their concentration in food products and effluents. The CHEmically Modified Field Effect Transistor (CHEMFET) based onamorphous silicon technology is a candidate for this type of application due to its low fabrication cost. In this article we have used a semi-empirical modelof the device to predict its performance in a solution of interfering ions. The actual semiconductor unit of the sensor was fabricated by the PECVD technique in the top gate configuration. The CHEMFET simulation was performed based on the experimental current voltage curves of the semiconductor unit and on an empirical model of the polymeric membrane. Results presented here are useful for selection and design of CHEMFET membranes and provide an idea of the limitations of the amorphous CHEMFET device. In addition to the economical advantage, the small size of this prototype means it is appropriate for in situ operation and integration in a sensor array.
Resumo:
There exist striking analogies in the behaviour of eigenvalues of Hermitian compact operators, singular values of compact operators and invariant factors of homomorphisms of modules over principal ideal domains, namely diagonalization theorems, interlacing inequalities and Courant-Fischer type formulae. Carlson and Sa [D. Carlson and E.M. Sa, Generalized minimax and interlacing inequalities, Linear Multilinear Algebra 15 (1984) pp. 77-103.] introduced an abstract structure, the s-space, where they proved unified versions of these theorems in the finite-dimensional case. We show that this unification can be done using modular lattices with Goldie dimension, which have a natural structure of s-space in the finite-dimensional case, and extend the unification to the countable-dimensional case.
Resumo:
We report the fabrication of planar sub-micron gratings in silicon with a period of 720 nm using a modified Michelson interferometer and femtosecond laser radiation. The gratings consist of alternated stripes of laser ablated and unmodified material. Ablated stripes are bordered by parallel ridges which protrude above the unmodified material. In the regions where ridges are formed, the laser radiation intensity is not sufficient to cause ablation. Nevertheless, melting and a significant temperature increase are expected, and ridges may be formed due to expansion of silicon during resolidification or silicon oxidation. These conclusions are consistent with the evolution of the stripes morphology as a function of the distance from the center of the grating. (C) 2013 Elsevier Ltd. All rights reserved.
Resumo:
The cytosolic chaperonin CCT is a heterooligomeric complex of about 900 kDa that mediates the folding of cytoskeletal proteins. We observed by indirect immunofluorescence that the Tetrahymena TpCCTalpha, TpCCTdelta, TpCCTepsilon, and TpCCTeta-subunits colocalize with tubulin in cilia, basal bodies, oral apparatus, and contractile vacuole pores. TpCCT-subunits localization was affected during reciliation. These findings combined with atomic force microscopy measurements in reciliating cells indicate that these proteins play a role during cilia biogenesis related to microtubule nucleation, tubulin transport, and/or axoneme assembly. The TpCCT-subunits were also found to be associated with cortex and cytoplasmic microtubules suggesting that they can act as microtubule-associated proteins. The TpCCTdelta being the only subunit found associated with the macronuclear envelope indicates that it has functions outside of the 900 kDa complex. Tetrahymena cytoplasm contains granular/globular-structures of TpCCT-subunits in close association with microtubule arrays. Studies of reciliation and with cycloheximide suggest that these structures may be sites of translation and folding. Combined biochemical techniques revealed that reciliation affects the oligomeric state of TpCCT-subunits being tubulin preferentially associated with smaller CCT oligomeric species in early stages of reciliation. Collectively, these findings indicate that the oligomeric state of CCT-subunits reflects the translation capacity of the cell and microtubules integrity.
Resumo:
Dissertação para a obtenção do grau de Mestre em Engenharia Electrotécnica Ramo de Automação e Electrónica Industrial
Resumo:
Dissertação para obtenção do grau de Mestre em Engenharia Electrotécnica Ramo de Automação e Electrónica Industrial
Resumo:
Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Electrónica e Telecomunicações
Resumo:
Mestrado em Fisioterapia
Resumo:
Dissertação para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização em Vias de Comunicação e Transportes
Resumo:
This paper proposes an efficient scalable Residue Number System (RNS) architecture supporting moduli sets with an arbitrary number of channels, allowing to achieve larger dynamic range and a higher level of parallelism. The proposed architecture allows the forward and reverse RNS conversion, by reusing the arithmetic channel units. The arithmetic operations supported at the channel level include addition, subtraction, and multiplication with accumulation capability. For the reverse conversion two algorithms are considered, one based on the Chinese Remainder Theorem and the other one on Mixed-Radix-Conversion, leading to implementations optimized for delay and required circuit area. With the proposed architecture a complete and compact RNS platform is achieved. Experimental results suggest gains of 17 % in the delay in the arithmetic operations, with an area reduction of 23 % regarding the RNS state of the art. When compared with a binary system the proposed architecture allows to perform the same computation 20 times faster alongside with only 10 % of the circuit area resources.
Resumo:
In visual sensor networks, local feature descriptors can be computed at the sensing nodes, which work collaboratively on the data obtained to make an efficient visual analysis. In fact, with a minimal amount of computational effort, the detection and extraction of local features, such as binary descriptors, can provide a reliable and compact image representation. In this paper, it is proposed to extract and code binary descriptors to meet the energy and bandwidth constraints at each sensing node. The major contribution is a binary descriptor coding technique that exploits the correlation using two different coding modes: Intra, which exploits the correlation between the elements that compose a descriptor; and Inter, which exploits the correlation between descriptors of the same image. The experimental results show bitrate savings up to 35% without any impact in the performance efficiency of the image retrieval task. © 2014 EURASIP.
Resumo:
This paper presents a single precision floating point arithmetic unit with support for multiplication, addition, fused multiply-add, reciprocal, square-root and inverse squareroot with high-performance and low resource usage. The design uses a piecewise 2nd order polynomial approximation to implement reciprocal, square-root and inverse square-root. The unit can be configured with any number of operations and is capable to calculate any function with a throughput of one operation per cycle. The floatingpoint multiplier of the unit is also used to implement the polynomial approximation and the fused multiply-add operation. We have compared our implementation with other state-of-the-art proposals, including the Xilinx Core-Gen operators, and conclude that the approach has a high relative performance/area efficiency. © 2014 Technical University of Munich (TUM).
Resumo:
Wireless communications are widely used for various applications, requiring antennas with different features. Often, to achieve the desired radiation pattern, is necessary to employ antenna arrays, using non-uniform excitation on its elements. Power dividers can be used and the best known are the T-junction and the Wilkinson power divider, whose main advantage is the isolation between output ports. In this paper the impact of this isolation on the overall performance of a circularly polarized planar antenna array using non-uniform excitation is investigated. Results show a huge decrease of the array bandwidths either in terms of return loss or in polarization, without resistors. © 2014 IEEE.
Resumo:
Floating-point computing with more than one TFLOP of peak performance is already a reality in recent Field-Programmable Gate Arrays (FPGA). General-Purpose Graphics Processing Units (GPGPU) and recent many-core CPUs have also taken advantage of the recent technological innovations in integrated circuit (IC) design and had also dramatically improved their peak performances. In this paper, we compare the trends of these computing architectures for high-performance computing and survey these platforms in the execution of algorithms belonging to different scientific application domains. Trends in peak performance, power consumption and sustained performances, for particular applications, show that FPGAs are increasing the gap to GPUs and many-core CPUs moving them away from high-performance computing with intensive floating-point calculations. FPGAs become competitive for custom floating-point or fixed-point representations, for smaller input sizes of certain algorithms, for combinational logic problems and parallel map-reduce problems. © 2014 Technical University of Munich (TUM).