This paper studies an integrate-and-fire circuit with a periodic input. It has two states and has rich dynamics: as a DC input varies, it can exhibit period doubling bifurcation to chaos; as a periodic input is applied, the periodic or chaotic phenomenon (for a DC input) is changed into interesting synchronous or asynchronous phenomenon. Using a mapping procedure, we can elucidate parameter subspace in which the synchronous phenomena occur. Using a test circuit, typical phenomena can be verified in the laboratory.

This paper is concerned with a comparative study of the accepting powers of deterministic, Las Vegas, self-verifying nondeterminisic, and nondeterministic (simple) multihead finite automata. We show that (1) for each k 2, one-way deterministic k-head (resp., simple k-head) finite automata are less powerful than one-way Las Vegas k-head (resp., simple k-head) finite automata, (2) there is a language accepted by a one-way self-verifying nondeterministic simple 2-head finite automaton, but not accepted by any one-way deterministic simple multihead finite automaton, (3) there is a language accepted by a one-way nondeterministic 2-head (resp., simple 2-head) finite automaton, but not accepted by any one-way self-verifying nondeterministic multihead (resp., simple multihead) finite automaton, (4) for each k 1, two-way Las Vegas k-head (resp., simple k-head) finite automata have the same accepting powers as two-way self-verifying nondeterministic k-head (resp., simple k-head) finite automata, and (5) two-way Las Vegas simple 2-head finite automata are more powerful than two-way deterministic simple 2-head finite automata.

In this paper, we present improved alternative sequential filter-edge detector using generalized directional morphological filters. Based on the properties of effective noise removal and detail preservation of the generalized directional morphological filters, we apply these filters to edge detection of noisy images. The performance of the edge detection in the presence of mixed noise is evaluated. Simulations show that edge detection method using generalized directional morphological filters can also improve the performance.

We have developed a new planar lightwave circuit (PLC) platform eliminating Si terraces for hybrid integrated optical modules. This PLC platform has the advantage of a lower fabrication cost than the conventional PLC platform with an Si terrace, because it does not require fabrication processes such as Si terrace forming and mechanical polishing. Using our new PLC platform structure, we fabricated a transceiver for optical access networks and an 8-channel multi-channel photoreceiver for wavelength division multiplexing (WDM) interconnection systems.

A digit-recurrence algorithm for cube rooting is proposed. In cube rooting, the digit-recurrence equation of the residual includes the square of the partial result of the cube root. In the proposed algorithm, the square of the partial result is kept, and the square, as well as the residual, is updated by addition/subtraction, shift, and multiplication by one or two digits. Different specific versions of the algorithm are possible, depending on the radix, the digit set of the cube root, and etc. Any version of the algorithm can be implemented as a sequential (folded) circuit or a combinational (unfolded) circuit, which is suitable for VLSI realization.

In this paper, we present deterministic parallel algorithms for the convex hull of sorted points and their application to a related problem. The algorithms are proposed for the coarse grained multicomputer (CGM) model. We first propose a cost optimal parallel algorithm for computing the problem with a constant number of communication rounds for n/p p2, where n is the size of an input and p is the number of processors. Next we propose a cost optimal algorithm, which is more complicated, for n/p pε, where 0 < ε < 2. From the above two results, we can compute the convex hull of sorted points with O(n/p) computation time and a constant number of communication rounds for n/p pε, where ε > 0. Finally we show an application of our convex hull algorithms. We solve the convex layers for d lines in O((n log n)/p) computation time with a constant number of communication rounds. The algorithm is also cost optimal for the problem.

This paper proposes a nonlinear distortion suppression scheme for optical direct FM Radio-on-Fiber system. This scheme uses the interaction between the nonlinearities of DFM-LD and OFD to suppress a 3rd order intermodulation distortion. We theoretically analyze the carrier to noise-plus-distortion ratio (CNDR) and show a controlling method in the MZI type OFD to realize the proposed suppression scheme.

We propose a new intelligent blind source separation algorithm for the mixture of sub-Gaussian and super-Gaussian sources. The algorithm consists of an update equation of the separating matrix and an adjustment equation of nonlinear functions. To verify the validity of the proposed algorithm, we compare the proposed algorithm with extant methods.

