The structure of an SST Viterbi decoder for general rate (n-1)/n convolutional codes is investigated in the light of syndrome decoding. Since the input to the main decoder is expressed as S(H-1)T (S: syndrome, H: dual encoder of G) for a general non-systematic convolutional code G if the inverse encoder G-1 is used as a pre-decoder, SST Viterbi decoding can be regarded as searching for the most likely error sequence through an extended syndrome trellis. We show that searching based on the extended syndrome trellis is equivalent to the original syndrome decoding by applying the invariant-factor theorem.

Hybrid direct sequence/slow frequency hopping-time division duplex (DS/SFH-TDD) multiple access system has some good features of each system. However it has a problem of hit between multiple users. If the designed frequency hopping patterns are inadequate, the quality of the multiple access system is degraded due to the frequent hit. In this paper, we propose an adaptive hopping pattern control system which is able to avoid the multiple access interference of hit. The proposed system decreases the influence of hit and increases the user capacity in the cell. And this adaptive hopping pattern control is applied to both single-cell and multi-cell systems. By computer simulation to evaluate the performance of this system, we found that this system is effective in increasing the multiple access capability.

This paper presents a new blind identification method of nonminimum phase FIR systems and an adaptive blind equalization for PAM/QAM inputs without employing higher-order statistics. They are based on the observation that the absolute mean of a second-order white sequence can measure whether the sequence is higher-order white or not. The proposed methods are new alternatives to many higher-order statistics approaches. Some computer simulations show that the absolute mean is exactly estimated and the proposed methods can overcome the disadvantages of the higher-order statistics approaches.

Microcellular systems are suitable as personal mobile communication systems because of their high channel re-use efficiency and low transmission power. To implement a microcellular system, the antennas of base stations should be low enough, compared to the buildings around them, to reduce the interference to or from other base stations. In high-speed digital mobile radio communications, the time delay spread caused by multipath propagation is a significant factor in determining the maximum data transmission rate. In the case of a low-antenna-height microcellular system, the propagation characteristics rapidly change when the mobile terminal moves from a line-of-sight (LOS) location to a non-line-of-sight (NLOS) location. In this paper, the time dealy spread characteristics under LOS and NLOS conditions are examined using a geometrical street model which has a reflecting wall at one end of the street on which the base station is located. The RMS delay spreads are calculated using optical ray theory, taking into consideration the wedge diffraction on the street corner. If a reflecting wall exists, the RMS delay spread increases as the mobile terminal moves away from the base station under LOS conditions, or away from the street corner under NLOS conditions. The calculated results agree with the experimental results if measuring equipment noise is taken into consideration.

The reverse link performance of coherent multicode DS-CDMA [4], [5] under multipath Rayleigh fading environments is evaluated by computer simulation. It is demonstrated that the combined use of pilot symbol assisted (PSA)-coherent RAKE, channel coding, antenna diversity, and transmit power control is powerful in lowering the required signal energy per information bit-to-interference plus additive white Gaussian nose (AWGN) power spectrum density ratio (Eb/Io) which is an important parameter in determining the link capacity. It is also demonstrated that with slight performance degradation, high rate data transmission is realized by using multiple orthogonal spreading codes in parallel (orthogonal multicode transmission). Based on the simulated link performance, the reverse link cell capacity and link budget are also evaluated. It is found that parameter η=Io/No plays an important role in controlling the cell capacity and the maximum allowable path loss, where No is the AWGN power spectrum density.

C1 class smooth interpolation by a fuzzy reasoning for a small data set is proposed. The drafting technique of a human expert is implemented by using a set of fuzzy rules. The effectiveness of the present method is verified by computer simulations and by applications to the practical interpolation problem in a power system.

In this study, we analyze the system which simultaneously transmits spread-spectrum signals with different processing gains. The main purpose of this study is to give an analytical framework that describes the influence of the interfering signals with different processing gains. For this purpose, we define a crosscorrelation function between the spreading sequences with different code lengths, and discuss the effects of interaction between the signals. As the results, we show that the power of the interference component after despreading procedure, the power ratio of the desired to undesired components, and thus the bit error rate are not constant but vary symbol by symbol.

