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

Keyword Search Result

[Keyword] SI(16314hit)

7621-7640hit(16314hit)

  • Sensitivity Analysis and Optimization Algorithm --- Based on Nonlinear Programming ---

    Masayoshi ODA  Yoshihiro YAMAGAMI  Junji KAWATA  Yoshifumi NISHIO  Akio USHIDA  

     
    PAPER-Analysis, Modelng and Simulation

      Vol:
    E91-A No:9
      Page(s):
    2426-2434

    We propose here a fully Spice-oriented design algorithm of op-amps for attaining the maximum gains under low power consumptions and assigned slew-rates. Our optimization algorithm is based on a well-known steepest descent method combining with nonlinear programming. The algorithm is realized by equivalent RC circuits with ABMs (analog behavior models) of Spice. The gradient direction is decided by the analysis of sensitivity circuits. The optimum parameters can be found at the equilibrium point in the transient response of the RC circuit. Although the optimization time is much faster than the other design tools, the results might be rough because of the simple transistor models. If much better parameter values are required, they can be improved with Spice simulator and/or other tools.

  • Downlink Transmission Scheme for Wireless MIMO Broadcast Channels with Multiuser Diversity

    Hao LI  Changqing XU  Pingzhi FAN  

     
    PAPER-Communication Theory and Signals

      Vol:
    E91-A No:8
      Page(s):
    2174-2182

    Sum power iterative water-filling (SPIWF) algorithm provides sum-rate-optimal transmission scheme for wireless multiple-input multiple-output (MIMO) broadcast channels (BC), whereas it suffers from its high complexity. In this paper, we propose a new transmission scheme based on a novel block zero-forcing dirty paper coding (Block ZF-DPC) strategy and multiuser-diversity-achieving user selection procedure. The Block ZF-DPC can be considered as an extension of existing ZF-DPC into MIMO BCs. Two user selection algorithms having linear increasing complexity with the number of users have been proposed. One aims at maximizing the achievable sum rate directly and the other is based on Gram-Schmidt Orthogonalization (GSO) and Frobenius norm. The proposed scheme is shown to achieve a sum rate close to the sum capacity of MIMO BC and obtain optimal multiplexing and multiuser diversity gain. In addition, we also show that both selection algorithms achieve a significant part of the sum rate of the optimal greedy selection algorithm at low computation expenditure.

  • Combined Self-Test of Analog Portion and ADCs in Integrated Mixed-Signal Circuits

    Geng HU  Hong WANG  Shiyuan YANG  

     
    PAPER-Dependable Computing

      Vol:
    E91-D No:8
      Page(s):
    2134-2140

    Testing is a critical stage in integrated circuits production in order to guarantee reliability. The complexity and high integration level of mixed-signal ICs has put forward new challenges to circuit testing. This paper describes an oscillation-based combined self-test strategy for the analog portion and analog-to-digital converters (ADCs) in integrated mixed-signal circuits. In test mode, the analog portion under test is reconfigured into an oscillator, generating periodic signals as the test stimulus of ADC. By analyzing the A/D conversion results, a histogram test of ADC can be performed, and the oscillation frequency as well as amplitude can be checked, and in this way the oscillation test of the analog portion is realized simultaneously. For an analog benchmark circuit combined with an ADC, triangle oscillation and sinusoid oscillation schemes are both given to test their faults. Experimental results show that fault coverage of the analog portion is 92.2% and 94.3% in the two schemes respectively, and faults in the ADC can also be tested.

  • A New Blind Adaptive Array Antenna Based on CMA Criteria for M-Ary/SS Signals Suitable for Software Defined Radio Architecture

    Miho KOZUMA  Atsushi SASAKI  Yukihiro KAMIYA  Takeo FUJII  Kenta UMEBAYASHI  Yasuo SUZUKI  

     
    PAPER

      Vol:
    E91-A No:8
      Page(s):
    1982-1989

    M-ary/SS is a version of Direct Sequence/Spread Spectrum (DS/SS) aiming to improve the spectral efficiency employing orthogonal codes. However, due to the auto-correlation property of the orthogonal codes, it is impossible to detect the symbol timing by observing correlator outputs. Therefore, conventionally, a preamble has been inserted in M-ary/SS signals. In this paper, we propose a new blind adaptive array antenna for M-ary/SS systems that combines signals over the space axis without any preambles. It is surely an innovative approach for M-ary/SS. The performance is investigated through computer simulations.

  • Time-Resolved Spectroscopic Temperature Measurement of Break Arcs in a D.C.42 V Resistive Circuit

    Junya SEKIKAWA  Naoki MORIYAMA  Takayoshi KUBONO  

     
    PAPER-Arc Discharge & Related Phenomena

      Vol:
    E91-C No:8
      Page(s):
    1268-1272

    In a D.C.42 V-10A resistive circuit, break arcs are generated between electrical contact pairs. The materials of the contact pairs are Ag, Ag/C 2wt%, Ag/SnO2 12wt%, and Ag/ZnO 12wt%. The arc spectral intensities are measured by a time-resolved spectroscopic temperature measurement system. The arc temperature is calculated from the spectral intensities by using the method of relative intensities of two spectra. The experimental results are as follows. The arc temperature gradually decreases with increase of the gap of electrical contacts. The ranges of arc temperature for Ag, Ag/C 2wt%, Ag/SnO2 12wt%, and Ag/ZnO 12wt% contacts pairs are 4500-11000 K, 4000-6000 K, 4000-7000 K, and 4000-11000 K, respectively.

  • Locally Adaptive Perceptual Compression for Color Images

    Kuo-Cheng LIU  Chun-Hsien CHOU  

     
    PAPER-Image

      Vol:
    E91-A No:8
      Page(s):
    2213-2222

    The main idea in perceptual image compression is to remove the perceptual redundancy for representing images at the lowest possible bit rate without introducing perceivable distortion. A certain amount of perceptual redundancy is inherent in the color image since human eyes are not perfect sensors for discriminating small differences in color signals. Effectively exploiting the perceptual redundancy will help to improve the coding efficiency of compressing color images. In this paper, a locally adaptive perceptual compression scheme for color images is proposed. The scheme is based on the design of an adaptive quantizer for compressing color images with the nearly lossless visual quality at a low bit rate. An effective way to achieve the nearly lossless visual quality is to shape the quantization error as a part of perceptual redundancy while compressing color images. This method is to control the adaptive quantization stage by the perceptual redundancy of the color image. In this paper, the perceptual redundancy in the form of the noise detection threshold associated with each coefficient in each subband of three color components of the color image is derived based on the finding of perceptually indistinguishable regions of color stimuli in the uniform color space and various masking effects of human visual perception. The quantizer step size for the target coefficient in each color component is adaptively adjusted by the associated noise detection threshold to make sure that the resulting quantization error is not perceivable. Simulation results show that the compression performance of the proposed scheme using the adaptively coefficient-wise quantization is better than that using the band-wise quantization. The nearly lossless visual quality of the reconstructed image can be achieved by the proposed scheme at lower entropy.

  • A Single Input Change Test Pattern Generator for Sequential Circuits

    Feng LIANG  ShaoChong LEI  ZhiBiao SHAO  

     
    PAPER-Semiconductor Materials and Devices

      Vol:
    E91-C No:8
      Page(s):
    1365-1370

    An optimized Built-In Self-Test technology is proposed in this paper. A simplified algebraic model is developed to represent the configurations of single input change circuits. A novel single input change sequence generation technique is designed. It consists of a modified scan shift register, a seed storage array and a series of XOR gates. This circuitry can automatically generate single input change sequences of more unique vectors. Experimental results based on the ISCAS-89 benchmark show that the proposed method can achieve high stuck-at fault coverage with low switching activity during test applications.

  • Initial Codebook Algorithm of Vector Quantizaton

    ShanXue CHEN  FangWei LI  WeiLe ZHU  TianQi ZHANG  

     
    LETTER-Algorithm Theory

      Vol:
    E91-D No:8
      Page(s):
    2189-2191

    A simple and successful design of initial codebook of vector quantization (VQ) is presented. For existing initial codebook algorithms, such as random method, the initial codebook is strongly influenced by selection of initial codewords and difficult to match with the features of the training vectors. In the proposed method, training vectors are sorted according to the norm of training vectors. Then, the ordered vectors are partitioned into N groups where N is the size of codebook. The initial codewords are obtained from calculating the centroid of each group. This initializtion method has a robust performance and can be combined with the VQ algorithm to further improve the quality of codebook.

  • A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches

    Koji KOBAYASHI  Shuichi MIYAZAKI  Yasuo OKABE  

     
    PAPER-Computation and Computational Models

      Vol:
    E91-D No:8
      Page(s):
    2105-2114

    The online buffer management problem formulates the problem of queueing policies of network switches supporting QoS (Quality of Service) guarantee. For this problem, several models are considered.In this paper, we focus on shared memory switches with preemption. We prove that the competitive ratio of the Longest Queue Drop (LQD) policy is (4M-4)/(3M-2) in the case of N=2, where N is the number of output ports in a switch and M is the size of the buffer.This matches the lower bound given by Hahne, Kesselman and Mansour.Also, in the case of arbitrary N, we improve the competitive ratio of LQD from 2 to 2 - (1/M) minK = 1, 2, ..., N{M/K + K - 1}.

  • A Study on Contact Spots of Earthquake Disaster Prevention Relays

    Yoshitada WATANABE  Yuichi HIRAKAWA  

     
    PAPER-Contact Phenomena

      Vol:
    E91-C No:8
      Page(s):
    1211-1214

    This paper reports on the effect of switching action on the contact surfaces of earthquake disaster prevention relays. Large-scale earthquakes occur frequently in Japan and bring extensive damage with them, and fire caused by electrical equipments is one example of the serious damage which can occur. Earthquake sensors capable of maintaining a high level of reliability when earthquakes occur play an important role as a means of minimizing this damage. For this reason, we carried out observations by focusing on samples which had either been subjected to an electric current of 10 mA or 0.1 A. The samples of 10 mA exhibited low and constant contact resistance despite the addition of seismic motion, while the samples of 0.1 A samples exhibited varying contact resistance and damage on their contact spots resulting from the addition of seismic motion. The sample surfaces were then observed using an atomic force microscope (AFM) in tapping mode and a surface potential microscope (SPoM). As a result, we found that even the unused earthquake disaster prevention relay (standard sample) which had a surface lined with asperities on its parallel striations formed by irregular protrusions due to dust and other deposits. In addition, scanning the contact surface with the SPoM at the same potential revealed the occurrence of differences in surface potential which varied in response to the asperities on the striations.

  • Outage Performance and Average Symbol Error Rate of M-QAM for Maximum Ratio Combining with Multiple Interferers

    Kyung Seung AHN  

     
    PAPER-Communication Theory and Signals

      Vol:
    E91-A No:8
      Page(s):
    2205-2212

    In this paper, we investigate the performance of maximum ratio combining (MRC) in the presence of multiple cochannel interferences over a flat Rayleigh fading channel. Closed-form expressions of signal-to-interference-plus-noise ratio (SINR), outage probability, and average symbol error rate (SER) of quadrature amplitude modulation (QAM) with M-ary signaling are obtained for unequal-power interference-to-noise ratio (INR). We also provide an upper-bound for the average SER using moment generating function (MGF) of the SINR. Moreover, we quantify the array gain loss between pure MRC (MRC system in the absence of CCI) and MRC system in the presence of CCI. Finally, we verify our analytical results by numerical simulations.

  • High Resolution DOA Estimation Using Unwrapped Phase Information of MUSIC-Based Noise Subspace

    Koichi ICHIGE  Kazuhiko SAITO  Hiroyuki ARAI  

     
    PAPER

      Vol:
    E91-A No:8
      Page(s):
    1990-1999

    This paper presents a high resolution Direction-Of-Arrival (DOA) estimation method using unwrapped phase information of MUSIC-based noise subspace. Superresolution DOA estimation methods such as MUSIC, Root-MUSIC and ESPRIT methods are paid great attention because of their brilliant properties in estimating DOAs of incident signals. Those methods achieve high accuracy in estimating DOAs in a good propagation environment, but would fail to estimate DOAs in severe environments like low Signal-to-Noise Ratio (SNR), small number of snapshots, or when incident waves are coming from close angles. In MUSIC method, its spectrum is calculated based on the absolute value of the inner product between array response and noise eigenvectors, means that MUSIC employs only the amplitude characteristics and does not use any phase characteristics. Recalling that phase characteristics plays an important role in signal and image processing, we expect that DOA estimation accuracy could be further improved using phase information in addition to MUSIC spectrum. This paper develops a procedure to obtain an accurate spectrum for DOA estimation using unwrapped and differentiated phase information of MUSIC-based noise subspace. Performance of the proposed method is evaluated through computer simulation in comparison with some conventional estimation methods.

  • On Bit Rate Reduction of Inter-Channel Communication for a Binaural Hearing Assistance System

    Yoshifumi CHISAKI  Ryouji KAWANO  Tsuyoshi USAGAWA  

     
    LETTER

      Vol:
    E91-A No:8
      Page(s):
    2041-2044

    A binaural hearing assistance system based on the frequency domain binaural model has been previously proposed. The system can enhance a signal coming from a specific direction. Since the system utilizes a binaural signal, an inter-channel communication between left and right subsystems is required. The bit rate reduction in inter-channel communication is essential for the detachment of the headset from the processing system. In this paper, the performance of a system which uses a differential pulse code modulation codec is examined and the relationship between the bit rate and sound quality is discussed.

  • POCS-Based Annotation Method Using Kernel PCA for Semantic Image Retrieval

    Takahiro OGAWA  Miki HASEYAMA  

     
    PAPER

      Vol:
    E91-A No:8
      Page(s):
    1915-1923

    A projection onto convex sets (POCS)-based annotation method for semantic image retrieval is presented in this paper. Utilizing database images previously annotated by keywords, the proposed method estimates unknown semantic features of a query image from its known visual features based on a POCS algorithm, which includes two novel approaches. First, the proposed method semantically assigns database images some clusters and introduces a nonlinear eigenspace of visual and semantic features in each cluster into the constraint of the POCS algorithm. This approach accurately provides semantic features for each cluster by using its visual features in the least squares sense. Furthermore, the proposed method monitors the error converged by the POCS algorithm in order to select the optimal cluster including the query image. By introducing the above two approaches into the POCS algorithm, the unknown semantic features of the query image are successfully estimated from its known visual features. Consequently, similar images can be easily retrieved from the database based on the obtained semantic features. Experimental results verify the effectiveness of the proposed method for semantic image retrieval.

  • A Passive 3D Face Recognition System and Its Performance Evaluation

    Akihiro HAYASAKA  Takuma SHIBAHARA  Koichi ITO  Takafumi AOKI  Hiroshi NAKAJIMA  Koji KOBAYASHI  

     
    PAPER

      Vol:
    E91-A No:8
      Page(s):
    1974-1981

    This paper proposes a three-dimensional (3D) face recognition system using passive stereo vision. So far, the reported 3D face recognition techniques have used active 3D measurement methods to capture high-quality 3D facial information. However, active methods employ structured illumination (structure projection, phase shift, moire topography, etc.) or laser scanning, which is not desirable in many human recognition applications. Addressing this problem, we propose a face recognition system that uses (i) passive stereo vision to capture 3D facial information and (ii) 3D matching using an ICP (Iterative Closest Point) algorithm with its improvement techniques. Experimental evaluation demonstrates efficient recognition performance of the proposed system compared with an active 3D face recognition system and a passive 3D face recognition system employing the original ICP algorithm.

  • Novel Conventional Standard Linear Element Based Complete Passive Equivalent Circuit Models of the Practical OTA-Based Inductors

    Rawid BANCHUIN  Boonruk CHIPIPOP  Boonchareon SIRINAOVAKUL  

     
    PAPER

      Vol:
    E91-A No:8
      Page(s):
    1883-1889

    In this research, the practical OTA-based inductors of all structures have been studied and their complete passive equivalent circuit models, where the effects of both parasitic elements and finite opened-loop bandwidth have been taken into account, also contain only the conventional standard linear elements i.e. the ordinary resistor, inductor and capacitor, without any infeasible high order element e.g. super inductor etc., have been proposed. The resulting models have been found to be excellently accurate, excellently straight forward, far superior to the previously proposed ones and completely realizable by the passive elements. Hence, the proposed passive equivalent circuit models have been found to be the convenience and versatile tools for the implementation of any analog and mixed signal processing circuits and systems.

  • Global Signal Elimination and Local Signals Enhancement from EM Radiation Waves Using Independent Component Analysis

    Motoaki MOURI  Arao FUNASE  Andrzej CICHOCKI  Ichi TAKUMI  Hiroshi YASUKAWA  Masayasu HATA  

     
    PAPER

      Vol:
    E91-A No:8
      Page(s):
    1875-1882

    Anomalous environmental electromagnetic (EM) radiation waves have been reported as the portents of earthquakes. Our study's goal is predicting earthquakes using EM radiation waves by detecting some anomalies. We have been measuring the Extremely Low Frequency (ELF) range EM radiation waves all over Japan. However, the recorded data contain signals unrelated to earthquakes. These signals, as noise, confound earthquake prediction efforts. In this paper, we propose an efficient method of global signal elimination and enhancement local signals using Independent Component Analysis (ICA). We evaluated the effectiveness of this method.

  • Performance Tradeoff in Multiuser Equalization for CDMA over Flat Channels

    Kok Ann Donny TEO  Shuichi OHNO  

     
    PAPER

      Vol:
    E91-A No:8
      Page(s):
    2008-2015

    We study the bit-error rate (BER) for different code lengths and number of users in CDMA system with linear minimum mean squared error (MMSE) and non-linear equalizations. We first show that for a fix channel and a fix number of users, BER of each symbol after linear equalization degrades with a decrease in the code length. Then, we prove that for a fix code length, the BER averaged over random channels improves with a decrease in the number of users. Furthermore, in the non-linear serial-interference cancellation (SIC) scheme, we prove analytically that the BER improves with each step of symbol cancellation for any channel not just at high signal-to-interference noise ratio (SINR) but at all range of SINR. Simulation results are presented to substantiate our theoretical findings.

  • Detection of Leak Location in a Pipeline by Acoustic Signal

    Umut YUNUS  Masaru TSUNASAKI  Yiwei HE  Masanobu Kominami   Katsumi YAMASHITA  

     
    PAPER-Engineering Acoustics

      Vol:
    E91-A No:8
      Page(s):
    2053-2061

    Gas or water leaks in pipes that are buried under ground or that are situated in the walls of buildings may occur due to aging or unpredictable accidents, such as earthquakes. Therefore, the detection of leaks in pipes is an important task and has been investigated extensively. In the present paper, we propose a novel leak detection method by means of acoustic wave. We inject an acoustic chirp signal into a target pipeline and then estimate the leak location from the delay time of the compressed pulse by passing the reflected signal through a correlator. In order to distinguish a leak reflection in a complicated pipeline arrangement, the reflection characteristics of leaks are carefully discussed by numerical simulations and experiments. There is a remarkable difference in the reflection characteristics between the leak and other types of discontinuity, and the property can be utilized to distinguish the leak reflection. The experimental results show that, even in a complicated pipe arrangement including bends and branches, the proposed approach can successfully implement the leak detection. Furthermore, the proposed approach has low cost and is easy to implement because only a personal computer and some commonly equipment are required.

  • The O-Sequence:Representation of 3D-Dissection

    Hidenori OHTA  Toshinori YAMADA  Chikaaki KODAMA  Kunihiro FUJIYOSHI  

     
    PAPER-Algorithms and Data Structures

      Vol:
    E91-A No:8
      Page(s):
    2111-2119

    A 3D-dissection (A rectangular solid dissection) is a dissection of a rectangular solid into smaller rectangular solids by planes. In this paper, we propose an O-sequence, a string of representing any 3D-dissection which is dissected by only non-crossing rectangular planes. We also present a necessary and sufficient condition for a given string to be an O-sequence.

7621-7640hit(16314hit)