We call a network an anonymous network, if each vertex of the network is given no ID's. For distributed algorithms for anonymous networks, solvable problems depend strongly on the given initial conditions. In the past, initial conditions have been investigated, for example, by computation given the number of vertices as the initial condition, and in terms of what initial condition is needed to elect a leader. In this paper, we study the relations among initial conditions. To achieve this task, we define the relation between initial conditions A and B (denoted by A B) as the relation that some distributed algorithm can compute B on any network satisfying A. Then we show the following property of this relation among initial conditions. The relation is a partial order with respect to equivalence classes. Moreover, over initial conditions, it induces a lattice which has maxima and minima, and contains an infinite number of elements. On the other hand, we give new initial conditions k-LEADER and k-COLOR. k-LEADER denotes the initial condition that gives special condition only to k vertices. k-COLOR denotes the initial condition that divides the vertices into k groups. Then we investigate the property of the relation among these initial conditions.
Zhi Qi MENG Natsuki YAMASAKI Mitsuo TATEIBA
To make clear numerically the scattering characteristics for a body embedded in a random medium, we need to analyze the bistatic cross-section (BCS). The scattering problem can be analyzed as a boundary value problem by using current generator method. The fourth moment of Green's functions in the random medium, which is necessary for the analysis, is obtained approximately by two-scale method. We analyze numerically the BCS of conducting circular cylinders in continuous random media, which are assumed to fluctuate about the dielectric constant of free space. The numerical results agree well with the law of energy conservation. The effects of random media on the BCS are also clarified numerically.
The mean reflection and transmission coefficients of electromagnetic waves incident onto a two-dimensional slightly random dielectric surface are investigated by means of the stochastic functional approach. We discuss the shift of Brewster's scattering angle using the Wiener kernels and numerical calculations. It is also shown that the phase shift at the reflection into Brewster's angle for a flat surface does not depend on the rms height of the surface, but does on the correlation length of the surface.
Tetsushi KATAYAMA Hiroyuki OCHI Takao TSUDA
Binary Decision Diagrams (BDDs) are graph representation of Boolean functions. In particular, Ordered BDDs (OBDDs) are useful in many situations, because they provide canonical representation and they are manipulated efficiently. BDD packages which automatically generate OBDDs have been developed, and they are now widely used in logic design area, including formal verification and logic synthesis. Synthesis of pass-transistor circuits is one of successful applications of such BDD packages. Pass-transistor circuits are generated from BDDs by mapping each node to a selector which consists of two or four pass transistors. If circuits are generated from smaller BDDs, generated circuits have smaller number of transistors and hence save chip area and power consumption. In this paper, more generic BDDs which have no restrictions in variable ordering and variable appearance count on its paths are called Generic BDDs (GBDDs), and an algorithm for generating GBDDs is proposed for the purpose of synthesis of pass-transistor circuits. The proposed algorithm consists of two steps. At the first step, parse trees (PTs) for given Boolean formulas are generated, where a PT is a directed tree representation of Boolean formula(s) and it consists of literal nodes and operation nodes. In this step, our algorithm attempts to reduce the number of literal nodes of PTs. At the second step, a GBDD is generated for the PTs using Concatenation Method, where Concatenation Method generates a GBDD by connecting GBDDs vertically. In this step, our algorithm attempts to share isomorphic subgraphs. In experiments on ISCAS'89 and MCNC benchmark circuits, our program successfully generated 32 GBDDs out of 680 single-output functions and 4 GBDDs out of 49 multi-output functions whose sizes are smaller than OBDDs. GBDD size is reduced by 23.1% in the best case compared with OBDD.
Neil V. BUDKO Rob F. REMIS Peter M. van den BERG
A two-dimensional algorithm, which combines the well-known Synthetic Aperture Radar (SAR) imaging and the recently developed effective inversion method, is presented and applied to a three-dimensional configuration. During the first stage a two-dimensional image of a realistic three-dimensional buried object is obtained. In the second stage the average permittivity of the object is estimated using a two-dimensional effective inversion scheme where the geometrical information retrieved from the SAR image is employed. The algorithm is applicable in real time.
Mahmood MODARRES-HASHEMI Mohammad M. NAYEBI Hossein ALAVI
In this paper, we consider the coherent radar detection of rapid fluctuating signals in the Gaussian noise. This problem has been previously solved by employing the GLR technique, but we use the ALR to improve the detection performance. So, after deriving an approximate ALR detector, we compare the new detector with the GLR and Square-law detectors and we show its superiority.
A new method of sequential control has been developed in order to increase the productivity and flexibility of production systems. This advanced sequential control (ASC) method is proposed for sequential control systems based on the autonomous decentralized system (ADS) architecture. The ADS defines the system software and message formats and makes it easy to expand the number of devices and software modules. The ASC method increases productivity because it minimizes the processing and adjustment times of production lines by adjusting the starting times of production processes automatically. Experimental evaluation results of the ASC method showed that it increases the productivity of production systems. It is also applied to an actual production system and the results are reported.
Ushio YAMAMOTO Haris HASANUDIN Yoshikuni ONOZATO
In CDMA mobile system, network connection is constructed with orthogonal spreading codes assigned to each user in order to distinguish one from the other. The number of distinguishable codes and the process speed are different according to the orthogonal spreading factors which, in another literature, can be described as the tree structure. In this paper, we investigate methods to improve the quality of services (QoS) of communication, by changing the spreading factors of orthogonal spreading codes according to the number of users. We propose the effective method to reconstruct the tree structure of orthogonal spreading codes for supporting various data rates transmission in DS-CDMA mobile system. We compare spreading factors with and without the reconstruction and evaluate the effectiveness of the reconstruction method.
Tetsuro ITAKURA Takashi UENO Hiroshi TANIMOTO Tadashi ARAI
A fully balanced (FB) transconductor using two multi-input single-ended (SE) CMOS transconductors is proposed, where the transconductors use MOS transitors operating in a triode region for achieving a wide linear input-range. SE circuits are easier to design than differential circuits and inherently reject common-mode (CM) signals. The multi-input structure is used to make a CM feedback loop and to determine an output CM voltage. A high-output-resistance current mirror is used in converting a differential signal to a single-ended signal in order to achieve a high common-mode rejection ratio (CMRR) and a high output-resistance of the transconductor. The FB transconductor achieves a 2-Vpp linear input range at a 2.5-V power supply and consumes 1.74 mA. The output resistance of the FB transconductor is 2 MΩ. It operates at 2 V with a linear input-range of 1.2 Vpp and at 1.6 V with a linear input-range of 0.9 Vpp. A 2.5-V 2.5-MHz FB Gm-C filter using the FB transconductors achieved a CMRR of 45 dB and a passband IIP3 of 32 dBm.
Suk Chan KIM Iickho SONG Seokho YOON So Ryoung PARK
If the direction of arrival (DOA) of a source is perturbed due to some reasons in a statistical way as in the environment of wireless mobile communications, a new model appropriate for such environment should be used instead of the point source model. In this paper, an angle-perturbed source model is proposed and an estimation method based on the eigen-decomposition technique is investigated under the model. The asymptotic distribution of the estimation errors is obtained to see the statistical properties.
Yuansheng TANG Toru FUJIWARA Tadao KASAMI
An algorithm for finding the optimal sectionalization for sectionalized trellises with respect to distinct optimality criterions was presented by Lafourcade and Vardy. In this paper, for linear block codes, we give a direct method for finding the optimal sectionalization when the optimality criterion is chosen as the total number |E| of the edges, the expansion index |E|-|V|+1, or the quantity 2|E|-|V|+1, only using the dimensions of the past and future sub-codes. A more concrete method for determining the optimal sectionalization is given for the Reed-Muller codes with the natural lexicographic coordinate ordering.
A novel adaptive algorithm based on pilot channel (PCA) for MMSE multiuser detection in downlink CDMA is proposed in this paper. This algorithm uses the information in pilot channel to compute the desired weight vector directly. Compared with conventional adaptive algorithms and blind algorithms, it does not require training sequences nor channel estimation. Analysis shows that the weight vector obtained by the PCA algorithm converges to the Wiener solution globally and its computational complexity is O(N2). Simulation results show that the PCA algorithm can adapt rapidly to the changing environment. The steady state performance can be enhanced by increasing the transmitted power in pilot channel, but is worse than that of conventional recursive least-square (RLS) algorithm in decision-directed mode. Also, performance of the adaptive MMSE detector is much better than that of conventional RAKE receiver.
Ru-Chwen WU Yu Ted SU Wen-Chang LIN
Noncoherent detectors for use in acquiring data-modulated direct-sequence spread-spectrum (DS/SS) signals are considered in this paper. Taking data modulation and timing uncertainty into account and using the generalized maximum likelihood (GML) or maximum likelihood (ML) detection approaches, we derive optimal detectors in the sense of Bayes or Neyman-Pearson and propose various suboptimal detectors. A simple systematic means for their realization is suggested and the numerical performance of these detectors is presented. We also compare their performance with that of the noncoherent combining (NC1) detector that had been proposed to serve the same need. Numerical results show that even the proposed suboptimal detectors can outperform the NC1 detector in most cases of interest.
Hyun-Sool KIM Woo-Seok KANG Joong-In SHIN Sang-Hui PARK
This letter proposes a new detection method of human faces in gray scale image with cluttered background using a face template and elliptical structure of the human face. This proposed method can be applicable even in the cases that the face is much smaller than image size and several faces exist in one image, which is impossible in the existing one.
Most distributed systems are based on either the C/S (Client/Server) model or the P-to-P (Peer to Peer) model. In C/S based distributed systems, a client invokes a server and waits for the server reply. Because of this sequential nature, C/S based distributed systems can be implemented by the RPC (Remote Procedure Call) scheme. Most tools for developing distributed objects are based on the RPC scheme. Whereas, in P-to-P based distributed systems, each distributed objects work concurrently, by exchanging asynchronous messages, without waiting for the receiver's action. To implement these P-to-P distributed systems, the RPC scheme is not powerful enough, and the active object model using asynchronous messages is suitable. This paper explains the pure Java library CAPE for developing P-to-P based distributed active object systems.
Seung-Hyub JEON Min-Hui LIM Chuck YOO
The execution model of mobile code inherits from traditional remote execution model such as telnet that needs two conditions. First, the proper program must exist in advance in the remote system. Second, there should be a process in the remote system waiting for requests. Therefore mobile code also bears the same conditions in order to be executed in a remote system. But these conditions constrain an important aspect of mobile code, which is the dynamic extension of system functionality. In this paper we propose a new approach, named Function Message that enables remote execution without these two conditions. Therefore, Function Message makes it easy and natural for mobile codes to extend system functionality dynamically. This paper describes the design of Function Message and implementation on Linux. We measure the overhead of Function Message and verify its usefulness with experimental results. On the ATM network, Function Message can be about five times faster than the traditional remote execution model based on exec().
Chiyo NAKANO Masaaki TAHARA Masanori HAMAMURA Shin'ichi TACHIKAWA
This letter proposes a modified synchronous acquisition method using code-orthogonalizing filters (COFs) in an asynchronous direct sequence (DS) / CDMA. Improvements on the average acquisition time for several conditions are shown.
We propose a unique word detection scheme having the correction of the phase ambiguity that remains in the output of a carrier recovery circuit for QPSK systems. The performance of the proposed scheme is analyzed by obtaining the probability generating function (PGF) for the output of the detector. The PGF is obtained from the z-transform of the probability density function (PDF) for each matched symbol with the reference symbol and by using the characteristics at this time that the random variables for matched symbols are independent and identically distributed. Then the total PGF for a unique word is obtained from powering the PGF for the individual symbol. From the total PGF, the length of a UW and the threshold value for detection can be obtained with a detection probability defined in a required system specification.
Masahiro FUJII Makoto ITAMI Kohji ITOH
This paper presents a new design of spread spectrum signals with the minimally sufficient dimension from the view point of frequency diversity. Letting the signature signal duration and the bandwidth be denoted by T and B, respectively, we can nominally represent a signature signal of either Direct Sequence (DS) or MultiCarrier (MC) spread spectrum system as the sum of N=BT sinusoidal signal units with their frequencies separated by 1/T or its multiples. In our design,assuming the maximum expected channel delay spread σd « T as usual, one signature signal viewed in the frequency domain is made up of the minimum number K 2πσdB of sinusoidal signal units which are arranged so as there is placed at least one unit in coherence bandwidth 1/(2πσd) in which the fading channel transfer function has strong correlation. Although the signature signal does not make use of all the units in the given frequency domain as in the ordinary spread spectrum systems, but uses only skipped units, it can be shown that almost the same frequency diversity effect is attained. And it is also shown that the immunity to the external interfering signals is by no means inferior. If every L=N/K T/(2πσd) consecutive sinusoidal signal units are assigned to the K signal units of a signature signal, L different signature signals are simultaneously available mutually orthogonal when the synchronous demodulation is performed in the same T period. We call each of the orthogonal sinusoidal signal sets a Frequency Devision (FD) signal set. Now, CDMA can be independently realized on each of the L FD signal sets provided the operation is synchronous or quasi-synchronous with respect to the symbol demodulation (or signature) period. Partitioning the simultaneous users among the FD sets, it is possible to decrease the number of CDMA users to be processed, retaining the total number of simultaneous users. Owing to this effect, the multiple access performance for the FD/CDMA system is shown to be superior to that of the ordinary DS or MC/CDMA system, assuming matched filter reception based on the complete estimation of the channel characteristics for the both cases. The decrease of the number of CDMA users per FD set makes it practical for the receiver to employ multiple access interference cancellation and even the maximum likelihood detection. Curiously, any FD signal set can be represented in the time domain as L repetition of a sequence with its period equal to K in the number of 1/B duration time chips.
Nonlinear behavior of electromagnetic surface waves propagating along a tangentially magnetized ferrite slab is investigated. The nonlinear Schrodinger equation (NLSE) which describes the temporal evolution of the electromagnetic wave pulses has been derived directly from the Maxwell equations and the equation of precessional motion for the magnetization in the ferrite slab with the aid of the reductive perturbation method without magnetostatic approximation. Based on the formula derived, we have numerically evaluated the frequency-dependence of the nonlinear coefficient in the NLSE for both a magnetostatic surface wave mode and a dynamic mode. As a result, we have confirmed the possibility of the propagation of solitons in the waveguide.