Derating Based Hardware Optimizations in Soft Error Tolerant Designs

Ensuring reliable operation over an extended period of time is one of the biggest challenges facing present day electronic systems. The increased vulnerability of the components to atmospheric particle strikes poses a big threat in attaining the reliability required for various mission critical applications. Various soft error mitigation methodologies exist to address this reliability challenge. A general solution to this problem is to arrive at a soft error mitigation methodology with an acceptable implementation overhead and error tolerance level. This implementation overhead can then be reduced by taking advantage of various derating effects like logical derating, electrical derating and timing window derating, and/or making use of application redundancy, e. g. redundancy in firmware/software executing on the so designed robust hardware. In this paper, we analyze the impact of various derating factors and show how they can be profitably employed to reduce the hardware overhead to implement a given level of soft error robustness. This analysis is performed on a set of benchmark circuits using the delayed capture methodology. Experimental results show upto 23% reduction in the hardware overhead when considering individual and combined derating factors.

Efficient Algorithms for Linear Summed Error Structural SVMs

Structural Support Vector Machines (SSVMs) have become a popular tool in machine learning for predicting structured objects like parse trees, Part-of-Speech (POS) label sequences and image segments. Various efficient algorithmic techniques have been proposed for training SSVMs for large datasets. The typical SSVM formulation contains a regularizer term and a composite loss term. The loss term is usually composed of the Linear Maximum Error (LME) associated with the training examples. Other alternatives for the loss term are yet to be explored for SSVMs. We formulate a new SSVM with Linear Summed Error (LSE) loss term and propose efficient algorithms to train the new SSVM formulation using primal cutting-plane method and sequential dual coordinate descent method. Numerical experiments on benchmark datasets demonstrate that the sequential dual coordinate descent method is faster than the cutting-plane method and reaches the steady-state generalization performance faster. It is thus a useful alternative for training SSVMs when linear summed error is used.

Optimal Linear Codes with a Local-Error-Correction Property

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such ``local'' parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.

Bubble size measurement and error analysis in a gas liquid ejector

Bubble size in a gas liquid ejector has been measured using the image technique and analysed for estimation of Sauter mean diameter. The individual bubble diameter is estimated by considering the two dimensional contour of the ellipse, for the actual three dimensional ellipsoid in the system by equating the volume of the ellipsoid to that of the sphere. It is observed that the bubbles are of oblate and prolate shaped ellipsoid in this air water system. The bubble diameter is calculated based on this concept and the Sauter mean diameter is estimated. The error between these considerations is reported. The bubble size at different locations from the nozzle of the ejector is presented along with their percentage error which is around 18%.

Error exponent analysis of energy-based bayesian spectrum sensing under fading channels

This paper analyzes the error exponents in Bayesian decentralized spectrum sensing, i.e., the detection of occupancy of the primary spectrum by a cognitive radio, with probability of error as the performance metric. At the individual sensors, the error exponents of a Central Limit Theorem (CLT) based detection scheme are analyzed. At the fusion center, a K-out-of-N rule is employed to arrive at the overall decision. It is shown that, in the presence of fading, for a fixed number of sensors, the error exponents with respect to the number of observations at both the individual sensors as well as at the fusion center are zero. This motivates the development of the error exponent with a certain probability as a novel metric that can be used to compare different detection schemes in the presence of fading. The metric is useful, for example, in answering the question of whether to sense for a pilot tone in a narrow band (and suffer Rayleigh fading) or to sense the entire wide-band signal (and suffer log-normal shadowing), in terms of the error exponent performance. The error exponents with a certain probability at both the individual sensors and at the fusion center are derived, with both Rayleigh as well as log-normal shadow fading. Numerical results are used to illustrate and provide a visual feel for the theoretical expressions obtained.

Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

Network-error correcting codes using small fields

