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.

Silica-based 64-channel arrayed waveguide gratings with double functions

Silica-based 64-channel arrayed waveguide gratings (AWGs) with double functions and 0.4 nm (50 GHz) channel spacing have been designed and fabricated. On the same component, Gauss and flat-top output response spectra are obtained simultaneously. The test results show that when the insertion loss ranges from 3.5 dB to 6 dB,the crosstalk is better than -34 dB, the 1 dB bandwidth is 0.12 nm, the 3 dB bandwidth is 0,218 nm, and the polarization-dependent loss (PDL) is less than 0.5 dB for Gauss response. When the insertion loss ranges,from 5.8 dB to 7.8 dB, the crosstalk is better than -30 dB, the 1 dB bandwidth is 0.24 nm, the 3 dB bandwidth is 0.33 nm, and the PDL is less than 0.2 dB for flat-top response.

A criterion for local interconvertibility between all-tripartite Gaussian states

We arrive at a necessary and sufficient criterion that can be readily used for interconvertibility between general, all-tripartite Gaussian states under local quantum operation. The derivation involves a systematic reduction that converts the original complex conditions in high-dimensional, 6n x 6n matrix space eventually into 2 x 2 matrix problems.

Conditions for the local manipulation of all bipartite Gaussian states

We provide a general, necessary, and sufficient condition for the possibility of transforming a mixed bipartite Gaussian state with arbitrarily many modes to another one under arbitrary local Gaussian channels, which do not include classical communication. Moreover, by means of this condition we present a necessary criterion that can be used to check the possibility of a state transformation between two mixed Gaussian states. At the same time, we prove that our criterion can be reduced to the Eisert-Plenio criterion when the mode number is chosen as 1 per side.

Conditions for the local manipulation of tripartite Gaussian states

We present the normal form of the covariance matrix for three-mode tripartite Gaussian states. By means of this result, the general form of a necessary and sufficient criterion for the possibility of a state transformation from one tripartite entangled Gaussian state to another with three modes is found. Moreover, we show that the conditions presented include not only inequalities but equalities as well.

practical type checking of functions defined on context-free languages

A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF.languages is not decidable,a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked.Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented.

pattern matching compilation of functions defined in context-free languages

LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become complicated and further studies are needed.

facilitating formal specification acquisition by using recursive functions on context-free languages

Although formal specification techniques are very useful in software development, the acquisition of formal specifications is a difficult task. This paper presents the formal specification language LFC, which is designed to facilitate the acquisition and validation of formal specifications. LFC uses context-free languages for syntactic aspect and relies on a new kind of recursive functions, i.e. recursive functions on context-free languages, for semantic aspect of specifications. Construction and validation of LFC specifications are machine-aided. The basic ideas behind LFC, the main aspects of LFC, and the use of LFC and illustrative examples are described.

combining cfg and recursive functions to get a new language

We propose a new functional programming language(FPL) which differs in some aspects from most well known FPLs[l].We descrihc the prohlmm domain,the language,explain why we need it.

on quadratic bent functions in polynomial forms

In this correspondence, we construct some new quadratic bent functions in polynomial forms by using the theory of quadratic forms over finite fields. The results improve some previous work. Moreover, we solve a problem left by Yu and Gong in 2006.