992 resultados para modulation bandwidth


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Large external memory bandwidth requirement leads to increased system power dissipation and cost in video coding application. Majority of the external memory traffic in video encoder is due to reference data accesses. We describe a lossy reference frame compression technique that can be used in video coding with minimal impact on quality while significantly reducing power and bandwidth requirement. The low cost transformless compression technique uses lossy reference for motion estimation to reduce memory traffic, and lossless reference for motion compensation (MC) to avoid drift. Thus, it is compatible with all existing video standards. We calculate the quantization error bound and show that by storing quantization error separately, bandwidth overhead due to MC can be reduced significantly. The technique meets key requirements specific to the video encode application. 24-39% reduction in peak bandwidth and 23-31% reduction in total average power consumption are observed for IBBP sequences.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Adult rat Leydig cells in culture synthesize and secrete riboflavin carrier protein (RCP) as demonstrated by [S-35]-methionine incorporation into newly synthesized proteins followed by immunoprecipitation as well as specific radioimmunoassay. LH stimulates the secretion of RCP 4-fold which could be inhibited upto 75% by an aromatase inhibitor. 8-bromo-cyclic AMP and cholera toxin could mimic the LH stimulated secretion of the carrier protein. The extent of stimulation of RCP secretion brought about by exogenous estradiol-17 beta is comparable to that of LH. The antiestrogen tamoxifen, when added along with either LH or estrogen, inhibited the stimulated levels significantly. These results show that the estrogen-inducible riboflavin carrier is secreted by Leydig cells under positive regulation of LH.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Four new vesicle-forming bolaphile/amphiphile ion pairs are synthesized; the bolaphile shapes in such hybrid systems strongly control their vesicular properties.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The technique of space vector pulsewidth modulation (SVM) is reviewed. The basic principle of SVM is derived and is compared with sine-triangle PWM. Operation in the overmodulation range is explained. Extension of SVM to other inverter-motor combinations such as three level inverters and split phase motors are discussed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Triplet lifetimes have been determined for the diastereomers of a broad set of butane-l,4-dione derivatives (1-3). A remarkable dependence of lifetimes on conformational preferences is revealed in that the lifetimes are shorter for the meso diastereomers of 1-3 than those for the racemic ones. The intramolecular beta-phenyl quenching is promoted in the case of meso diastereomers by virtue of the gauche relationship between the excited carbonyl group and the beta-aryl ring, while a distal arrangement in the lowest energy conformation (H-anti) in racemic diastereomers prevents such a deactivation. The involvement of charge transfer in the intramolecular beta-phenyl quenching is suggested by the correlation of the triplet lifetimes of the meso diastereomers of compounds 2 with the nature of the substituent on the beta-phenyl rings. In the case of racemic diastereomers, beta-methoxy substitution on the beta-phenyl ring (2-OCH3, 3-OCH3) also led to a decrease of the triplet lifetimes when compared to those of the nonsubstituted compounds (2-H, 3-H). This shortening is accounted for by the deactivation of a small proportion of the excited molecules through beta-phenyl quenching. In addition to the above factors, the lifetimes in the case of meso diastereomers can further be controlled by increasing the energy spacing between the T-1 and T-2 states, since beta-phenyl quenching occurs from the latter for compounds 2 and 3. Through a rational conformational control, a surprisingly long triplet lifetime (300 ns) has been measured for the first time for a purely n,pi* triplet-excited beta-phenylpropiophenone dimer (1-rac).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The integration of different wireless networks, such as GSM and WiFi, as a two-tier hybrid wireless network is more popular and economical. Efficient bandwidth management, call admission control strategies and mobility management are important issues in supporting multiple types of services with different bandwidth requirements in hybrid networks. In particular, bandwidth is a critical commodity because of the type of transactions supported by these hybrid networks, which may have varying bandwidth and time requirements. In this paper, we consider such a problem in a hybrid wireless network installed in a superstore environment and design a bandwidth management algorithm based on the priority level, classification of the incoming transactions. Our scheme uses a downlink transaction scheduling algorithm, which decides how to schedule the outgoing transactions based on their priority level with efficient use of available bandwidth. The transaction scheduling algorithm is used to maximize the number of transaction-executions. The proposed scheme is simulated in a superstore environment with multi Rooms. The performance results describe that the proposed scheme can considerably improve the bandwidth utilization by reducing transaction blocking and accommodating more essential transactions at the peak time of the business.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Two new classes of mono- and bis-D-pi-A cryptand derivatives with a flexible and a rigid cryptand core have been synthesized. The linear and nonlinear optical properties of these molecules are probed. The three dimensional cavity of the cryptand moiety has been utilized to modulate the SHG intensity to different extents in solution with metal ion inputs such as Ni-II,Cu-II,Zn-II, and Cd-II. We also report that decomplexation events can be used to reversibly modulate their NLO responses.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The temperature and power dependence of Fermi-edge singularity (FES) in high-density two-dimensional electron gas, specific to pseudomorphic AlxGa1-xAs/InyGa1-yAs/GaAs heterostructures is studied by photoluminescence (PL). In all these structures, there are two prominent transitions E11 and E21 considered to be the result of electron-hole recombination from first and second electron sub-bands with that of first heavy-hole sub-band. FES is observed approximately 5 -10 meV below the E21 transition. At 4.2 K, FES appears as a lower energy shoulder to the E21 transition. The PL intensity of all the three transitions E11, FES and E21 grows linearly with excitation power. However, we observe anomalous behavior of FES with temperature. While PL intensity of E11 and E21 decrease with increasing temperature, FES transition becomes stronger initially and then quenches-off slowly (till 40K). Though it appears as a distinct peak at about 20 K, its maximum is around 7 - 13 K.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.