We propose Polarization-Shift-Keying (POLSK) homodyne system using phase-diversity receivers and theoretically analyze its bit-error-rate (BER) performance. Since the proposed system uses polarization modulation and homodyne detection, it can cancel the phase noise and is attractive at a high bit-rate transmission. It is found that the receiver sensitivity of the proposed POLSK homodyne system is the same as that of POLSK heterodyne system and is much better than that of DPSK phase-diversity homodyne systems at high signal-to-noise ratio (SNR). We also cosider theoretically the effect of the fluctuation of state of polarization (SOP) on the BER performance of POLSK homodyne system.

This paper investigates the performance of the line spectrum pair (LSP) frequency parameter representation for speech recognition. Transitional parameters of LSP frequencies are defined using first-order regression coefficients. The transitional and the instantaneous frequency parameters are linearly combined to generate a single feature vector used for recognition. The performance of the single vector is compared with that of the cepstral coefficients (CC) representation using a minimumdistance classifier in speaker-independent isolated word recognition experiments. In the speech recognition experiments, the transitional and the instantaneous coefficients are also combined in the distance domain. Also, inverse variance weighted Euclidean measures are defined using LSP frequencies to achieve Mel-scale-like warping and the new warped-frequencies are used in recognition experiments. The performance of the single feature vector defined with transitional and instantaneous LSP frequencies is found to be the best among the measures used in the experiments.

A reversible (or injective) cellular automaton (RCA) is a backward deterministic" CA, i.e., every configuration of it has at most one predecessor. Margolus has been shown that there is a computation-universal two-dimensional 2-state RCA model. Although his model is very interesting, it differs from a standard CA model because of its somewhat spatial and temporal non-uniformity. In this paper, we present two kinds of simple 16-state computation-universal models using the framework of two-dimensional reversible partitioned CA (PCA). Since PCA can be considered as a subclass of standard CA, we can immediately obtain 16-state standard RCA models from them. For each of these models, we designed a configuration which simulates a Fredkin gate. Since Fredkin gate has been known to be a universal logic element, computation-universality of these two models is concluded.

We review the role of optics in interconnects, analog processing, neural networks, and digital computing. The properties of low interference, massively parallel interconnections, and very high data rates promise extremely high performance for optical information processing systems.

A fast Viterbi decoding technique with path reduction in optical channels is presented. This decoding exploits the asymmetric characteristic of optical channels. In the decoding trellis, the branches with low or no possibility being correct path are eliminated based on the detected signal level. The number of Add-Compare-Select (ACS) operations which occupy the dominant part of Viterbi decoding is considerably reduced due to branch eliminations, and fast decoding is realized by decoding asynchronously to received sequence. The reduction of the number of ACS operations is derived for the codes with rate 1/2. It is shown that the number of ACS operations is considerably reduced compared with the conventional Viterbi decoding. The bit error probability of the proposed decoding is derived for noiseless photon counting channel. It is also shown that the decoding technique can be applied to the cases using avalanche photo diode (APD) based receiver with dark current noise at a cost of negligible degradation on the bit error probability.

This paper presents a new connected associative memory neural network. In this network, a threshold function which has two dynamical parameters is introduced. After analyzing the dynamical behaviors and giving an upper bound of the memory capacity of the conventional connected associative memory neural network, it is demonstrated that these parameters play an important role in the recalling processes of the connected neural network. An approximate method of evaluationg their optimum values is given. Further, the optimum feedback stopping time of this network is discussed. Therefore, in our network, the recalling processes are ended at the optimum feedback stopping time whether a state energy has been local minimum or not. The simulations on computer show that the dynamical behaviors of our network are greatly improved. Even though the number of learned patterns is so large as the number of neurons, the statistical properties of the dynamical behaviors of our network are that the output series of recalling processes approach to the expected patterns on their initial inputs.

This paper proposes a new construction of the minimum knowledge undeniable signature scheme which solves a problem inherent in Chaum's scheme. We formulate a new proof system, the minimum knowledge interactive bi-proof system, and a pair of languages, the common witness problem, based on the random self-reducible problem. We show that any common witness problem has the minimum knowledge interactive bi-proof system. A practical construction for undeniable signature schemes is proposed based on such a proof system. These schemes provide signature confirmation and disavowal with the same protocol (or at the same time).

A chordal ring network is a processor network on which n processors are arranged to a ring with additional chords. We study a distributed leader election algorithm on chordal ring networks and present trade-offs between the message complexity and the number of chords at each processor and between the message complexity and the length of chords as follows:For every d(1dlog* n1) there exists a chordal ring network with d chords at each processor on which the message complexity for leader election is O(n(log(d1)nlog* n)).For every d(1dlog* n1) there exists a chordal ring network with log(d1)nd1 chords at each processor on which the message complexity for leader election is O(dn).For every m(2mn/2) there exists a chordal ring network whose chords have at most length m such that the message complexity for leader election is O((n/m)log n).

