This paper discusses real-time language recognition by 1-dimensional one-way cellular automata (OCAs) and two-way cellular automata (CAs), focusing on limitations of the parallel computation power. To clarify the limitations, we investigate real-time recognition of cyclic strings of the form uk with u {0,1}+ and k 2. We show a version of pumping lemma for recognizing cyclic strings by OCAs, which can be used for proving that several languages are not recognizable by OCAs in real time. The paper also discusses the real-time language recognition of CAs by prefix and postfix computation, in which every prefix or postfix of an input string is also accepted, if the prefix or postfix is in the language. It is shown that there are languages L
In this paper, we propose an adaptive multistage fuzzy-based partial parallel interference cancellation (FB-PPIC) multiuser detector for multi-carrier direct-sequence code-division multiple-access (MC-CDMA) communication systems over frequency selective fading channels. The partial cancellation tries to reduce the cancellation error in parallel interference cancellation (PIC) schemes due to the wrong interference estimations in the early stages and thus outperforms the conventional PIC (CPIC) under the heavy load for MC-CDMA systems. Therefore, in this paper, the adaptive cancellation weights are inferred from a proposed multistage fuzzy inference system (FIS) to perform effective PPIC multiuser detection under time-varying frequency selective fading channels in MC-CDMA systems. Simulation results show that the proposed adaptive four-stage FB-PPIC scheme outperforms both CPIC and constant weight PPIC (CW-PPIC) schemes, especially in near-far environments.
We show that a problem of deciding whether a formula for a multivariate polynomial of n variables over a finite field of characteristic 2 has degree n when reduced modulo a certain Boolean ideal belongs to P. When the formula is allowed to have succinct representations as sums of monomials, the problem becomes P-complete.
Akira MURAYA Tadashi MATSUMOTO Seiichiro MORO Haruo HASEGAWA
For fixed initial and destination states (i.e., markings), M0 and Md, there exist generally infinite firing count vectors in a Petri net. In this letter, it is shown that all fundamental particular solutions as well as all minimal T-invariants w.r.t. firing count vectors are needed to express an arbitrary firing count vector for the fixed M0 and Md. An algorithm for finding a special firing count vector which is expressed by using the only one specified fundamental particular solution is also given.
Hyuk-Choon KWON Won-Seok JANG Sang-Kook HAN
We have proposed and experimentally demonstrated a novel WDM-PON downstream optical link. It is composed of a wavelength-locked FP-LD with a spectrally-sliced FP-LD as an external-injection optical source and operated as directly-modulating in a downstream-traffic transmitter. The downstream transmissions at 622 Mbps and 2.5 Gbps were performed for four channels over 25 km. The proposed WDM-PON downstream transmitter can be expanded up to eight channels by controlling an external-injection optical source of a spectrally-sliced FP-LD. Also, the transmitter has facility of multi-channel selection by controlling temperature. We verified the potential of the transmitter in WDM-PON optical link.
Suwich KUNARUTTANAPRUK Somchai JITAPUNKUL
In a quasi-synchronous reverse link multicarrier code division multiple access system, the signal detection is vulnerable to the interference due to the insufficient guard interval. A multiuser detection with intersymbol interference cancellation is a potential solution to overcome this problem. In this paper, we proposes a parameter acquisition technique based on a specially designed training sequence for the receiver. The concerned parameters are the transformed signature sequences and the ISI generation sequences. We analyze a criterion for the training sequences to achieve the minimum mean square error and propose the systematic generation of the optimum training sequences. We also propose the noise variance estimator for providing information about noise variance to some classes of multiuser detection. Simulation results prove relevant benefits of the proposed techniques and give useful insights into the system designs.
Michihiro KOIBUCHI Akiya JOURAKU Hideharu AMANO
Adaptive routing algorithms, which dynamically select the route of a packet, have been widely studied for interconnection networks in massively parallel computers. An output selection function (OSF), which decides the output channel when some legal channels are free, is essential for an adaptive routing. In this paper, we propose a simple and efficient OSF called minimal multiplexed and least-recently-used (MMLRU). The MMLRU selection function has the following simple strategies for distributing the traffic: 1) each router locally grasps the congestion information by the utilization ratio of its own physical channels; 2) it is divided into the two selection steps, the choice from available physical channels and the choice from available virtual channels. The MMLRU selection function can be used on any type of network topology and adaptive routing algorithm. Simulation results show that the MMLRU selection function improves throughput and latency especially when the number of dimension becomes larger or the number of nodes per dimension become larger.
Wonil LEE Donghoon CHANG Sangjin LEE Soohak SUNG Mridul NANDI
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than Sarkar's construction which is the previously best known complete binary tree based construction. But only disadvantage is that here we need more key length expansion than that of Shoup's sequential algorithm. But it is not too large as in all practical situations we need just two more masks than Shoup's. Our second algorithm is based on non-complete l-ary tree and has the same optimal key length expansion as Shoup's which has the most efficient key length expansion known so far. Using the recent result, we can also prove that the key length expansion of this algorithm and Shoup's sequential algorithm are the minimum possible for any algorithms in a large class of "natural" domain extending algorithms. But its parallelizability performance is less efficient than complete tree based constructions. However if l is getting larger, then the parallelizability of the construction is also getting near to that of complete tree based constructions. We also give a sufficient condition for valid domain extension in sequential domain extension.
This study aims to identify grammatical relations (GRs) in Korean sentences. The key task is to find the GRs in sentences in terms of such GR categories as subject, object, and adverbial. To overcome this problem, we are faced with the structural ambiguity and the grammatical relational ambiguity. We propose a statistical model, which resolves the grammatical relational ambiguity first, and then resolves structural ambiguity by using the probabilities of the GRs given noun phrases and verb phrases in sentences. The proposed model uses the characteristics of the Korean language such as distance, no-crossing and case property. We showed that consideration of such characteristics produces better results than without consideration by experiments. We attempt to enhance our system by estimating the probabilities of the proposed model with the Maximum Entropy (ME) model, and with Support Vector Machines (SVM) classifiers and we confirm that SVM classifiers improved the performance of our proposed model through experiments. Through an experiment with a tree and GR tagged corpus for training the model, we achieved an overall accuracy of 84.8%, 94.1%, and 84.8% in identifying subject, object, and adverbial relations in sentences, respectively.
Jumpei UCHIDA Nozomu TOGAWA Masao YANAGISAWA Tatsuo OHTSUKI
This paper proposes a thread partitioning algorithm in low power high-level synthesis. The algorithm is applied to high-level synthesis systems. In the systems, we can describe parallel behaving circuit blocks (threads) explicitly. First it focuses on a local register file RF in a thread. It partitions a thread into two sub-threads, one of which has RF and the other does not have RF. The partitioned sub-threads need to be synchronized with each other to keep the data dependency of the original thread. Since the partitioned sub-threads have waiting time for synchronization, gated clocks can be applied to each sub-thread. Then we can synthesize a low power circuit with a low area overhead, compared to the original circuit. Experimental results demonstrate effectiveness and efficiency of the algorithm.
Eduardo Kazuhide SATO Atsuo KAWAMURA
This paper proposes an independent control for parallel-connected multiple uninterruptible power supply (UPS) systems based upon a very simple control scheme. Here, the amplitude and phase angle of the output voltage are the controllable variables. With the only measurement of the output current, the active and reactive components are calculated to define the control variables. The entire system including the equations for the circuit, control and voltage limiters is well represented by a small-signal model, in which the computation of its eigenvalues constitutes the stability proof of the system. The root locus diagram gives an overall panorama of the system performance as a function of a certain gain and it aims to aid the further understanding and the design of the control. The experimental verification is carried out using a mere proportional-integral control scheme, which is a special case of the general control equation used in the theoretical analysis. For some situations, experiments show a flow of lateral current between UPS's, which causes an unbalanced current distribution. By increasing the proportional gain of the control equation for the output voltage amplitude, the lateral current can be substantially suppressed with a consequent improvement of the load sharing. Experimental results under various conditions show excellent results in terms of synchronization, load sharing and stability for three distinct output rating UPS's connected in parallel.
Katsuhiko NISHIMURA Kazuo KOBAYASHI
We propose a unique synchronous rectification method in the rectification circuit of a DC-DC converter. This paper describes a novel synchronous rectification circuit that uses a saturable current transformer. We explain operations of this circuit, and analyzed them in this work. In addition, we verified operations of this method applied in boost converter and demonstrated its effectiveness when two or more converters operate in parallel through simulations and experiments.
So-Young PARK Yong-Jae KWAK Joon-Ho LIM Hae-Chang RIM
In this paper, we propose a probabilistic feature-based parsing model for head-final languages, which can lead to an improvement of syntactic disambiguation while reducing the parsing cost related to lexical information. For effective syntactic disambiguation, the proposed parsing model utilizes several useful features such as a syntactic label feature, a content feature, a functional feature, and a size feature. Moreover, it is designed to be suitable for representing word order variation of non-head words in head-final languages. Experimental results show that the proposed parsing model performs better than previous lexicalized parsing models, although it has much less dependence on lexical information.
Kyung Tae DO Yang Hyo KIM Young Hwan KIM Jung Yun CHOI
We present a new approach to the power modeling of synthesizable soft macros, which uses the characteristics of individual input signals for high accuracy. We also present the parameterized power model, developed using the proposed approach, which can relieve us from the power characterization for all possible macro sizes. Extensive experiments illustrate that the proposed approaches exhibit the overall modeling errors below 4.24% and 4.71% for benchmark macros before and after parameterization, when compared with the results of gate-level analysis.
The partial projection filter gives optimal signal restoration in the presence of both the signal space and the observation space noises. In this paper, the filter has been characterized from the point of view of its signal restoration and noise suppression capabilities. The filter is shown to suppress the noise component in the restored signal while retaining the signal component, thus maximizing the signal-to-noise ratio. Further, a digital implementation of the filter is presented in matrix form in contrast to its original operator based derivation, for practical applications.
Herng-Jer LEE Ming-Hong LAI Chia-Chi CHU Wu-Shiung FENG
A new moment computation technique for general lumped R(L)C interconnect circuits with multiple resistor loops is proposed. Using the concept of tearing, a lumped R(L)C network can be partitioned into a spanning tree and several resistor links. The contributions of network moments from each tree and the corresponding links can be determined independently. By combining the conventional moment computation algorithms and the reduced ordered binary decision diagram (ROBDD), the proposed method can compute system moments efficiently. Experimental results have demonstrate that the proposed method can indeed obtain accurate moments and is more efficient than the conventional approach.
The problem of signal restoration in the presence of observation space noise has been tackled extensively. However, restoration of degraded signals in the presence of signal space noise leads to considerable complexity because it becomes difficult to distinguish between the original signal and the noise. In this paper, a partial projection filter has been devised for the restoration of signals degraded by both the signal space and the observation space noises. A closed form of the proposed filter has been derived and its performance has been verified experimentally.
Akinori NAKAJIMA Deepshikha GARG Fumiyuki ADACHI
In this paper, iterative adaptive soft parallel interference canceller (ASPIC) is proposed for turbo coded multiple-input multiple-output (MIMO) multiplexing. ASPIC is applied to transform a MIMO channel into single-input multiple-output (SIMO) channels for maximum ratio diversity combining (MRC). In the ASPIC, replicas of the interference are generated and subtracted from the received signals. For the generation of replicas with higher reliability, iterative ASPIC is proposed. It performs the iterative interference cancellation by feedback of the log-likelihood ratio (LLR) sequence obtained as the turbo decoder output. For iterative ASPIC, at the transmitter, the information sequence and parity sequence are transmitted from different antennas. In this paper, the achievable bit error rate (BER) performance, in a Rayleigh fading channel, for the turbo coded MIMO multiplexing with the proposed iterative ASPIC system is evaluated by computer simulation.
Yong XIANG Wensheng YU Jingxin ZHANG Senjian AN
This paper presents a new method for blind source separation by exploiting phase and frequency redundancy of cyclostationary signals in a complementary way. It requires a weaker separation condition than those methods which only exploit the phase diversity or the frequency diversity of the source signals. The separation criterion is to diagonalize a polynomial matrix whose coefficient matrices consist of the correlation and cyclic correlation matrices, at time delay τ= 0, of multiple measurements. An algorithm is proposed to perform the blind source separation. Computer simulation results illustrate the performance of the new algorithm in comparison with the existing ones.
This paper presents a multi-resolution optical flow estimation method that is robust against large variation in the estimation parameter. For each level solution of the multi-grid estimation, a nonlinear iteration is proposed differently from the existing method, where the incremental displacement from the coarser level optical flow is calculated by linear iteration. The experimental results show that the proposed scheme has better error-performance in a much wider range of regularization parameters.