245 resultados para Digital channel
Resumo:
In a recent paper, Srinivasan et al (1980) have described a programmable digital signal averager with facility for programming the sampling period, number of channels and number of sweeps. We have examined this paper in some detail and find that some points need clarification.
Resumo:
Analogue and digital techniques for linearization of non-linear input-output relationship of transducers are briefly reviewed. The condition required for linearizing a non-linear function y = f(x) using a non-linear analogue-to-digital converter, is explained. A simple technique to construct a non-linear digital-to-analogue converter, based on ' segments of equal digital interval ' is described. The technique was used to build an N-DAC which can be employed in a successive approximation or counter-ramp type ADC to linearize the non-linear transfer function of a thermistor-resistor combination. The possibility of achieving an order of magnitude higher accuracy in the measurement of temperature is shown.
Resumo:
Color displays used in image processing systems consist of a refresh memory buffer storing digital image data which are converted into analog signals to display an image by driving the primary color channels (red, green, and blue) of a color television monitor. The color cathode ray tube (CRT) of the monitor is unable to reproduce colors exactly due to phosphor limitations, exponential luminance response of the tube to the applied signal, and limitations imposed by the digital-to-analog conversion. In this paper we describe some computer simulation studies (using the U*V*W* color space) carried out to measure these reproduction errors. Further, a procedure to correct for color reproduction error due to the exponential luminance response (gamma) of the picture tube is proposed, using a video-lookup-table and a higher resolution digital-to-analog converter. It is found, on the basis of computer simulation studies, that the proposed gamma correction scheme is effective and robust with respect to variations in the assumed value of the gamma.
Resumo:
Alamethicin and several related microbial polypeptides, which contain a high proportion of agr-aminoisobutyric acid (Aib) residues, possess the ability to modify the permeability properties of phospholipid bilayer membranes. Alamethicin induces excitability phenomena in model membranes and has served as an excellent model for the study of voltage sensitive transmembrane channels. This review summarizes various aspects of the structural chemistry and membrane modifying properties of alamethicin and related Alb containing peptides. The presence of Aib residues in these sequences, constrains the polypeptides to 310 or agr-helical conformations. Functional membrane channels are formed by aggregation of cylindrical peptide helices, which span the lipid bilayer, forming a scaffolding for an aqueous column across the membrane. After consideration of the available data on the conductance characteristics of alamethicin channels, a working, hypothesis for a channel model is outlined. Channel aggregates in the lipid phase may be stabilized by intermolecular hydrogen bonding, involving a central glutamine residue and also by interactions between the macro-dipoles of proximate peptide helices. Fluctuations between different conductance states are rationalized by transitions between states of different aggregation and hence altered dimensions of the aqueous core or by changes in net dipole moment of the aggregate. Ion fluxes through the channel may also be affected by the electric field within the aqueous core.
Resumo:
The suzukacillin fragments, Boc-Ala-Aib-Aib-Gln-Aib-Leu-Aib-Gly-Leu-Aib-Pro-Val-Aib-Aib-OMe (14), Boc-Ala-Aib-Ala-Aib-Aib-Gln-Aib-Leu-Aib-Gly-Leu-Aib-Pro-Val-Aib-Aib-OMe (16G) and the completely apolar 16-residue peptide in which the glutamine residue has been replaced by alanine (16A) have been studied by 270 MHz 1H-HMR, in C2HCl3 and (C2H3)2SO solution. Intramolecularly hydrogen-bonded NH groups have been identified by temperature and solvent dependence of chemical shifts. Peptides 14 and 16A adopt folded 310 helical conformations stabilized by 11 and 13 hydrogen bonds, respectively. In peptide 16G there are 12 intramolecular hydrogen bonds, with the glycine NH being solvent-exposed, in contrast to 14 and 16A.
Resumo:
We discuss micro ring resonator based optical logic gates using Kerr-type nonlinearity. Resonant wavelength selectivity is one key factor in achieving the desired gate. Based on basic gates like AND gate, OR gate etc. We proceed to propose a 3-bit binary adder circuit.Due to the presence of more than a single wavelength, the system gets complicated as we increase the number of components in the circuit. Hence it has been observed that for efficient designing and functioning of digital circuits in optical domain, we need a device which can give single wavelength output, filtering out all other wavelengths and at the same time preserve the digital characteristics of the output. We propose such filter-preserver device based on micro ring resonator.
Resumo:
The crystal structures of three pentapeptide fragments of suzukacillin-A have been determined. Boc-Aib-Pro-Val-Aib-Val-OMe (peptide 1–5) adopts a distorted helical conformation, stabilized by three intramolecular hydrogen bonds (two 5→1, one 4→1). Boc-Ala-Aib-Ala-Aib-Aib-OMe (peptide 6–10) and Boc-Leu-Aib-Pro-Val-Aib-OMe (peptide 16–20) adopt 310 helical structures stabilized by three and two 4→1 intramolecular hydrogen bonds, respectively. These structures provide substantial support for a largely helical conformation for the suzukacillin membrane channel.
Resumo:
For the quasi-static, Rayleigh-fading multiple-input multiple-output (MIMO) channel with n(t) transmit and n(r) receive antennas, Zheng and Tse showed that there exists a fundamental tradeoff between diversity and spatial-multiplexing gains, referred to as the diversity-multiplexing gain (D-MG) tradeoff. Subsequently, El Gamal, Caire, and Damen considered signaling across the same channel using an L-round automatic retransmission request (ARQ) protocol that assumes the presence of a noiseless feedback channel capable of conveying one bit of information per use of the feedback channel. They showed that given a fixed number L of ARQ rounds and no power control, there is a tradeoff between diversity and multiplexing gains, termed the diversity-multiplexing-delay (DMD) tradeoff. This tradeoff indicates that the diversity gain under the ARQ scheme for a particular information rate is considerably larger than that obtainable in the absence of feedback. In this paper, a set of sufficient conditions under which a space-time (ST) code will achieve the DMD tradeoff is presented. This is followed by two classes of explicit constructions of ST codes which meet these conditions. Constructions belonging to the first class achieve minimum delay and apply to a broad class of fading channels whenever n(r) >= n(t) and either L/n(t) or n(t)kslashL. The second class of constructions do not achieve minimum delay, but do achieve the DMD tradeoff of the fading channel for all statistical descriptions of the channel and for all values of the parameters n(r,) n(t,) L.
Resumo:
In this paper we address the problem of transmission of correlated sources over a fading multiple access channel (MAC). We provide sufficient conditions for transmission with given distortions. Next these conditions are specialized to a Gaussian MAC (GMAC). Transmission schemes for discrete and Gaussian sources over a fading GMAC are considered. Various power allocation strategies are also compared.
Resumo:
A channel router is an important design aid in the design automation of VLSI circuit layout. Many algorithms have been developed based on various wiring models with routing done on two layers. With the recent advances in VLSI process technology, it is possible to have three independent layers for interconnection. In this paper two algorithms are presented for three-layer channel routing. The first assumes a very simple wiring model. This enables the routing problem to be solved optimally in a time of O(n log n). The second algorithm is for a different wiring model and has an upper bound of O(n2) for its execution time. It uses fewer horizontal tracks than the first algorithm. For the second model the channel width is not bounded by the channel density.
Resumo:
Bread undergoes several physicochemical changes during storage that results in a rapid loss of freshness. These changes depend on moisture content present in bread product. An instrument based on electrical impedance spectroscopy technique is developed to estimate moisture content of bread at different zones using designed multi-channel ring electrodes. A dedicated AT89S52 microcontroller and associated peripherals are employed for hardware. A constant current is applied across bread loaf through central pair of electrodes and developed potential across different zones of bread loaf are measured using remaining four ring electrode pairs. These measured values of voltage and current are used to measure the impedance at each zone. Electrical impedance behavior of the bread loaf at crust and crumb is investigated during storage. A linear relationship is observed between the measured impedance and moisture content present in crust and crumb of bread loaf during storage of 120 hours.
Resumo:
A new digital polynomial generator using the principle of dual-slope analogue-to-digital conversion is proposed. Techniques for realizing a wide range of integer as well as fractional coefficients to obtain the desired polynomial have been discussed. The suitability of realizing the proposed polynomial generator in integrated circuit form is also indicated.
Resumo:
This paper recasts the multiple data path assignment problem solved by Torng and Wilhelm by the dynamic programming method [1] into a minimal covering problem following a switching theoretic approach. The concept of bus compatibility for the data transfers is used to obtain the various ways of interconnecting the circuit modules with the minimum number of buses that allow concurrent data transfers. These have been called the feasible solutions of the problem. The minimal cost solutions are obtained by assigning weights to the bus-compatible sets present in the feasible solutions. Minimization of the cost of the solution by increasing the number of buses is also discussed.
Resumo:
This paper recasts the multiple data path assignment problem solved by Torng and Wilhelm by the dynamic programming method [1] into a minimal covering problem following a switching theoretic approach. The concept of bus compatibility for the data transfers is used to obtain the various ways of interconnecting the circuit modules with the minimum number of buses that allow concurrent data transfers. These have been called the feasible solutions of the problem. The minimal cost solutions are obtained by assigning weights to the bus-compatible sets present in the feasible solutions. Minimization of the cost of the solution by increasing the number of buses is also discussed.