Recently, Ebrahimi and Fragouli proposed an algorithm to construct scalar network codes using small fields (and vector network codes of small lengths) satisfying multicast constraints in a given single-source, acyclic network. The contribution of this paper is two fold. Primarily, we extend the scalar network coding algorithm of Ebrahimi and Fragouli (henceforth referred to as the EF algorithm) to block network-error correction. Existing construction algorithms of block network-error correcting codes require a rather large field size, which grows with the size of the network and the number of sinks, and thereby can be prohibitive in large networks. We give an algorithm which, starting from a given network-error correcting code, can obtain another network code using a small field, with the same error correcting capability as the original code. Our secondary contribution is to improve the EF Algorithm itself. The major step in the EF algorithm is to find a least degree irreducible polynomial which is coprime to another large degree polynomial. We suggest an alternate method to compute this coprime polynomial, which is faster than the brute force method in the work of Ebrahimi and Fragouli.

Channel estimation using minimum bit error rate framework for BPSK signals

We consider the design of a linear equalizer with a finite number of coefficients in the context of a classical linear intersymbol-interference channel with additive Gaussian noise for channel estimation. Previous literature has shown that Minimum Bit Error Rate(MBER) based detection has outperformed Minimum Mean Squared Error (MMSE) based detection. We pose the channel estimation problem as a detection problem and propose a novel algorithm to estimate the channel based on the MBER framework for BPSK signals. It is shown that the proposed algorithm reduces BER compared to an MMSE based channel estimation when used in MMSE or MBER detection.

Mycobacterium tuberculosis RsdA provides a conformational rationale for selective regulation of sigma-factor activity by proteolysis

The relative levels of different sigma factors dictate the expression profile of a bacterium. Extracytoplasmic function sigma factors synchronize the transcriptional profile with environmental conditions. The cellular concentration of free extracytoplasmic function sigma factors is regulated by the localization of this protein in a sigma/anti-sigma complex. Anti-sigma factors are multi-domain proteins with a receptor to sense environmental stimuli and a conserved anti-sigma domain (ASD) that binds a sigma factor. Here we describe the structure of Mycobacterium tuberculosis anti-sigma(D) (RsdA) in complex with the -35 promoter binding domain of sigma(D) (sigma(D)(4)). We note distinct conformational features that enable the release of sigma(D) by the selective proteolysis of the ASD in RsdA. The structural and biochemical features of the sigma(D)/RsdA complex provide a basis to reconcile diverse regulatory mechanisms that govern sigma/anti-sigma interactions despite high overall structural similarity. Multiple regulatory mechanisms embedded in an ASD scaffold thus provide an elegant route to rapidly re-engineer the expression profile of a bacterium in response to an environmental stimulus.

Estimating wind stress at the ocean surface from scatterometer observations

Wind stress is the most important ocean forcing for driving tropical surface currents. Stress can be estimated from scatterometer-reported wind measurements at 10 m that have been extrapolated to the surface, assuming a neutrally stable atmosphere and no surface current. Scatterometer calibration is designed to account for the assumption of neutral stability; however, the assumption of a particular sea state and negligible current often introduces an error in wind stress estimations. Since the fundamental scatterometer measurement is of the surface radar backscatter (sigma-0) which is related to surface roughness and, thus, stress, we develop a method to estimate wind stress directly from the scatterometer measurements of sigma-0 and their associated azimuth angle and incidence angle using a neural network approach. We compare the results with in situ estimations and observe that the wind stress estimations from this approach are more accurate compared with those obtained from the conventional estimations using 10-m-height wind measurements.

Identification and characterization of starvation induced msdgc-1 promoter involved in the c-di-GMP turnover

C-di-GMP Bis-(3'-5')-cyclic-dimeric-guanosine monophosphate], a second messenger is involved in intracellular communication in the bacterial species. As a result several multi-cellular behaviors in both Gram-positive and Gram-negative bacteria are directly linked to the intracellular level of c-di-GMP. The cellular concentration of c-di-GMP is maintained by two opposing activities, diguanylate cyclase (DGC) and phosphodiesterase (PDE-A). In Mycobacterium smegmatis, a single bifunctional protein MSDGC-1 is responsible for the cellular concentration of c-di-GMP. A better understanding of the regulation of c-di-GMP at the genetic level is necessary to control the function of above two activities. In this work, we have characterized the promoter element present in msdgc-1 along with the + 1 transcription start site and identified the sigma factors that regulate the transcription of msdgc-1. Interestingly, msdgc-1 utilizes SigA during the initial phase of growth, whereas near the stationary phase SigB containing RNA polymerase takes over the expression of msdgc-1. We report here that the promoter activity of msdgc-1 increases during starvation or depletion of carbon source like glucose or glycerol. When msdgc-1 is deleted, the numbers of viable cells are similar to 10 times higher in the stationary phase in comparison to that of the wild type. We propose here that msdgc-1 is involved in the regulation of cell population density. (C) 2013 Elsevier B.V. All rights reserved.

