In this paper, we show a collusion attack on the novel and sophisticated ID-based non-interactive key sharing scheme proposed by Tanaka [2], [3]. It is based on a linear algebraic approach [4]. We discuss its complexity and provide numerical simulation results of the success probability in forging the shared keys.

An adaptive algorithm for a single sinusoid detection using IIR bandpass filter with parallel block structure has been proposed by Nishimura et al. However, the algorithm has three problems: First, it has several input frequencies being impossible to converge. Secondly, the convergence rate can not be higher than that of the scalar structure. Finally, it has a large amount of computation. In this paper, a new algorithm is proposed to solve these problems. In addition, a new structure is proposed to reduce the amount of computation, in which the adaptive control signal generator is realized by the paralel block structure. Simulation results are given to illustrate the performance of the proposed algorithm.

In this paper, we study three-dimensional motion estimation using optical flow. We construct a weighted quotient-form objective function that provides an unbiased estimator. Using this objective function with a certain projection operator as a weight drastically reduces the computational cost for estimation compared with using the maximum likelihood estimator. To reduce the variance of the estimator, we examine the weight, and we show by theoretical evaluations and simulations that, with an appropriate projection function, and when the noise variance is not too small, this objective function provides an estimator whose variance is smaller than that of the maximum likelihood estimator. The use of this projection is based on the knowledge that the depth function has a positive value (i. e., the object is in front of the camera) and that it is generally smooth.

Air interfaces of the future mobile communication are widely spreading, because of the multimedia service demands, technology trends and radio propagation conditions. Radio-Highway Networks are expected to realize the universal, seamless and multi-air-interface capability for mobile access networks, and play an important role in the future multimedia radio communications. For the radio-highway networks, this paper newly proposes natural bandpass sampling - asynchronous time division multiple access (NBS-ATDMA) method, where radio signals are natural bandpass sampled at the radio base station and are asynchronously multiplexed on the optic fiber bus link and intelligently transmitted to its desired radio control station. We theoretically analyze the loss probability of the radio signal due to collision in the network and the carrier-to-noise power ratio of received radio signals at the radio control station. Moreover, in order to reduce the loss probability, two access control methods, carrier sense and pulse width control, are proposed, and it is clarified that these improve the number of base station connected to radio highway networks.

Recently applications of Hilbert curves are studied in the area of image processing, image compression, computer hologram, etc. We have proposed a fast Hilbert scanning algorithm using lookup tables in N dimensional space. However, this scan is different from the one of previously proposed scanning algorithms. Making the lookup tables is a problem for the generation of several Hilbert scans. In this note, we describe a method of making lookup tables from a given Hilbert scan which is obtained by other scanning methods.

A cumulant-based lattice algorithm for multichannel adaptive filtering is proposed in this paper. Proposed algorithm takes into account the advantages of higer-order statistics, that is, improvement of estimation accuracy, blindness to colored Gaussian noise and the possibility to estimate the nonminimum-phase system etc. Without invoking the Instrumental Variable () method as used in other papers [1], [2], the algorithm is derived directly from the recursive pseudo-inverse matrix. The behavior of the algorithm is illustrated by numerical examples.

The purpose of this paper is to provide a practical tool for performing a shift operation in orthonormal compactly supported wavelet bases. This translation τ of a discrete sequence, where τ is a real number, is suitable for filter bank implementations. The shift operation in this realization is neither related to the analysis filters nor to the synthesis filters of the filter bank. Simulations were done on the Daubechis wavelets with 12 coefficients and on complex valued wavelets. For the latter ones a real input sequence was used and split up into two subsequences in order to gain computational efficiency.

Network functions (NFs) such as network reflection and transmission coefficients are discussed about an interconnected network consisting of a lumped distributed N-port N non-commensurate line junction network (N-port) and a M-port. The derivation of the NFs can be done quite easily regardless of the complexity of the network by considering the flow of the traveling waves and conditions of the interconnected interface of the two multi-ports. The theory of this paper has been examined with respect to interconnected networks consisting of two 3-ports in both the time and frequency domains, and has shown good results consistent with other papers. The network functions described here can be used not only for the analysis of high-speed pulse propagation in digital systems with branches but also for the analysis of microwave distributed line networks such as hybird rings. In that sense, a new analysis method is presented in this paper.

