In this paper, to obtain higher spectral efficiency than a conventional M-ary/Spread Spectrum (SS) communication system using an orthogonal code, we propose Double M-ary/SS communication systems in which transmitting sequences are produced by multiplying two sequences obtained from different M-ary/SS systems. First, we estimate the system performance of a Double M-ary/SS in which transmitting sequences are composed of two kinds of sequences which have the same chip duration and the same sequence length in AWGN environment by theoretical analysis and computer simulations using random sequences. And we show that the bit error rate (BER) of the system can be improved, compared to that of the conventional M-ary/SS. Next, we propose two concrete examples of the Double M-ary/SS systems. We investigate the performance of these systems in AWGN environment by computer simulations, and show that the BER and spectral efficiency can be improved by the two systems compared to those of the conventional M-ary/SS. Further, we consider a modified method of the demodulation for one of the examples of Double M-ary/SS systems, and show that we can reduce quantity of calculations by the method.

A new numerical procedure called asymptotic periodic waveform evaluation (APWE) for finding the steady state solution of nonlinear circuits driven by one tone periodic input signal is presented. APWE starts by constructing a virtual system which gives the same periodic steady state waveform as the original system's but with a shorter transient duration. Thus the periodic steady state (PSS) response can be obtained by simply performing transient analysis of the newly derived system for a few periods. An efficient method for solving the nonlinear equations occurred during the transient analysis is presented. To improve the convergence rate of PSS waveform, APWE is combined with extrapolation method. Some simulation results are shown.

We propose a novel soft-decision decoding algorithm for cyclic codes based on energy minimization principle. The well-known soft-decision decoding algorithms for block codes perform algebraic (hard-decision) decoding several times in order to generate candidate codewords using the reliability of received symbols. In contrast, the proposed method defines energy as the Euclidean distance between the received signal and a codeword and alters the values of information symbols so as to decrease the energy in order to seek the codeword of minimum energy, which is the most likely codeword. We let initial positions be the information parts of signals obtained by cyclically shifting a received signal and look for the point, which represents a codeword, of minimum energy by moving each point from several initial positions. This paper presents and investigates reducing complexity of the soft-decision decoding algorithm. We rank initial positions in order of reliability and reduce the number of initial positions in decoding. Computer simulation results show that this method reduces decoding complexity.

In GSM High Speed Circuit Switched Data (HSCSD), the data rate can be increased by using multiple time slots instead of single time slot. Multiple time-slot assignment results in high blocking rate. To accommodate more users, flexible resource allocation strategies have been proposed. Since GSM follows TDMA/FDMA, the channels (time slots) in a base station are segmented by frequency carriers. The base station must allocate the channels which belong to the same frequency carrier to individual requests. This Flexible Resource Allocation scheme for GSM (FRA-GSM) is contrastive to the scheme proposed in our previous studies where a base station may arbitrarily allocate idle channels in the base station to incoming requests. We define satisfaction indication SI as the measurement to compare the performance of these schemes. Experiment results indicate that FRA-GSM scheme has good performance when the user mobility is high, or when some cost factors are taken into account.

Video on demand is regarded as one of the most important applications in future broadband networks. Although several trial runs in various parts of the world do not bring instant success, its inherent requirements for bandwidth and bounded delay make it a suitable candidate for studying various networks and protocols in real-time applications. Recently, the Hybrid Fiber Coaxial (HFC) networks emerged as network architecture for bringing broadband services to the home. The co-axial cable network uses a tree-like architecture and requires complex protocols for synchronizing and sharing uplink communications among many users. This paper proposes that a dual bus network may be a simpler and cost effective alternative. We implement an interactive VOD (IVOD) system as an example to demonstrate its simplicity and suitability as a community network. The system uses client/server architecture with guaranteed bandwidth and bounded delays. Simulations are conducted to test the network load and response time for different number of users. The results indicate its feasibility and the delay time can be further reduced by releasing bandwidth during the pause operation.

In the commonsense reasoning, priorities among rules are often required to be found out in order to derive the desired conclusion as a theorem of the reasoning. In this paper, first we present the bottom-up and top-down abduction procedures to compute skeptical explanations and secondly show that priorities of circumscription to infer a desired theorem can be abduced as a skeptical explanation in abduction. In our approach, the required priorities can be computed based on the procedure to compute skeptical explanations provided in this paper as well as Wakaki and Satoh's method of compiling circumscription into extended logic programs. The method, for example, enables us to automatically find the adequate priority w. r. t. the Yale Shooting Problem to express a human natural reasoning in the framework of circumscription.

