The message level performance of error controls in data communication on ATM network is analyzed. Three layers, "a cell"(a unit of transmission), "a block"(a unit of error controls) and "a message"(a unit of transmission of user level) are considered. The error controls treated in this paper are GBN (Go-Back-N) and FEC+GBN. The cell loss process is assumed to be the two state Markov chain considering the cell loss process in ATM networks. Numerical results show that (1) the improvement of the message forwarding delay is saturated in some environments when the interface rate becomes high, (2) FEC is efficient when the burstiness of the cell loss process is small, the message length is large and the interface rate is high.

This letter describes an efficient and economical method for dropping optical fiber to residential premises in which several fiber ribbons in a distribution cable are assigned to one dropping point. The optical fiber cables for dropping, which contain mono-coated fibers, are then aerially installed between several poles from this point during initial construction. One or two fibers in a cable are then branched and dropped to a subscriber when the demand arises. When an optical drop wire stranded cable is used as the optical fiber cable for dropping, the above method can be employed without the need for a fiber joint in the dropping portion. The tube stranding pitch of this cable is investigated theoretically and experimentally, and the cable is manufactured based on the results. The transmission characteristics of the cable are confirmed to be stable.

A novel reactive congestion control scheme based on Dynamic UPC/NPC (Usage/Network Parameter Control) in ATM networks is proposed. In this scheme, policing parameters at the UPC/NPC are dynamically modified in response to the reception of RM (Resource Management) cells. In a congested state, traffic volume submitted to the network is regulated by Dynamic UPC/NPC, while providing negotiated QoS (Quality of Service) for each ATM connection. When end-stations (or edge-entities between network segments) operate according to ER-based (Explicit Rate based) behavior, a UPC/NPC function will indicate (send) an ER value toward each source end-station using backward RM cells. In this case, the policing parameter at the UPC/NPC should take the same value as the ER value. When end-stations (or edge-entities) operate according to EFCI-based (Explicit Forward Congestion Indication based) behavior, the modified policing parameter at the UPC/NPC point must be harmonized with the modified cell transmission rate at the source end-stations (or at the edge-entities). In order to improve the control performance for the long distance connections, backward RM cells will be generated by the NPC function (UPC function will be optional) at the egress of a congested network in response to the reception of EFCI marked cells (or forward RM cells) as a proxy destination end-station, and they will be sent back toward the UPC/NPC function at the ingress of the network. As a result, the proposed control scheme enables the network to recover from the congested state securely and provide the negotiated service quality, even if cooperation of (rate-based) flow control at each source end-station (and at edge-entities between network segments) is not expected.

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.

This paper proposes a new emphasizing three-dimensional pointing device considering user friendliness and lack of cable clutter. The proposed method utilizes five degrees of freedom via the medium of non-verbal voice of human. That is, the spatial direction of the sound source, the type of the voice phoneme and the tone of the voice phoneme are utilized. The input voice is analyzed regarding the above factors and then taking proper effects as previously defined for human interface. In this paper the estimated spatial direction is used for three-dimensional movement for the virtual object as three degrees of freedom. Both of the type and the tone of the voice phoneme are used for remaining two degrees of freedom. Since vocalization of nonverbal human voice is an everyday task, and the intonation of the voice can be quite easily and intentionally controlled by human vocal ability, the proposed scheme is a new three-dimensional spatial interaction medium. In this sense, this paper realizes a cost-effective and handy nonverbal interface scheme without any artificial wearing materials which might give a physical and psychological fatigue. By using the prototype the authors evaluate the performance of the scheme from both of static and dynamic points of view and show some advantages of look and feel, and then prospect possibilities of the application for the proposed scheme.

An ATM network design algorithm is treated as a resource allocation problem. As an effective way to facilitate a coexistence of traffic with its diverse characteristics and different quality of service (QOS) requirements in ATM networks, a virtual path (VP) concept has been proposed. In attempting to design the VP (Virtual Path)-based ATM network, it requires to consider a network topology and traffic pattern generated from users for minimizing a network construction cost while satisfying QOS requirements such as cell / call loss probabilities and cell delay times. In this paper, we propose a new heuristic design algorithm for the VP-based ATM network under QOS constraints. A minimum bandwidth required to transfer a given amount of traffic is first obtained by utilizing an equivalent bandwidth method. After all the routes of VPs are temporarily established by means of the shortest paths, we try to minimize the network cost through the alternation of VP route, the separation of a single VP into several VPs, and the introduction of VCX nodes. To evaluate our design algorithm, we consider two kinds of traffic; voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in the cost-effective VP-based ATM network.