This article analyzes dynamics of the chaotic neural network and minimum searching principle of this network. First it is indicated that the dynamics of the chaotic newral network is described like a gradient decent, and the chaotic neural network can roughly find out a local minimum point of a quadratic function using its attractor. Secondly It is guaranteed that the vertex corresponding a local minimum point derived from the chaotic neural network has a lower value of the objective function. Then it is confirmed that the chaotic neural network can escape an invalid local minimum and find out a reasonable one.

This paper describes a variable multi-level QAM modem applied to a wireless ATM transport network with the aim of effectively offering ATM network services over a terrestrial digital radio system. The concept of the wireless ATM transport network based on a Virtual Path (VP) capacity control system which optimizes both the number of channels and the multi-level QAM scheme for existing traffic variation is discussed. To achieve a hitless switch as a technical requirement of this network, we propose a modem configuration and a modulation scheme control (MSC) signal transmission. In this modem configuration, a multi-level control logic circuit in the modulator is used as the signal formatter. A modulated signal for the modulation scheme is maintained at a constant average power. Decision data and error signal selection for the received signal is carried out in the multi-level control logic circuit in the demodulator. The fluctuation of the demodulator loops due to modulation scheme switch can be reduced by using a fully digitized AGC loop and by converting the received signal to the condition of decision level constant. The MSC signal inserted into the first path data signal is transmitted without error by arranging the maximum amplitude of the signal point set. In this way, switching between the modulator and the demodulator is possible frame by frame. Finally, we present experimental results for a variable multi-level QAM modem employing four modulation schemes: QPSK, 16 QAM, 64 QAM, and 256 QAM. Through experiments, we prove that the modulation scheme is switched without fluctuation of the demodulator control loops by maintaining the signal condition of the decision level constant. The achievement of a hitless switch for multi-level QAM is also confirmed by experiments.

This paper presents a method of employing a priority scheme in a random access environment. A prioritized nonblocked stack collision resolution algorithm with binary feedback is developed and tested using simulations. The algorithm accommodates an n-level priority scheme which makes it attractive in mobile data systems. The effectiveness of the algorithm is described on its ability to first, reject the lowest priority class when the system load is near or on the maximum value and second, minimize the delay spread of the higher class users. The performance of the algorithm is characterized using the throughput/delay and cumulative delay for each class of users.

A new line simulator, SEMALIS has been developed. This simulator can handle complicated lot processings to maintain processing quality and efficient line operations to improve line performance. The current manufacturing line consists of five resource models: lot, process sequence, equipment, lot processing, and line operations. The parameters of these models are defined so as to accurately reflect the state of the line operations. From our simulation results, we confirmed that SEMALIS accurately identifies bottlenecks or starvations where equipment can be added or reduced to optimize equipment utilization through resource planning, and that SEMALIS can also be used to evaluate the long-term effects of line operating methods on the line performance of ASIC manufacturing lines.

Multiple TDMA bursts assignment between a base station and a personal terminal will be required for multimedia communications that offers high speed signal transmission such as voice and data simultaneous transmission. This paper proposes a reliable packet transmission method for TDMA based wireless multimedia communications. The proposed method employs an adaptive transmission rate control according to the packet length and a burst diversity technique is applied to improve the frame error rate of a packet. The frame error rate performance has been approximated theoretically by using fade- and infade-duration statistics of a Rayleigh fading channel and a computer simulation has been carried out for two control channels, FACCH/SACCH (Fast/Slow Associated Control CHannel) in the PHS as well as GSM. Both results indicate that the frame error rate is dramatically improved, about one order, when two bursts have different frequency and improved by about 25% when the two bursts have the same frequency.

In an adaptive load balancing, the location policy to determine a destination node for transferring tasks can be classified into three categories: dynamic selection, random selection, and state polling. The dynamic selection immediately determines a destination node by exploiting the state information broadcasted from other nodes. It not only requires the overheads of collecting the state information, but may cause an unpredictable behavior unless the state information is accurate. Also, it may not guarantee even load distribution. The random selection determines a destination node at random. The state polling determines a destination node by polling other nodes. It may cause some problems such as useless polling, unachievable load balancing, and system instability. A new Sender-initiated Adaptive LOad balancing scheme (SALO) is presented to remedy the above problems. It determines a destination node by exploiting the predictable state knowledge and by polling the destination node. It can determine a good destination with minimal useless polling and guarantee even load distribution. Also, it has an efficient mechanism and good data structure to collect the state information simply. An analytic model is developed to compare with other well known schemes. The validity of the model is checked with an event-driven simulation. With the model and the simulation result, it is shown that SALO yields a significant improvement over other schemes, especially at high system loads.