We discuss the security of the improved knapsack cryptosystem that Kobayashi and Kimura have proposed. Two attacking methods for their cryptosystem are proposed; one is the method for obtaining secret keys from public keys by using the continued fraction, and the other is for decrypting the ciphertext without knowing secret keys. We show that their cryptosystem is not secure against these attacks.

A method is presented for determining the minimum weight of cyclic codes. It is a probabilistic algorithm. This algorithm is used to find, the minimum weight of codes far too large to be treated by any known algorithm. It is based on a probabilistic algorithm for determining the minimum weight of linear code by Jeffrey S. Leon. By using this method, the minimum weight of cyclic codes is computed efficiently.

This paper presents the subjective speech quality evaluation in terms of the Mean Opinion Score (MOS) and the relationship between BER and subjective speech quality in a GSM-based radio system. The results show that in certain environments (hilly terrain and rural areas), a SNR (or C/I) higher than 12 dB is required for acceptable speech quality. For an acceptable speech quality, a BER(c1) better than 10-2 is needed in a GSM-based system.

The required building blocks of CMOS fuzzy chips capable of performing as adaptive fuzzy systems are described in this paper. The building blocks are designed with mixed-signal current-mode cells that contain low-resolution A/D and D/A converters based on current mirrors. These cells provide the chip with an analog-digital programming interface. They also perform as computing elements of the fuzzy inference engine that calculate the output signal in either analog or digital formats, thus easing communication of the chip with digital processing environments and analog actuators. Experimental results of a 9-rule prototype integrated in a 2. 4-µm CMOS process are included. It has a digital interface to program the antecedents and consequents and a mixed-signal output interface. The proposed design approach enables the CMOS realization of low-cost and high-inference fuzzy systems able to cope with complex processes through adaptation. This is illustrated with simulated results of an application to the on-line identification of a nonlinear dynamical plant.

Optical frequency division multiplexing (FDM) technique has the advantage of fully orthogonal transmissions. However, FDM system permits only a small number of FDM channels despite of a great effort, such as frequency stabilization. On the other hand, frequency-domain encoding code-division multiple-access (FE-CDMA) has been widely studied as a type of optical CDMA. In this system, encoding is done in the frequency domain of an ultrashort light pulse spread by optically Fourier transform. However, FE-CDMA accommodates very limited number of simultaneous users, though this scheme uses a vast optical bandwidth. It is attractive to consider the combination of both advantages of FDM and FE-CDMA. We propose FE-CDMA enhancement of FDM (FDM/FE-CDMA). Since in FDM/FE-CDMA the total bandwidth is partitioned into M optical bands and each band is encoded by the code with code length of Nc, we expect nearly perfect orthogonal transmissions. In addition, since the creation of FDM bands is realized by a passive filter, the optical frequency is precisely controlled and the optical frequency allocation is flexible. We derive the bit error rate (BER) as a function of the number of simultaneous users, bit rate, and the utilization efficiency of total bandwidth. We compare the performance of FDM/FE-CDMA with that of the conventional FE-CDMA in terms of the number of simultaneous users on condition that each chip width is constant. As a result, we show that FDM/FE-CDMA can support the larger number of simultaneous users than the conventional FE-CDMA at a given bit error rate under the same total bandwidth.

The proposed method tracks the user location in a hierarchically distributed fashion. Call patterns in personal communications services (PCS) have the locality. The virtually hierarchical link (VHL) is used to support the call locality and makes the fast call set up possible. The locality consideration effectively reduces the query traffic compared with non-locality consideration.

In order to improve microprocessor performance, we propose to utilize histories of dynamic instruction sequences. A lot of special purpose memories integrated in a processor chip hold the histories. In this paper, we describe the usefulness of using two special purpose memories: Non-Consecutive basic block Buffer (NCB) and Reference Prediction Table (RPT). The NCB improves instruction fetching efficiency in order to relieve control dependences. The RPT predicts data addresses in order to speculate data dependences. From the simulation study, it has been found that the proposed mechanisms improve processor performance by up to 49. 2%.

Though response of neurons is mainly decided by synaptic events, the length of a time window for the neuronal response has still not been clarified. In this paper, we analyse the time window within which a neuron processes synaptic events, on the basis of the Hodgkin-Huxley equations. Our simulation shows that an active membrane property makes neurons' behavior complex, and that a few milliseconds is plausible as the time window. A neuron seems to detect coincidence synaptic events in such a time window.