The problem of TM-mode scattering from the finite number of rectangular notches in a parallel plate waveguide is considered. The Fourier-transform is employed to obtain simultaneous equations and the simultaneous equations are solved to obtain an analytic solution in rapidly-convergent series. Numerical computations are performed to investigate the scattering behavior in terms of frequency and notch sizes. The presented theory is applicable to the analysis of scattering from the E-plane stubs in the rectangular waveguide.

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.

A direct gradient descent learning algorithm of energy function in Hopfield neural networks is proposed. The gradient descent learning is not performed on usual error functions, but the Hopfield energy functions directly. We demonstrate the algorithm by testing it on an analog-to-digital conversion and an associative memory problems.

In this study, multimode chaos observed from two coupled chaotic oscillators with hard nonlinearities is investigated. At first, a simple chaotic oscillator with hard nonlinearities is realized. It is confirmed that in this chaotic oscillator the origin is always asymptotically stable and that the solution, which is excited by giving relatively large initial conditions, undergoes period-doubling bifurcations and bifurcates to chaos. Next, the coexistence of four different modes of oscillations are observed from two coupled chaotic oscillators with hard nonlinearities by both of circuit experiments and computer calculations. One of the modes of oscillation is a nonresonant double-mode oscillation and this oscillation is stably generated even in the case that oscillation is chaotic. Namely, for this oscillation mode, chaotic oscillation and periodic oscillation can be simultaneously excited. This phenomenon has not been reported yet, and we name this phenomenon as double-mode chaos. Finally, the beat frequency of the double-mode chaos is confirmed to be changed by varying the value of the coupling capacitor.

Soft-error immunity of a 1-V operating CMOS memory cell is described. To evaluate the immunity precisely at the supply voltage of 1 V, a multi-threshold CMOS (MTCMOS) memory scheme, which has a peripheral circuit combining low-threshold CMOS logic gates and high-threshold MOSFETs with a virtual supply line, is adopted as a test structure. A 1-kb memory was designed and fabricated with 0.5-µm MTCMOS technology and the soft-error immunity of the memory cells was evaluated. The results of an alpha-particle exposure test and a pulse laser test show that a full-CMOS memory cell has high immunity at 1-V operations.

A learning algorithm is presented for nearest neighbor pattern classifiers for the cases where mixed supervised and unsupervised training data are given. The classification rule includes rejection of outlier patterns and fuzzy classification. This partially supervised learning problem is formulated as a multiobjective program which reduces to purely super-vised case when all training data are supervised or to the other extreme of fully unsupervised one when all data are unsupervised. The learning, i. e. the solution process of this program is performed with a gradient method for searching a saddle point of the Lagrange function of the program.

Existing edge detection methods provide unsatisfactory results when contrast changes largely within an image due to non-uniform illumination. Koch et al. developed an energy function based upon the Hopfield neural network, whose coefficients were fixed by trial and error, and remain constant for the entire image, irrespective of the differences in intensity level. This paper presents an improved edge detection method for non-uniformly illuminated images. We propose that the energy function coefficients for an image with inconsistent illumination should not remain fixed, rather should vary as a second-order function of the intensity differences between pixels, and actually use a schedule of changing coefficients. The results, compared with those of existing methods, suggest a better strategy for edge detection depending upon both the dynamic range of the original image pixel values as well as their contrast.

This paper proposes an integrated interference suppression scheme which realizes interference-resistant satellite digital signal transmission systems. It employs a notch filter in the receiving side to suppress the co-channel interference (CCI) signal. Moreover, the proposed scheme employs an adaptive equalizer combined with a forward error correction (FEC) scheme to improve the Pe (probability of error) performance degradation due to the inter-symbol interference caused by notch filtering of the desired signal. In the typical frequency modulation (FM) CCI environment with a BWi/FN of 2.3 (BWi: interference signal required bandwidth, fN: one half the Nyquist bandwidth of the desired signal), a Δf / fN of 1.05 (Δf: interference frequency offset) and a D/U of 3 dB (desired to undesired (interference) signal power ratio), the proposed scheme improves the required Eb/NO by 1.5 dB at a Pe of 10-4 compared to that without an adaptive equalizer.

