Recent progresses in high Tc superconducting quantum interference device (SQUID) magnetometers are discussed. First, intrinsic sensitivity of the SQUID at T=77 K is discussed. For this purpose, transport and noise properties of the bicrystal junction are clarified, and optimization of junction parameters is shown. We also discuss the quality of the SQUID from a comprehensive comparison between experiment and simulation of the SQUID characteristics. Next, we discuss issues to guarantee correct operation of the SQUID magnetometer in noisy environment, such as a method to avoid flux trapping due to earth magnetic field, high-bandwidth electronics and gradiometer. Finally, we briefly describe application fields of the high Tc magnetometer.

This paper describes the design principles, the specification, and evaluations of a new 128-bit block cipher E2, which was proposed to the AES (Advanced Encryption Standard) candidates. This algorithm supports 128-bit, 192-bit, and 256-bit secret keys. The design philosophy of E2 is highly conservative; the structure uses 12-round Feistel as its main function whose round function is constructed with 2-round SPN structure, and initial/final transformational functions. E2 has practical security against differential attack, linear attack, cryptanalysis with impossible differential, truncated differential attack, and so on. Furthermore, E2 can be implemented efficiently and flexibly on various platforms because the primitive operations involve byte length processing.

A hierarchical structure of the statistical models involving the parametric, state space, generalized state space, and self-organizing state space models is explained. It is shown that by considering higher level modeling, it is possible to develop models quite freely and then to extract essential information from data which has been difficult to obtain due to the use of restricted models. It is also shown that by rising the level of the model, the model selection procedure which has been realized with human expertise can be performed automatically and thus the automatic processing of huge time series data becomes realistic. In other words, the hierarchical statistical modeling facilitates both automatic processing of massive time series data and a new method for knowledge discovery.

This paper presents a simple and generic conversion from a public-key encryption scheme that is indistinguishable against chosen-plaintext attacks into a public-key encryption scheme that is indistinguishable against adaptive chosen-ciphertext attacks in the random oracle model. The scheme obtained by the conversion is as efficient as the original encryption scheme and the security reduction is very tight in the exact security manner.

This paper presents a simulated annealing (SA)-based algorithm for fast and robust block motion estimation. To reduce computational complexity, the existing fast search algorithms move iteratively toward the winning point based only on a finite set of checking points in every stage. Despite the efficiency of these algorithms, the search process is easily trapped into local minima, especially for high activity image sequences. To overcome this difficulty, the new algorithm uses two sets of checking points in every search stage and invokes the SA to choose the appropriate one. The employment of the SA provides the search a mechanism of being able to move out of local minima so that the new algorithm is less susceptible to such a dilemma. In addition, two schemes are employed to further enhance the performance of the algorithm. First, a set of initial checking points which exploit high correlations among the motion vectors of the temporally and spatially adjacent blocks are used. Second, an alternating search strategy is addressed to visit more points without increasing computations. Simulation results show that the new algorithm offers superior performance with lower computational complexity compared to previous works in various scenarios.

We propose a new probabilistic ID-based non-interactive key sharing scheme that has non-separable secret-key functions and a non-separable common-key function. The proposed scheme uses the calculation over modulo-P, modulo-Q and over integer ring for realizing non-separability. This proposed scheme has a large threshold against linear attack by the collusive entities.

We report on the fabrication and operation of all-NbN single flux quantum (SFQ) circuits with resistively shunted NbN/AlN/NbN tunnel junctions fabricated on silicon substrates. The critical current varied by about 5% in 400 NbN/AlN/NbN junction arrays, where the junction area was 88 µm2. Critical current densities of the NbN/AlN/NbN tunnel junctions showed exponential dependence on the deposition time of the AlN barrier. By using the 12-nm-thick Cu film as shunted resistors, non-hysteretic current-voltage characteristics were achieved. From dc-SQUID measurements, the sheet inductance of our NbN stripline was estimated to be around 1.2 pH at 4.2 K. We designed and fabricated circuits consisting of dc/SFQ converters, Josephson transmission lines, and T flip-flop-based SFQ/dc converters. The circuits demonstrated correct operation with a bias margin of more than 15% at 4.2 K.

The paper shows some of benefits of multi-unitary decomposition in signal analysis applications. It is emphasized that decompositions of complex discrete-time signals onto a single basis provide an incomplete and in such way potentially misleading image of the signals in signal analysis applications. It is shown that the multi-unitary decimated filter banks which decompose the analyzed signal onto several bases of the given vector space can serve as a tool which provides a more complete information about the signal and at the same time the filter banks can enjoy efficient polyphase component implementation of maximally decimated, i. e. nonredundant, filter banks. An insight into the multi-unitary signal decomposition is provided. It is shown that the multiple-bases representation leads to an efficient computation of frequency domain representations of signals on a dense not necessarily uniform frequency grid. It is also shown that the multiple-bases representation can be useful in the detection of tones in digital implementations of multifrequency signaling, and in receivers of chirp systems. A proof is provided that there are possible benefits of the multiple-bases representations in de-noising applications.

