Efficient parasitic substrate modeling for monolithic mixed-A/D circuit design and verification

Parasitic analog-digital noise coupling has been identified as a key issue facing designers of mixed-signal integrated circuits. In particular, signal crosstalk through the common chip substrate has become increasingly problematic. This paper demonstrates a methodology for developing simulation, synthesis, and verification models to analyze the global electrical behavior of the non-ideal semiconductor substrate. First, a triangular discretization method is employed to generate RC equivalent-circuit substrate models which are far less complex than those formulated by conventional techniques. The networks are then accurately approximated for subsequent analysis by an efficient reduction algorithm which uses a well-conditioned Lanczos moment-matching process. Through congruence transformations, the network admittance matrices are transformed to reduced equivalents which are easily post-processed to derive passive, SPICE-compatible netlist representations of the reduced models. The pure-RC properties of the extracted substrate networks are fully exploited to formulate an efficient overall algorithm. For validation, the strategy has been successfully applied to several mixed-signal circuit examples.     

A Parallel Hill Climbing Algorithm for Pushing Dependent Data in Clients–Providers–Servers Systems

The up-link bandwidth in satellite networks and in advanced traffic wireless information system is very limited. A server broadcasts data files provided by different independent providers and accessed by many clients in a round-robin manner. The clients who access these files may have different patterns of access. Some clients may wish to access several files in any order (AND), some wish to access one out of several files (OR), and some clients may access a second file only after accessing another file (IMPLY). The goal of the server is to order the files in a way that minimizes the access time of the clients given some a priori knowledge of their access patterns. An appropriate clients–servers model was recently proposed by Bay-Noy, Naor and Schieber. They formulated three separate problems and proposed an algorithm that evaluates certain number of random permutations and chooses the one whose access time is minimized. In this paper, we formulate a combined AOI (AND-OR-IMPLY) problem, and propose to apply a parallel hill climbing algorithm (to each of the four problems), which begins from certain number of random permutations, and then applies hill climbing technique on each of them until there is no more improvement. The evaluation time of neighboring permutations generated in hill climbing process is optimized, so that it requires O(n) time per permutation instead of O(n ²) time required for evaluating access time of a random permutation, where n is the number of files the server broadcasts. Experiments indicate that the parallel hill climbing algorithm is O(n) times faster that random permutations method, both in terms of time needed to evaluate the same number of permutations, and time needed to provide a high quality solution. Thus the improvement is significant for broadcasting large number of files.     

Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier

Related key attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain algebraic induced key relations, e.g., affine functions or polynomials of bounded degree. In this work, we show that it is possible to go beyond the algebraic barrier and achieve security against arbitrary key relations, by restricting the number of tampering queries the adversary is allowed to ask for. The latter restriction is necessary in case of arbitrary key relations, as otherwise a generic attack of Gennaro et al. (TCC 2004) shows how to recover the key of almost any cryptographic primitive. We describe our contributions in more detail below. (1) We show that standard ID and signature schemes constructed from a large class of \(\Sigma \)-protocols (including the Okamoto scheme, for instance) are secure even if the adversary can arbitrarily tamper with the prover’s state a bounded number of times and obtain some bounded amount of leakage. Interestingly, for the Okamoto scheme we can allow also independent tampering with the public parameters. (2) We show a bounded tamper and leakage resilient CCA-secure public key cryptosystem based on the DDH assumption. We first define a weaker CCA-like security notion that we can instantiate based on DDH, and then we give a general compiler that yields CCA security with tamper and leakage resilience. This requires a public tamper-proof common reference string. (3) Finally, we explain how to boost bounded tampering and leakage resilience [as in (1) and (2) above] to continuous tampering and leakage resilience, in the so-called floppy model where each user has a personal hardware token (containing leak- and tamper-free information) which can be used to refresh the secret key. We believe that bounded tampering is a meaningful and interesting alternative to avoid known impossibility results and can provide important insights into the security of existing standard cryptographic schemes.     

