An ultra-low power CMOS random number generator

This paper proposes an ultra-low power CMOS random number generator (RING), which is based on an oscillator-sampling architecture. The noisy oscillator consists of a dual-drain MOS transistor, a noise generator and a voltage control oscillator. The dual-drain MOS transistor can bring extra-noise to the drain current or the output voltage so that the jitter of the oscillator is much larger than the normal oscillator. The frequency division ratio of the high-frequency sampling oscillator and the noisy oscillator is small. The RNG has been fabricated in a 0.35 mu m CMOS process. It can produce good quality bit streams without any post-processing. The bit rate of this RNG could be as high as 100 kbps. It has a typical ultra-low power dissipation of 0.91 mu W. This novel circuit is a promising unit for low power system and communication applications. (c) 2007 Elsevier Ltd. All rights reserved.

A Hybrid Random Number Generator Using Single Electron Tunneling Junctions and MOS Transistors

This paper proposes a novel single electron random number generator (RNG). The generator consists of multiple tunneling junctions (MTJ) and a hybrid single electron transistor (SET)/MOS output circuit. It is an oscillator-based RNG. MTJ is used to implement a high-frequency oscillator,which uses the inherent physical randomness in tunneling events of the MTJ to achieve large frequency drift. The hybrid SET and MOS output circuit is used to amplify and buffer the output signal of the MTJ oscillator. The RNG circuit generates high-quality random digital sequences with a simple structure. The operation speed of this circuit is as high as 1GHz. The circuit also has good driven capability and low power dissipation. This novel random number generator is a promising device for future cryptographic systems and communication applications.

Nanoelectronic Circuit Architectures Based on Single-Electron Turnstiles

Single-electron devices (SEDs) have ultra-low power dissipation and high integration density, which make them promising candidates as basic circuit elements of the next generation VLSI circuits. In this paper, we propose two novel circuit single-electron architectures: the single-electron simulated annealing algorithm (SAA) circuit and the single-electron cellular neural network (CNN). We used the MOSFET-based single-electron turnstile [1] as the basic circuit element. The SAA circuit consists of the voltage-controlled single-electron random number generator [2] and the single-electron multiple-valued memories (SEMVs) [3]. The random-number generation and variable variations in SAA are easily achieved by transferring electrons using the single-electron turnstile. The CNN circuit used the floating-gate single-electron turnstile as the neural synapses, and the number of electrons is used to represent the cells states. These novel circuits are promising in future nanoscale integrated circuits.

Parametric Analysis for Monitoring 2D Kinetics of Receptor-Ligand binding

Thermal fluctuation approach is widely used to monitor association kinetics of surface-bound receptor-ligand interactions. Various protocols such as sliding standard deviation (SD) analysis (SSA) and Page's test analysis (PTA) have been used to estimate two-dimensional (2D) kinetic rates from the time course of displacement of molecular carrier. In the current work, we compared the estimations from both SSA and modified PTA using measured data from an optical trap assay and simulated data from a random number generator. Our results indicated that both SSA and PTA were reliable in estimating 2D kinetic rates. Parametric analysis also demonstrated that such the estimations were sensitive to parameters such as sampling rate, sliding window size, and threshold. These results furthered the understandings in quantifying the biophysics of receptor-ligand interactions.

Linearization Method and Linear Complexity

We focus on the relationship between the linearization method and linear complexity and show that the linearization method is another effective technique for calculating linear complexity. We analyze its effectiveness by comparing with the logic circuit method. We compare the relevant conditions and necessary computational cost with those of the Berlekamp-Massey algorithm and the Games-Chan algorithm. The significant property of a linearization method is that it needs no output sequence from a pseudo-random number generator (PRNG) because it calculates linear complexity using the algebraic expression of its algorithm. When a PRNG has n [bit] stages (registers or internal states), the necessary computational cost is smaller than O(2n). On the other hand, the Berlekamp-Massey algorithm needs O(N2) where N ( 2n) denotes period. Since existing methods calculate using the output sequence, an initial value of PRNG influences a resultant value of linear complexity. Therefore, a linear complexity is generally given as an estimate value. On the other hand, a linearization method calculates from an algorithm of PRNG, it can determine the lower bound of linear complexity.