In the wireless asynchronous transfer mode (ATM) networks, a custom data link control (DLC) layer protocol with stronger error correction ability is needed for mitigating the affect of radio channel errors. This paper applies punctured turbo code schemes to the protection of the header and various payloads in wireless ATM cell, which are realized by the combination of programmable interleaving and puncturing. Their performance is analyzed for Rayleigh fading channel, which shows more significant reduction in cell loss rate (CLR) than the previous systems. Our proposal also provides good balance designs for CLR and the payload bit error rate (BER), and offers potential for future evolutionary improvement of the wireless ATM coding scheme.

We propose the problem of how to transmit an information-theoretically secure bit using random deals of cards among players in hierarchical groups and a computationally unlimited eavesdropper. A player in the highest group wants to send players in lower groups a secret bit which is secure from the eavesdropper and some other players. We formalize this problem and design protocols for constructing secret key exchange spanning trees on hierarchical groups. For each protocol we give sufficient conditions to successfully construct a secret key exchange spanning tree for the hand sizes of the players and the eavesdropper.

Many methods have been proposed to detect intrusions; for example, the pattern matching method on known intrusion patterns and the statistical approach to detecting deviation from normal activities. We investigated a new method for detecting intrusions based on the number of system calls during a user's network activity on a host machine. This method attempts to separate intrusions from normal activities by using discriminant analysis, a kind of multivariate analysis. We can detect intrusions by analyzing only 11 system calls occurring on a host machine by discriminant analysis with the Mahalanobis' distance, and can also tell whether an unknown sample is an intrusion. Our approach is a lightweight intrusion detection method, given that it requires only 11 system calls for analysis. Moreover, our approach does not require user profiles or a user activity database in order to detect intrusions. This paper explains our new method for the separation of intrusions and normal behavior by discriminant analysis, and describes the classification method by which to identify an unknown behavior.

We have developed the design procedure of multi-wavelength pumped Raman amplifiers, introducing superposition rule and account for pump-to-pump energy transfer. It is summarized with respect to the pumping wavelength and power allocation. The comparisons between simulated and experimental results are presented. Section 2 reviews the fundamentals of Raman amplifier. In this section, Raman gain spectra measured for different fibers are presented and the difference among the spectra is discussed. Section 3 describes the way to determine the pumping wavelength allocation by introducing superposition method. By means of this design method, some optimized design examples are presented, where the peak levels of Raman gain are fixed to 10 dB for the wavelength range from 1525 nm to 1615 nm (C- plus L-band) in all cases. From these results, it is confirmed that better gain flatness can be obtained by using the larger number of pumps. Section 4 explains how the pump-to-pump energy transfer changes the gain profile by experimental and simulated results. In this section, simulation modeling to perform precise numerical simulation is also presented. From the above discussion, the design procedure can be simplified: (1) one determines pump wavelengths with which a desired composite Raman gain can be obtained by adding in logarithmic scale individual Raman gain spectra shifted by the respective wavelength differences with adequate weight factors. And (2), one predicts how much power should be launched in order to realize the weight factors through precise numerical simulations. Section 5 verifies the superposition rule and the effect of pump-to-pump energy transfer by comparing a measured Raman gain with a superposed one. The agreement of two gain profiles shows that the multi-wavelength pumped Raman gain profile contains only the individual gain profiles created by the respective pump wavelengths. Section 6 concludes this paper.

Based on filtering ground clutter power directly in the frequency domain, a new non-coefficient Adaptive MTI (AMTI) scheme is presented in this letter. The results of simulation example show that this scheme has smaller signal-to-noise ratio loss than the classical AMTI based on spectral estimation, as well as high improvement factor.

An improved dynamic protocol for variable-sized messages is proposed in WDM-based local network, when nodal transceiver has nonzero tuning time. With the protocol, data channel is assigned dynamically. However, once a node reserves one data channel, it can persistently use the reserved channel till message transmission is finished. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.

Let m 2, n 2, and q 2 be positive integers. Let Sr and Sb be two disjoint sets of points in the plane such that no three points of Sr Sb are collinear, |Sr| = nq, and |Sb| = mq. This paper shows that Kaneko and Kano's conjecture is true, i.e., there are q disjoint convex regions of the plain such that each region includes n points of Sr and m points of Sb. This is a generalization of 2-dimension Ham Sandwich Theorem.