This paper discusses new trends and directions in human interface (HI) technologies, and the effects of HI technologies on human life or on social activities. This paper postulates that the HI subsumes man-machine interface, human-computer interaction, human-human interaction, human-organizational interface, human-environmental interface, human-social interface, etc. A new communication model, called Human Interface Communication Model (HICOM), and a new human dialogue model, called Human Interface Dialogue model (HIDIM), are derived by reexamining trends and directions on HI technologies from the viewpoint of functional meanings of interfaces, and from the viewpoint of a socially distributed cognition mechanism.

Suppose that there are terminals on two concentric circles Cin and Cout, with Cin inside of Cout. A set of two-terminal nets is given and the routing area is the annular region between the two circles. In this paper, we present an O(n2) time algorithm for testing whether the given net set is two-layer routable, where n is the number of nets. Applying this algorithm repeatedly, we can find, in O(n3) time, a maximal subset of nets which is two-layer routable.

The VSTEP concept and its practical application in the form of an LED-type pnpn-VSTEP demonstrating low power consumption through electro-photonic operational modes are both shown. Further, with focus primarily on the new laser-mode VSTEP with high-intensity light output and narrow optical beam divergence, the design features such as threshold gain and optical absorptivity, device fabrication, and characteristics are explained. The possibility of ultimate performance based mainly on electrical to optical power conversion efficiency, important from the application viewpoint of optical interconnection, are also discussed. Also, as two examples of functional optical interconnection achieved by VSTEP, serial-to-parallel data conversion and optical self-routing switches are shown. Finally, future opto-electronic technologies to be developed for two-dimensionally integrable surface-type optical semiconductor devices, including the VSTEP, are discussed.

We consider applications of optical solitons to signal processing. Soliton switching devices promise ultrafast operation and compatibility with communications systems using optical pulses. Quantum soliton effects include broadband squeezing and quantum nondemolition measurements, and can reduce noise and increase sensitivities of optical measurements. We report the demonstration of two-color soliton switching and describe progress towards implementation of quantum nondemolition measurement of photon number using soliton collisions.

We consider applications of optical solitons to signal processing. Soliton switching devices promise ultrafast operation and compatibility with communications systems using optical pulses. Quantum soliton effects include broadband squeezing and quantum nondemolition measurements, and can reduce noise and increase sensitivities of optical measurements. We report the demonstration of two-color soliton switching and describe progress towards implementation of quantum nondemolition measurement of photon number using soliton collisions.

We propose parallel rate-variable punctured convolutional coded PPM in photon communication to achieve high energy information efficiency Ie for desired bit error rate (BER) and transmission bandwidth. We theoretically show the BER performance, bandwidth expansion factor β and necessary Ie to achieve BER=10-6 of the proposed systems for some combinations of code rates. It is found that the proposed system can achieve high Ie for desired BER and β by selecting a suitable combination of code rates depending on the channel conditions. Moreover, it is shown that the proposed system has better BER performance than RS-coded PPM in the range of small β.

We study the depth of planar Boolean circuits. We show that planar Boolean circuits of depth D(n) are simulated by on-line Turing machines in space O(D(n)). From this relationship, it is shown that any planar circuit for computing integer multiplication requires linear depth. It is also shown that a planar analogue to the NC-hierarchy is properly separated.

We review the role of optics in interconnects, analog processing, neural networks, and digital computing. The properties of low interference, massively parallel interconnections, and very high data rates promise extremely high performance for optical information processing systems.

The VSTEP concept and its practical application in the form of an LED-type pnpn-VSTEP demonstrating low power consumption through electro-photonic operational modes are both shown. Further, with focus primarily on the new laser-mode VSTEP with high-intensity light output and narrow optical beam divergence, the design features such as threshold gain and optical absorptivity, device fabrication, and characteristics are explained. The possibility of ultimate performance based mainly on electrical to optical power conversion efficiency, important from the application viewpoint of optical interconnection, are also discussed. Also, as two examples of functional optical interconnection achieved by VSTEP, serial-to-parallel data conversion and optical self-routing switches are shown. Finally, future opto-electronic technologies to be developed for two-dimensionally integrable surface-type optical semiconductor devices, including the VSTEP, are discussed.

Based on the semiclassical theory, we deduce the expressions of stimulated absorption, stimulated amplification and threshold by using density matrix equation in the Er3+-doped fibers. Meaningful results have been given and some phenomena occuring in experiments are explained theoretically.