Personal communication systems (PCS) have more signalling traffic than conventional fixed networks and require large-scale databases to manage users' profiles, which are sets of data items, such as the location the user is currently visiting and the user's authentication key, necessary for a PCS user to be provided with PCS services. This paper focuses on inter-network roaming in PCS environments. In designing a PCS supporting roaming service, it is essential to avoid increased signalling traffic and data searching time in the database. We first identify the appropriate domains for three routing schemes-Direction Routing, Redirection Routing, and Look-ahead Routing-from the viewpoints of the number of signals for inter-network roaming and roaming probability. We do this for two kinds of PCS database network architecture, Home Location Register (HLR) and Visitor Location Register (VLR), and show that Look-ahead Routing is the best scheme for the HLR network architecture (considering the number of signals for intra-network and inter-network database access) and that in the VLR network architecture, the decreasing of the roaming probability expands domains for which Redirection Routing is appropriate. We also propose a generic PCS data model that inter-network roaming interfaces can use to search effectively for a user's profile. The data model clarifies the contents of a set of data items which share certain characteristics, data items that the contents compose, and the relationships (data structures) between sets of data items. The model is based on the X. 500 series recommendations, which are applied for an Intelligent Network. We also propose a data structure between sets of data items using the directory information tree and show the ASN. 1 notations of the data model.

For mobile/personal satellite systems, an ARQ protocol with low transmitter/receiver complexity as well as high throughput performance in a long Round-Trip-Delay (RTD) and even in a bad channel condition is required. In this paper, a new Selective-Repeat (SR) ARQ with multicopy retransmission is proposed and a performance on an AWGN channel is analyzed. The proposed scheme can be viewed as a modified version for SR + Stutter (ST) Scheme 2 [6]. The basic idea of the strategy is to repeat only erroneous blocks stored in the vN block transmitter buffer multiple times, when v consecutive retransmissions in SR mode are received in error, where N denotes RTD in blocks. Numerical analysis and simuration results in the case of N block transmitter/receiver buffer show that the proposed scheme presents better performance than SR + ST scheme 2 of 2N block buffer, especially that the robustness in the high BER region is remarkable.

An antenna and multi-carrier combined diversity system using Time Division Duplex (TDD) is proposed to combat with multi-path channel problem which produces frequency-selective fading and degrades the quality of signal transimission. So far multi-carrier modulation technique has been studied to solve this problem. On the other hand, TDD method has been studied to use a transmitter antenna diversity as pre-diversity against flat fading (non-selective fading). Our proposed system merges these two methods in a micro-cellular system as follows. On the reverse link, the base station can select the best combination between the carriers and antennas after receiving the multi-carrier signal from the mobile station. On the forward link, the same combination selected on the reverse link can be used to send the signal from the base station with multi-antenna to the mobile station with a single antenna and produces pre-diversity (transmitter diversity) effect which can reduce the complexity at the mobile station. The pre-diversity must be based on TDD function because the channel has to be observed before the signal transimission. By computer simulations we find that our proposed system can achieve far better performance than conventional systems.

This paper presents a model for a wide-band fading channel for terrestrial mobile applications. The model is based on the results of measurements made in a heavily built-up urban environment using a 25 MHz signal centred at approximately 2.6 GHz. This paper presents measured impulse responses and details the parameter extraction process used to determine the characteristics of the channel. These parameters are used in the channel simulation package and the output of these simulations are compared to the original data.

Many numerical simulation problems of natural phenomena are formulated by large tridiagonal and block tridiagonal linear systems. In this paper, an efficient parallel algorithm to solve a tridiagonal linear system is proposed. The algorithm named bi-recurrence algorithm has an inherent parallelism which is suitable for parallel processing. Its time complexity is 8N - 4 for a tridiagonal linear system of order N. The complexity is little more than the Gaussian elimination algorithm. For parallel implementation with two processors, the time complexity is 4N - 1. Based on the bi-recurrence algorithm, a VLSI oriented tridiagonal solver is designed, which has an architecture of 1-D linear systolic array with three processing cells. The systolic tridiagonal solver completes finding the solution of a tridiagonal linear system in 3N + 6 units of time. A highly parallel systolic tridiagonal solver is also presented. The solver is characterized by highly parallel computability which originates in the divide-and-conquer strategy and high cost performance which originates in the systolic architecture. This solver completes finding the solution in 10(N/p) + 6p + 23 time units, where p is the number of partitions of the system.

We propose in this paper a systematic way for analyzing discrete event dynamic systems to classify faults and failures quantitatively and to find tolerable fault event sequences embedded in the system. An automated failure diagnosis scheme with respect to the nominal normal operating event sequences and the supervisory control for tolerable fault event sequences are presented. Moreover the supervisor failure diagnosis with respect to the tolerable fault event sequences is considered. Finally, a case study of plasma etching system is described.

