The introduction of networks providing Internet-like services such as the Open Computer Network (OCN) by NTT and others like it will lead to higher level demands by users. For example, users will be asking for higher quality, greater functionality, and lower charges for high-speed, high-throughput data transfer. To respond effectively to the wishes of sophisticated and varied users, technological development must be pursued from the user's point of view. For this reason, research and development is being performed on middleware to open up network functions and make it possible for the user and network to cooperate with each other. This paper discusses the development of major technologies for achieving an enhanced internetworking that should become a catalyst for the future multimedia network, and presents a future vision for the network.

We have developed a network architecture that achieves ATM multicast communication services with receiver-specified quality of service (QoS) guarantee which depends on the dynamic resource environment of the receivers (e.g. CPU capability, memory capability, and network capability). We propose two receiver-initiated QoS guarantee methods and concentrate on the functions required to achieve them. Moreover, on our ATM testbed, we also evaluate the performance of an experimental implementation of the proposed methods.

This paper presents a new generation method of the periodic orthogonal numerical sequences with small maximum amplitude. In the generation method, complex exponential sequences are used as the generating sequences and such periodic orthogonal numerical sequences are constructed from the discrete Fourier transform of the generating sequences. Until now, there has not been found a generation algorithm to derive such sequences with any period. It is shown that the proposed generation method can derive periodic orthogonal real sequences with the maximum amplitude less than 1.5 for the period 1N200 and periodic orthogonal coplex sequences with all the sbsolute amplitude value of 1 for any period.

In computer hardware there is a constant evolution towards smaller transistor sizes. At the same time, more and more transistors are placed on one chip. Both trends make the pin limitation problem worse. Scaling down chip sizes adds to the shortage of available pins while increasing the number of transistors per chip imposes a higher need for chip terminals. The use of three-dimensional systems would alleviate this pin limitation problem. In order to decide whether the benefits of such systems balance the higher processing costs, one must be able to characterize these benefits accurately. This can be done by estimating important layout properties of electronic designs, such as space requirements and interconnection length values. For a two-dimensional placement, Donath found an upper bound for the average interconnection length that follows the trends of experimentally obtained average lengths. Yet, this upper bound deviates from the experimentally obtained value by a factor of approximately 2 which is not sufficiently accurate for some applications. In this paper, we first extend Donath's technique to a three-dimensional placement. We then compute a significantly more accurate estimate by taking into account the inherent features of the optimal placement process.