This paper discusses key technologies for intelligent radio transmissions and intelligent network constitution techniques for advanced wireless communication systems. In the former part, this paper discusses the intelligent radio transmission techniques, in which the adaptive modulation techniques are mainly introduced because it is very effective to intelligently assign radio resources to each terminals as well as to intelligently control radio transmission parameters under dynamically changing traffic, required quality of services (QOS), and channel conditions. In the latter part, this paper discusses intelligent networking techniques, in which autonomous radio networking techniques and IP address control techniques for mobile host in the Internet are introduced to obtain suggestions for future intelligent and robust networking technologies.

In order to pave the way to B-ISDN, one of the most important issues for network providers is to identify the most efficient B-ISDN introduction strategy. This paper focuses on the costs of introducing ATM transmission systems into backbone transport networks which must provide highly reliable broad band transmission capability. In this context, the main rival to ATM is Synchronous Transfer Mode (STM); recent Synchronous Digital Hierarchy (SDH) equipment supports the establishment of advanced STM-based high speed transport networks. This paper offers a cost comparison of ATM and STM based backbone transport networks. A digital path network in STM has a hierarchical structure determined by the hierarchical multiplexing scheme employed. The minimum cost STM path network can only be determined by developing a path design method that considers all hierarchical path levels and yields the optimum balance of link cost and node cost. Virtual paths have desirable features such as non-deterministic path bandwidth and non-hierarchical and direct multiplexing capability into high speed optical transmission links. These features make it possible to implement a non-hierarchical VP network with ATM cross connect systems which can handle any bandwidth VP with a universal cell switching function. This paper shows that the non-hierarchical VP routing, which strongly minimizes link cost, can be implemented without significantly increasing node cost. Network design simulations show that the virtual path scheme, possible only in an ATM network, yields the most cost effective path network configuration.

This paper describes Kleenean coefficients that are a subset of Kleenean functions for use in representing multiple-valued logic functions. A conventional multiple-valued sum-of-products expression uses product terms that are the MIN of literals and constants. In this paper, a new sum-of-products expression is allowed to sum product terms that also include variables and complements of variables. Since the conventional sum-of-products expression is complete, so also is the augmented one. A minimization method of the new expression is described besed on the binary Quine-McCluskey algorithm. The result of computer simulation shows that a saving of the number of implicants used in minimal expressions by approximately 9% on the average can be obtained for some random functions. A result for some arithmetic functions shows that the minimal solutions of MOD radix SUM, MAX and MIN functions require much fewer implicants than those of the standard sum-of-products expressions. Thus, this paper clarifies that the new expression has an advantage to reduce the number of implicants in minimal sum-of-products expressions.

This letter presents a new design method for approximate inverse systems using all-pass networks. The efficacy of approximate inverse systems for input and parameter estimation of nonminimum phase systems is well recognized. in the previous methods, only time domain design of FIR (finite impulse response) type approximate inverse systems were considered. Here, we demonstrate that IIR (infinite impulse response) type approximate inverse systems outperform the previous methods. A nonlinear optimization technique is adopted for designing the proposed system in the frequency domain. Numerical examples are also presented to show the effectiveness of the proposed method.

In this paper, we give a direct proof of the result of Latteux and Turakainen that the full class of recursively enumerable languages can be obtained from minimal linear languages (which are generated by linear context-free grammars with only one nonterminal symbol) by Dyck reductions (which reduce pairs of parentheses to the empty word).

We study the capacity assignment and routing procedure for a simultaneous multipoint-to-point communication network called convergence cast communication (con-cast). In capacity assignment, we analyse the network in two different application model, single destination and variable destination concast group. In each model, we determine the optimal capacity and network configuration. In routing procedure, since the problem is computationally intractable[1], [2], we present a heuristic algorithm that, under condition of the capacity constraint, selects a set of connections for n-1 separated points to one point. This is accomplished by considering a hierarchical structure and a flow decomposition technique in the network. The algorithm finds a solution for connection assignment in convergence-type communications. Theoretical analysis and computer simulation of the proposed method are given.