Experimental Study on the Thermal Argon Plasma Generation and Jet Length Change Characteristics at Atmospheric Pressure

The generation, jet length and flow-regime change characteristics of argon plasma issuing into ambient air have been experimentally examined. Different torch structures have been used in the tests. Laminar plasma jets can be generated within a rather wide range of working-gas flow rates, and an unsteady transitional flow state exists between the laminar and turbulent flow regimes. The high-temperature region length of the laminar plasma jet can be over an order longer than that of the turbulent plasma jet and increases with increasing argon flow rate or arc current, while the jet length of the turbulent plasma is less influenced by the generating parameters. The flow field of the plasma jet has very high radial gradients of plasma parameters, and a Reynolds number alone calculated in the ordinary manner may not adequately serve as a criterion for transition. The laminar plasma jet can have a higher velocity than that of an unsteady or turbulent jet. The long laminar plasma jet has good stiffness to withstand the impact of laterally injected cold gas and particulate matter. It could be used as a rather ideal object for fundamental studies and be applied to novel materials processing due to its attractive stable and adjustable properties.

Flows with Inertia in a Three-Dimensional Random Fiber Network

A fiber web is modeled as a three-dimensional random cylindrical fiber network. Nonlinear behavior of fluid flowing through the fiber network is numerically simulated by using the lattice Boltzmann (LB) method. A nonlinear relationship between the friction factor and the modified Reynolds number is clearly observed and analyzed by using the Fochheimer equation, which includes the quadratic term of velocity. We obtain a transition from linear to nonlinear region when the Reynolds numbers are sufficiently high, reflecting the inertial effect of the flows. The simulated permeability of such fiber network has relatively good agreement with the experimental results and finite element simulations.

Computer Simulation Of Random Sphere Packing In An Arbitrarily Shaped Container

Most simulations of random sphere packing concern a cubic or cylindric container with periodic boundary, containers of other shapes are rarely studied. In this paper, a new relaxation algorithm with pre-expanding procedure for random sphere packing in an arbitrarily shaped container is presented. Boundaries of the container are simulated by overlapping spheres which covers the boundary surface of the container. We find 0.4 similar to 0.6 of the overlap rate is a proper value for boundary spheres. The algorithm begins with a random distribution of small internal spheres. Then the expansion and relaxation procedures are performed alternately to increase the packing density. The pre-expanding procedure stops when the packing density of internal spheres reaches a preset value. Following the pre-expanding procedure, the relaxation and shrinking iterations are carried out alternately to reduce the overlaps of internal spheres. The pre-expanding procedure avoids the overflow problem and gives a uniform distribution of initial spheres. Efficiency of the algorithm is increased with the cubic cell background system and double link data structure. Examples show the packing results agree well with both computational and experimental results. Packing density about 0.63 is obtained by the algorithm for random sphere packing in containers of various shapes.

快速Delaunay逐点插入网格生成算法

对插入形心的Delaunay逐点插入算法,提出按单元可插度分组的双向链表组数据结构,避免了对最大可插度单元的搜索。采用了邻接单元搜索、双向链表存储、随机方向搜索、邻接旋转、几何量继承等技术,使算法的计算时间与生成单元数近似呈线性关系,时间复杂度达到O(N1.05),N为生成单元数。算例表明,在一台AMD Athlon3200+(主频2.0 GHz)PC上,该算法的四面体单元生成速度达50 000个/s以上。

Self-organized generation of transverse waves in diverging cylindrical detonations

Self-organized generation of transverse waves associated with the transverse wave instabilities at a diverging cylindrical detonation front was numerically studied by solving two-dimensional Euler equations implemented with an improved two-step chemical kinetic model. After solution validation, four mechanisms of the transverse wave generation were identified from numerical simulations, and referred to as the concave front focusing, the kinked front evolution, the wrinkled front evolution and the transverse wave merging, respectively. The propagation of the cylindrical detonation is maintained by the growth of the transverse waves that match the rate of increase in surface area of the detonation front to asymptotically approach a constant average number of transverse waves per unit length along the circumference of the detonation front. This cell bifurcation phenomenon of cellular detonations is discussed in detail to gain better understanding on detonation physics.

The gated integration technique for the accurate measurement of the autocorrelation function of speckle intensities scattered from random phase screens