Field Programmable Gate Arrays (FPGA's) are important devices for rapid system prototyping. Roth-Karp decomposition is one of the most popular decomposition techniques for Look-Up Table (LUT) -based FPGA technology mapping. In this paper, we propose a novel algorithm based on Binary Decision Diagrams (BDD's) for selecting good lambda set variables in Roth-Karp decomposition to minimize the number of consumed configurable logic blocks (CLB's) in FPGA's. The experimental results on a set of benchmarks show that our algorithm can produce much better results than the similar works of the previous approaches.

A CAD-based faulty portion diagnosis technique for CMOS-LSI with single fault using abnormal Iddq has been developed to indicate the presence of physical damage in a circuit. This method of progressively reducing the faulty portion, works by extracting the inner logic state of each block from logic simulation, and by deriving test vector numbers with abnomal Iddq. To easily perform fault diagnosis, the hierarchical circuit structure is divided into primitive blocks including simple logic gates. The diagnosis technique employs the comparative operation of each primitive block to determine whether one and the same inner logic state with abnormal Iddq exists in the inner logic state with normal Iddq or not. The former block is regarded as normal block and the latter block is regarded as faulty block. Faulty portion of the faulty block can be localized easily by using input logic state simulation. Experimental results on real faulty LSI with 100k gates demonstrated rapid diagnosis times of within ten hours and reliable extraction of the faulty portion.

Nonuniform transmission lines are crucial in integrated circuits and printed circuit boards, because these circuits have complex geometries and layout between the multi layers, and most of the transmission lines possess nonuniform characteristics. In this article, an efficient numerical method for analyzing nonuniform transmission lines has been presented by using the Chebyshev expansion method and moment techniques. Efficiency on computational cost is demonstrated by numerical example.

We present theoretical results on the convergence of iterative methods for the solution of linear differential-algebraic equations arising form circuit simulation. The iterative methods considered include the continuous-time and discretetime waveform relaxation methods and the Krylov subspace methods in function space. The waveform generalized minimal residual method for solving linear differential-algebraic equations in function space is developed, which is one of the waveform Krylov subspace methods. Some new criteria for convergence of these iterative methods are derived. Examples are given to verify the convergence conditions.

A Unique Input/Output (UIO) sequence for the state J of a protocol is a sequence of input/output pairs that is unique to state J. Obtaining UIO sequences from the protocol specification is a very important problem in protocol conformance testing. Let n and m be the total number of states and transitions of the protocol, respectively, and dmax be the largest outdegree of any state, W. Chun and P. D. Amer proposed an O(n2(dmax)2n-1) algorithm to obtain the minimum-length UIO sequences (where the length refers to the number of input/output pairs). However, n and m are normally very large for real protocols. In this paper, we propose an O(n*m) algorithm for obtaining UIO sequences. In theory, our algorithm yields a UIO sequence which contains at most n1 input/output pairs. In experimentation, ten protocol examples collected from recent papers, the ISO TP0 protocol, the ISDN Q. 931 network-side protocol, and the CCITT X. 25 protocol show that in average the obtained UIO sequences are only 11.8% longer than the minimum-length ones, and 97.4% of the existent UIO sequences can be found. And our algorithm is extended for minimizing the cost of UIO sequences and for obtaining synchronizable UIO sequences, which have not been achieved by any algorithm proposed earlier.

To implement the PGPS packet scheduling algorithm in high speed networks is more difficult since it is based on real time simulation of an equivalent fluid-model system leading to a higher implementation time complexity. A modified approach to PGPS is the SCFQ scheme. This scheme is easy to implement, but has an increasing end-to-end delay bound. The VC packet scheduling algorithm provides the same end-to-end delay bound as PGPS does, but has the disadvantage of unfairness. As SCFQ, SFQ is much easier to implement than PGPS and achieves the same fairness, but has a higher end-to-end delay bound than PGPS. We propose a new packet scheduling algorithm, called Minimum Starting-tag Fair Queueing (MSFQ), which assigns the virtual time to be the minimum starting tag over all backlogged connections. MSFQ is much easier to implement than PGPS and provides the same end-to-end delay bound for each connection and fairness as PGPS. In this paper, we will show the end-to-end delay bound and fairness of MSFQ and compare 5 rate-based packet scheduling algorithms including PGPS, VC, SCFQ, SFQ, and MSFQ focusing on end-to-end delay bound, fairness, and implementation time complexity.

Distributed multimedia applications are often sensitive to the Quality of Service (QoS) provided by the communication network. They usually require guaranteed QoS service, so that real-time communication is possible. However, searching a route with multiple QoS constraints is known to be a NP-complete problem. In this paper, we propose a new simple and efficient distributed QoS routing algorithm, called "DQoSR," for supporting real-time communication in high-speed networks. It searches a route that could guarantee bandwidth, delay, and delay jitter requirements. Routing decision is based only on the modified cost, hop and delay vectors stored in the routing table at each node and its directly connected neighbors. Moreover, DQoSR is proved to construct loop-free routes. Its worst case message complexity is O(|V|2), where |V| is the number of nodes in the network. Thus DQoSR is fast and scales well to large networks. Finally, extensive simulations show that average rate of establishing successful connection of DQoSR is very near to optimum (the difference is less than 0.4%).

High-Tc SQUID was applied to the detection of magnetized fine particle moving at high speed. Two types of SQUIDs were used. One was a large washer type and the other was a flux transformer type. Their Josephson junctions were step edge type. The iron particle was attached on a nylon wire and scanned under the SQUID. High-Tc SQUID detected an iron particle of 50 µm diameter running at 800 m/min. It was shown that the magnetic field measured by the SQUID was proportional to the volumer of the particle and is inversely proportional to the distance between the SQUID and the particle. This technique using high-Tc SQUID is hopeful not only to wire production line but also for the processing of food and medicine, etc.

This study shows the results of evaluating the flux noises at low frequency when the alternating current(AC) bias direct offset integrated technique(DOIT) with additional positive feedback (APF) is used in a high-Tc dc superconducting quantum interference device (SQUID). The AC-bias DOIT can reduce low-frequency noise without increasing the level of white noise because each operating point in the two voltage-flux characteristics with AC bias can always be optimum on the magnetometer in the high-Tc dc-SQUID. APF can improve the effective flux-to-voltage transfer function so that it can reduce the equivalent flux noise due to the voltage noise of the preamplifier in the magnetometer. The use of APF combined with the AC-bias DOIT reduced the noise of the magnetometer by factors of 1.5 (33µΦ0/Hz vs. 50 µΦ0/Hz) at100 Hz, 3.5 (43 µΦ0/Hz vs. 150 µΦ0/Hz) at 10 Hz, and 5.2 (67 µΦ0/Hz vs. 351 µΦ0/Hz) at 1 Hz as compared with the noise levels that were obtained with the static-current-bias DOIT. The contribution of the factors at 1 Hz is about 2 by APF and 2.6 by AC bias. The performance of improving the flux noise in the AC -bias DOIT with APF is almost equal to that of the flux locked loop (FLL) circuits in which the flux modulation uses a coupling system with a transformer and with the AC bias.

This paper presents an exact minimization algorithm for AND-OR-EXOR three-level networks, where a single two-input exclusive-OR (EXOR) gate is used. The network realizes an EXOR of two sum-of-products expressions (EX-SOP), where the two sum-of-products expressions (SOP) can share products. The objective is to minimize the total number of different products in the two SOPs. An algorithm for the exact minimization of EX-SOPs with up to five variables are shown. Up to five variables, EX-SOPs for all the representative functions of NP-equivalence classes were minimized. For five-variable functions, we confirmed that minimum EX-SOPs require up to 9 products. For n-variable functions, minimum EX-SOPs require at most 92n-5 (n6) products.

In this paper, we present an error concealment method to recover damaged blocks for block-based image coding schemes. Imperfect transmission of image data results in damaged blocks in the reconstructed images. Hence recovering damaged image blocks is needed for reliable image communications. To recover damaged blocks is to estimate damaged blocks from the correctly received or undamaged neighborhood information with a priori knowledge about natural images. The recovery problem considered in our method is to estimate a larger block, which consists of a damaged block and the undamaged neighborhood, from the undamaged neighborhood. To find an accurate estimate, a set of the feature vectors is introduced and an estimate is expressed as a linear combination of the feature vectors. The proposed method recoveres damaged blocks by projecting the undamaged neighborhood information onto the feature vectors. The sequential projections onto the feature vectors algorithm is proposed to find the projection coefficients of the feature vectors to minimize the squared difference of an estimate and the undamaged neighborhood information. We tested our algorithm through computer simulations. The experimental results showed the proposed method ourperforms the frequency domain prediction method in the PSNR values by 4.0-5.0dB. Tthe reconstructed images by the proposed method provide a good subjective quality as well as an objective one.

Nonlinearity is an important factor in the biological neural networks. The motion perception and learning in them have been studied on the simplest type of nonlinearity, multiplication. In this paper, asymmetrical neural networks with nonlinear function, are studied in the biological neural networks. Then, the nonlinear higher-order system is discussed in the neural networks. The second-order system in the nonlinear biological system is shown to play an important role in the movement detection. From the theoretical analysis, it is shown that the third-order one does not contribute to the detection and the fourth-order one becomes to the second-order in the movement detection function. Hassenstein and Reichardt network (1956) and Barlow and Levick network (1965) of movements are similar to the asymmetrical network developed here. To make clear the difference among these asymmetrical networks, we derive α-equation of movement, which shows the detection of movement. During the movement, we also can derive the movement equation, which implies the movement direction regardless of the parameter α.

This work is targeted to understand the operating principle of the feedback type echo canceller for use in an FM broadcasting receiver and to study its compensating features and the effects of the practical operating environment on its performance. The effects of the tap interval and the compensation performance in the presence of an echo with excess delay 0 - 15 µs are examined. The results show that the tap interval should be selected according to the observable bandwidth of the channel transfer function and the performance of a feedback type echo canceller has a wavelike curve with respect to the excess delay of the echo. To improve the performance of the feedback type echo canceller, an adaptive echo canceller operating with CM algorithm is proposed and examined with computer simulation. The results show that the compensation performance is improved.

The construction of fault-tolerant processor arrays with interconnections of cube-connected cycles (CCCs) by using an advanced spare-connection scheme for k-out-of-n redundancies called "generalized additional bypass linking" is described. The connection scheme uses bypass links with wired OR connections to spare processing elements (PEs) without external switches, and can reconfigure complete arrays by tolerating faulty portions in these PEs and links. The spare connections are designed as a node-coloring problem of a CCC graph with a minimum distance of 3: the chromatic numbers corresponding to the number of spare PE connections were evaluated theoretically. The proposed scheme can be used for constructing various k-out-of-n configurations capable of quick broadcasting by using spare circuits, and is superior to conventional schemes in terms of extra PE connections and reconfiguration control. In particular, it allows construction of optimal r-fault-tolerant configurations that provide r spare PEs and r extra connections per PE for CCCs with 4x PEs (x: integer) in each cycle.

The performance of a noncoherent parallel matched-filter (MF) acquisition scheme with a reference filter (RF) is evaluated for a direct-sequence/spread-spectrum multiple access (DS/SSMA) packet radio system in a mobile cellular environment. This acquisition scheme employs a RF to estimate the variance of interference at the output of detecting MF. Acquisition-based packet throughput of the parallel NM-RF scheme is derived for an AWGN and a Rayleigh fading channels. Packet throughput of a parallel MF-RF acquisition scheme is compared with those of a serial MF scheme, a serial MF-RF scheme, and a parallel MF. From the numerical results, it is shown that the packet throughput decreases with the number of users in the system, and increases with the preamble length. Imperfect power control causes packet throughput to decrease especially when the power control error is large. The considerations in this paper can be applied to the reverse link (mobile-to-base station) design of a DS/SSMA system for packet-type services.

In order to construct fuzzy systems automatically, there are many studies on combining fuzzy inference with neural networks. In these studies, fuzzy models using self-organization and vector quantization have been proposed. It is well known that these models construct fuzzy inference rules effectively representing distribution of input data, and not affected by increment of input dimensions. In this paper, we propose a destructive fuzzy modeling using neural gas network and demonstrate the validity of a proposed method by performing some numerical examples.