In this paper, we propose a multiple access technique using a simple interference canceller for common code transmission. In the proposed system, we adopt a common code for a receiver oriented system. All the transmitters utilize the same pseudo noise (PN) code to communicate with a receiver. Here the receiver structure becomes very simple with only one matched filter (MF). The proposed system has two very important merits. One is to avoid packet collisions by means of an interference cancellation method based on a common code chip shift transmission technique. That is, in order to avoid interference, which occurs because all the received signals have the same PN code, the same data with different timing are transmitted in two channels. In this study, we define and evaluate three types of packet collision which can be reduced by the canceller. The other merit is to reduce the system degradation due to the correlation side-lobes by means of a side-lobe canceller. In spread spectrum (SS) communication systems with PN codes like M-sequences, the correlation side-lobes appear at the detector in the case of the polarity data changing from 1 to 1 . The side-lobes degrade the system quality. Therefore in this system a interference canceller operates to cancel the correlation side-lobes and attempts to reduce the system degradation. Finally, by our cancellation method it becomes possible to realize a simple multiple access using only one PN code under the condition of a receiver oriented system without a base station.

This paper describes a real-time connection admission control scheme for supporting multiple service categories. The scheme is based on a real-time cell-loss ratio evaluation algorithm for VBR based on peak/sustainable cell rates and maximum burst size. The algorithm is based on a notion of Allan variance of VP utilization. The most remarkable characteristics of the admission control scheme are that it terminates within constant time, a few milliseconds, and that its time is independent of both the number of VCs and the capacity of a cell buffer.

In this paper we propose a total quality evaluation method in an ATM network-type remote conference system, and describe the results of evaluations of a proving system. The quality of a remote conference system depends on such various elements as video images, voice signals, and cost; but a total quality index may be regarded as the cost of a remote conference system compared with that of a conventional face-to-face conference. Here, however, the decline in communication quality arising from the remote locations of participants must be included in the evaluation. Moreover, the relative weightings of voice signals, video images of participants, and shared data will vary depending on the type of conference, and these factors must also be taken into account in evaluations. An actual conference systems were constructed for evaluation, and based on a MOS (Mean Opinion Score) of the quality elements, the total system quality was evaluated with reference to the proposed concepts. These results are also described in this paper.

This paper describes a new architecture-based DSP processor, which consists of n n mesh multiprocessor for digital signal processing. A prototype chip, RCDSP9701 has been designed and implemented using a CMOS 0. 6 µm process. This architecture has better performance compare to the traditional microprocessor solution to Digital Signal Processing. The proposed method poses remarkable flexibility compare to ASIC (Application Specified Integrated Circuits) approach for Digital Signal Processing applications. In addition, the proposed architecture is fault tolerant and suitable for parallel computing applications. In this paper, an implementation into a silicon chip of the new architecture is presented to give a better understanding of our work.

Simplification orderings, like the recursive path ordering and the improved recursive decomposition ordering, are widely used for proving the termination property of term rewriting systems. The improved recursive decomposition ordering is known as the most powerful simplification ordering. Recently Jouannaud and Rubio extended the recursive path ordering to higher-order rewrite systems by introducing an ordering on type structure. In this paper we extend the improved recursive decomposition ordering for proving termination of higher-order rewrite systems. The key idea of our ordering is a new concept of pseudo-terminal occurrences.

In this paper we propose a method to aid a visually impaired person in the operation of a computer running a graphical user interface (GUI). It is based on image processing techniques, using images taken by a color camera placed over a Braille display. The shape of the user's hand is extracted from the image by analyzing the hue and saturation histograms. The orientation of the hand, given by an angle θ with the vertical axis, is calculated based on central moments. The image of the hand is then rotated to a normalized position. The number of pixels in each column of the normalized image is counted, and the result is put in a histogram. By analyzing the coefficient of asymmetry of this histogram, it can be determined whether the thumb is positioned along the pointing finger, or whether it is far from the other fingers. These two positions define two states that correspond to a mouse button up or down. In this way, by rotating the hand and moving the thumb, we can emulate the acts of moving a scroll bar and depressing a mouse button, respectively. These operations can be used to perform tasks in a GUI, such as cut-and-paste, for example. Experimental results show that this method is fast and efficient for the proposed application.