It is thought that we have generally succeeded in establishing learning algorithms for neural networks, such as the back-propagation algorithm. However two major issues remain to be solved. First, there are possibilities of being trapped at a local minimum in learning. Second, the convergence rate is too slow. Chang and Ghaffar proposed to add a new hidden node, whenever stopping at a local minimum, and restart to train the new net until the error converges to zero. Their method designs newly generated weights so that the new net after introducing a new hidden node has less error than that at the original local minimum. In this paper, we propose a new method that improves their convergence rate. Our proposed method is expected to give a lower system error and a larger error gradient magnitude than their method at a starting point of the new net, which leads to a faster convergence rate. Actually, it is shown through numerical examples that the proposed method gives a much better performance than the conventional Chang and Ghaffar's method.

We present a minimal lattice realization of MIMO linear discrete-time systems which interpolate the desired Markov and covariance parameters. The minimal lattice realization is derived via a recursive construction algorithm based on the state space description and it parametrizes all the interpolants.

In this work, a new structure of M-channel linear-phase paraunitary filter banks is proposed, where M is even. Our proposed structure can be regarded as a modification of the conventional generalized linear-phase lapped orthogonal transforms (GenLOT) based on the discrete cosine transform (DCT). The main purpose of this work is to overcome the limitation of the conventional DCT-based GenLOT, and improve the performance of the fast implementation. It is shown that our proposed fast GenLOT is superior to that of the conventional technique in terms of the coding gain. This work also provides a recursive initialization design procedure so as to avoid insignificant local-minimum solutions in the non-linear optimization processes. In order to verify the significance of our proposed method, several design examples are given. Furthermore, it is shown that the fast implementation can be used to construct M-band linear-phase orthonormal wavelets with regularity.

Intending to contribute to constructing better multimedia network systems, we propose a new concept of image database system of which form of storage is featuring exponential or graceful oblivion and abrupt recollection like the human memory property. By virtue of this property of database storages that is realized by employing hierarchical or pyramidal image coding, the database memory and transmission costs can be significantly reduced. In this paper we will describe the details of the concept, the results of theoretical analysis based on a simplified model which reveals the effectiveness of the proposed system, the structure of an experimental prototype system and the result of an experimental image retrieval service carried out by implementing it over ATM high speed channels.

For reducing requirement of large memory and minimizing computation complexity in a large-vocabulary continuous speech recognition system, speech segmentation plays an important role in speech recognition systems. In this paper, we formulate the speech segmentation as a two-phase problem. Phase 1 (frame labeling) involves labeling frames of speech data. Frames are classified into three types: (1) silence, (2) consonant and (3) vowel according to two segmentation features. In phase 2 (syllabic unit segmentation) we apply the concept of transition states to segment continuous speech data into syllabic units based on the labeled frames. The novel class of hyperrectangular composite neural networks (HRCNNs) is used to cluster frames. The HRCNNs integrate the rule-based approach and neural network paradigms, therefore, this special hybrid system may neutralize the disadvantages of each alternative. The parameters of the trained HRCNNs are utilized to extract both crisp and fuzzy classification rules. In our experiments, a database containing continuous reading-rate Mandarin speech recorded from newscast was utilized to illustrate the performance of the proposed speaker independent speech segmentation system. The effectiveness of the proposed segmentation system is confirmed by the experimental results.

This paper concerns optimized facility design for VLSI production. The methods proposed are applicable in planning LSI production facilities with a good balance between the number of machines and the number of operators. The sequence in each processing step is analyzed in detail. A new algorithm based on the queueing model is developed for estimating the simultaneous requirements for the two kinds of resources, machines and operators. This estimation system can be applied to complicated fabrication schemes, such as batch processing, continuous processing, and mixed technologies. This methodology yields guidelines for ASIC LSI production system design.

A new ATM switch architecture, named shared multibuffering, features great advantages on memory access speed for a large switch, and overall size of buffer memories to achieve excellent cell-loss performance. We have developed a 622-Mb/s 88 shared multibuffer ATM switch with multicast functions and hierarchical queueing functions to accommodate 156-Mb/s, 622-Mb/s and 2.4-Gb/s interfaces. Implementation of the shared multibuffer ATM switch is described with respect to the four sorts of 0.8-µm BiCMOS LSIs and ATM switch boards. The switch board/type-1, with C1-LSI, allows to accommodate effectively 156-Mb/s and 622-Mb/s interfaces, which is suitable for an ATM access system. The switch board/type-2, with C2-LSI, can provide multicast functions and accommodate a 2.4-Gb/s interface. By using four switch boards, it is possible to apply them to a 2.4-Gb/s ATM loop system.