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

Keyword Search Result

[Keyword] tin(3578hit)

1941-1960hit(3578hit)

  • A New Infrastructure for Digital Pre-Filtering in Multi-bit Continuous Time Delta Sigma Modulators

    Hossein SHAMSI  Omid SHOAEI  

     
    LETTER-Electronic Circuits

      Vol:
    E89-C No:12
      Page(s):
    1954-1957

    In this paper a new approach for employing the digital signal processing capabilities in the design of the multi-bit continuous time (CT) Delta Sigma modulators (DSM's) is presented. It proposes the discrete time (DT) pre-filtering before the DAC for solving the known problems of the CT DSM's.

  • Evidences for Adsorption of Heptyl Viologen Cation Radicals in Thin Deposition Layers on ITO Electrodes by Slab Optical Waveguide Spectroscopy

    Yusuke AYATO  Akiko TAKATSU  Kenji KATO  Naoki MATSUDA  

     
    PAPER-Evaluation of Organic Materials

      Vol:
    E89-C No:12
      Page(s):
    1750-1754

    In situ observations were mainly performed by using slab optical waveguide (SOWG) spectroscopy synchronized with potential step measurements to investigate the time dependent spectral change of the adsorbed heptyl viologen cation radicals (HV+) in thin deposition layer on indium-tin-oxide (ITO) electrodes. Several absorption bands, which indicated a monomer and dimer of HV+ were co-adsorbed on ITO electrode surface with a monolayer or a few layers deposition, were observed in UV-visible region. The time dependent spectra yielded some important molecular information for the adsorption phenomena of HV+ on the electrode surface. All observed absorption bands disappeared completely when the electrode potential of -200 mV vs. Ag/AgCl was applied, which indicated the adsorbed HV+ species were electrochemically reoxidized on the ITO electrode.

  • Routing of Monotonic Parallel and Orthogonal Netlists for Single-Layer Ball Grid Array Packages

    Yoichi TOMIOKA  Atsushi TAKAHASHI  

     
    PAPER-Physical Design

      Vol:
    E89-A No:12
      Page(s):
    3551-3559

    Ball Grid Array packages in which I/O pins are arranged in a grid array pattern realize a number of connections between chips and PCB, but it takes much time in manual routing. So the demand for automation of package routing is increasing. In this paper, we give the necessary and sufficient condition that all nets can be connected by monotonic routes when a net consists of a finger and a ball and fingers are on the two parallel boundaries of the Ball Grid Array package, and propose a monotonic routing method based on this condition. Moreover, we give a necessary condition and a sufficient condition when fingers are on the two orthogonal boundaries, and propose a monotonic routing method based on the necessary condition.

  • Adaptive Noise Estimation Using Least-Squares Line in Wavelet Packet Transform Domain

    Sung-il JUNG  Younghun KWON  Sung-il YANG  

     
    LETTER-Speech and Hearing

      Vol:
    E89-D No:12
      Page(s):
    3002-3005

    In this letter, we suggest a noise estimation method which can be applied for speech enhancement in various noise environments. The proposed method consists of the following two main processes to analyze and estimate efficiently the noise from the noisy speech. First, a least-squares line is used, which is obtained by applying coefficient magnitudes in node with a uniform wavelet packet transform to a least squares method. Next, a differential forgetting factor and a correlation coefficient per subband are applied, where each subband consists of several nodes with the uniform wavelet packet transform. In particular, this approach has the ability to update noise estimation by using the estimated noise at the previous frame only instead of employing the statistical information of long past frames and explicit nonspeech frames detection consisted of noise signals. In objective assessments, we observed that the performance of the proposed method was better than that of the compared methods. Furthermore, our method showed a reliable result even at low SNR.

  • Recognizing and Analyzing of User's Continuous Action in Mobile Systems

    Jonghun BAEK  Ik-Jin JANG  Byoung-Ju YUN  

     
    PAPER-Human-computer Interaction

      Vol:
    E89-D No:12
      Page(s):
    2957-2963

    As a result of the growth of sensor-enabled mobile devices, in recent years, users can utilize diverse digital contents everywhere and anytime. However, the interfaces of mobile applications are often unnatural due to limited computational capability, miniaturized input/output controls, and so on. To complement the poor user interface (UI) and fully utilize mobility as feature of mobile devices, we explore possibilities for a new UI of mobile devices. This paper describes the method for recognizing and analyzing a user's continuous action including the user's various gestures and postures. The application example we created is mobile game called AM-Fishing game on mobile devices that employ the accelerometer as the main interaction modality. The demonstration shows the evaluation for the system usability.

  • The AMS Extension to System Level Design Language--SpecC

    Yu LIU  Satoshi KOMATSU  Masahiro FUJITA  

     
    PAPER-System Level Design

      Vol:
    E89-A No:12
      Page(s):
    3397-3407

    Recently, system level design languages (SLDLs), which can describe both hardware and software aspects of the design, are receiving attentions. Analog mixed-signal (AMS) extensions to SLDLs enable current discrete-oriented SLDLs to describe and simulate not only digital systems but also digital-analog mixed-signal systems. In this paper, we present our work on the AMS extension to one of the system level design language--SpecC. The extended language supports designer to describe all the analog, digital and software aspects in a universal language.

  • Molecular Ordering in Self-Organized Dye Particles--Near-Field and Polarized Evanescent-Field Fluorescence Study--

    Shinji KINOSHITA  Akihiro TOMIOKA  Atsushi FUJIMOTO  Yasuaki ITAKURA  

     
    PAPER-Evaluation of Organic Materials

      Vol:
    E89-C No:12
      Page(s):
    1735-1740

    Self-organized organic dye particles of micrometer and submicrometer size were prepared by utilizing a wetting/dewetting process of polar solvent on a hydrophilic glass substrate. The near-field scanning optical microscopy successfully identified near-field excited near-field fluorescence from single particles, however, the majority of the small particles with diameters around 2 µm or less did not show fluorescence under near-field observation. In contrast, far-field fluorescence, when excited by a polarized evanescent field, was observed, with the intensity depending on the excitation polarization, indicating that molecules' transition moment within dye particles was oriented parallel to the substrate surface. Single particle fluorescence spectrum consistently showed an identical sharp peak with a large redshift, indicating that the particles were composed of identical dye aggregates similar to J-aggregates. These observations suggest that the near-field at the probe tip was polarized parallel to the probe axis. Another observation, that molecules were oriented in a similar direction among adjacent particles, suggests that the dewetting process contributed to the alignment of the molecular orientation among adjacent particles, which further proves that the present specimen was formed by a self-organizing mechanism.

  • An Efficient and Effective Algorithm for Online Task Placement with I/O Communications in Partially Reconfigurable FPGAs

    Mitsuru TOMONO  Masaki NAKANISHI  Shigeru YAMASHITA  Kazuo NAKAJIMA  Katsumasa WATANABE  

     
    PAPER-System Level Design

      Vol:
    E89-A No:12
      Page(s):
    3416-3426

    In a partially reconfigurable FPGA of the future, arbitrary portions of its logic resources and interconnection networks will be reconfigured without affecting the other parts. Multiple tasks will be mapped and executed concurrently in such an FPGA. Efficient execution of the tasks using the limited resources of the FPGA will necessitate effective resource management. A number of online FPGA placement methods have recently been proposed for such an FPGA. However, they cannot handle I/O communications of the tasks. Taking such I/O communications into consideration, we introduce a new approach to online FPGA placement. We present an algorithm for placing each arriving task in an empty area so as to complete all the tasks efficiently. We develop two fitting strategies to effectively handle I/O communications of the tasks. Our experimental results show that properly weighted combinations of these and two other previously proposed strategies enable this algorithm to run very fast and make an effective placement of the tasks. In fact, we show that the overhead associated with the use of this algorithm is negligible as compared to the total execution time of the tasks.

  • Soft Counting Poisson Mixture Model-Based Polling Method for Speech/Nonspeech Classification

    Youngjoo SUH  Hoirin KIM  Minsoo HAHN  Yongju LEE  

     
    LETTER-Speech and Hearing

      Vol:
    E89-D No:12
      Page(s):
    2994-2997

    In this letter, a new segment-level speech/nonspeech classification method based on the Poisson polling technique is proposed. The proposed method makes two modifications from the baseline Poisson polling method to further improve the classification accuracy. One of them is to employ Poisson mixture models to more accurately represent various segmental patterns of the observed frequencies for frame-level input features. The other is the soft counting-based frequency estimation to improve the reliability of the observed frequencies. The effectiveness of the proposed method is confirmed by the experimental results showing the maximum error reduction of 39% compared to the segmentally accumulated log-likelihood ratio-based method.

  • Perceptually Transparent Polyline Watermarking Based on Normal Multi-Resolution Representation

    Yu-Chi PU  Wei-Chang DU  I-Chang JOU  

     
    PAPER-Application Information Security

      Vol:
    E89-D No:12
      Page(s):
    2939-2949

    Digital watermarking techniques were developed for regular raster data such as images or video, but little research addressed irregular vector data, such as the shapes of cartoons or elevation contours. Vector graphic images, such as those in SVG format, are popular on the WWW, and provide the advantage of permitting affine transformations without aliasing. The creation of cartoon images or the acquisition of GIS geometry data involves much work, so the copyright and ownership of vector data must be protected. Common components in vector graphic images are polygonal lines or polylines. This work develops a normal multi-resolution representation of a polygonal line, and embeds a copyright notice or serial number in this representation. Previous studies on polyline watermarking have the non-transparent problems, including self-intersection of line segments. The experimental results demonstrate that the proposed watermarking approach is perceptually transparent, and solves the self-intersection problem. It is also resistant to similarity transformation, traversal reordering, point insertion/deletion and random noise attacks.

  • LSI Design Flow for Shot Reduction of Character Projection Electron Beam Direct Writing Using Combined Cell Stencil

    Taisuke KAZAMA  Makoto IKEDA  Kunihiro ASADA  

     
    PAPER-Physical Design

      Vol:
    E89-A No:12
      Page(s):
    3546-3550

    We propose a shot reduction technique of character projection (CP) Electron Beam Direct Writing (EBDW) using combined cell stencil (CCS) or the advanced process technology. CP EBDW is expected both to reduce mask costs and to realize quick turn around time. One of major issue of the conventional CP EBDW, however, is a throughput of lithography. The throughput is determined by numbers of shots, which are proportional to numbers of cell instances in LSIs. The conventional shot reduction techniques focus on optimization of cell stencil extraction, without any modifications on designed LSI mask patterns. The proposed technique employs the proposed combined cell stencil, with proposed modified design flow, for further shot reduction. We demonstrate 22.4% shot reduction within 4.3% area increase for a microprocessor and 28.6% shot reduction for IWLS benchmarks compared with the conventional technique.

  • Mechanism of Humanoid Robot Arm with 7 DOFs Having Pneumatic Actuators

    Kiyoshi HOSHINO  Ichiro KAWABUCHI  

     
    PAPER-Systems and Control

      Vol:
    E89-A No:11
      Page(s):
    3290-3297

    Pneumatic pressure, which is easy enough to be handled in comparison with hydraulic pressure and is endowed with high safety, is available for a power source of a robot arm to be utilized in concert with human beings to do various types of work. But pneumatic pressure is so low in comparison with hydraulic pressure that an air cylinder having a diameter long enough and stroke wide enough is required to obtain great output power. In this study, therefore, the investigation was made with layout of air cylinders and transmission mechanisms of the motion power directed toward the driving joints to be followed by development of a new humanoid robot arm with seven degrees of freedom in which air cylinders are compactly incorporated. To be concrete with this, contrivance was made with an endoskeleton structure allowing almost all of the structure materials of the individual arm joints to be shared by the air cylinder with incorporation of the air cylinder in the axes of the upper arm joint and forearm joints by paying attention to the fact that the cylinder itself has high strength. The evaluation experiments driving the robot arm referred to above were conducted by means of I-PD control. The results suggested that the mechanism of the robot with seven degrees of freedom having pneumatic actuators proposed in this study is useful as the humanoid robot arm. The quick and accurate motions were accomplished with I-PD control which is relatively easy to be dealt with but not suitable for non-linear actuator system.

  • A SPICE-Oriented Method for Finding DC Operating Points of Nonlinear Circuits Containing Piecewise-Linear Macromodels

    Wataru KUROKI  Kiyotaka YAMAMURA  

     
    PAPER-Nonlinear Problems

      Vol:
    E89-A No:11
      Page(s):
    3306-3312

    Recently, efficient algorithms have been proposed for finding all characteristic curves of one-port piecewise-linear (PWL) resistive circuits. Using these algorithms, a middle scale one-port circuit can be represented by a PWL resistor that is neither voltage nor current controlled. By modeling often used one-port subcircuits by such resistors (macromodels), large scale circuits can be analyzed efficiently. In this paper, an efficient method is proposed for finding DC operating points of nonlinear circuits containing such neither voltage nor current controlled resistors using the SPICE-oriented approach. The proposed method can be easily implemented on SPICE without programming.

  • Mining Frequent Patterns Securely in Distributed System

    Jiahong WANG  Takuya FUKASAWA  Shintaro URABE  Toyoo TAKATA  Masatoshi MIYAZAKI  

     
    PAPER-Data Mining

      Vol:
    E89-D No:11
      Page(s):
    2739-2747

    Data mining across different companies, organizations, online shops, or the likes is necessary so as to discover valuable shared patterns, associations, trends, or dependencies in their shared data. Privacy, however, is a concern. In many situations it is required that data mining should be conducted without any privacy being violated. In response to this requirement, in this paper we propose an effective distributed privacy-preserving data mining approach called SDDM. SDDM is characterized by its ability to resist collusion. Unless the number of colluding sites in a distributed system is larger than or equal to 4, privacy cannot be violated. Results of performance study demonstrated the effectiveness of SDDM.

  • An Efficient Homotopy Method That Can Be Easily Implemented on SPICE

    Wataru KUROKI  Kiyotaka YAMAMURA  

     
    PAPER-VLSI Design Technology and CAD

      Vol:
    E89-A No:11
      Page(s):
    3320-3326

    Recently, an efficient homotopy method termed the variable gain Newton homotopy (VGNH) method has been proposed for finding DC operating points of nonlinear circuits. This method is not only very efficient but also globally convergent for any initial point. However, the programming of sophisticated homotopy methods is often difficult for non-experts or beginners. In this paper, we propose an effective method for implementing the VGNH method on SPICE. By this method, we can implement a "sophisticated VGNH method with various efficient techniques" "easily" "without programming," "although we do not know the homotopy method well."

  • A Cost Effective Interconnection Network for Reconfigurable Computing Processor in Digital Signal Processing Applications

    Yeong-Kang LAI  Lien-Fei CHEN  Jian-Chou CHEN  Chun-Wei CHIU  

     
    LETTER

      Vol:
    E89-C No:11
      Page(s):
    1674-1675

    In this paper, a novel cost effective interconnection network for two-way pipelined SIMD-based reconfigurable computing processor is proposed. Our reconfigurable computing engine is composed of the SIMD-based function units, flexible interconnection networks, and two-bank on-chip memories. In order to connect the function units, the reconfigurable network is proposed to connect all neighbors of each function unit. The proposed interconnection network is a kind of full and bidirectional connection with the data duplication to perform the data-parallelism applications efficiently. Moreover, it is a multistage network to accomplish the high flexibility and low hardware cost.

  • Improvement of Coherent Ultrashort Light Pulse CDMA Communication Systems with Distinct 4-Level m-Sequences

    Yasutaka IGARASHI  Ippei OKAJIMA  Hiroyuki YASHIMA  

     
    PAPER

      Vol:
    E89-A No:11
      Page(s):
    3018-3025

    Optical fiber communications require multiple-access schemes to access a shared channel among multiple users. The coherent ultrashort light pulse code-division multiple-access (CDMA) system is one such scheme, and it also offers asynchronous-access communication. This system usually employs 2-level, i.e., binary, m-sequences as signature codes because of their low correlation. If the number of active users is greater than the length of the m-sequence, i.e., code length, distinct m-sequences are used. However, the distinct 2-level m-sequences do not exhibit low correlation, resulting in performance degradation. We therefore propose a coherent ultrashort light pulse CDMA communication system with distinct 4-level, i.e., quaternary, m-sequences to improve system performance when the number of users is greater than the code length. We created the 4-level m-sequences from 2-level m-sequences, and assess the correlation of the 4-level m-sequences. We also theoretically derive the bit error rate (BER) of the proposed system taking into account multiple-access interference (MAI), beat noise, amplified spontaneous emission (ASE), shot noise, and thermal noise. The numerical results show that BER for distinct 4-level m-sequences is more than an order of magnitude smaller than that for distinct 2-level m-sequences. BER is limited by MAI and beat noise when the power of the received signal is high, otherwise BER is limited by ASE, shot noise, and thermal noise.

  • Evaluation of Image Corrected by Retinex Method Based on S-CIELAB and Gazing Information

    Jie BAI  Toshiya NAKAGUCHI  Norimichi TSUMURA  Yoichi MIYAKE  

     
    PAPER

      Vol:
    E89-A No:11
      Page(s):
    2955-2961

    The purpose of this research is to propose an effective color metric which can predict the perceptual image quality for Retinex method. In this paper, we first give a brief introduction of three kinds of typical single Retinex methods to improve the color reproduction. And then, we state the process for obtaining the observer rating value from the subjective evaluation experiment performed under the sRGB illumination condition. Next, we introduce the S-CIELAB metric and propose a new metric on the basis of S-CIELAB metric that considers the gazing information. The average S-CIELAB color differences with and without the consideration of gazing information were calculated as the objective image quality measures. The correlations between the observer rating values and the objective image quality measures were calculated. The result shows that all of the average S-CIELAB color differences based on the gazing information are better correlated to the observer rating value than the average S-CIELAB color difference over the whole area. The average S-CIELAB color difference weighted by the gazing frequency over the gazing area shows the strong correlation with the observer rating value.

  • Ellipse Fitting with Hyperaccuracy

    Kenichi KANATANI  

     
    PAPER-Image Recognition, Computer Vision

      Vol:
    E89-D No:10
      Page(s):
    2653-2660

    For fitting an ellipse to a point sequence, ML (maximum likelihood) has been regarded as having the highest accuracy. In this paper, we demonstrate the existence of a "hyperaccurate" method which outperforms ML. This is made possible by error analysis of ML followed by subtraction of high-order bias terms. Since ML nearly achieves the theoretical accuracy bound (the KCR lower bound), the resulting improvement is very small. Nevertheless, our analysis has theoretical significance, illuminating the relationship between ML and the KCR lower bound.

  • Node-Disjoint Paths Algorithm in a Transposition Graph

    Yasuto SUZUKI  Keiichi KANEKO  Mario NAKAMORI  

     
    PAPER-Algorithm Theory

      Vol:
    E89-D No:10
      Page(s):
    2600-2605

    In this paper, we give an algorithm for the node-to-set disjoint paths problem in a transposition graph. The algorithm is of polynomial order of n for an n-transposition graph. It is based on recursion and divided into two cases according to the distribution of destination nodes. The maximum length of each path and the time complexity of the algorithm are estimated theoretically to be O(n7) and 3n - 5, respectively, and the average performance is evaluated based on computer experiments.

1941-1960hit(3578hit)