A Systematic Approach to Synthesis of Verification Test-suites for Modular SoC Designs

Verification is one of the important stages in designing an SoC (system on chips) that consumes upto 70% of the design time. In this work, we present a methodology to automatically generate verification test-cases to verify a class of SoCs and also enable re-use of verification resources created from one SoC to another. A prototype implementation for generating the test-cases is also presented.

Structural Rigidity of Paranemic Crossover and Juxtapose DNA Nanostructures

Crossover motifs are integral components for designing DNA-based nanostructures and nanomechanical devices due to their enhanced rigidity compared to the normal B-DNA. Although the structural rigidity of the double helix B-DNA has been investigated extensively using both experimental and theoretical tools, to date there is no quantitative information about structural rigidity and the mechanical strength of parallel crossover DNA motifs. We have used fully atomistic molecular dynamics simulations in explicit solvent to get the force-extension curve of parallel DNA nanostructures to characterize their mechanical rigidity. In the presence of monovalent Na(+) ions, we find that the stretch modulus (gamma(1)) of the paranemic crossover and its topoisomer JX DNA structure is significantly higher (similar to 30%) compared to normal B-DNA of the same sequence and length. However, this is in contrast to the original expectation that these motifs are almost twice as rigid compared to the double-stranded B-DNA. When the DNA motif is surrounded by a solvent with Mg(2+) counterions, we find an enhanced rigidity compared to Na(+) environment due to the electrostatic screening effects arising from the divalent nature of Mg(2+) ions. To our knowledge, this is the first direct determination of the mechanical strength of these crossover motifs, which can be useful for the design of suitable DNA for DNA-based nanostructures and nanomechanical devices with improved structural rigidity.

Channel Precoding for STBCs from Generalized Pseudo Orthogonal Designs

Statistical information about the wireless channel can be used at the transmitter side to enhance the performance of MIMO systems. This paper addresses how the concept of channel precoding can be used to enhance the performance of STBCs from Generalized Pseudo Orthogonal Designs which were first introduced by Zhu and Jafarkhani. Such designs include some important classes of STBCs that are directly derivable from Quasi-Orthogonal Designs and Co-ordinate Interleaved Orthogonal Designs.

“Post silicon debug of SOC designs”

Continuous advances in VLSI technology have made implementation of very complicated systems possible. Modern System-on -Chips (SoCs) have many processors, IP cores and other functional units. As a result, complete verification of whole systems before implementation is becoming infeasible; hence it is likely that these systems may have some errors after manufacturing. This increases the need to find design errors in chips after fabrication. The main challenge for post-silicon debug is the observability of the internal signals. Post-silicon debug is the problem of determining what's wrong when the fabricated chip of a new design behaves incorrectly. This problem now consumes over half of the overall verification effort on large designs, and the problem is growing worse.Traditional post-silicon debug methods concentrate on functional parts of systems and provide mechanisms to increase the observability of internal state of systems. Those methods may not be sufficient as modern SoCs have lots of blocks (processors, IP cores, etc.) which are communicating with one another and communication is another source of design errors. This tutorial will be provide an insight into various observability enhancement techniques, on chip instrumentation techniques and use of high level models to support the debug process targeting both inside blocks and communication among them. It will also cover the use of formal methods to help debug process.

Towards formal verification of analog mixed signal designs using SPICE circuit simulation traces

An extension to a formal verification approach of hybrid systems is proposed to verify analog and mixed signal (AMS) designs. AMS designs can be formally modeled as hybrid systems and therefore lend themselves to the formal analysis and verification techniques applied to hybrid systems. The proposed approach employs simulation traces obtained from an actual design implementation of AMS circuit blocks (for example, in the form of SPICE netlists) to carry out formal analysis and verification. This enables the same platform used for formally validating an abstract model of an AMS design, to be also used for validating its different refinements and design implementation; thereby, providing a simple route to formal verification at different levels of implementation. The feasibility of the proposed approach is demonstrated with a case study based on a tunnel diode oscillator. Since the device characteristic of a tunnel diode is highly non-linear with a negative resistance region, dynamic behavior of circuits in which it is employed as an element is difficult to model, analyze and verify within a general hybrid system formal verification tool. In the case study presented the formal model and the proposed computational techniques have been incorporated into CheckMate, a formal verification tool based on MATLAB and Simulink-Stateflow Framework from MathWorks.

Low-Delay, High-Rate Nonsquare Complex Orthogonal Designs

The maximal rate of a nonsquare complex orthogonal design for transmit antennas is 1/2 + 1/n if is even and 1/2 + 1/n+1 if is odd and the codes have been constructed for all by Liang (2003) and Lu et al. (2005) to achieve this rate. A lower bound on the decoding delay of maximal-rate complex orthogonal designs has been obtained by Adams et al. (2007) and it is observed that Liang's construction achieves the bound on delay for equal to 1 and 3 modulo 4 while Lu et al.'s construction achieves the bound for n = 0, 1, 3 mod 4. For n = 2 mod 4, Adams et al. (2010) have shown that the minimal decoding delay is twice the lower bound, in which case, both Liang's and Lu et al.'s construction achieve the minimum decoding delay. For large value of, it is observed that the rate is close to half and the decoding delay is very large. A class of rate-1/2 codes with low decoding delay for all has been constructed by Tarokh et al. (1999). In this paper, another class of rate-1/2 codes is constructed for all in which case the decoding delay is half the decoding delay of the rate-1/2 codes given by Tarokh et al. This is achieved by giving first a general construction of square real orthogonal designs which includes as special cases the well-known constructions of Adams, Lax, and Phillips and the construction of Geramita and Pullman, and then making use of it to obtain the desired rate-1/2 codes. For the case of nine transmit antennas, the proposed rate-1/2 code is shown to be of minimal delay. The proposed construction results in designs with zero entries which may have high peak-to-average power ratio and it is shown that by appropriate postmultiplication, a design with no zero entry can be obtained with no change in the code parameters.

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.

