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

Keyword Search Result

[Keyword] CTI(8214hit)

3401-3420hit(8214hit)

  • Two Relay-Stage Selection Cooperation in Wireless Networks and Why More than Two Is Not Necessary

    Xingyang CHEN  Lin ZHANG  Yuhan DONG  Xiuming SHAN  Yong REN  

     
    PAPER

      Vol:
    E93-B No:12
      Page(s):
    3332-3344

    The selection cooperation is a basic and attractive scheme of cooperative diversity in the multiple relays scenario. Most previous schemes of selection cooperation consist only one relay-stage in which one relay is selected to retransmit, and the signal from the selected relay is not utilized by other relays. In this paper, we introduce a two relay-stage selection cooperation scheme. The performance can be improved by letting all other relays to utilize the signal from the first selected relay to make another selection and retransmission in the second relay-stage. We derive the closed-form expression of the outage probability of the proposed scheme in the high SNR regime. Both theoretical and numerical results suggest that the proposed scheme can reduce the outage probability compared with the traditional scheme with only one relay-stage. Furthermore, we demonstrate that more than two relay-stage can not further reduce the outage probability. We also study the dependence of the proposed scheme on stage lengths and topology, and analyze the increased overhead.

  • Improved Dictionary-Based Code-Compression Schemes with XOR Reference for RISC/VLIW Architecture

    Jui-Chun CHEN  Chang-Hong LIN  

     
    PAPER-High-Level Synthesis and System-Level Design

      Vol:
    E93-A No:12
      Page(s):
    2517-2523

    Embedded systems are constrained by the available memory, and code-compression techniques address this issue by reducing the code size of application programs. The main challenge for the development of an effective code-compression technique is to reduce code size without affecting the overall system performance. Dictionary-based code-compression schemes are the most commonly used code-compression methods, because they can provide both good compression ratio and fast decompression. We propose an XOR-based reference scheme that can enhance the compression ratio on all the existing dictionary-based algorithms by changing the distribution of the symbols. Our approach works on all kinds of computer architecture with fixed length instructions, such as RISC or VLIW. Experiments show that our approach can further improve the compression ratio with nearly no hardware, performance, and power overheads.

  • Subtraction Inversion for Delta Path's Hardware Simplification in MASH Delta-Sigma Modulator

    Pao-Lung CHEN  

     
    LETTER-Circuit Design

      Vol:
    E93-A No:12
      Page(s):
    2616-2620

    The multistage noise-shaping (MASH) delta-sigma modulator (DSM) is the key element in a fractional-N frequency synthesizer. A hardware simplification method with subtraction inversion is proposed for delta-path's design in a MASH delta-sigma modulator. The subtraction inversion method focuses on simplification of adder-subtractor unit in the delta path with inversion of subtraction signal. It achieves with less hardware cost as compared with the conventional approaches. As a result, the hardware organization is regular and easy for expanding into higher order MASH DSM design. Analytical details of the implementation way and hardware cost function with N-th order configuration are presented. Finally, simulations with hardware description language as well as synthesis data verified the proposed design method.

  • An Enhanced Automatic Gain Control Algorithm for Initial Cell Search in 3GPP LTE TDD System

    Jun-Hee JANG  Keun-Dea KIM  Hyung-Jin CHOI  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E93-B No:12
      Page(s):
    3606-3615

    In this paper, we propose an AGC (Automatic Gain Control) algorithm for initial cell search in 3GPP (3rd Generation Partnership Project) LTE (Long Term Evolution) TDD (Time Division Duplex) system. Since the received signal has a large signal power difference between uplink and downlink subframe in wireless communication systems using a TDD scheme, conventional AGC scheme cannot sufficiently adjust the AGC gain because the AGC gain cannot converge fast enough to properly respond. Therefore, conventional AGC scheme leads to increased AGC gain variation, and the received signal will be attenuated by large AGC gain variation. To overcome this limitation, we propose an AGC scheme based on the average amplitude ratio calculation which can not only effectively increase convergence speed of the AGC gain but also maintain the stability of AGC operation in LTE TDD system. Also, it is important for AGC to converge efficiently for the accurate radio frame timing detection during the subsequent initial cell search procedure. Therefore, we also consider the proposed AGC scheme in combination with PSS (Primary Synchronization Signal) detection interface for the first step of initial cell search process in LTE TDD system to obtain both a stable AGC operation and accurate PSS detection performance. By extensive computer simulation in the presence of frequency offset and various channel environments, we verified that the proposed method can obtain a good behavior in terms of demodulation and PSS detection performance in LTE TDD system.

  • On-Line Electrocardiogram Lossless Compression Using Antidictionary Codes for a Finite Alphabet

    Takahiro OTA  Hiroyoshi MORITA  

     
    PAPER-Biological Engineering

      Vol:
    E93-D No:12
      Page(s):
    3384-3391

    An antidictionary is particularly useful for data compression, and on-line electrocardiogram (ECG) lossless compression algorithms using antidictionaries have been proposed. They work in real-time with constant memory and give better compression ratios than traditional lossless data compression algorithms, while they only deal with ECG data on a binary alphabet. This paper proposes on-line ECG lossless compression for a given data on a finite alphabet. The proposed algorithm gives not only better compression ratios than those algorithms but also uses less computational space than they do. Moreover, the proposed algorithm work in real-time. Its effectiveness is demonstrated by simulation results.

  • Binary Oriented Vulnerability Analyzer Based on Hidden Markov Model

    Hao BAI  Chang-zhen HU  Gang ZHANG  Xiao-chuan JING  Ning LI  

     
    LETTER-Dependable Computing

      Vol:
    E93-D No:12
      Page(s):
    3410-3413

    The letter proposes a novel binary vulnerability analyzer for executable programs that is based on the Hidden Markov Model. A vulnerability instruction library (VIL) is primarily constructed by collecting binary frames located by double precision analysis. Executable programs are then converted into structurized code sequences with the VIL. The code sequences are essentially context-sensitive, which can be modeled by Hidden Markov Model (HMM). Finally, the HMM based vulnerability analyzer is built to recognize potential vulnerabilities of executable programs. Experimental results show the proposed approach achieves lower false positive/negative rate than latest static analyzers.

  • Secure Cluster Head Election Using Mark Based Exclusion in Wireless Sensor Networks

    Gicheol WANG  Gihwan CHO  

     
    PAPER

      Vol:
    E93-B No:11
      Page(s):
    2925-2935

    In clustered sensor networks, because CHs (Cluster Heads) are the collection points of data, they are likely to be compromise targets of attackers. So, they need to be changed through a CH election scheme as frequently as possible. Besides, because the compromised nodes must try to become a CH, a CH election scheme should prevent them from being a CH. This paper presents a secure CH election scheme for clustered sensor networks, which changes the CH role nodes securely by excluding the compromised nodes from CH candidates. In the proposed scheme, each node gives marks for behavior of all other nodes in the same CH election region and exchanges the mark list with them. Then, each node computes the average marks for all nodes in the region, and nodes whose average mark is less than a specific threshold are excluded from CH candidates. A CH is elected among the remaining candidates. Simulation results show that our scheme provides strong resilience against misbehavior of compromised nodes and reduces energy consumption of nodes. Another simulation results show that our scheme well operates in the environment where some packets are often lost.

  • A 4.78 µs Dynamic Compensated Inductive Coupling Transceiver for Ubiquitous and Wearable Body Sensor Network

    Seulki LEE  Jerald YOO  Hoi-Jun YOO  

     
    PAPER

      Vol:
    E93-B No:11
      Page(s):
    2892-2900

    A Real-time Capacitor Compensation (RCC) scheme is proposed for low power and continuous communication in the wearable inductive coupling transceiver. Since inductance values of wearable inductor vary dynamically with deterioration of its communication characteristics, the inductance value is monitored and its resonance frequency is adjusted by additive parallel/serial capacitors in real time. RLC Bridge for detection of the inductance variations and the Dual-edge Sampling Comparator for recognition of the variance direction are proposed. It is implemented in a 0.18 µm CMOS technology, and it occupies a 12.7 mm2 chip area. The proposed transceiver consumes only 426.6 µW at 4 Mbps data rate. The compensation time takes 4.78 µs, including 3 µs of detection and 1.78 µs for compensation process in worst case.

  • Mixed-Mode Extraction of Figures of Merit for InGaAs Quantum-Well Lasers and SiGe Low-Noise Amplifiers

    Hsien-Cheng TSENG  Jibin HORNG  Chieh HU  Seth TSAU  

     
    BRIEF PAPER-Semiconductor Materials and Devices

      Vol:
    E93-C No:11
      Page(s):
    1645-1647

    We propose a new parameter-extraction approach based on a mixed-mode genetic algorithm (GA), including the efficient search-space separation and local-minima-convergence prevention process. The technique, substantially extended from our previous work, allows the designed figures-of-merit, such as internal quantum efficiency (ηi) as well as transparency current density (Jtr) of lasers and minimum noise figure (NFmin) as well as associated available gain (GA,assoc) of low-noise amplifiers (LNAs), extracted by an analytical equation-based methodology combined with an evolutionary numerical tool. Extraction results, which agree well with actually measured data, for both state-of-the-art InGaAs quantum-well lasers and advanced SiGe LNAs are presented for the first time to demonstrate this multi-parameter analysis and high-accuracy optimization.

  • A Novel Measured Function for MCDM Problem Based on Interval-Valued Intuitionistic Fuzzy Sets

    Kuo-Chen HUNG  Yuan-Cheng TSAI  Kuo-Ping LIN  Peterson JULIAN  

     
    PAPER-Office Information Systems, e-Business Modeling

      Vol:
    E93-D No:11
      Page(s):
    3059-3065

    Several papers have presented measured function to handle multi-criteria fuzzy decision-making problems based on interval-valued intuitionistic fuzzy sets. However, in some cases, the proposed function cannot give sufficient information about alternatives. Consequently, in this paper, we will overcome previous insufficient problem and provide a novel accuracy function to measure the degree of the interval-valued intuitionistic fuzzy information. And a practical example has been provided to demonstrate our proposed approach. In addition, to make computing and ranking results easier and to increase the recruiting productivity, a computer-based interface system has been developed for decision makers to make decisions more efficiently.

  • Self-Quotient ε-Filter for Feature Extraction from Noise Corrupted Image

    Mitsuharu MATSUMOTO  

     
    PAPER-Image Recognition, Computer Vision

      Vol:
    E93-D No:11
      Page(s):
    3066-3075

    This paper describes a nonlinear filter that can extract the image feature from noise corrupted image labeled self-quotient ε-filter (SQEF). SQEF is an improved self-quotient filter (SQF) to extract the image feature from noise corrupted image. Although SQF is a simple approach for feature extraction from the images, it is difficult to extract the feature when the image includes noise. On the other hand, SQEF can extract the image feature not only from clear images but also from noise corrupted images with uniform noise, Gaussian noise and impulse noise. We show the algorithm of SQEF and describe its feature when it is applied to uniform noise corrupted image, Gaussian noise corrupted image and impulse noise corrupted image. Experimental results are also shown to confirm the effectiveness of the proposed method.

  • Interference Coordination in Compact Frequency Reuse for Multihop Cellular Networks

    Yue ZHAO  Xuming FANG  Zhengguang ZHAO  

     
    PAPER-Mobile Information Network and Personal Communications

      Vol:
    E93-A No:11
      Page(s):
    2312-2319

    Continuously increasing the bandwidth to enhance the capacity is impractical because of the scarcity of spectrum availability. Fortunately, on the basis of the characteristics of the multihop cellular networks (MCNs), a new compact frequency reuse scheme has been proposed to provide higher spectrum utilization efficiency and larger capacity without increasing the cost on network. Base stations (BSs) and relay stations (RSs) could transmit simultaneously on the same frequency according to the compact frequency reuse scheme. In this situation, however, mobile stations (MSs) near the coverage boundary will suffer serious interference and their traffic quality can hardly be guaranteed. In order to mitigate the interference while maintaining high spectrum utilization efficiency, this paper introduces a fractional frequency reuse (FFR) scheme into multihop cellular networks, in which the principle of FFR scheme and characteristics of frequency resources configurations are described, then the transmission (Tx) power consumption of BS and RSs is analyzed. The proposed scheme can both meet the requirement of high traffic load in future cellular system and maximize the benefit by reducing the Tx power consumption. Numerical results demonstrate that the proposed FFR in compact frequency reuse achieves higher cell coverage probability and larger capacity with respect to the conventional schemes.

  • Sorted Sector Covering Combined with Image Condensation -- An Efficient Method for Local Dimming of Direct-Lit and Edge-Lit LCDs Open Access

    Marc ALBRECHT  Andreas KARRENBAUER  Tobias JUNG  Chihao XU  

     
    INVITED PAPER

      Vol:
    E93-C No:11
      Page(s):
    1556-1563

    We consider the backlight calculation of local dimming as an optimization problem. The luminance produced by many LEDs at each pixel considered is calculated which should cover the gray value of each pixel, while the sum of LED currents is to be minimized. For this purpose a specific approach called as "Sorted Sector Covering" (SSC) was developed and is described in this paper. In our pre-processing unit called condenser the source image is reduced to a matrix of much lower resolution so that the computation effort of the SSC algorithm is drastically reduced. During this preprocessing phase, filter functions can be integrated so that a further reduction of the power consumption is achieved. Our processing system allows high power saving and high visual quality at low processor cost. We approach the local dimming problem in the physical viewing direction -- from LED to pixel. The luminance for the pixel is based on the light spread function (LSF) and the PWM values of the LEDs. As the physical viewing direction is chosen, this method is universal and can be applied for any kind of LED arrangement -- direct-lit as well as edge-lit. It is validated on prototypes, e.g., a locally dimmed edge-lit TV.

  • Utility Based Scheduling Algorithm for Multiple Services per User in OFDM Systems

    Ying WANG  Zixiong CHEN  Cong SHI  Ping ZHANG  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E93-B No:11
      Page(s):
    3102-3112

    With development of wireless communication technologies, users are no longer satisfied with only a single service provided per time. They are willing to enjoy multiple services simultaneously. Therefore scheduling multiple services per user becomes quite important usability issue in the area of resource management. In this paper, the multiple-service scheduling problem is firstly formulated as an integrated optimization problem based on a utility function in homogeneous service systems. Due to its NP-hard characteristic, a set of low-complexity sub-optimal algorithms is therefore proposed and used to schedule resources for multiple services per user at the downlink of Orthogonal Frequency Division Multiplexing (OFDM) systems. The proposed algorithms are capable to effectively and efficiently distribute assigned resources among multiple services for one user. Moreover the utility of our algorithms is further extended from homogeneous service systems to heterogeneous service systems. And full exploitation of multi-user diversity gain is achieved while guaranteeing quality of service (QoS). The simulation results show that the proposed algorithm outperforms traditional algorithm in terms of system best effort service throughput and fairness criterion.

  • Otedama: A Relocatable RFID Information Repository Architecture

    Shigeya SUZUKI  Rodney VAN METER  Osamu NAKAMURA  Jun MURAI  

     
    PAPER

      Vol:
    E93-D No:11
      Page(s):
    2922-2931

    We present a novel RFID middleware architecture, Otedama, which makes use of a unique property of RFID information to improve performance. RFID tags are bound to items. New information related to an RFID tag is generated at the site where the ID exists, and the entity most interested in the history and the item itself is in close proximity to the RFID tag. To exploit this property, we propose a scheme which bundles information related to a specific ID into one object and moves that bundle to a nearby server as the RFID tag moves from place to place. By using this scheme, information is always accessible by querying a system near the physical location of the tag, providing better query performance. Additionally, the volume of records that must be kept by a repository manager is reduced, because the relocation naturally migrates data away as physical objects move. We show the effectiveness of this architecture by analyzing data from a major retailer, finding that information retrieval performance will be six times better, and the cost of search is possibly several times cheaper.

  • Sampling Point Selection Scheme for Fractional Sampling-OFDM Receivers on Fast Time-Varying Multipath Channels

    Tatsuya KOBAYASHI  Haruki NISHIMURA  Yukitoshi SANADA  

     
    PAPER

      Vol:
    E93-A No:11
      Page(s):
    2122-2129

    Fractional sampling (FS) and Doppler diversity equalization in OFDM receivers can achieve two types of diversity (path diversity and frequency diversity) simultaneously on time-varying multipath channels. However FS with a higher sampling rate requires the large amount of complexity in demodulation. In this paper, a novel sampling point selection (SPS) scheme with MMSE equalization in FS-OFDM receivers is proposed. On fast time-varying multipath channels, the proposed scheme selects the appropriate samples from the fractionally sampled signals. Through the computer simulation, it is demonstrated that with the proposed scheme, both path diversity gain and Doppler diversity gain can increase as compared to a conventional non-SPS scheme.

  • Application of Compressive Projection Principal Component Analysis to MIMO Channel Feedback Scheme

    Chenhao QI  Lenan WU  

     
    LETTER

      Vol:
    E93-A No:11
      Page(s):
    2193-2195

    In this letter, we apply recently proposed compressive projection principal component analysis (CPPCA) for MIMO channel feedback. A novel scheme with compressed feedback and efficient reconstruction is presented. Simulation results based on 3GPP spatial channel model (SCM) demonstrate the scheme is beneficial for large-scale MIMO systems.

  • A Relay Selection Based on Eigenvalue Decomposition for Cooperative Communications in Indoor Ubiquitous Sensor Networks

    Sekchin CHANG  

     
    LETTER

      Vol:
    E93-B No:11
      Page(s):
    2967-2970

    A new best-relay selection scheme is proposed in this letter in order to maintain a reliable cooperative communications for ubiquitous sensor networks in indoor environments. The suggested technique relies on eigenvalue decomposition to select the best relay. The simulation results confirm that the performance of the proposed approach is better than that of the previous scheme in indoor environments.

  • Digital Image Stabilization Based on Correction for Basic Reference Frame Jitter

    Yuefei ZHANG  Mei XIE  Ling MAO  

     
    LETTER-Image Recognition, Computer Vision

      Vol:
    E93-D No:11
      Page(s):
    3149-3152

    In this letter, we first study the impact of the basic reference frame jitter on the digital image stabilization. Next, a method for stabilizing the digital image sequence based on the correction for basic reference frame jitter is proposed. The experimental results show that our proposed method can effectively decrease the excessive undefined areas in the stable image sequence resulting from the basic reference frame jitter.

  • Lossy Coding of Binary Sources with Short Linear Codes

    Misako KOTANI  Motohiko ISAKA  

     
    LETTER-Source Coding

      Vol:
    E93-A No:11
      Page(s):
    2074-2076

    This letter treats lossy source coding of binary sources with short linear block codes. It is numerically shown that very simple basis-reprocessing approach yields good rate-distortion performance with manageable computational complexity for small block lengths. The result for code lengths up to 100 outperforms the message-passing based encoding for low-density codes which are several times longer.

3401-3420hit(8214hit)