A matroidal framework for network-error correcting codes

Matroidal networks were introduced by Dougherty et al. and have been well studied in the recent past. It was shown that a network has a scalar linear network coding solution if and only if it is matroidal associated with a representable matroid. The current work attempts to establish a connection between matroid theory and network-error correcting codes. In a similar vein to the theory connecting matroids and network coding, we abstract the essential aspects of network-error correcting codes to arrive at the definition of a matroidal error correcting network. An acyclic network (with arbitrary sink demands) is then shown to possess a scalar linear error correcting network code if and only if it is a matroidal error correcting network associated with a representable matroid. Therefore, constructing such network-error correcting codes implies the construction of certain representable matroids that satisfy some special conditions, and vice versa.

Vibrational spectra of fluorene, 1-methylfluorene and 1,8-dimethylfluorene

In this paper, we report the gas phase infrared spectra of fluorene and its methylated derivatives using a heated multipass cell and argon as a carrier gas. The observed spectra in the 4000-400 cm(-1) range have been fitted using the modified scaled quantum mechanical force field (SQMFF) calculation with the 6-311G** basis. The advantage of using the modified SQMFF method is that it scales the force constants to find the best fit to the observed spectral lines by minimizing the fitting error. In this way we are able to assign all the observed fundamental bands in the spectra. With consecutive methyl substitutions two sets of bands are found to shift in a systematic way. The set of four aromatic C-H stretching vibrations around 3000 cm(-1) shifts toward lower frequencies while the single most intense aromatic C-H out-of-plane bending mode around 750 cm(-1) shifts toward higher frequencies. The reason for shifting of aromatic C-H stretching frequency toward lower wave numbers with gradual methyl substitution has been attributed to the lengthening of the C-H bonds due to the +I effect of the methyl groups to the ring current as revealed from the calculations. While the unexpected shifting of the aromatic C-H out-of-plane bend toward higher wave numbers with increasing methyl substitution is ascribed to the lowering of the number of adjacent aromatic C-H bonds on the plane of the benzene ring with gradual methyl substitutions. (C) 2013 Elsevier B.V. All rights reserved.

Burst error correction using partial fourier matrices and block sparse representation

There is a strong relation between sparse signal recovery and error control coding. It is known that burst errors are block sparse in nature. So, here we attempt to solve burst error correction problem using block sparse signal recovery methods. We construct partial Fourier based encoding and decoding matrices using results on difference sets. These constructions offer guaranteed and efficient error correction when used in conjunction with reconstruction algorithms which exploit block sparsity.

A POSTERIORI ERROR CONTROL OF DISCONTINUOUS GALERKIN METHODS FOR ELLIPTIC OBSTACLE PROBLEMS

In this article, we derive an a posteriori error estimator for various discontinuous Galerkin (DG) methods that are proposed in (Wang, Han and Cheng, SIAM J. Numer. Anal., 48: 708-733, 2010) for an elliptic obstacle problem. Using a key property of DG methods, we perform the analysis in a general framework. The error estimator we have obtained for DG methods is comparable with the estimator for the conforming Galerkin (CG) finite element method. In the analysis, we construct a non-linear smoothing function mapping DG finite element space to CG finite element space and use it as a key tool. The error estimator consists of a discrete Lagrange multiplier associated with the obstacle constraint. It is shown for non-over-penalized DG methods that the discrete Lagrange multiplier is uniformly stable on non-uniform meshes. Finally, numerical results demonstrating the performance of the error estimator are presented.