A new approach based on the gated integration technique is proposed for the accurate measurement of the autocorrelation function of speckle intensities scattered from a random phase screen. The Boxcar used for this technique in the acquisition of the speckle intensity data integrates the photoelectric signal during its sampling gate open, and it repeats the sampling by a preset number, in. The average analog of the in samplings output by the Boxcar enhances the signal-to-noise ratio by root m, because the repeated sampling and the average make the useful speckle signals stable, while the randomly varied photoelectric noise is suppressed by 1/ root m. In the experiment, we use an analog-to-digital converter module to synchronize all the actions such as the stepped movement of the phase screen, the repeated sampling, the readout of the averaged output of the Boxcar, etc. The experimental results show that speckle signals are better recovered from contaminated signals, and the autocorrelation function with the secondary maximum is obtained, indicating that the accuracy of the measurement of the autocorrelation function is greatly improved by the gated integration technique. (C) 2006 Elsevier Ltd. All rights reserved.

Number of phase levels of a Talbot array illuminator

The number of phase levels of a Talbot array illuminator is an important factor in the estimation of practical fabrication complexity and cost. We show that the number it) of phase levels of a Talbot array illuminator has a simple relationship to the prime number. When there is an alternative pi -phase modulation in the output array, the relations are similar. (C) 2001 Optical Society of America OCIS codes: 070.6760, 050.1950, 050.1980.

Ultrafast temporal pattern generation and recognition

Ultrafast temporal pattern generation and recognition with femtosecond laser technology is presented, analyzed, and experimentally implemented. Ultrafast temporal pattern generation and recognition are realized by taking advantage of two well-known techniques: the space-time conversion technique and the ultrafast pulse measurement technique. Here the temporal pattern for the designed multiple pulses, optimized with a preassumed Gaussian spectral distribution of an ultrashort pulse, is described. With the simulation of a Gaussian spectral distribution, we realize that the uniformity of the generated multiple ultrafast temporal pulses is relevant to the repeated number of modulation periods in the mask in the spectral plane. Moreover, the change of Gaussian spectral phases with the wavelengths in the modulated phase plate is considered. Experiments of ultrafast temporal pattern recognition by the frequency-resolved optical gating (FROG) characterization technique are also given. (C) 2004 Society of Photo-Optical Instrumentation Engineers.

Generation and characterization of monoclonal antibodies against the flounder Paralichthys olivaceus rhabdovirus

Two MAbs (3C7 and 3C9) against flounder Paralichthys olivaceus rhabdovirus (PORV) were generated with hybridoma cell fusion technology and characterized by an indirect enzyme-linked immunosorbent assay, isotype test, Western blot and immunodot analysis and immunofluorescence assay. Isotyping tests demonstrated that both of the two MAbs belonged to IgM subclass. Western blot analysis showed the MAbs reacted with 42, 30, and 22 kDa viral proteins, which were localized within the cytoplasm of PORV-infected grass carp ovary (GCO) cells analyzed by indirect immunofluorescences tests. The MAb 3C7 was also selected at random for detecting virus antigens in the inoculated grass carp tissues by immunohistochemistry assay. Flow cytometry tests showed that at the 36 h postinfection (0.25 PFU/cell), the 23% PORV-infected GCO cells could be distinguished from the uninfected cells with the MAb 3C7. Such MAbs could be useful for diagnosis and potential treatment of viral infection. (C) 2007 Elsevier B.V. All rights reserved.

Complex networks constructed from irrational number sequences

In this paper, we construct (d, r) networks from sequences of different irrational numbers. In detail, segment an irrational number sequence of length M into groups of d digits which represent the nodes while two consecutive groups overlap by r digits (r = 0,1,...,d-1), and the undirected edges indicate the adjacency between two consecutive groups. (3, r) and (4, r) networks are respectively constructed from 14 different irrational numbers and their topological properties are examined. By observation, we find that network topologies change with different values of d, r and even sequence length M instead of the types of irrational numbers, although they share some similar features with traditional random graphs. We make a further investigation to explain these interesting phenomena and propose the identical-degree random graph model. The results presented in this paper provide some insight into distributions of irrational number digits that may help better understanding of the nature of irrational numbers.