A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance

A statistical approach to cryptanalysis of a memoryless function of clock-controlled shift registers is introduced. In the case of zero-order correlation immunity, an algorithm for a shift register initial state reconstruction based on the sequence comparison concept is proposed. A constrained Levenshtein distance relevant for the cryptanalysis is defined and a novel recursive procedure for its efficient computation is derived. Preliminary experimental results are given and open theoretic problems are discussed.Following [11], a Boolean function f(x ₁,..., x _n) is said to be mth-order correlation immune if m is the maximum integer such that the random variable f(X ₁,..., X _n) is statistically independent of every set of m random variables chosen from the balanced and independent binary random variables X ₁,..., X _n.     

New neural method for bias dependent noise modelling of microwave transistors

A new method for accurate determination of noise parameters of microwave transistors for various bias conditions is proposed in this paper. The proposed model consists of a transistor empirical noise model (modification of Pospieszalski’s noise model) and two artificial neural networks. With the aim to avoid extraction of the empirical model parameters for each bias point, an artificial neural network is used to introduce bias-dependence of the equivalent circuit parameters. Accuracy of such bias-dependent model is further improved by using an additional neural network aimed to correct the noise parameters’ values. The proposed modeling approach is exemplified by modelling of a MESFET device in packaged form. The noise parameters obtained by the simulation agree well with the measured data.     

The application of Ramo's theorem to the impulse response calculation of a reach-through avalanche photodiode

A method for calculation the impulse response of a depletion layer of a semiconductor device based on Ramo's theorem is described. Using this method the impulse response of a reach-through avalanche photodiode is derived.     

Characterization and Optimization of a Resonant Cavity Enhanced P-i-N Photodiode Response

This paper presents linear pulse response of a Resonant Cavity Enhanced (RCE) P-i-N fotodiode. The RCE P-i-N photodiode designed for high-speed aplication is analysed for various submicron thicknesses of absorption layer, bias voltages, active areas and incident pulse optical excitations. The results are obtained by numerical simulation of the complete phenomenological model for two valley semiconductor. Great enhancement of the quantum efficiency and the product bandwidth-quantum efficiency, is obvious from obtained results for this photodiode type.     

Fast Symbol Detection for Massive G-STBC MIMO Systems

In this paper, a group-based fast symbol detection scheme is proposed for massive Group-wise Space–Time Block Code Multiple-Input Multiple-Output systems. The proposed scheme first chooses a number G, (e.g. \(G=4,6,8\)) as the size of each group and then conducts the Minimum Mean Square Error (MMSE) detectors to facilitate symbol detection group by group. In particular, instead of directly using huge computational complexity to compute the MMSE detectors, the proposed scheme recursively finds the corresponding assistant matrices to determine the groups and calculate the MMSE detectors. As a result, the transmitted symbols can be recursively estimated group by group. Finally, simulation results and complexity analysis show the proposed scheme performs very close to the existing methods, while using lower computational complexity.     

Analysis of blocking probability in optical burst switched networks

In this article, we study the blocking probability in a wavelength division multiplexing (WDM) based asynchronous bufferless optical burst switched (OBS) network, equipped with a bank of wavelength converters. Our analysis encloses two wavelength reservation schemes JIT (just-in-time) and JET (just-enough-time), and two-class data rate. The contribution of our work includes: (i) derivation of an accurate model for blocking probability of lower priority bursts in case of a non-preempted model; (ii) provision of the analytical model for blocking probability calculation in the OBS network, which includes these variables: two signaling schemes, partial wavelength conversion, two-class data, traffic intensity, cross-connect speed, number of wavelengths in WDM fiber, number of fibers in the node, number of wavelength converters, and number of nodes in the path; (iii) simulation results, which show that partial wavelength conversion provide quite satisfactory quality of service. We compare performance in a single OBS node, under various sets of parameter values. The OBS network shows great flexibility in terms of used multiclass data, and there is no dependence on the used higher layer protocol.