26 resultados para Systems and data security
em Indian Institute of Science - Bangalore - Índia
Resumo:
A common and practical paradigm in cooperative communications is the use of a dynamically selected 'best' relay to decode and forward information from a source to a destination. Such a system consists of two core phases: a relay selection phase, in which the system expends resources to select the best relay, and a data transmission phase, in which it uses the selected relay to forward data to the destination. In this paper, we study and optimize the trade-off between the selection and data transmission phase durations. We derive closed-form expressions for the overall throughput of a non-adaptive system that includes the selection phase overhead, and then optimize the selection and data transmission phase durations. Corresponding results are also derived for an adaptive system in which the relays can vary their transmission rates. Our results show that the optimal selection phase overhead can be significant even for fast selection algorithms. Furthermore, the optimal selection phase duration depends on the number of relays and whether adaptation is used.
Resumo:
It is well known that the impulse response of a wide-band wireless channel is approximately sparse, in the sense that it has a small number of significant components relative to the channel delay spread. In this paper, we consider the estimation of the unknown channel coefficients and its support in OFDM systems using a sparse Bayesian learning (SBL) framework for exact inference. In a quasi-static, block-fading scenario, we employ the SBL algorithm for channel estimation and propose a joint SBL (J-SBL) and a low-complexity recursive J-SBL algorithm for joint channel estimation and data detection. In a time-varying scenario, we use a first-order autoregressive model for the wireless channel and propose a novel, recursive, low-complexity Kalman filtering-based SBL (KSBL) algorithm for channel estimation. We generalize the KSBL algorithm to obtain the recursive joint KSBL algorithm that performs joint channel estimation and data detection. Our algorithms can efficiently recover a group of approximately sparse vectors even when the measurement matrix is partially unknown due to the presence of unknown data symbols. Moreover, the algorithms can fully exploit the correlation structure in the multiple measurements. Monte Carlo simulations illustrate the efficacy of the proposed techniques in terms of the mean-square error and bit error rate performance.
Resumo:
The impulse response of wireless channels between the N-t transmit and N-r receive antennas of a MIMO-OFDM system are group approximately sparse (ga-sparse), i.e., NtNt the channels have a small number of significant paths relative to the channel delay spread and the time-lags of the significant paths between transmit and receive antenna pairs coincide. Often, wireless channels are also group approximately cluster-sparse (gac-sparse), i.e., every ga-sparse channel consists of clusters, where a few clusters have all strong components while most clusters have all weak components. In this paper, we cast the problem of estimating the ga-sparse and gac-sparse block-fading and time-varying channels in the sparse Bayesian learning (SBL) framework and propose a bouquet of novel algorithms for pilot-based channel estimation, and joint channel estimation and data detection, in MIMO-OFDM systems. The proposed algorithms are capable of estimating the sparse wireless channels even when the measurement matrix is only partially known. Further, we employ a first-order autoregressive modeling of the temporal variation of the ga-sparse and gac-sparse channels and propose a recursive Kalman filtering and smoothing (KFS) technique for joint channel estimation, tracking, and data detection. We also propose novel, parallel-implementation based, low-complexity techniques for estimating gac-sparse channels. Monte Carlo simulations illustrate the benefit of exploiting the gac-sparse structure in the wireless channel in terms of the mean square error (MSE) and coded bit error rate (BER) performance.
Resumo:
The problem of time variant reliability analysis of existing structures subjected to stationary random dynamic excitations is considered. The study assumes that samples of dynamic response of the structure, under the action of external excitations, have been measured at a set of sparse points on the structure. The utilization of these measurements m in updating reliability models, postulated prior to making any measurements, is considered. This is achieved by using dynamic state estimation methods which combine results from Markov process theory and Bayes' theorem. The uncertainties present in measurements as well as in the postulated model for the structural behaviour are accounted for. The samples of external excitations are taken to emanate from known stochastic models and allowance is made for ability (or lack of it) to measure the applied excitations. The future reliability of the structure is modeled using expected structural response conditioned on all the measurements made. This expected response is shown to have a time varying mean and a random component that can be treated as being weakly stationary. For linear systems, an approximate analytical solution for the problem of reliability model updating is obtained by combining theories of discrete Kalman filter and level crossing statistics. For the case of nonlinear systems, the problem is tackled by combining particle filtering strategies with data based extreme value analysis. In all these studies, the governing stochastic differential equations are discretized using the strong forms of Ito-Taylor's discretization schemes. The possibility of using conditional simulation strategies, when applied external actions are measured, is also considered. The proposed procedures are exemplifiedmby considering the reliability analysis of a few low-dimensional dynamical systems based on synthetically generated measurement data. The performance of the procedures developed is also assessed based on a limited amount of pertinent Monte Carlo simulations. (C) 2010 Elsevier Ltd. All rights reserved.
Resumo:
The impulse response of a typical wireless multipath channel can be modeled as a tapped delay line filter whose non-zero components are sparse relative to the channel delay spread. In this paper, a novel method of estimating such sparse multipath fading channels for OFDM systems is explored. In particular, Sparse Bayesian Learning (SBL) techniques are applied to jointly estimate the sparse channel and its second order statistics, and a new Bayesian Cramer-Rao bound is derived for the SBL algorithm. Further, in the context of OFDM channel estimation, an enhancement to the SBL algorithm is proposed, which uses an Expectation Maximization (EM) framework to jointly estimate the sparse channel, unknown data symbols and the second order statistics of the channel. The EM-SBL algorithm is able to recover the support as well as the channel taps more efficiently, and/or using fewer pilot symbols, than the SBL algorithm. To further improve the performance of the EM-SBL, a threshold-based pruning of the estimated second order statistics that are input to the algorithm is proposed, and its mean square error and symbol error rate performance is illustrated through Monte-Carlo simulations. Thus, the algorithms proposed in this paper are capable of obtaining efficient sparse channel estimates even in the presence of a small number of pilots.
Resumo:
The article presents a generalized analytical expression for description of the integral excess Gibbs free energy of mixing of a ternary system. Twelve constants of the equation are assessed by the least mean squares regressional analysis of the experimental integral excess data of the constituent binaries; three ternary parameters are evaluated by a regressional analysis based on the partial experimental data of a component of the ternary system. The assessed values of the ternary parameters describe the nature of the ternary interaction in the system. Activities and isoactivities of the components in the Ag-Au-Cu system at 1350 K are calculated and found to be in good agreement with the experimental data. This analytical treatment is particularly useful to ternary systems where the thermodynamic data are available from different sources.
Resumo:
Two-dimensional magnetic recording (2-D TDMR) is an emerging technology that aims to achieve areal densities as high as 10 Tb/in(2) using sophisticated 2-D signal-processing algorithms. High areal densities are achieved by reducing the size of a bit to the order of the size of magnetic grains, resulting in severe 2-D intersymbol interference (ISI). Jitter noise due to irregular grain positions on the magnetic medium is more pronounced at these areal densities. Therefore, a viable read-channel architecture for TDMR requires 2-D signal-detection algorithms that can mitigate 2-D ISI and combat noise comprising jitter and electronic components. Partial response maximum likelihood (PRML) detection scheme allows controlled ISI as seen by the detector. With the controlled and reduced span of 2-D ISI, the PRML scheme overcomes practical difficulties such as Nyquist rate signaling required for full response 2-D equalization. As in the case of 1-D magnetic recording, jitter noise can be handled using a data-dependent noise-prediction (DDNP) filter bank within a 2-D signal-detection engine. The contributions of this paper are threefold: 1) we empirically study the jitter noise characteristics in TDMR as a function of grain density using a Voronoi-based granular media model; 2) we develop a 2-D DDNP algorithm to handle the media noise seen in TDMR; and 3) we also develop techniques to design 2-D separable and nonseparable targets for generalized partial response equalization for TDMR. This can be used along with a 2-D signal-detection algorithm. The DDNP algorithm is observed to give a 2.5 dB gain in SNR over uncoded data compared with the noise predictive maximum likelihood detection for the same choice of channel model parameters to achieve a channel bit density of 1.3 Tb/in(2) with media grain center-to-center distance of 10 nm. The DDNP algorithm is observed to give similar to 10% gain in areal density near 5 grains/bit. The proposed signal-processing framework can broadly scale to various TDMR realizations and areal density points.
Resumo:
This paper is concerned with the integration of voice and data on an experimental local area network used by the School of Automation, of the Indian Institute of Science. SALAN (School of Automation Local Area Network) consists of a number of microprocessor-based communication nodes linked to a shared coaxial cable transmission medium. The communication nodes handle the various low-level functions associated with computer communication, and interface user data equipment to the network. SALAN at present provides a file transfer facility between an Intel Series III microcomputer development system and a Texas Instruments Model 990/4 microcomputer system. Further, a packet voice communication system has also been implemented on SALAN. The various aspects of the design and implementation of the above two utilities are discussed.
Resumo:
Phase diagrams for the systems Ln2O3---H2O (Ln = La, Pr, Nd, Sm, Eu, Gd, Tb, Dy, Ho, Er, Tm, Lu and Y) studied at 5000 to 10,000 psi and temperature range of 200–900°C, show that Ln(OH)3 hexagonal and LnOOH monoclinic are the only stable phases from Nd to Ho. The cubic oxide phase (C---Ln2O3) is stable for systems of Er, Tm, Yb and Lu, with no evidence of its equilibrium in the systems of lighter lanthanides. Using strong acids, HNO3 and HCOOH, as mineralisers the cubic oxides could be stabilised from Eu down to Lu. Solid solution phases of CeO2---Y2O3 and Eu2O3---Y2O3 have also been synthesised with HNO3 as mineraliser, since these compounds have promising use as solid electrolyte and phosphor materials respectively.
Resumo:
Phase diagrams for ternary Ln2O3-H2O-CO2 systems for the entire lanthanide series (except promethium) were studied at temperatures in the range 100–950 °C and pressures up to 3000 bar. The phase diagrams obtained for the heavier lanthanides are far more complex, with the appearance of a number of stable carbonate phases. New carbonates isolated from lanthanide systems (Ln ≡ Tm, Yb, Lu) include Ln6(OH)4(CO3)7, Ln4(OH)6-(CO3)3, Ln2O(OH)2CO3, Ln6O2(OH)8(CO3)3 and Ln12O7(OH)10(CO3)6. Stable carbonate phases common to all the lighter lanthanides are hexagonal LnOHCO3 and hexagonal Ln2O2CO3. Ln2(CO3)3• 3H2O is stable from samarium onwards and orthorhombic LnOHCO3 is stable from gadolinium onwards. On the basis of the appearance of stable carbonates, four different groups of lanthanides were established: lanthanum to neodymium, promethium to europium, terbium to erbium and thulium to lutetium. Gadolinium is the connecting element between groups II and III. This is in accordance with the tetrad classification for f transition elements.
Resumo:
Anisotropic Gaussian Schell-model (AGSM) fields and their transformation by first-order optical systems (FOS’s) forming Sp(4,R) are studied using the generalized pencils of rays. The fact that Sp(4,R), rather than the larger group SL(4,R), is the relevant group is emphasized. A convenient geometrical picture wherein AGSM fields and FOS’s are represented, respectively, by antisymmetric second-rank tensors and de Sitter transformations in a (3+2)-dimensional space is developed. These fields are shown to separate into two qualitatively different families of orbits and the invariants over each orbit, two in number, are worked out. We also develop another geometrical picture in a (2+1)-dimensional Minkowski space suitable for the description of the action of axially symmetric FOS’s on AGSM fields, and the invariants, now seven in number, are derived. Interesting limiting cases forming coherent and quasihomogeneous fields are analyzed.
Resumo:
By applying the theory of the asymptotic distribution of extremes and a certain stability criterion to the question of the domain of convergence in the probability sense, of the renormalized perturbation expansion (RPE) for the site self-energy in a cellularly disordered system, an expression has been obtained in closed form for the probability of nonconvergence of the RPE on the real-energy axis. Hence, the intrinsic mobility mu (E) as a function of the carrier energy E is deduced to be given by mu (E)= mu 0exp(-exp( mod E mod -Ec) Delta ), where Ec is a nominal 'mobility edge' and Delta is the width of the random site-energy distribution. Thus mobility falls off sharply but continuously for mod E mod >Ec, in contradistinction with the notion of an abrupt 'mobility edge' proposed by Cohen et al. and Mott. Also, the calculated electrical conductivity shows a temperature dependence in qualitative agreement with experiments on disordered semiconductors.
Resumo:
Scaling relations between the critical indices are derived for two similar systems exhibiting λ lines: binary liquid systems and ferromagnets under pressure. In addition to the usual scaling relations, this procedure gives information about other weakly divergent quantities like isothermal compressibility and thermal expansion. Suggestions for more detailed investigations are made.
Resumo:
A new arrangement to achieve adequate mixing between gas and solid is described. Residence time distribution studies ensured that the behavior of this device actually approaches that of a completely mixed system. The applicability of this device in MT reactors was verified by studying the vapor phase catalytic oxidation of anthracene over vanadium pentoxide.
Resumo:
We consider the problem of centralized routing and scheduling for IEEE 802.16 mesh networks so as to provide Quality of Service (QoS) to individual real and interactive data applications. We first obtain an optimal and fair routing and scheduling policy for aggregate demands for different source- destination pairs. We then present scheduling algorithms which provide per flow QoS guarantees while utilizing the network resources efficiently. Our algorithms are also scalable: they do not require per flow processing and queueing and the computational requirements are modest. We have verified our algorithms via extensive simulations.