In this paper, we show two process allocation schemes to tolerate multiple faults when the primary-backup replication method is used. The first scheme, called multiple backup scheme, is running multiple backup processes for each process to tolerate multiple faults. The second scheme, called regenerative backup scheme, is running only one backup process for each process, but re-generates backup processes for processes that do not have a backup process after a fault occurrence to keep the primary-backup process pair available. In both schemes, we propose heuristic process allocation methods for balancing loads in spite of the occurrence of faults. Then we evaluate and compare the performance of the proposed heuristic process allocation methods using simulation. Next, we analyze the reliability of two schemes based on their fault-tolerance capability. For the analysis of fault-tolerance capability, we find the degree of fault tolerance for each scheme. Then we find the reliability of each scheme using Markov chains. The comparison results of two schemes indicate that the regenerative single backup process allocation scheme is more suitable than the multiple backup allocation scheme.

This paper presents a new fuzzy dynamic output feedback controller design technique for the Takagi Sugeno (T-S) fuzzy model with unknown-but-bounded time-varying modeling error. It is shown that the quadratic stabilization problem of the T-S fuzzy modeled system can be converted into an H control problem of the scaled polytopic Linear Parameter Varying (LPV) system. Then, a controller satisfying a prescribed H performance is designed for the stabilization of the T-S fuzzy modeled system.

This paper proposes a novel DS/CDMA system with code-diversity techniques constituted by a simple system to suppress multiple access interference (MAI) without estimating the PN sequence of interference at the receiver. In the transmitter, the data signal is modulated with a sum of several PN sequences, and, two types of code- diversity reception are proposed, (1) maximal-ratio combining (MRC) code-diversity by autocorrelation, and (2) MRC code-diversity by anti-crosscorrelation. By computer simulations, it is shown that MRC code-diversity by anti-crosscorrelation is superior to the other one. It is also shown that MRC code-diversity by anti-crosscorrelation can improve BER more effectively for the interference which takes the phase to degrade BER at the worst. Next, to design the optimum number of branches for code-diversity, average BERs are calculated for several combinations of codes in code-diversity. As a result, the optimum number of branches varies for each combination of codes, however, it is decided from 3 to 7 branches. Finally, the effectivity of the proposed system in a near-far problem is presented.

We have developed a diagnostic Case-Based Reasoning (CBR) system, Doctor, which infers possible defects in a home electrical appliance and lists up necessary service parts. The CBR is suitable to build a diagnostic system for the field service because the CBR imitates how experienced service technicians infer and is able to learn defect trends and novel repair cases from a service report database. In order to apply a CBR system to this real-world problem, Our system has the following new features: (1) Its CBR mechanism utilizes not only repair cases, but also diagnostic rules that are elicited from human experts so that accurate diagnosis can be achieved. (2) Its casebase maintenance mechanism updates the casebase and adapts it to the changing real world.

This paper proposes a novel spread spectrum (SS) modem for random access satellite communication systems that employs digital matched filters. The proposed modem employs a parallel structure to ensure detection of packet arrival. Code timing detection with a combination of a coarse detector and a fractional error detector reduces the sampling rate while maintaining the BER performance. An in-symbol pilot multiplexing scheme is also proposed for fast and stable carrier synchronization with a simple hardware. A performance evaluation shows that the proposed modem achieves the UW miss-detection probability of 10-4 at the Eb/No of 0 dB. The overall BER performance achieved in experiments well agrees simulation.

This paper proposes an adaptive list-output Viterbi equalizer (LVE) with fast compare-select operation, in order to achieve a good trade-off between bit error rate (BER) performance and processing speed. An LVE, which keeps several survivors for each state, has good BER performance in the presence of wide-spread intersymbol interference. However, the LVE suffers from large processing delay due to its sorting-based compare-select operation. The proposed adaptive LVE greatly reduces its processing delay, because it simplifies compare-select operation. In addition, computer simulation shows that the proposed LVE causes only slight BER performance degradation due to its simplification of compare-select operation. Thus, the proposed LVE achieves better BER performance than decision-feedback sequence estimation (DFSE) without an increase in processing delay.

