Shinya SASAKI Tetsuki TANIGUCHI Yoshio KARASAWA
In this paper, as an important technology for the software-defined radio, a novel scheme of adaptive array antenna utilizing bandpass sampling technique is proposed. For adaptive signal processing, it is necessary to convert the radio frequency signal received by the antenna that is given by real number into baseband region, i.e., complex number region. Then, the method for dividing the bandpass sampled signal to in-phase and quadrature components is analyzed. The sampling scheme is called the IQ-division bandpass sampling. An adaptive array antenna based on the IQ-division bandpass sampling is characterized by the signal processing at the bandpass sampled signal stage, namely, intermediate frequency stage, not baseband. Finally, we will confirm the validity of the proposed scheme through an experiment in a radio anechoic chamber.
Masanori HASHIMOTO Yoshiteru HAYASHI Hidetoshi ONODERA
This paper experimentally investigates the effectiveness of regularly-placed bit-slice layout and transistor-level optimization to datapath circuit performance. We focus on cell-base design flows with transistor-level circuit optimization. We examine the effectiveness through design experiments of 32-bit carry select adder and 16-bit tree-style multiplier in a 0.35 µm technology. From the experimental results, we can scarcely observe that manual cell placement contributes to improve circuit performance. On the other hand, transistor-level circuit optimization is so effective that circuit delay is reduced by 11-20% and power dissipation decreases to 42-62%. We can see that, in the case of cell-base design, transistor-level optimization is also important as well as in the case of custom design, whereas cell-base bit-slice layout has less importance to circuit performance.
Jeong-Yong AHN Young-Hyun KIM Soon-Ki KIM
The fuzzy set framework can be utilized in several different approaches to modeling the diagnostic process. In this paper, we introduce two main relations between symptoms and diseases where the relations are described by intuitionistic fuzzy set data. Also, we suggest four measures for medical diagnosis. We are dealing with the preliminary diagnosis from the information of interview chart. We quantify the qualitative information based on the interview chart by dual scaling. Prototype of fuzzy diagnostic sets and the linear regression methods are established with these quantified data. These methods can be used to classify new patient's tone of diseases with certain degrees of belief and its concerned symptoms.
HariGovind V. RAMASAMY Michel CUKIER William H. SANDERS
The traditional approach for establishing the correctness of group communication protocols is through rigorous arguments. While this is a valid approach, the likelihood of subtle errors in the design and implementation of such complex distributed protocols is not negligible. The use of formal verification methods has been widely advocated to instill confidence in the correctness of protocols. In this paper, we describe how we used the SPIN model checker to formally verify a group membership protocol that is part of an intrusion-tolerant group communication system. We describe how we successfully tackled the state-space explosion problem by determining the right abstraction level for formally specifying the protocol. The verification exercise not only formally showed that the protocol satisfies its correctness claims, but also provided information that will help us make the protocol more efficient without violating correctness.
Data compression is popularly applied to computer systems and communication systems. Especially, lossless compression is applied to text compression. Since compressed data are very sensitive to errors, several error control methods for data compression using probability model, such as for arithmetic coding, have been proposed. This paper proposes to apply an unequal error protection, or a UEP, scheme to LZ77 coding and LZW coding. This investigates a structure of the compressed data and clarifies a part which is more sensitive to errors than the other by using theoretical analysis and computer simulation. The UEP scheme protects the error-sensitive part from errors more strongly than the others. Computer simulation says that the proposed scheme can recover from errors in the compressed data more effectively than the conventional methods.
Satoshi KOMATSU Masahiro FUJITA
The power dissipation at the off-chip bus has become a significant part of the overall power dissipation in micro-processor based digital systems. This paper presents irredundant address bus encoding methods which reduce signal transitions on the instruction address buses by using adaptive codebook methods. These methods are based on the temporal locality and spatial locality of instruction address. Since applications tend to JUMP/BRANCH to limited sets of addresses, proposed encoding methods assign the least signal transition codes to the addresses of JUMP/BRANCH operations in the past. In addition, our methods can be easily applicable for conventional digital systems since they are irredundant encoding methods. Our encoding methods reduce the signal transitions on the instruction address buses, which results in the reduction of total power dissipation of digital systems. Experimental results show that our methods can reduce the signal transition by an average of 88%.
Mira KIM Junji SHIKATA Hirofumi MURATANI Hideki IMAI
In this paper, we deal with c-secure codes in a fingerprinting scheme, which encode user ID to be embedded into the contents. If a pirate copy appears, c-secure codes allow the owner of the contents to trace the source of the illegal redistribution under collusion attacks. However, when dealing in practical applications, most past proposed codes are failed to obtain a good efficiency, i.e. their codeword length are too large to be embedded into digital contents. In this paper, we propose a construction method of c-secure CRT codes based on polynomials over finite fields and it is shown that the codeword length in our construction is shorter than that of Muratani's scheme. We compare the codeword length of our construction and that of Muratani's scheme by numerical experiments and present some theoretical results which supports the results obtained by numerical experiments. As a result, we show that our construction is especially efficient in respect to a large size of any coalition c. Furthermore, we discuss the influence of the random error on the traceability and formally define the Weak IDs in respect to our construction.
We present a differential fixpoint computation method for program analyses based on abstract interpretation. An analysis of a program based on abstract interpretation can be expressed using a monotonic increasing function and a fixpoint of the function becomes an analysis result. To compute a fixpoint, the function is applied repeatedly until the results become stable. This brings redundant computation because new results always include the former results. Differential methods try to avoid such redundancy by computing only the increment of each function application. Compared with other differential fixpoint evaluation methods, our method can deal with non-distributive functions which often occur in practical program analyses. To compute increments for non-distributive functions, we adapt an indirect way of using a differential evaluation rule for expressions which form function bodies. We have designed a differential worklist algorithm and applied the algorithm to implement an alias and constant propagation analysis. Experiments show that our method can avoid much redundant computation.
Takayuki YAMAMOTO Masashi SUGANO Masayuki MURATA Takaaki HATAUCHI Yohei HOSOOKA
In ad hoc wireless networks, wireless terminals can autonomously construct and can maintain the network. They communicate with some neighbor terminals, exchange network information and determine routes for packets on the multi-hop wireless network. Flexible Radio Network (FRN), one of the ad hoc wireless network systems, adopts a proprietary protocol that provides a multiple routes management and a packet retransmission mechanism against packet transmission errors. This system is a commercial product that has been in use in a recent few years. In this paper, we first evaluate the performance through simulations for data-link protocol and routing protocol of the FRN to clarify its basic properties. Furthermore, we propose some techniques that enhance its performance and solve problems on the protocols. We show how they improve the system performance through simulations and analyses.
Masayuki HIROTA Maria-Cecilia VALECILLOS Manuel E. BRITO Kiyoshi HIRAO Motohiro TORIYAMA
Using various rare earth sesquioxides as additives, silicon nitride (Si3N4) samples were sintered at 1700 for 4 h by millimeter-wave heating performed in an applicator fed by a 28 GHz Gyrotron source under a nitrogen pressure of 0.1 MPa. A comparative study of densification, grain growth behavior and mechanical properties of silicon nitride fabricated by millimeter-wave and conventional sintering was carried out. Bulk densities were measured by Archimedes' technique. Except for the Eu2O3 containing sample, all samples were densified to relative densities of above 97.0%. Microstructure of the specimens was analyzed by scanning electron microscopy (SEM) and transmission electron microscopy (TEM). To investigate quantitatively the effect of millimeter-wave heating on grain growth, image analysis was carried out for grains in the specimens. Fracture toughness was determined by the indentation-fracture method (IF method) in accordance with Japan Industrial Standards (JIS). Fully dense millimeter-wave sintered silicon nitride presenting a bimodal microstructure exhibited higher values of fracture toughness than materials processed by conventional heating techniques. Results indicate that millimeter-wave sintering is more effective in enhancing the grain growth and in producing the bimodal microstructure than conventional heating. It was also confirmed that localized runaway in temperature, depending upon the sintering additives, can occur under millimeter-wave heating.
Xavier DEFAGO Andre SCHIPER Peter URBAN
In this paper, we present the results of a comparative analysis of Atomic Broadcast algorithms. The analysis was done by using an analytical method to compare the performance of five different classes of Atomic Broadcast algorithms. The five classes of Atomic Broadcast algorithms are determined by the mechanisms used by the algorithms to define the delivery order. To evaluate the performance of algorithms, the analysis relies on contention-aware metrics to provide a measure for both their latency and their throughput. The results thus obtained yield interesting insight into the performance tradeoffs of different Atomic Broadcast algorithms, thus providing helpful information to algorithms and systems designers.
JungWon CHO SeungDo JEONG GeunSeop LEE SungHo CHO ByungUk CHOI
In a content-based image retrieval (CBIR) system, both the retrieval relevance and the response time are very important. This letter presents the condensed two-stage search method as a new fast image retrieval approach by making use of the property of Cauchy-Schwarz inequality. The method successfully reduces the overall processing time for similarity computation, while maintaining the same retrieval relevance as the conventional exhaustive search method. By the extensive computer simulations, we observe that the condensed two-stage search method is more effective as the number of images and dimensions of the feature space increase.
Johannes Hamonangan SIREGAR Hideaki TAKAGI Yongbing ZHANG
We consider the routing and wavelength assignment (RWA) problem for large-scale WDM optical networks where each transmission request is served by an all-optical lightpath without wavelength conversion. Two heuristic RWA algorithms are proposed in order to minimize the number of wavelengths required for a given set of connection requests. The proposed algorithms are evaluated and compared with the existing algorithms for two realistic networks constructed based on the locations of major cities in Ibaraki Prefecture and those in Kanto District in Japan.
Yong GUAN Yoshio NIKAWA Eiji TANABE
Development of non-invasive techniques to measure blood sugar level is strongly required. The application of millimeter waves has a great potentiality to realize the measuring technique. Nevertheless, the practical method of the technique is not yet reported. In this paper, a new technique is proposed to measure blood sugar level using millimeter waves. The technique proposed here is very rapid and safety way to obtain blood sugar level.
Hirotsugu TAKIZAWA Masato IWASAKI
Both Cr2O3 and NiO absorb 28 GHz milli-meter-wave energy well and this strong coupling with millimeter-waves can be used to promote a chemical reaction with La2O3 to form perovskite-type LaCrO3 or LaNiO3 ceramics. In La2O3-Cr2O3 system, the reaction proceeded rapidly and single phase LaCrO3 could be synthesized within 15 min even at lower temperature (400) as compared to conventional synthesis (T > 800). In the case of LaNiO3, the reaction proceeded rapidly in the early stage of heating (t < 15 min), but not completed even after prolonged millimeter-wave irradiation. The results suggest an importance of millimeter-wave penetration depth, especially for processing of conductive materials.
Dong XIANG Shan GU Hideo FUJIWARA
A two stage non-scan design for testability method is proposed. The first stage selects test points based on an earlier testability measure conflict. A new design for testability algorithm is proposed to select test points by a fault-oriented testability measure conflict+ in the second stage. Test points are selected in the second stage based on the hard faults after the initial ATPG run of the design for testability circuit in the preliminary stage. The new testability measure conflict+ based on conflict analysis of hard-faults in the process of test generation is introduced, which emulates most general features of sequential ATPG. The new testability measure reduces testability of a fault to the minimum D or
Young I. SON Hyungbo SHIM Kab-Il KIM
In order to stabilize a convey-crane with only cart position measurement, this paper designs an additional dynamics with which the parallel-connected system is feedback passive. Since the crane system can be stabilized with a proportional-derivative (PD) law, the additional system is constructed by using the PD gains, and the closed-loop system exhibits almost same performances with the PD law. With the proposed control law, the transfer function of the additional system has the form of sH(s) with a strictly positive real (SPR) H(s).
Kang-Seo PARK Doo-Jin HAN Tae-Yun CHUNG Sang-Hui PARK
A novel motion vector re-estimation technique for transcoding into lower spatial resolution is proposed. This technique is based on the fact that the block matching error is proportional to the complexity of the reference block with Taylor series expansion. It is shown that the motion vectors re-estimated by the proposed method are closer to optimal ones and offer better quality than those of previous techniques.
At EuroCrypt '95, Stadler, Piveteau and Camenish introduced the concept of fair blind signatures to prevent the misuse of blind signature schemes by criminals. Recently, Hwang, Lee and Lai claimed that Stadler et al.'s first fair blind signature scheme cannot meet the untraceability property of the blind signature schemes. However, this letter will demonstrate that Hwang et al.'s claim is incorrect and Stadler et al.'s first scheme still holds the untraceability property.
Hisashi FUTAKI Tomoaki OHTSUKI
In this letter, we propose the Low-Density Parity-Check (LDPC) coded Orthogonal Frequency Division Multiplexing (OFDM) systems to improve the error rate performance of OFDM. We also evaluate the iterative decoding performance on both an AWGN and a frequency-selective fading channels. We show that when the energy per information bit to the noise power spectral density ratio Eb/N0 is not small, the LDPC coded OFDM (LDPC-COFDM) systems have the good error rate performance with a small number of iterations. We also show that when the Eb/N0 is small, the BER of the LDPC-COFDM systems is worse than that of the Turbo coded OFDM (TCOFDM) systems, while when the Eb/N0 is not small, the BER of the LDPC-COFDM systems is better with a small number of iterations.