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

Keyword Search Result

[Keyword] Al(20498hit)

10581-10600hit(20498hit)

  • Critical Band Subspace-Based Speech Enhancement Using SNR and Auditory Masking Aware Technique

    Jia-Ching WANG  Hsiao-Ping LEE  Jhing-Fa WANG  Chung-Hsien YANG  

     
    PAPER-Speech and Hearing

      Vol:
    E90-D No:7
      Page(s):
    1055-1062

    In this paper, a new subspace-based speech enhancement algorithm is presented. First, we construct a perceptual filterbank from psycho-acoustic model and incorporate it in the subspace-based enhancement approach. This filterbank is created through a five-level wavelet packet decomposition. The masking properties of the human auditory system are then derived based on the perceptual filterbank. Finally, the prior SNR and the masking threshold of each critical band are taken to decide the attenuation factor of the optimal linear estimator. Five different types of in-car noises in TAICAR database were used in our evaluation. The experimental results demonstrated that our approach outperformed conventional subspace and spectral subtraction methods.

  • Dependence of Motion of Breaking Arc on Contact Separating Speed for Ag and Pd Contact Pairs in a DC42V Resistive Circuit

    Yoshinobu NAKAMURA  Junya SEKIKAWA  Takayoshi KUBONO  

     
    PAPER-Arc Discharge & Related Phenomena

      Vol:
    E90-C No:7
      Page(s):
    1361-1368

    Ag and Pd electrical contact pairs are separated at constant separating speeds (5, 10 and 20 mm/s) in a DC 42 V/8.4 A resistive circuit. The motion of the breaking arc is observed with a high-speed video camera. For Ag contacts, the motion of the breaking arc becomes stable at a certain critical gap at separating speeds of 10 mm/s and 20 mm/s, and the breaking arc moves extensively at the separating speed of 5 mm/s. For Pd contacts, the breaking arc moves extensively regardless of the separating speed. These results are attributed to the following causes. For Ag contacts, the difference in the motion of arc spots at each separating speed is changed by the difference in the total energy input to the contacts. For Pd contacts, the temperature of the contact surfaces is kept high because of the lower thermal conductivity of Pd than Ag.

  • Bit Error Rate Analysis of OFDM with Pilot-Assisted Channel Estimation

    Richol KU  Shinsuke TAKAOKA  Fumiyuki ADACHI  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E90-B No:7
      Page(s):
    1725-1733

    The objective of this paper is to develop the theoretical foundation to the pilot-assisted channel estimation using delay-time domain windowing for the coherent detection of OFDM signals. The pilot-assisted channel estimation using delay-time domain windowing is jointly used with polynomial interpolation, decision feedback and Wiener filter. A closed-form BER expression is derived. The impacts of the delay-time domain window width, multipath channel decay factor, the maximum Doppler frequency are discussed. The theoretical analysis is confirmed by computer simulation.

  • Effect of Arcing Behavior Characteristics on Welding Resistance of Relay Contacts

    Zhenbiao LI  Meifang WEI  Makoto HASEGAWA  

     
    PAPER-Arc Discharge & Related Phenomena

      Vol:
    E90-C No:7
      Page(s):
    1385-1390

    The dependence of arcing duration and energy in break operations for automotive relays was analysed with breaking current/voltage waveforms. Endurance tests were conducted with AgSnO2, AgNi10 and AgNi0.15 contacts under the loads of resistance, lamp and inductance, respectively, at 14 VDC. The experimental results shows breaking current (or break arc) duration is usually low and stable before welding occurs. The welding may appear suddenly or randomly without any preceding cumulated increases in the arc duration, the quantity of electric charges, nor the arcing energy. The welded contacts may be re-opened in the later break operation and, thereafter, can keep on working normally for many times.

  • 3D Animation Compression Using Affine Transformation Matrix and Principal Component Analysis

    Pai-Feng LEE  Chi-Kang KAO  Juin-Ling TSENG  Bin-Shyan JONG  Tsong-Wuu LIN  

     
    PAPER-Computer Graphics

      Vol:
    E90-D No:7
      Page(s):
    1073-1084

    This paper investigates the use of the affine transformation matrix when employing principal component analysis (PCA) to compress the data of 3D animation models. Satisfactory results were achieved for the common 3D models by using PCA because it can simplify several related variables to a few independent main factors, in addition to making the animation identical to the original by using linear combinations. The selection of the principal component factor (also known as the base) is still a subject for further research. Selecting a large number of bases could improve the precision of the animation and reduce distortion for a large data volume. Hence, a formula is required for base selection. This study develops an automatic PCA selection method, which includes the selection of suitable bases and a PCA separately on the three axes to select the number of suitable bases for each axis. PCA is more suitable for animation models for apparent stationary movement. If the original animation model is integrated with transformation movements such as translation, rotation, and scaling (RTS), the resulting animation model will have a greater distortion in the case of the same base vector with regard to apparent stationary movement. This paper is the first to extract the model movement characteristics using the affine transformation matrix and then to compress 3D animation using PCA. The affine transformation matrix can record the changes in the geometric transformation by using 44 matrices. The transformed model can eliminate the influences of geometric transformations with the animation model normalized to a limited space. Subsequently, by using PCA, the most suitable base vector (variance) can be selected more precisely.

  • Adaptive Hybrid Genetic Algorithm Parallel Interference Cancellation High Rate Multi-User Detection for Dual Rate W-CDMA Mobile Communications

    Liangfang NI  Sidan DU  Baoyu ZHENG  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E90-B No:7
      Page(s):
    1692-1706

    Adaptive hybrid genetic algorithm concatenated with improved parallel interference cancellation, i.e. adaptive hybrid genetic algorithm parallel interference cancellation (AHGAPIC) was proposed. A study is conducted on the application of AHGAPIC to soft decoding high rate multi-user detection with diversity reception for dual-rate wideband DS-CDMA spread spectrum communications, aiming to mitigate the effect of multiple access interference. The relevant research has revealed that the local search capability of hybrid genetic algorithm (HGA) is still not good enough. Therefore, first, two evolutionary operations, i.e. inversion and insertion are merged into HGA to constitute a novel algorithm. With its moderate local search capability, this new algorithm can search for the global optimum region according to the information entropy, and then it is made adaptively vary its probabilities of crossover and mutation depending on the fitness values of the solutions to form the adaptive hybrid genetic algorithm (AHGA). Second, AHGA is utilized to effectively identify the better and better binary string to maximize the log-likelihood function of dual-rate multi-user detection. As AHGA converges to the optimum region, the control factor of the improved parallel interference cancellation (IPIC) detector is set to be the ratio of the average fitness value to the maximum fitness value of the population of AHGA. Finally, equipped with both the control factor and the binary string with the maximum fitness value as the initial data, the IPIC detector can rapidly find out the approximately optimum soft decoding vector. Then, it can obtain the approximately global optimum estimate point on the basis of the soft decoding rule, corresponding to the transmitted data bits. A lower bound of computational complexity has been achieved through simulations and qualitative analyses. The property of the proposed algorithm to converge rapidly leads to lower computational complexity. Emulation results have shown that the AHGAPIC soft decoding high rate multi-user detector is superior to other suboptimum detectors considered in this paper in terms of two points. They are the mitigation of multiple access interference and the resistance to near-far effects. Its performance is close to the sequential group optimum multi-user detector but with a shorter time delay.

  • Feature Selection in Genetic Fuzzy Discretization for the Pattern Classification Problems

    Yoon-Seok CHOI  Byung-Ro MOON  

     
    PAPER-Pattern Recognition

      Vol:
    E90-D No:7
      Page(s):
    1047-1054

    We propose a new genetic fuzzy discretization method with feature selection for the pattern classification problems. Traditional discretization methods categorize a continuous attribute into a number of bins. Because they are made on crisp discretization, there exists considerable information loss. Fuzzy discretization allows overlapping intervals and reflects linguistic classification. However, the number of intervals, the boundaries of intervals, and the degrees of overlapping are intractable to get optimized and a discretization process increases the total amount of data being transformed. We use a genetic algorithm with feature selection not only to optimize these parameters but also to reduce the amount of transformed data by filtering the unconcerned attributes. Experimental results showed considerable improvement on the classification accuracy over a crisp discretization and a typical fuzzy discretization with feature selection.

  • A Multi-Scale Adaptive Grey World Algorithm

    Bing LI  De XU  Moon Ho LEE  Song-He FENG  

     
    LETTER-Image Recognition, Computer Vision

      Vol:
    E90-D No:7
      Page(s):
    1121-1124

    Grey world algorithm is a well-known color constancy algorithm. It is based on the Grey-World assumption i.e., the average reflectance of surfaces in the world is achromatic. This algorithm is simple and has low computational costs. However, for the images with several colors, the light source color could not be estimated correctly using the Grey World algorithm. In this paper, we propose a Multi-scale Adaptive Grey World algorithm (MAGW). First, multi-scale images are obtained based on wavelet transformation and the illumination color is estimated from different scales images. Then according to the estimated illumination color, the original image is mapped into the image under a canonical illumination with supervision of an adaptive reliability function, which is based on the image entropy. The experimental results show that our algorithm is effective and also has low computational costs.

  • Invariance of Second-Order Modes of Linear Continuous-Time Systems under Typical Frequency Transformations

    Masayuki KAWAMATA  Yousuke MIZUKAMI  Shunsuke KOSHITA  

     
    LETTER-Systems and Control

      Vol:
    E90-A No:7
      Page(s):
    1481-1486

    This paper discusses the behavior of the second-order modes (Hankel singular values) of linear continuous-time systems under typical frequency transformations, such as lowpass-lowpass, lowpass-highpass, lowpass-bandpass, and lowpass-bandstop transformations. Our main result establishes the fact that the second-order modes are invariant under any of these typical frequency transformations. This means that any transformed system that is generated from a prototype system has the same second-order modes as those of the prototype system. We achieve the derivation of this result by describing the state-space equations and the controllability/observability Gramians of transformed systems.

  • The Repacking Efficiency for Bandwidth Packing Problem

    Jianxin CHEN  Yuhang YANG  Lei ZHOU  

     
    PAPER-Complexity Theory

      Vol:
    E90-D No:7
      Page(s):
    1011-1017

    Repacking is an efficient scheme for bandwidth packing problem (BPP) in centralized networks (CNs), where a central unit allocates bandwidth to the rounding terminals. In this paper, we study its performance by proposing a new formulation of the BPP in the CN, and introducing repacking scheme into next fit algorithm in terms of the online constraint. For the realistic applications, the effect of call demand distribution is also exploited by means of simulation. The results show that the repacking efficiency is significant (e.g. the minimal improvement about 13% over uniform distribution), especially in the scenarios where the small call demands dominate the network.

  • Robust Adaptive Array Beamforming Based on Independent Component Analysis with Regularized Constraints

    Ann-Chen CHANG  Chih-Wei JEN  Ing-Jiunn SU  

     
    PAPER-Antennas and Propagation

      Vol:
    E90-B No:7
      Page(s):
    1791-1800

    This paper deals with adaptive array beamforming based on stochastic gradient descent independent component analysis (ICA) for suppressing interference with robust capabilities. The approach first uses estimates of the interested source directions to construct the multiple regularized constraints, which form an efficient ICA-based beamformer to achieve fast convergence and more robust capabilities than existing MCMV and ESB beamformers. In conjunction with the regularization parameters of the high-order derivative constraints, the width of the main beam for remaining the desired signal and the depth of nulls for suppressing interferers can be adjusted. Several computer simulation examples are provided for illustration and comparison.

  • Very Fast Recursion Based Algorithm for BLAST Signal Detection in Spatial Multiplexing Systems

    Wenjie JIANG  Yusuke ASAI  Satoru AIKAWA  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E90-B No:7
      Page(s):
    1773-1779

    Recent theoretical and experimental studies indicate that spatial multiplexing (SM) systems have enormous potential for increasing the capacity of corresponding multiple input multiple output (MIMO) channels in rich scattering environments. In this paper, we propose a new recursion based algorithm for Bell Labs layered space time (BLAST) signal detection in SM systems. The new algorithm uses an inflated recursion in the initialization and a deflated recursion in the iteration stage: as a result, the complexity is greatly reduced and the irregularity issues are completely avoided. Compared with the conventional fastest recursive approach, the complexity of our proposal is lower by a factor of 2 and it is also very implementation friendly.

  • A Half-Skewed Octree for Volume Ray Casting

    Sukhyun LIM  Byeong-Seok SHIN  

     
    PAPER-Computer Graphics

      Vol:
    E90-D No:7
      Page(s):
    1085-1091

    A hierarchical representation formed by an octree for a volume ray casting is a well-known data structure to skip over transparent regions requiring little preprocessing and storage. However, it accompanies unnecessary comparison and level shift between octants. We propose a new data structure named half-skewed octree, which is an auxiliary octree to support the conventional octree. In preprocessing step, a half-skewed octree selects eight different child octants in each generation step compared with the conventional octree. During rendering, after comparing an octant of the conventional octree with corresponding octant of the half-skewed octree simultaneously at the same level, a ray chooses one of two octants to jump over transparent regions farther away. By this method, we can reduce unnecessary comparison and level shift between octants. Another problem of a conventional octree structure is that it is difficult to determine a distance from the boundary of a transparent octant to opposite boundary. Although we exploit the previously proposed distance template, we cannot expect the acceleration when a ray direction is almost parallel to the octant's boundary. However, our method can solve it without additional operations because a ray selects one octant to leap farther away. As a result, our approach is much faster than the method using conventional octree while preserving image quality and requiring minimal storage.

  • Operation Mode Based High-Level Switching Activity Analysis for Power Estimation of Digital Circuits

    Hyunchul SHIN  Changhee LEE  

     
    PAPER-Energy in Electronics Communications

      Vol:
    E90-B No:7
      Page(s):
    1826-1834

    As semiconductor processing technology advances, complex, high density circuits can be integrated in a chip. However, increasing energy consumption is becoming one of the most important limiting factors. Power estimation at the early stage of design is essential since design changes at later stages may significantly lengthen the design period and increase the costs. For efficient power estimation, we analyze the "key" control signals of a digital circuit and develop power models for several operational modes. The trade-off between accuracy and complexity can be made by choosing the number and the complexity of the power models. When compared with those of logic simulation based estimation, experimental results show that 13 to 15 times faster power estimation with an estimation error of about 5% is possible. We have also developed new logic-level power modeling techniques in which logic gates are levelized and several levels are selected to build power model tables. This table based method shows significant improvement in estimation accuracy and a slight improvement in efficiency when compared to a well-known previous method. The average estimation error has been reduced from 13.3% to 3.8%.

  • Particle Swarm Optimization Assisted Multiuser Detection along with Radial Basis Function

    Muhammad ZUBAIR  Muhammad Aamir Saleem CHOUDHRY  Aqdas Naveed MALIK  Ijaz Mansoor QURESHI  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E90-B No:7
      Page(s):
    1861-1863

    In this work particle swarm optimization (PSO) aided with radial basis functions (RBF) has been suggested to carry out multiuser detection (MUD) for synchronous direct sequence code division multiple access (DS-CDMA) systems. The performance of the proposed algorithm is compared to that of other standard suboptimal detectors and genetic algorithm (GA) assisted MUD. It is shown to offer better performance than the others especially if there are many users.

  • Theoretical Analysis of Decision Directed Block Iterative Channel Estimation for OFDM Mobile Radio

    Koichi ADACHI  Masao NAKAGAWA  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E90-B No:7
      Page(s):
    1764-1772

    Orthogonal frequency division multiplexing (OFDM) is one of the promising transmission techniques for next generation mobile communication systems. Accurate channel estimation is essential for coherent OFDM signal transmission. So far, many pilot-assisted channel estimation schemes have been proposed. In the case of packet transmission, each received packet can be repeatedly processed by decision feedback to improve the channel estimation accuracy, resulting in a decision directed block iterative channel estimation (DD-BICE). However, decision feedback of erroneously detected data symbols degrades the packet error rate (PER) or bit error rate (BER) performance. In this paper, theoretical analysis is presented for the DD-BICE taking into account the decision feedback errors assuming quadrature phase shift keying (QPSK) data modulation. A 2-dimensional (2D) averaging filter is used for reducing the negative impact of decision feedback errors. The impacts of 2D averaging filter and antenna diversity reception are discussed and the validity of the theoretical analysis is confirmed by computer simulation.

  • Flexible Allocation of Optical Access Network Resources Using Constraint Satisfaction Problem

    Kenichi TAYAMA  Shiro OGASAWARA  Tetsuya YAMAMURA  Yasuyuki OKUMURA  

     
    PAPER-Network Management/Operation

      Vol:
    E90-B No:7
      Page(s):
    1674-1681

    A method for flexibly allocating and reallocating optical access network (OAN) resources, including fibers and equipment, using the constraint satisfaction problem (CSP) is described. OAN resource allocation during service delivery provisioning involves various input conditions and allocation sequences, so an OAN resource allocation method has to support various workflow patterns. Furthermore, exception processing, such as reallocating OAN resources once they are allocated, is inevitable, especially during the spread of service using optical fiber and during the deployment of an optical access network. However, it is almost impossible to describe all workflow patterns including exception processes. Improving the efficiency of these exception processes, as well as that of the typical processes, is important for reducing the service delivery time. Describing all these patterns and process flows increases development cost. The CSP can be used to search for solutions without having to fix the process sequence and input conditions beforehand. We have formulated the conditions for OAN resource allocation and reallocation as a CSP. Use of this method makes it possible to handle various allocation workflow patterns including exception processes. Evaluation of the solution search time demonstrated its feasibility.

  • A Novel Vertical Handoff Scheme Based on Mobility Speed in Integrated WLAN and UMTS Networks

    HyoJin KIM  JooSeok SONG  

     
    LETTER-Network

      Vol:
    E90-B No:7
      Page(s):
    1844-1847

    This letter proposes a vertical handoff scheme for integrated WLAN and UMTS that use the mobile Internet Protocol (IP) to reduce the packet loss caused by the ping-pong effect for high mobility users. The simulation results show that the proposed scheme efficiently increases the throughput of high mobility users.

  • Electrical and Tribological Characteristics of Metal-Doped Carbon Thin Films

    Shigeru UMEMURA  Shinsuke MISU-MATSUHASHI  Shigeru HIRONO  

     
    PAPER-Materials

      Vol:
    E90-C No:7
      Page(s):
    1435-1440

    To realize highly conductive and wear-durable thin films, we deposited metal doped carbon films onto silicon substrates by RF sputtering method. The dopant metals were various precious metals and transition metals. The electrical conductivity and wear durability of the deposited films were evaluated. We have found that Ir doping especially increased the electrical conductivity for the given amount of dopant metal. The wear durability of Ir-doped carbon films did not deteriorate even below a 7 at.% Ir concentration, and the conductivity of 7 at.% Ir-doped carbon was twenty times that of a non-doped carbon thin film.

  • Consideration on Contact Mechanism of YBaCuO Bulk Superconductor with Deposited Metal Layer

    Hiroyuki FUJITA  Katsuya FUKUDA  Koichiro SAWA  Masaru TOMITA  Masato MURAKAMI  Naomichi SAKAI  Izumi HIRABAYASHI  

     
    PAPER-Contact Phenomena

      Vol:
    E90-C No:7
      Page(s):
    1421-1428

    A persistent current switch (PCS) is used for superconducting applications, such as superconducting magnetic energy storage (SMES) system. The authors have proposed a mechanical switch of Y-Ba-Cu-O (YBCO) bulk as a mechanical PCS. In previous study, the authors have successfully reduced a residual resistance by depositing with metal on contact surface. This paper focused on a current carrying area (called a-spot) on contact surface and presented an effect of deposited metal on electrical contact characteristics in order to clear the contact mechanism. As the results of experiments and simulation using FEM, it became clear that it was effective for reducing the residual resistance from a view point of increasing the a-spot by depositing with metal.

10581-10600hit(20498hit)