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.
Ching-Tang HSIEH Mu-Chun SU Chih-Hsu HSU
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.
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.
Because the match phase in OPS5-type production systems requires most of the system's execution time and memory accesses, we proposed hash-based parallel production systems, CPPS (Clustered Parallel Production Systems), based on the RETE algorithm for distributed memory parallel computers, or multicomputers to reduce such a bottleneck. CPPS was effective in speeding up the match phase, but still left room for optimizations. In this paper, we introduce software cache techniques to memory nodes in the CPPS as one of the optimizations, and implement it on a multicomputer, nCUBE2. The benchmark results show that the CPPS with the software cache is about 2-fold faster than the original, and more than 7-fold faster than the simple hash method proposed by Acharya et al. for a large scale problem. The speed-up can be attributed to decreased communication costs.
Tadayoshi HORITA Itsuo TAKANAMI
Various reconfiguration schemes against faults of mesh-connected processor arrays have been proposed. As one of them, the mesh-connected processor arrays model based on single-track switches was proposed in [1]. The model has an advantage of its inherent simplicity of the routing hardware. Furthermore, the 2 track switch model [2] and the multiple track switch model [3] were proposed to enhance yields and reliabilities of arrays. However, in these models, Simplicity of the routing hardware is somewhat lost because multiple tracks are used for each row and column. In this paper, we present a builtin self-reconstruction approach for mesh-connected processor arrays which are partitioned into sub-arrays each using single-track switches. Spare PEs which are located on the boundaries of the sub-arrays compensate faulty PEs in these sub-arrays. First, we formulate a reconfigulation algorithm for partitioned mesh-arrays using a Hopfield-type neural network, and then its performance for reconfigulation in terms of survival rates and reliabilities of arrays and processing time are investigated by computer simulations. From the results, we can see that high reliabilites are achieved while processing time is a little and hardware overhead (links and switches) required for reconstruction is as same as that for the track switch model. Next, we present a hardware implementation of the neural algorithm so that a built-in self-reconfigurable scheme may be realized.
Ami KANAZAWA Chikara OHTA Yoshikuni ONOZATO Tsukasa IWAMA Shigetoshi YOSHIMOTO
This paper proposes Channel Reservation for Ahead Cells (CRAC)" scheme for street micro-cellular systems. The scheme enables mobiles to reserve the same channel over several cells at once. This paper analyzes both CRAC and FCA (Fixed Channel Assignment) in a ring-shaped service area where high speed mobiles and low speed mobiles move. In the analysis, the priority control which prioritizes hand-off calls and reservation calls over new calls over new calls is also taken into account. Obtained results include the blocking rate, the forced call termination rate, the average number of channel changings and the system utilization. From numerical results, CRAC is found to perform better than FCA with regard to the average number of channel changings and the forced call termination rate.
In this paper, we propose a timing constrained database system which accesses a database at a host computer via a mobile support server with a wireless portable computer running in mobile computing environments, so that we can provide seamless database access between a communication cell and the host computer even if the user of the portable computer moves from one communication cell to another. Then, we also provide some new kind of database cache algorihm, such as all-cell-cache, neighbour-cell-cache, 1-cell-skip-cache, 2-cell-skip-cache and 3-cell-skip-cache methods, each of which manages the data downloading and uploading among the host database and some cell databases at the mobile support servers so as to minimize the database access fault probability when the user moves from one communication cell to another. And, we show the averaged database access time and the averaged database cache hit ratio which are computed by simulating each of the above database cache algorithms with random variables generation method. Finally, we conclude that each above cache alogorithm is advantageous to the database in mobile computineg einvironments.
Satoru FUKUMOTO Kazunori OKADA Duk-Kyu PARK Shigetoshi YOSHIMOTO Iwao SASASE
In estimating the performances of Distributed control Dynamic Channel Assignment (DDCA) strategies in sector cell layout systems, we find that sector cell layout systems with DDCA achieved a large system capacity. Moreover, we also indicate the problem, which is the increase of occurrences of cochannel interference, raised by using DDCA in sector cell layout systems. The new channel assignment algorithm, which is called Channel Searching on Direction of Sector (CSDS), is proposed to cope with the problem. CSDS assigns nominal channels to each sector according to their direction so that the same frequency channel tends to be used in sectors having the same direction. We show, by simulations, that CSDS is an adequate algorithm for sector cell layout systems because it significantly improves performance on co-channel interference while only slightly decreasing system capacity.
This paper is a brief survey of mobile applications of meteor burst communications (MBC). Though the capacity of MBC systems is generally not large, this unique long distance communication method has at least two selling points when applied to mobiles. First of all, it is cheap. Secondly, it can easily offer nationwide seamless service. Thus, since the late 1980s, mobile MBC systems have been attracting interests of the industry. Although MBC is today a well established communication technique, there are some difficulties to be overcome before it is widely applied to mobile systems. Two most serious problems are the rather large antenna size and high transmitter power inherent to this beyond line of sight communication which relies on weak reflections of low VHF (typically 35 to 50 MHz) radio waves from ionized meteor trails. Some reduced sized antennas which can be mounted on the roofs of trucks have been tested. The problem of large peak power (a few hundred watts for mobile remotes) is much alleviated by the very low duty cycle (usually less than 1%) of remote transmitters due to their bursty transmissions responding to the probe signals from the master station via infrequent meteor reflections. In this paper, some land and maritime mobile MBC systems are brieflyintroduced.
Mario FRULLONE Claudia CARCIOFI Guido RIVA Paolo GRAZIOSO
The paper deals with the evaluation of performance of current cellular systems which are required to accommodate in an already operating system a wide range of new services, with different quality requirements (on delays, retransmission rates, etc.), and often characterised by a high burstiness (i. e. with relatively short traffic bursts, interleaved by comparatively long silence periods). To this end, an extension of packet communications is appealing for its inherent flexibility; standardisation of packet protocols for data transmission over idle GSM channels is in progress, and a similar service exploiting AMPS radio and network resources is already specified as Cellular Digital Packet Data. In both cases voice traffic retains a higher priority. The paper focuses on the evaluation of the effect of this additional traffic on existing voice traffic in a GSM Phase 2+ system. Although voice calls experience the same channel availability, their performance are worsened by the higher co-channel interference due to the higher average channel occupancy. This impairment cannot be tackled, as a matter of course, by increasing the re-use distance as this would affect the overall system capacity. The paper suggests the use of smart planning strategies capable to ease control of interference levels with a negligible impact on system complexity and signalling load.
Hiroyuki NAKAHARA Hiromitsu TAKAHASHI
Let W be a real symmetric matrix associated with a weighted 2-connected planar graph. It is important to study a fast algorithm to solve the linear system Wx = c, since the system has many various applicaions, for example to solve partial defferencial equations numerically. In this paper, a new algorithm for the solution of a linear system of equations by Δ-Y transformations is proposed, and a sufficient condition for using this algorithm is proved. We show that this algorithm solves in O (n3/2) time a linear system associated with a planar graph which is embedded a cylinder graph with n vertices.
Hiraku OKADA Takeshi SATO Takaya YAMAZATO Masaaki KATAYAMA Akira OGAWA
In this paper, we analyze the throughput and delay performances of the CDMA unslotted ALOHA system considering packet retransmisson. We also clarify the stability of the system. Based on these results, we propose the optimal retransmission control (ORC) to improve the performances. The ORC is the scheme to prevent the system from drifting to an undesirable operating point by controlling the birth rate of retransmitted packets. As a result, it is shown that the throughput and delay performances of the system with the ORC are better than without the ORC and the system does not drift to an undesirable operating point.
Storage system in a multimedia server must satisfy two contradicting requirements: real-timeliness and large number of parallel user requests. Efficient algorithms for data placement, disk head scheduling, and request admission control schemes are needed to support the requirements. In this paper, we propose efficient schemes to maximize system resource utilization and service availability: cyclic placement scheme, subgroup retrieval scheme, and measurement-based request admission control scheme. Performance analysis through simulation revealed that the amount of system buffers required can be reduced by 70% approximately.
This paper designs recursive least-squares fixed-point smoother and filter, which use the observed value, the probability that the signal exists, and the covariance information relevant to the signal and observation noises, on the estimation problem associated with the uncertain observations in linear continuous-time systems.
Kang-Hyun JO Kentaro HAYASHI Yoshinori KUNO Yoshiaki SHIRAI
This paper presents a vision-based human interface system that enables a user to move a target object in a 3D CG world by moving his hand. The system can interpret hand motions both in a frame fixed in the world and a frame attached to the user. If the latter is chosen, the user can move the object forward by moving his hand forward even if he has changed his body position. In addition, the user does not have to keep in mind that his hand is in the camera field of view. The active camera system tracks the user to keep him in its field of view. Moreover, the system does not need any camera calibration. The key for the realization of the system with such features is vision algorithms based on the multiple view affine invariance theory. We demon-strate an experimental system as well as the vision algorithms. Human operation experiments show the usefulness of the system.
We analyze dynamics of a simple hysteresis network (ab. SHN) which has only two parameters. We classify the periodic orbits and clarify the number of attractors and their domain of attraction. The SHN is a piecewise linear system, and therefore we can calculate the trajectory using exact solutions. We clarify the bifurcation sets on which equilibrium attractors bifurcate to the periodic orbits. We also give a sufficient condition for stability of the periodic orbits, and the stability is verified by laboratory experiment. The results of this paper may contribute to the development of an efficient multi functional artificial neural network.
Ken OHTA Takashi WATANABE Tadanori MIZUNO
Time-critical-communication, which should guarantee a time limit of a communication service is getting important in multimedia and factory automation fields. This paper proposes an IP-based protocol, Network Protocol with Performance (NPP) to provide the advanced best-effort service which takes a time constraint into account for real-time applications on the Internet. NPP uses the packet-scheduling function to make an effort to guarantee time constraints. Packet-scheduling algorithm chooses a packet in a NPP queue by a precedent level and a time constraint of each packet. We also discuss an application of NPP to multimedia communication system, and investigate performance of NPP by simulation.
A structural active-object system (SAOS) is a transition-based object-oriented system suitable for rapid development of hardware logic simulators. A SAOS consists of a collection of interacting structural active objects (SAOs), whose behaviors are determined by the transition statements provided in their class definitions. Furthermore, SAOs can be structurally and hierarchically composed from their component SAOs like hardware components. These features allow SAOs to model components for circuit simulation more naturally than passive objects used in ordinary object-oriented programming. Also, we can easily create new kinds of components by using the inheritance mechanism. Executions of transition statements may be event-and/or time-driven, and hence digital, analog, and mixed-mode simulation is possible. Prototype simulation programs with graphical user interfaces have been developed as SAOS programs for digital, analog, and mixed-mode circuit simulation.
Byung-Kwon PARK Woong-Kee LOH Jeong-Joon LEE Chong-Mok PARK Kyu-Young WHANG
In this paper, we describe the design and implementation of a hypermedia system that has the following characteristics. First, being designed according to the Dexter hypertext reference model, it has a layered architecture and thus maintains commonality with other hypermedia systems based on the Dextermodel. Second, being designed based on the MHEG standard, it has data structures that are inherently suitable for data interchange and synchronization. Third, adopting the MIME protocol, it provides multimedia mail services. Finally, being built on top of an object-oriented DBMS, it makes it easy to represent Dexter and MHEG models and also provides efficient storage and search capabilities. The contribution of this paper is combining these characteristics to build an integrated hypermedia system reflecting reference architectures and international standard efforts.
Fumiyuki TANEMO Tadashiro YOSHIDA Ryoji KATAOKA
When people watch such motion pictures as documentaries or educational-type films, it is very natural for them to be interested in moving objects in the movies and be eager to know the detailed information related to these object. Therefore, a mechanism that enables users to directly pick up object information from motion pictures is necessary to make a movie system feasible. For this reason, we are researching techniques on using objects in motion pictures as hypermedia anchors. We call a movie system that provides the above mechanism a video hypermedia system. An object in a motion picture can generally be considered as a complex object which includes many parts. To allow users to obtain information related to each part, a system must be able to provide anchors corresponding to each part in each complex object. For this, authors cannot help defining all anchors in all frames, since the visual status of each part varies from moment to moment. This paper presents our approach for managing objects in motion pictures for video hypermedia systems. The main feature of the proposed method is to apply computer graphic techniques to the defining of anchors for a complex object.