Traffic management schemes such as Connection Admission Control (CAC), policing, and traffic shaping are important to provide multimedia communications with better Quality of Service (QoS). In the conventional model, admission control and policing are done at intermediate nodes, and traffic shaping is done at the edge of a network. However, QoS of communications should be defined between tasks or threads rather than between hosts. Therefore traffic management inside a host is as important as that in networks. We propose software-based traffic management architecture over a real-time microkernel. The architecture focuses on the interface between a network driver and user threads calling the driver. We categorized services of communication threads into three classes: Real-Time at Guaranteed Rate (RT-GR), Real-Time at Available Rate (RT-AR), and Best-Effort (BE). Our architecture is designed for an environment containing a mixture of these services. In the architecture, a sender periodic thread of RT-GR or RT-AR is executed such that the sending rate matches a user-specified rate. The network driver monitors the per-flow rate of injected data and discards the data if the injected rate exceeds the user-specified rate. To avoid the continuous discarding of data, the sending thread can adjust its sending rate by periodically looking at logged data concerning the rate. RT-AR service can achieve more than the specified rate when bandwidth is available. The scheme of software traffic management is effective in attaining higher throughput not only for full-duplex Ethernet but also for ATM because the difference of rate between hardware and software is reduced. In this paper, we describe the design and implementation of the software-based traffic management architecture on Real-Time Mach. The results of performance evaluations demonstrate that our traffic management scheme performs well for full-duplex Ethernet.

An efficient procedure is presented to determine the implicit exact solution of an arbitrary nonuniform transmission line (NTL), and its first order approximation (F. O. A. ) as an explicit expression. The method of the solution is based on the steplines approximation of the nonuniform transmission lines and quasi-TEM assumptions. Using steplines approximation the NTL is subdivided into a large number of uniform line segments (steps). Using time-domain approach and invoking the boundary conditions at the discontinuities of the adjacent steps, each step is modeled as continuous time domain linear filter characterized by a transfer function. The frequency domain transfer function of this filter is then obtained for linear termination networks. For very large number of steplines this transfer function approaches transfer function of the NTL. In the next step a F. O. A. , as an explicit expression of the exact response will be obtained. This F. O. A. is more suitable for very short transmission lines which is often the case in integrated circuits and some of printed circuit boards. Then, the F. O. A. of the ABCD matrix will be obtained.

While higher chip rate can provide better performance for Direct Sequence/Code Division Multiple Access (DS/CDMA) systems due to larger process gain, it may also induce spectrum emission to adjacent channels, i. e. , adjacent channel interference. Especially, if different operators use adjacent channels in the same area with uncoordinated power levels, such interference becomes large, and excessively higher chip rate will decrease the efficiency of a system. In this context, this paper evaluates the relation between chip rate and capacity in DS/CDMA cellular communication systems considering adjacent channel interference from other systems. First, the classification of adjacent channel interference between two independent DS/CDMA systems is described, and the concrete interference levels are calculated for several chip rates. Then, by using computer simulation, the system CDMA capacity is evaluated under adjacent channel interference. From these results, we can find that the excessively higher chip rate can not always provide the larger system CDMA capacity in spite of the larger process gain, and there exists the appropriate chip rate for a certain given bandwidth.

I would like to draw the attention of the editorial board of IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences and its readers to a recent paper, Tianruo Yang, "The integrated scheduling and allocation of high-level test synthesis," vol. E82-A, no. 1, January 1999, pp. 145-158. (Here we call this paper the Yang's paper. ) Yang did not give the correct information about the originality of the paper. I will point out that the writings (and the idea accordingly) of section 6 of Yang's paper came from papers [1] and [2].

This paper discusses the employment of adaptive array antennas at the base station of a Multi Processing Gain (MPG) CDMA system. It is shown that the adaptive array antenna with the weight control scheme based on the signal before despreading procedure does not increase but even decreases the performance than that with an omni-directional antenna, and the cause of this serious performance degradation is revealed. Then it is shown that the performance with the weight control scheme based on the signal after despreading procedure is always better than that with an omni-directional antenna. Furthermore, the possibilities of performance improvement by the combination of adaptive array antenna and interference cancellation techniques are mentioned.

The transmission quality in mobile wireless communications is affected by not only the thermal noise but also the multipass fading which changes drastically an amplitude and a phase of received signal. The paper proposes the theoretical and approximate methods for deriving an average bit error rate in DS-CDMA systems under the Rician fading environment on the assumption of the frequency non-selective fading, as parameters of the number of simultaneous access stations, the maximum Doppler frequency and so on. It is confirmed from the coincidence of theoretical and approximate results with simulation ones that the proposed approach is applicable to a variety of system parameters.