Multiple parents crossover operators: A new approach removes the overlapping solutions for sequencing problems

Maintaining population diversity throughout generations of Genetic Algorithms (GAs) is key to avoid premature convergence. Redundant solutions is one cause for the decreasing population diversity. To prevent the negative effect of redundant solutions, we propose a framework that is based on the multi-parents crossover (MPX) operator embedded in GAs. Because MPX generates diversified chromosomes with good solution quality, when a pair of redundant solutions is found, we would generate a new offspring by using the MPX to replace the redundant chromosome. Three schemes of MPX will be examined and will be compared against some algorithms in literature when we solve the permutation flowshop scheduling problems, which is a strong NP-Hard sequencing problem. The results indicate that our approach significantly improves the solution quality. This study is useful for researchers who are trying to avoid premature convergence of evolutionary algorithms by solving the sequencing problems.

Anisotropy induced crossover from weakly to strongly first order melting of two dimensional solids

Melting and freezing transitions in two dimensional (2D) systems are known to show highly unusual characteristics. Most of the earlier studies considered atomic systems: the melting of 2D molecular solids is still largely unexplored. In order to understand the role of anisotropy as well as multiple energy and length scales present in molecular systems, here we report computer simulation studies of melting of 2D molecular systems. We computed a limited portion of the solid-liquid phase diagram. We find that the interplay between the strength of isotropic and anisotropic interactions can give rise to rich phase diagram consisting of isotropic liquid and two crystalline phases-honeycomb and oblique. The nature of the transition depends on the relative strength of the anisotropic interaction and a strongly first order melting turns into a weakly first order transition on increasing the strength of the isotropic interaction. This crossover can be attributed to an increase in stiffness of the solid phase free energy minimum on increasing the strength of the anisotropic interaction. The defects involved in melting of molecular systems are quite different from those known for the atomic systems.

Crossover from photodarkening to photobleaching in a-GexSe100-x thin films

In this Letter, we present the interesting results of photodarkening (PD), transition toward photostability, and a slow crossover from PD to photobleaching when composition of the chalcogenide glassy thin film changes from Ge-deficient to rich. A subsequent Raman analysis on these as-prepared and irradiated samples provide the direct evidence of photoinduced structural rearrangement, i.e., photocrystallization of Se and the removal of edge-sharing GeSe4 tetrahedra. Further, our experimental results clearly demonstrate that light-induced effects can be effectively controlled by choosing the right composition and provide valuable information on synthesizing photostable/sensitive glasses.

On t-designs and bounds relating query complexity to error resilience in locally correctable codes

An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs for larger t. It is shown here that for such codes, for a given number of queries r, under linear decoding, one can, in general, handle a larger number of corrupted bits. We exhibit to our knowledge, for the first time, a finite length code, whose dual contains 4-designs, which can tolerate a fraction of up to 0.567/r corrupted symbols as against a maximum of 0.5/r in prior constructions. We also present an upper bound that shows that 0.567 is the best possible for this code length and query complexity over this symbol alphabet thereby establishing optimality of this code in this respect. A second result in the article is a finite-length bound which relates the number of queries r and the fraction of errors that can be tolerated, for a locally correctable code that employs a randomized algorithm in which each instance of the algorithm involves t-error correction.

The exploration of Kemp's triacid (KTA) as the core for the synthesis of 3-fold symmetric 2(3)-cyclophane, 2(2)-cyclophane and novel linker directed designs

For the first time, two units of KTA have been linked to three units of cyst-di-OMe. The reaction is noteworthy since it involves the formation of six amide bonds leading to a three-fold symmetric 23-cyclophane (3) harboring a cluster of three S-S bridges. The major product is a di-imide (4), arising from the interaction of a cystine NH with a neighbouring activated ester. A third reaction of tethering KTA with a single cyst-di-OMe unit afforded the flexible compound 6 and, with benzidine, the novel linker directed 7 with orthogonally disposed anchor modules.

Universal power law in crossover from integrability to quantum chaos

We study models of interacting fermions in one dimension to investigate the crossover from integrability to nonintegrability, i.e., quantum chaos, as a function of system size. Using exact diagonalization of finite-sized systems, we study this crossover by obtaining the energy level statistics and Drude weight associated with transport. Our results reinforce the idea that for system size L -> infinity nonintegrability sets in for an arbitrarily small integrability-breaking perturbation. The crossover value of the perturbation scales as a power law similar to L-eta when the integrable system is gapless. The exponent eta approximate to 3 appears to be robust to microscopic details and the precise form of the perturbation. We conjecture that the exponent in the power law is characteristic of the random matrix ensemble describing the nonintegrable system. For systems with a gap, the crossover scaling appears to be faster than a power law.