The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] Ti(30728hit)

20361-20380hit(30728hit)

  • Security of Kuwakado-Tanaka Transitive Signature Scheme for Directed Trees

    Xun YI  Chik-How TAN  Eiji OKAMOTO  

     
    LETTER-Information Security

      Vol:
    E87-A No:4
      Page(s):
    955-957

    Recently, Kuwakado and Tanaka proposed a transitive signature scheme for directed trees. In this letter, we show that Kuwakado-Tanaka scheme is insecure against a forgery attack, in which an attacker is able to forge edge signatures by composing edge signatures provided by a signer.

  • Blind Adaptive Compensation for Gain/Phase Imbalance and DC Offset in Quadrature Demodulator with Power Measurement

    Chun-Hung SUN  Shiunn-Jang CHERN  Chin-Ying HUANG  

     
    PAPER-Wireless Communication Technology

      Vol:
    E87-B No:4
      Page(s):
    891-898

    In this paper we propose a new blind adaptive compensator associated with the inverse QRD-RLS (IQRD-RLS) algorithm to adaptively estimate the parameters, related to the effects of gain/phase imbalance and DC offsets occur in the Quadrature demodulator, for compensation. In this new approach the power measurement of the received signal is employed to develop the blind adaptation algorithm for compensator, it does not require any reference signal transmitted from the transmitter and possess the fast convergence rate and better numerical stability. To verify the great improvement, in terms of reducing the effects of the imbalance and offset, over existing techniques computer simulation is carried out for the coherent 16 PSK-communication system. We show that the proposed blind scheme has rapidly convergence rate and the smaller mean square error in steady state.

  • The Multipurpose Methods for Efficient Searching at Online Shopping

    Tomomi SANJO  Morio NAGATA  

     
    PAPER-System

      Vol:
    E87-D No:4
      Page(s):
    928-936

    Online shopping is becoming more and more popular in recent years. However, users are still unable to find what they want on the online market very efficiently. In our previous paper we suggested a system that helps to find short-sleeved T-shirts for young women on the online market. Then we conducted several verification experiments and proved that the system was effective. In this paper, we modified the system by adopting the following schemes in order to make it more versatile; First, all information is presented in a unified format. Second, users are provided with multiple-choice key words. Third, users search results are used to select information that is truly useful for the user. Lastly, we conducted several verification experiments and proved that these schemes were effective.

  • A Full-CMOS Single Chip Bluetooth LSI with 1.5 MHz-IF Receiver and Direct Modulation Transmitter

    Fumitoshi HATORI  Hiroki ISHIKURO  Mototsugu HAMADA  Ken-ichi AGAWA  Shouhei KOUSAI  Hiroyuki KOBAYASHI  Duc Minh NGUYEN  

     
    PAPER

      Vol:
    E87-C No:4
      Page(s):
    556-562

    This paper describes a full-CMOS single-chip Bluetooth LSI fabricated using a 0.18 µm CMOS, triple-well, quad-metal technology. The chip integrates radio and baseband, which is compliant with Bluetooth Core Specification version 1.1. A direct modulation transmitter and a low-IF receiver architecture are employed for the low-power and low-cost implementation. To reduce the power consumption of the digital blocks, it uses a clock gating technique during the active modes and a power manager during the low power modes. The maximum power consumption is 75 mW for the transmission, 120 mW for the reception and 30 µW for the low power mode operation. These values are low enough for mobile applications. Sensitivity of -80 dBm has been achieved and the transmitter can deliver up to 4 dBm.

  • Comparing Reading Techniques for Object-Oriented Design Inspection

    Giedre SABALIAUSKAITE  Shinji KUSUMOTO  Katsuro INOUE  

     
    PAPER-Software Engineering

      Vol:
    E87-D No:4
      Page(s):
    976-984

    For more than twenty-five years software inspections have been considered an effective method for defect detection. Inspections have been investigated through controlled experiments in university environment and industry case studies. However, in most cases software inspections have been used for defect detection in documents of conventional structured development process. Therefore, there is a significant lack of information about how inspections should be applied to Object-Oriented artifacts, such as Object-Oriented code and design diagrams. In addition, extensive work is needed to determine whether some inspection techniques can be more beneficial than others. Most inspection experiments include inspection meetings after individual inspection is completed. However, several researchers suggested that inspection meetings may not be necessary since an insignificant number of new defects are found as a result of inspection meeting. Moreover, inspection meetings have been found to suffer from process loss. This paper presents the findings of a controlled experiment that was conducted to investigate the performance of individual inspectors as well as 3-person teams in Object-Oriented design document inspection. Documents were written using the notation of Unified Modelling Language. Two reading techniques, namely Checklist-based reading (CBR) and Perspective-based reading (PBR), were used during experiment. We found that both techniques are similar with respect to defect detection effectiveness during individual inspection as well as during inspection meetings. Investigating the usefulness of inspection meetings, we found out that the teams that used CBR technique exhibited significantly smaller meeting gains (number of new defect first found during team meeting) than meeting losses (number of defects first identified by an individual but never included into defect list by a team); meanwhile the meeting gains were similar to meeting losses of the teams that used PBR technique. Consequently, CBR 3-person team meetings turned out to be less beneficial than PBR 3-person team meetings.

  • Shared Sub-Path Protection with Overlapped Protection Areas in WDM Networks

    Jian-Qing LI  Hong-Shik PARK  Hyeong-Ho LEE  

     
    PAPER-Network Management/Operation

      Vol:
    E87-B No:4
      Page(s):
    940-947

    A new partitioning configuration that divides a given network into overlapped protection areas is investigated. If two working sub-paths are in the adjacent different working areas, their corresponding protection sub-paths can share a wavelength on the link that belongs to the overlap between two adjacent protection areas. The objective of overlapping is to increase sharing of the protection sub-paths that belong to the adjacent protection areas. The performances of resource utilization and recovery time are improved without any significant degradation of other performances.

  • Selective-Sets Resizable Cache Memory Design for High-Performance and Low-Power CPU Core

    Takashi KURAFUJI  Yasunobu NAKASE  Hidehiro TAKATA  Yukinaga IMAMURA  Rei AKIYAMA  Tadao YAMANAKA  Atsushi IWABU  Shutarou YASUDA  Toshitsugu MIWA  Yasuhiro NUNOMURA  Niichi ITOH  Tetsuya KAGEMOTO  Nobuharu YOSHIOKA  Takeshi SHIBAGAKI  Hiroyuki KONDO  Masayuki KOYAMA  Takahiko ARAKAWA  Shuhei IWADE  

     
    PAPER

      Vol:
    E87-C No:4
      Page(s):
    535-542

    We apply a selective-sets resizable cache and a complete hierarchy SRAM for the high-performance and low-power RISC CPU core. The selective-sets resizable cache can change the cache memory size by varying the number of cache sets. It reduces the leakage current by 23% with slight degradation of the worst case operating speed from 213 MHz to 210 MHz. The complete hierarchy SRAM enables the partial swing operation not only in the bit lines, but also in the global signal lines. It reduces the current consumption of the memory by 4.6%, and attains the high-speed access of 1.4 ns in the typical case.

  • A Method to Develop Feasible Requirements for Java Mobile Code Application

    Haruhiko KAIYA  Kouta SASAKI  Kenji KAIJIRI  

     
    PAPER-Requirement Engineering

      Vol:
    E87-D No:4
      Page(s):
    811-821

    We propose a method for analyzing trade-off between an environment where a Java mobile code application is running and requirements for the application. In particular, we focus on the security-related problems that originate in low-level security policy of the code-centric style of the access control in Java runtime. As the result of this method, we get feasible requirements with respect to security issues of mobile codes. This method will help requirements analysts to compromise the differences between customers' goals and realizable solutions. Customers will agree to the results of the analysis by this method because they can clearly trace the reasons why some goals are achieved but others are not. We can clarify which functions can be performed under the environment systematically. We also clarify which functions in mobile codes are needed so as to meet the goals of users by goal oriented requirements analysis(GORA). By comparing functions derived from the environment and functions from the goals, we can find conflicts between the environments and the goals, and also find vagueness of the requirements. By resolving the conflicts and by clarifying the vagueness, we can develop bases for the requirements specification.

  • Performance of Chaos and Burst Noises Injected to the Hopfield NN for Quadratic Assignment Problems

    Yoko UWATE  Yoshifumi NISHIO  Tetsushi UETA  Tohru KAWABE  Tohru IKEGUCHI  

     
    PAPER-Neural Networks and Bioengineering

      Vol:
    E87-A No:4
      Page(s):
    937-943

    In this paper, performance of chaos and burst noises injected to the Hopfield Neural Network for quadratic assignment problems is investigated. For the evaluation of the noises, two methods to appreciate finding a lot of nearly optimal solutions are proposed. By computer simulations, it is confirmed that the burst noise generated by the Gilbert model with a laminar part and a burst part achieved the good performance as the intermittency chaos noise near the three-periodic window.

  • Normalization of Time-Derivative Parameters for Robust Speech Recognition in Small Devices

    Yasunari OBUCHI  Nobuo HATAOKA  Richard M. STERN  

     
    PAPER-Speech and Hearing

      Vol:
    E87-D No:4
      Page(s):
    1004-1011

    In this paper we describe a new framework of feature compensation for robust speech recognition, which is suitable especially for small devices. We introduce Delta-cepstrum Normalization (DCN) that normalizes not only cepstral coefficients, but also their time-derivatives. Cepstral Mean Normalization (CMN) and Mean and Variance Normalization (MVN) are fast and efficient algorithms of environmental adaptation, and have been used widely. In those algorithms, normalization was applied to cepstral coefficients to reduce the irrelevant information from them, but such a normalization was not applied to time-derivative parameters because the reduction of the irrelevant information was not enough. However, Histogram Equalization (HEQ) provides better compensation and can be applied even to the delta and delta-delta cepstra. We investigate various implementation of DCN, and show that we can achieve the best performance when the normalization of the cepstra and the delta cepstra can be mutually interdependent. We evaluate the performance of DCN using speech data recorded by a PDA. DCN provides significant improvements compared to HEQ. It is shown that DCN gives 15% relative word error rate reduction from HEQ. We also examine the possibility of combining Vector Taylor Series (VTS) and DCN. Even though some combinations do not improve the performance of VTS, it is shown that the best combination gives the better performance than VTS alone. Finally, the advantage of DCN in terms of the computation speed is also discussed.

  • Electric-Energy Generation through Variable-Capacitive Resonator for Power-Free LSI

    Masayuki MIYAZAKI  Hidetoshi TANAKA  Goichi ONO  Tomohiro NAGANO  Norio OHKUBO  Takayuki KAWAHARA  

     
    PAPER

      Vol:
    E87-C No:4
      Page(s):
    549-555

    A vibration-to-electric energy converter as a power generator through a variable-resonating capacitor is theoretically and experimentally demonstrated as a potential on-chip battery. The converter is constructed from three components: a mechanical-variable capacitor, a charge-transporter circuit and a timing-capture control circuit. An optimum design methodology is theoretically described to maximize the efficiency of the vibration-to-electric energy conversion. The energy-conversion efficiency is analyzed based on the following three factors: the mechanical-energy to electric-energy conversion loss, the parasitic elements loss in the charge-transporter circuit and the timing error in the timing-capture circuit. Through the mechanical-energy conversion analysis, the optimum condition for the resonance is found. The parasitic elements in the charge-transporter circuit and the timing management of the capture circuit dominate the output energy efficiency. These analyses enable the optimum design of the energy-conversion system. The converter is fabricated experimentally. The practical measured power is 0.12 µW, and the conversion efficiency is 21%. This efficiency is calculated from a 43% mechanical-energy conversion loss and a 63% charge-transportation loss. The timing-capture circuit is manually controlled in this experiment, so that the timing error is not considered in the efficiency. From our result, a new system LSI application with an embedded power source can be explored for the ubiquitous computing world.

  • A Robust Blind Image Watermarking Scheme Based on Vector Quantization

    Soo-Chang PEI  Jun-Horng CHEN  

     
    PAPER-Image

      Vol:
    E87-A No:4
      Page(s):
    912-919

    Watermarking schemes have been extensively discussed and developed recently. People are usually facing the dilemma of two factors, robustness and transparency. To achieve these requirements, embedding the watermark message in the transform domain or the spatial domain is usually considered. In this paper, we will propose a blind image watermarking scheme based on vector quantization. By exploiting a modified binary tree splitting method, a stable codebook could be generated so that the watermark message could be novelly embedded and survive the JPEG compression and the Gaussian noise addition. The embedded message could be extracted without referring the host image. It makes the scheme more practical.

  • Generation of Various Types of Spatio-Temporal Phenomena in Two-Layer Cellular Neural Networks

    Zonghuang YANG  Yoshifumi NISHIO  Akio USHIDA  

     
    PAPER-Nonlinear Problems

      Vol:
    E87-A No:4
      Page(s):
    864-871

    The paper discusses the spatio-temporal phenomena in autonomous two-layer Cellular Neural Networks (CNNs) with mutually coupled templates between two layers. By computer calculations, we show how pattern formations, autowaves and classical waves can be regenerated in the networks, and describe the properties of these phenomena in detail. In particular, we focus our discussion on the necessary conditions for generating these spatio-temporal phenomena. In addition, the influences of the template parameters and initial state conditions of CNNs on the spatio-temporal phenomena are investigated.

  • An Initial Solution Algorithm for Globally Convergent Homotopy Methods

    Yasuaki INOUE  Saeko KUSANOBU  Kiyotaka YAMAMURA  Makoto ANDO  

     
    PAPER

      Vol:
    E87-A No:4
      Page(s):
    780-786

    Finding DC operating points of transistor circuits is an important and difficult task. The Newton-Raphson method adopted in SPICE-like simulators often fails to converge to a solution. To overcome this convergence problem, homotopy methods have been studied from various viewpoints. For efficiency of globally convergent homotopy methods, it is important to give an appropriate initial solution as a starting point. However, there are few studies concerning such initial solution algorithms. In this paper, initial solution problems in homotopy methods are discussed, and an effective initial solution algorithm is proposed for globally convergent homotopy methods, which finds DC operating points of transistor circuits efficiently. Numerical examples using practical transistor circuits show the effectiveness of the proposed algorithm.

  • A Noise-Shaping Algorithm of Multi-bit DAC Nonlinearities in Complex Bandpass ΔΣAD Modulators

    Hao SAN  Haruo KOBAYASHI  Shinya KAWAKAMI  Nobuyuki KUROIWA  

     
    PAPER

      Vol:
    E87-A No:4
      Page(s):
    792-800

    This paper presents a technique for improving the SNR and resolution of complex bandpass ΔΣADCs which are used for wireless communication systems such as cellular phone, wireless LAN and Bluetooth. Oversampling and noise-shaping are used to achieve high accuracy of a ΔΣAD modulator. However when a multi-bit internal DAC is used inside a modulator, nonlinearities of the DAC are not noise-shaped and the SNR of the ΔΣADC degrades. For the conversion of complex intermediate frequency (IF) input signals, a complex bandpass ΔΣAD modulator can provide superior performance to a pair of real bandpass ΔΣAD modulators of the same order. This paper proposes a new noise-shaping algorithm--implemented by adding simple digital circuitry--to reduce the effects of nonlinearities in multi-bit DACs of complex bandpass ΔΣAD modulators. We have performed simulation with MATLAB to verify the effectiveness of the algorithm, and the results show that the proposed algorithm can improve the SNR of a complex bandpass ΔΣADC with nonlinear internal multi-bit DACs.

  • A Novel Wold Decomposition Algorithm for Extracting Deterministic Features from Texture Images: With Comparison

    Taoi HSU  Wen-Liang HWANG  Jiann-Ling KUO  Der-Kuo TUNG  

     
    PAPER-Image

      Vol:
    E87-A No:4
      Page(s):
    892-902

    In this paper, a novel Wold decomposition algorithm is proposed to address the issue of deterministic component extraction for texture images. This algorithm exploits the wavelet-based singularity detection theory to process both harmonic a nd evanescent features from frequency domain. This exploitation is based on the 2D Lebesgue decomposition theory. When applying multiresolution analysis techniq ue to the power spectrum density (PSD) of a regular homogeneous random field, its indeterministic component will be effectively smoothed, and its deterministic component will remain dominant at coarse scale. By means of propagating these positions to the finest scale, the deterministic component can be properly extracted. From experiment, the proposed algorithm can obtain results that satisfactorily ensure its robustness and efficiency.

  • Unsupervised Polarimetric SAR Image Classification

    Junyi XU  Jian YANG  Yingning PENG  Chao WANG  

     
    LETTER-Sensing

      Vol:
    E87-B No:4
      Page(s):
    1048-1052

    In this letter, the concept of cross-entropy is introduced for unsupervised polarimetric synthetic aperture radar (SAR) image classification. The difference between two scatterers is decomposed into three parts, i.e., the difference of average scattering characteristic, the difference of scattering randomness and the difference of scattering matrix span. All these three parts are expressed in cross-entropy formats. The minimum cross-entropy principle is adopted to make classification decision. It works well in unsupervised terrain classification with a NASA/JPL AIRSAR image.

  • Instruction-Level Power Estimation Method by Considering Hamming Distance of Registers

    Akihiko HIGUCHI  Kazutoshi KOBAYASHI  Hidetoshi ONODERA  

     
    PAPER

      Vol:
    E87-A No:4
      Page(s):
    823-829

    This paper proposes an instruction-level power estimation method for an embedded RISC processor, the power consumption of which fluctuates so much by applications and input data. The proposed method estimates the power consumption from the result of ISS (Instruction Set Simulator) and energy tables according to Hamming Distance of Registers (HDR) of all instructions. It is over 105 times faster than the gate-level detailed logic simulation, while the estimated power curves have the same tendency with those from the logic simulation. The proposed method realizes both accurate and fast power estimation of embedded processors.

  • An Efficient Error Correction Scheme Allowing Backward Compatibility with JPEG2000 Codestream

    Masayuki KUROSAKI  Hitoshi KIYA  

     
    PAPER

      Vol:
    E87-A No:4
      Page(s):
    816-822

    A scheme of error correction for JPEG2000 codestream is proposed in this paper. The scheme uses a forward error correction code (FEC) and a data hiding technique. The headers and the higher quality layers of the codestream are coded using FEC codes. Then the parity data are separated from the FEC-coded data and hidden in the JPEG2000 codestream. The hidden data are used for error correction at the decoder. Several error correction codes with different strength are selected for the main header, the tile-part headers, the packet headers, and the bodies. The codestream generated by the proposed scheme has backward compatibility with a standard JPEG2000 codestream. Thus, it can be decoded with a general decoder. Simulation results demonstrated the effectiveness of the proposed scheme.

  • Shrinking Alternating Two-Pushdown Automata

    Friedrich OTTO  Etsuro MORIYA  

     
    PAPER-Automata and Formal Language Theory

      Vol:
    E87-D No:4
      Page(s):
    959-966

    The alternating variant of the shrinking two-pushdown automaton of Buntrock and Otto (1998) is introduced. It is shown that the class of languages accepted by these automata is contained in the class of deterministic context-sensitive languages, and that it contains a PSPACE-complete language. Hence, the closure of this class of languages under log-space reductions coincides with the complexity class PSPACE.

20361-20380hit(30728hit)