In this paper, we formulate and solve a discrete-time queueing problem that has two potential applications: ATM multiplexers and DQDB networks. We first consider the modeling of an ATM multiplexer. The object of the analysis is a periodic traffic stream (CBR traffic), which is one of the inputs to the multiplexer. As in previous works of the subject, we consider a memoryless background traffic input. Here, in addition to this background traffic, we take into account the influence of a high-priority traffic, which is time-correlated and requires expedited service. We analyze the influence of these two types of traffic on the statistics of the interdeparture time (jitter process) and the delay of the periodic traffic stream. We obtain their distributions in a form of z-transforms, and from these we derive closed form expressions for the average delay and the variance of the interdeparture time. Our results show that the delay and jitter are very sensitive to the burstiness of the high priority traffic arrival process. We next apply our analytical modeling to a DQDB network when some of its stations are driven by CBR sources. We can obtain interesting results concerning the influence of the physical location of a DQDB station on the jitter.

This paper introduces a new image representation method that is named the projective image representation (PIR). We consider an image as a collage of symmetric segments each of which can be well represented by its projection data of a single orientation. A quadtree-based method is adopted to decompose an image into variable sized segments according to the complexity within it. Also, we deal with the application of the PIR to the image compression and propose an efficient algorithm, the quadtree-structured projection vector quantization (QTPVQ) which combines the PIR with the VQ. As the VQ is carried out on the projection data instead of the pixel intensities of the segment, the QTPVQ successfully overcomes the drawbacks of the conventional VQ algorithms such as the blocking artifact and the difficulty in manipulating the large dimension. Above all, the QTPVQ improves the subjective quality greatly, especially at low bit rate, which makes it applicable to low bit rate image coding.

One of coupling coefficients appearing in the coupled power equations describing the crosstalk in an image fiber is derived based on the coupled mode theory. Cores arranged in the cross-section of the fiber differ randomly to the degree of several percent in size and consequently modes propagating along the cores differ randomly. Random fluctuations of the propagation constants of modes cause the random transfer process of power between the cores, whereas contributions of the random fluctuations of the mode coupling coefficients to the statistical process can be neglected. The coupling coefficient is described as the ratio of the power transfer ratio to the coupling length for two cores with slightly different radii characterizing the random cores. The theoretical results are in good agreement with measurement results except near cutoff.

A novel circuit design technique for bipolar linear transconductance amplifiers is presented. A triple-tail cell, which consists of three emitter-common transistors biased by a single tail current, is exchangeable with an emitter-coupled pair in the multi-tanh cell, such as a multi-tanh doublet, a multi-tanh triplet or a multi-tanh quad. Therefore, the multi-tanh technique is further theoretically expanded to the super-multi-tanh technique. In this paper, the super-multi-tanh technique is proposed and discussed, and furthermore, a super-multi-tanh doublet is verified with bipolar transistor-arrays and discrete resistors on a breadboard.

Recursive Diagonal Torus (RDT) is a class of interconnection network for massively parallel computers with 216 nodes. In this paper, message transfer algorithms on the RDT are proposed and discussed. First, a simple one-to-one message routing algorithm called the vector routing is introduced and its practical extension called the floating vector routing is proposed. In the floating vector routing both the diameter and average distance are improved compared with the fixed vector routing. Next, broadcasting and hypercube emulation algorithm scheme on the RDT are shown. Finally, deadlock-free message routing algorithms on the RDT are discussed. By a simple modification of the e-cube routing and a small numbers of additional virtual channels, both one-to-one message transfer and broadcast can be achieved without deadlock.

In general, a time-limited signal such as a single sinusoidal waveform framed by a frame period T can be utilized for conveying a multi-level symbol in data transmission. If such a signal is analyzed by the conventional DFT (Discrete Fourier Transform) analysis, the infinite number of frequency components with frequency spacing fD = T1 is needed. This limits the accuracy with which the original frequency of the unframed sinusoidal waverform can be identified. It is especially difficult to identify two similar framed sinusoids whose frequency spacing is narrower than fD. An analytical principle for time-limited signals is therefore proposed by introducing the concept of an Extended Frame into DFT. Waveform analysis more accurate than DFT is achieved by taking into account multiple correlations between extended frames made of an input frame signal and the element frequency components corresponding to the length of each extended frame. In this approach, it is possible to use arbitrary element frequency spacing less than fD. It also allows an element frequency to be selected as a real number times of fD, rather than as an integer times of fD that is used for DFT. With this analyzing mechanism, it is verified that an input frame signal with only the frequency components which coincide with any of the element frequencies can be exactly analyzed. The disturbance caused by the input white noise is examined. As a result, it is found that the superior noise suppression function is achieved by this method over a conventional matched filter. In addition, the error caused by using a finite number of element frequencies and the A/D conversion accuracy required for sampling an input signal are examined, and it is shown that these factors need not impede practical implementation. For this reason, this principle is useful for multi-ary transmission systems, noise tolerant receivers, or systems requiring precise filtering of time limited waveforms.