Apisak WORAPISHET Kornika MOOLPHO Jitkasame NGARMNIL
A structure of a track-and-hold (T/H) circuit based on a pair of complementary floating-gate (FG) MOS transistors is introduced. Its main features include low complexity, low operating supply voltage and gain insensitivity to device mismatches, leading to efficient realization of numerous baseband functions in modern communication systems. The detailed operation and performance analysis of the FG T/H circuit are given. Functional verification of the circuit is provided through a breadboard experiment. The effectiveness of the circuit is verified via simulations where the single T/H cell operating at 10 MHz clock frequency exhibits gain variation less than 0.13% and a dynamic range over 71 dB with the coupling capacitance of 300 fF at 1.5 V supply and 12.75 µW power consumption. As a demonstration on its practical viability, the designed FG T/H cell was also utilized to realize a 10 MS/s 7-tap analog correlator for possible use in modern communication applications.
Yukihiro TADOKORO Hiraku OKADA Takaya YAMAZATO Masaaki KATAYAMA
Packet-recognition/code-acquisition (PR/CA) is one of the most important issues in packet communication systems. In a CDMA Unslotted ALOHA system, Multiple Access Interference (MAI) may bring about errors in PR/CA. The MAI mainly stems from already recognized packets and newly arriving packets under the execution of PR/CA. This characteristic of asynchronous transmission in CDMA U-ALOHA systems implies that only one or a few packets arrive at the receiver within a short interval of a execution. Furthermore, newly arriving packets are recognized and code-acquired by using a short preamble part. Consequently, the MAI from the packets under the execution of the PR/CA will be small. Focusing on that point, this paper proposes applying the IC scheme in order to suppress the MAI from the already recognized and code-acquired packets. A performance evaluation demonstrates that such an application is valid due to the small amount of MAI from the packets under the execution of PR/CA. In addition, we demonstrates that the scheme reduces false recognition rather than mis-recognition. Such a scheme improves the performance of not only PR/CA, but also the throughput.
Shoichi KAJIWARA Atsushi YAMAMOTO Koichi OGAWA Akihiro OZAKI Yoshio KOYANAGI
This paper addresses the variation of the attenuation characteristics of the Specific Absorption Rate (SAR) in a lossy medium as a function of the distance between an antenna and the medium with different EM-source sizes. Analysis and measurements were performed using a dipole antenna at 900 MHz and a COST244 cubic phantom. From this, an empirical equation has been derived, representing the attenuation characteristics of the SAR. The equation takes into consideration an energy loss due to the spatial spread of electromagnetic waves. In the case where an antenna is placed more than λ/2π away from the medium, the attenuation characteristics of the SAR are those obtained from plane waves in the lossy medium. In the case where a half-wavelength dipole antenna is located close to the medium, at a distance of less than λ/2π, the attenuation characteristics of the SAR are calculated from an equation that includes a loss caused by the spread of energy as a cylindrical wave. Moreover, when the length of antenna is short, it is found that a spatial attenuation factor appropriate to a spherical wave should be taken into account.
An electromagnetic (EM) inverse scattering problem that involves the reconstruction of microwave images for dielectric objects is considered in this paper. This ill-posed and nonlinear problem is treated as a global optimization problem, and is solved by the application of micro-genetic algorithm (m-GA). The reconstructed results obtained by m-GA have shown that it is an effective technique for microwave imaging and satisfactory performance is achieved when compared with the conventional genetic algorithms.
Naobumi MICHISHITA Yuji NAKAYAMA Hiroyuki ARAI Kohei MORI
The three beam-switched top-loaded antenna is suited to be applied to a wireless local area network to switch the radiation pattern by arranging several unidirectional antennas. In this paper, a three beam switched top loaded monopole antenna is proposed to realize its small size and planar structure. Three top loaded monopole antennas are arranged around a parasitic hexagonal patch at intervals of 120 degrees. The feed element is selected by the switching device to switch the radiation pattern. This antenna allows for reduction in the number of elements as well as downsizing. The front to back ratio (F/B) becomes 23 dB by selecting suitable parameters.
Jong-Won LEE Suk-Hwan LEE Ki-Ryong KWON Kuhn-Il LEE
We proposed 3D-mesh watermarking using CEGI distribution that has robustness against mesh simplification, cropping, vertex randomization, and rotation and which does not need the original model for detection the watermark. The proposed algorithm embeds the watermark bits into the normal vector direction of meshes that are mapped into the cells that have the large magnitude of complex weight in patch CEGIs. The watermark can be detected based on the known center point of each patch and the rank table of the cell in each patch instead of original model. Experimental results verified that the proposed algorithm has robustness against the attacks.
Kwang-Baek KIM Sung-Kwan JE Young-Ju KIM
This paper proposes an enhanced RBF network that enhances learning algorithms between input layer and middle layer and between middle layer and output layer individually for improving the efficiency of learning. The proposed network applies ART2 network as the learning structure between input layer and middle layer. And the auto-tuning method of learning rate and momentum is proposed and applied to learning between middle layer and output layer, which arbitrates learning rate and momentum dynamically by using the fuzzy control system for the arbitration of the connected weight between middle layer and output layer. The experiment for the classification of number patterns extracted from the citizen registration card shows that compared with conventional networks such as delta-bar-delta algorithm and the ART2-based RBF network, the proposed method achieves the improvement of performance in terms of learning speed and convergence.
Nobuyoshi KOMURO Hiromasa HABUCHI
In this paper, the throughput performance of the CSK/SSMA ALOHA system with nonorthogonal sequences which combines the ALOHA system with Code Shift Keying using nonorthogonal sequences is analyzed. In this system, the nonorthogonal sequences are constructed by concatenating Mcon orthogonal sequences. The throughput performance of the CSK/SSMA ALOHA system with nonorthogonal sequences is analyzed in consideration that the number of packets changes at intervals of one orthogonal sequence. Moreover, the throughput performance of our system with Channel Load Sensing Protocol (CLSP) is also analyzed. We also examine the influence of unreachable control signal of CLSP. Consequently, it is found that the throughput performance of our system decreases significantly by this analysis. It is also found that the throughput performance of our system improves greatly by using CLSP. However, the unreachable control signal affects the throughput performance of this system, seriously.
Tatsunori ASAI Hiroshi SARUWATARI Kiyohiro SHIKANO
This paper describes a new interface for a barge-in free spoken dialogue system combining an adaptive sound field control and a microphone array. In order to actualize robustness against the change of transfer functions due to the various interferences, the barge-in free spoken dialogue system which uses sound field control and a microphone array has been proposed by one of the authors. However, this method cannot follow the change of transfer functions because the method consists of fixed filters. To solve the problem, we introduce a new adaptive sound field control that follows the change of transfer functions.
This paper gives an efficient algorithm to compute addition in Jacobian of C34 curves, aiming at C34 curve cryptosystems. Using C34 curves for cryptosystems has two advantages. The first is safety and the second is the short size of the base field. In the paper, we modify the addition algorithm of for Cab curves in the specific manner to C34 curves. We classify all of the forms of the Groebner bases of ideals involved in the algorithm and eliminate the use of Buchberger algorithm from it. Our resulting algorithm computes the addition in Jacobian of C34 curves in about 3 times amount of computation of the one in elliptic curves, when the sizes of groups are set to be the same.
Embedded systems are used in broad fields. They are one of the indispensable and fundamental technologies in a highly informative society in recent years. As embedded systems are large-scale and complicated, it is prosperous to design and develop a system LSI (Large Scale Integration). The structure of the system LSI has been increasing complexity every year. The degree of improvement of its design productivity has not caught up with the degree of its complexity by conventional methods or techniques. Hence, an idea for the design of a system LSI which has the flow of describing specifications of a system in UML (Unified Modeling Language) and then designing the system in a system level language has already proposed. It is important to establish how to convert from UML to a system level language in specification description or design with the idea. This paper proposes, extracts and verifies transformation rules from UML to SpecC which is one of system level languages. SpecC code has been generated actually from elements in diagrams in UML based on the rules. As an example to verify the rules, "headlights control system of a car" is adopted. SpecC code has been generated actually from elements in diagrams in UML based on the rules. It has been confirmed that the example is executed correctly in simulations. By using the transformation rules proposed in this paper, specification and implementation of a system can be connected seamlessly. Hence, it can improve the design productivity of a system LSI and the productivity of embedded systems.
This paper presents a distributed task assignment algorithm in a logical unidirectional ring, which guarantees that almost all tasks are assigned to servers with the first come first served (FCFS) policy without a global clock. A task assignment for a process is obtained in the time period needed for a message to circle the ring. This time period is almost optimal for a unidirectional ring. The FCFS policy is very important in terms of task fairness and can also avoid starvation and provide an efficient response time. Simulation results show that the algorithm generally works better than conventional task assignment or load balancing schemes with respect to both mean response time and task fairness.
Frequency domain blind source separation has the great advantage that the complicated convolution in time domain becomes multiple efficient multiplications in frequency domain. However, the inherent ambiguity of permutation of ICA becomes an important problem that the separated signals at different frequencies may be permuted in order. Mapping the separated signal at each frequency to a target source remains to be a difficult problem. In this paper, we first discuss the inter-frequency correlation based method, and propose a new method using the continuity in power between adjacent frequency components of same source. The proposed method also implicitly utilizes the information of inter-frequency correlation, as such has better performance than the previous method.
Wei-Bin EWE Le-Wei LI Qun WU Mook-Seng LEONG
This paper presents an analysis of electrically large antennas using the adaptive integral method (AIM). The arbitrarily shaped perfectly conducting surfaces are modeled using triangular patches and the associated electric field integral equation (EFIE) is solved for computing the radiation patterns of these antennas. The method of moments (MoM) is used to discretize the integral equations and the resultant matrix system will be solved by an iterative solver. The AIM is employed in the iterative solver to speed up the matrix-vector multiplication and to reduce the memory requirement. As specific applications, radiation patterns of parabolic reflectors and X-band horns are computed using the proposed method.
Masahiko NISHIMOTO Ken-ichiro SHIMO
A method for detecting shallowly buried landmines using sequential ground penetrating radar (GPR) data is presented. After removing a dominant coherent component arising from the ground surface reflection from the GPR data, three kinds of target features related to wave correlation, energy ratio, and signal arrival time are extracted. Since the detection problem treated here is reduced to a binary hypothesis test, an approach based on a likelihood ratio test is employed as a detection algorithm. In order to check the detection performance, a Monte Carlo simulation is carried out for data generated by a two-dimensional finite-difference time domain (FDTD) method. Results given in the form of receiver operating characteristic (ROC) curves show that good detection performance is obtained even for landmines buried at shallow depths under rough ground surfaces, where the responses from the landmines and that from the ground surface overlap in time.
In order to boost the translation quality of corpus-based MT systems for speech translation, the technique of splitting an input utterance appears promising. In previous research, many methods used word-sequence characteristics like N-gram clues among splitting positions. In this paper, to supplement splitting methods based on word-sequence characteristics, we introduce another clue using similarity based on edit-distance. In our splitting method, we generate candidates for utterance splitting based on N-grams, and select the best one by measuring the utterance similarity against a corpus. This selection is founded on the assumption that a corpus-based MT system can correctly translate an utterance that is similar to an utterance in its training corpus. We conducted experiments using three MT systems: two EBMT systems, one of which uses a phrase as a translation unit and the other of which uses an utterance, and an SMT system. The translation results under various conditions were evaluated by objective measures and a subjective measure. The experimental results demonstrate that the proposed method is valuable for the three systems. Using utterance similarity can improve the translation quality.
Anas Muhamad BOSTAMAM Yukitoshi SANADA
In this paper a new adjacent channel interference (ACI) cancellation scheme for multi-channel signal reception with low-IF receivers is investigated through the experiment. In the low-IF receivers, the signal in the mirror frequency causes interference to the desired signal. In the proposed analog-digital signal processing scheme, channel selection is made by analog complex band pass filter and the signal is reconstruct by Wiener filter to eliminate the interference effect in order to improve the performance.
Yun Won CHUNG Jae Kyun KWON Yeong Jin KIM Dan Keun SUNG
This letter proposes an improved timer-based location management scheme for packet-switched (PS) mobile communication systems. Compared to the conventional timer-based scheme with a single timer threshold, a new timer-based scheme with two timer thresholds is proposed to accommodate the bursty data traffic characteristics of PS service. The location update and paging costs of the proposed scheme are analyzed and compared with those of the conventional scheme. We show that the proposed scheme outperforms the conventional scheme in terms of total cost of both location update and paging with an appropriate selection of timer thresholds.
Masayoshi ARITSUGI Hiroki FUKATSU Yoshinari KANAMORI
Data accessed by many sites are replicated in distributed environments for performance and availability. In this paper, replication schemes are examined in parallel image convolution processing. This paper presents a system architecture that we have developed with CORBA (Common Object Request Broker Architecture) for the processing. Employing CORBA enables us to make use of a cluster of workstations, each of which has a different level of computing power. The paper also describes a parallel and distributed image convolution processing model using replicas stored in a network of workstations, and reports some experimental results showing that our analytical model can agree with practical situations.
Toshifumi MORIYAMA Yoshio YAMAGUCHI Seiho URATSUKA Toshihiko UMEHARA Hideo MAENO Makoto SATAKE Akitsugu NADAI Kazuki NAKAMURA
This paper attempts to use the polarimetric correlation coefficient for extraction of the polarimetric features of the urban areas and the natural distributed areas from Polarimetric Synthetic Aperture Radar (POLSAR) data. There is a possibility that the polarimetric correlation coefficient can reveal various scattering mechanisms of terrains based on the reflection symmetry property. In order to verify the capability of polarimetric correlation coefficient, we examined the behavior of this coefficient of the urban areas and the natural distributed areas with respect to the several polarimetric scattering models in the linear and circular polarization bases, and the difference of the polarimetric scattering characteristics between these two areas was derived. It was confirmed that the polarimetric correlation coefficient is useful to extract the polarimetric features from the actual L-band and X-band POLSAR data.