Elliptic curve cryptosystems are based on the elliptic curve discrete logarithm problem (ECDLP). If elliptic curve cryptosystems avoid FR-reduction and anomalous elliptic curve over Fq, then with current knowledge we can construct elliptic curve cryptosystems over a smaller definition field. ECDLP has an interesting property that the security deeply depends on elliptic curve traces rather than definition fields, which does not occur in the case of the discrete logarithm problem (DLP). Therefore it is important to characterize elliptic curve traces explicitly from the security point of view. As for FR-reduction, supersingular elliptic curves or elliptic curve E/Fq with trace 2 have been reported to be vulnerable. However unfortunately these have been only results that characterize elliptic curve traces explicitly for FR- and MOV-reductions. More importantly, the secure trace against FR-reduction has not been reported at all. Elliptic curves with the secure trace means that the reduced extension degree is always higher than a certain level. In this paper, we aim at characterizing elliptic curve traces by FR-reduction and investigate explicit conditions of traces vulnerable or secure against FR-reduction. We show new explicit conditions of elliptic curve traces for FR-reduction. We also present algorithms to construct such elliptic curves, which have relation to famous number theory problems.

This paper presents the outline of the systolic array recursive least-squares (RLS) processor prototyped primarily with the aim of broadband mobile communication applications. To execute the RLS algorithm effectively, this processor uses an orthogonal triangularization technique known in matrix algebra as QR decomposition for parallel pipelined processing. The processor board comprises 19 application-specific integrated circuit chips, each with approximately one million gates. Thirty-two bit fixed-point signal processing takes place in the processor, with which one cycle of internal cell signal processing requires approximately 500 nsec, and boundary cell signal processing requires approximately 80 nsec. The processor board can estimate up to 10 parameters. It takes approximately 35 µs to estimate 10 parameters using 41 known symbols. To evaluate signal processing performance of the prototyped systolic array processor board, processing time required to estimate a certain number of parameters using the prototyped board was comapred with using a digital signal processing (DSP) board. The DSP board performed a standard form of the RLS algorithm. Additionally, we conducted minimum mean-squared error adaptive array in-lab experiments using a complex baseband fading/array response simulator. In terms of parameter estimation accuracy, the processor is found to produce virtually the same results as a conventional software engine using floating-point operations.

Photonic crystals have seen major advances in the past few years in the optical range. The association of in-plane waveguiding and two-dimensional photonic crystals (PCs) in thin-slab or waveguide structures leads to good 3D confinement with easy fabrication. Such structures, much easier to fabricate than 3D PCs open many exciting opportunities in optoelectronic devices and integrated optics. We present experiments on a variety of structures and devices, as well as modelling tools, which show that 2D PCs etched through waveguides supported by substrates are a viable route to high-performance PC-based photonic integrated circuits (PICs). In particular, they exhibit low out-of-plane diffraction losses. Low-loss waveguides, high finesse microcavities, and their mutual coupling are demonstrated. PACS: 42.70 QS, 42.55 Sa, 42.82 m, 42.50-p.

We report on the demonstration of a fast restorable all-optical WDM network. This network consisted of four 44 optical cross-connects (OXC's) and four in-line optical amplifiers. These OXC's monitored not only the status of various network elements and quality of optical signals but also the optical path of each channel continuously. Thus, this network could automatically identify the causes of most network failures. For the fast restoration, we implemented these OXC's by using thermo-optic polymer switches (switching time: < 1.5 ms) and used hardware interrupt when LOS was detected. In addition, we used a pre-planned routing table made by using a simple heuristic routing and wavelength assignment algorithm. The results show that this network could be restored from any single link failure within 6 ms even when the restoration path was 400 km.

This paper proposes a nonlinear distortion suppression scheme for optical direct FM Radio-on-Fiber system. This scheme uses the interaction between the nonlinearities of DFM-LD and OFD to suppress a 3rd order intermodulation distortion. We theoretically analyze the carrier to noise-plus-distortion ratio (CNDR) and show a controlling method in the MZI type OFD to realize the proposed suppression scheme.