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

Keyword Search Result

[Keyword] Al(20498hit)

8861-8880hit(20498hit)

  • A Scheduling Algorithm for Minimizing Exclusive Window Durations in Time-Triggered Controller Area Network

    Minsoo RYU  

     
    LETTER-Network

      Vol:
    E92-B No:8
      Page(s):
    2739-2742

    Time-Triggered Controller Area Network is widely accepted as a viable solution for real-time communication systems such as in-vehicle communications. However, although TTCAN has been designed to support both periodic and sporadic real-time messages, previous studies mostly focused on providing deterministic real-time guarantees for periodic messages while barely addressing the performance issue of sporadic messages. In this paper, we present an O(n2) scheduling algorithm that can minimize the maximum duration of exclusive windows occupied by periodic messages, thereby minimizing the worst-case scheduling delays experienced by sporadic messages.

  • Beam Profile Tailoring of Laser Diodes Using Lloyd's Mirror Interference

    Takehiro FUKUSHIMA  Kunihiro MIYAHARA  Naoki NAKATA  

     
    LETTER-Lasers, Quantum Electronics

      Vol:
    E92-C No:8
      Page(s):
    1095-1097

    A novel method for tailoring the beam profile of laser diodes that employs Lloyd's mirror interference is investigated. The beam profile in the vertical direction is controlled by inserting a GaAs mirror below the active layer. The experimentally obtained trends are successfully modeled by numerical calculations using Huygens' integral.

  • Performance Evaluation of MIMO-UWB Systems Using Measured Propagation Data and Proposal of Timing Control Scheme in LOS Environments

    Masaki TAKANASHI  Toshihiko NISHIMURA  Yasutaka OGAWA  Takeo OHGANE  

     
    PAPER-Antennas and Propagation

      Vol:
    E92-B No:8
      Page(s):
    2698-2707

    Ultrawide-band impulse radio (UWB-IR) technology and multiple-input multiple-output (MIMO) systems have attracted interest regarding their use in next-generation high-speed radio communication. We have studied the use of MIMO ultrawide-band (MIMO-UWB) systems to enable higher-speed radio communication. We used frequency-domain equalization based on the minimum mean square error criterion (MMSE-FDE) to reduce intersymbol interference (ISI) and co-channel interference (CCI) in MIMO-UWB systems. Because UWB systems are expected to be used for short-range wireless communication, MIMO-UWB systems will usually operate in line-of-sight (LOS) environments and direct waves will be received at the receiver side. Direct waves have high power and cause high correlations between antennas in such environments. Thus, it is thought that direct waves will adversely affect the performance of spatial filtering and equalization techniques used to enhance signal detection. To examine the feasibility of MIMO-UWB systems, we conducted MIMO-UWB system propagation measurements in LOS environments. From the measurements, we found that the arrival time of direct waves from different transmitting antennas depends on the MIMO configuration. Because we can obtain high power from the direct waves, direct wave reception is critical for maximizing transmission performance. In this paper, we present our measurement results, and propose a way to improve performance using a method of transmit (Tx) and receive (Rx) timing control. We evaluate the bit error rate (BER) performance for this form of timing control using measured channel data.

  • Semi-Dynamic Multiprocessor Scheduling with an Asymptotically Optimal Performance Ratio

    Satoshi FUJITA  

     
    PAPER-Theory

      Vol:
    E92-A No:8
      Page(s):
    1764-1770

    In this paper, we consider a problem of assigning n independent tasks onto m identical processors in such a way that the overall execution time of the tasks will be minimized. Unlike conventional task assignment problem, we assume that the execution time of each task is not fixed in advance, and merely upper and lower bounds of the execution time are given at the compile time. In the following, we first provide a theoretical analysis of several conventional scheduling policies in terms of the worst case slowdown compared with the outcome of an optimal off-line scheduling policy. It is shown that the best known algorithm in the literature achieves a worst case performance ratio of 1 + 1/f(n) where f(n) = O(n2/3) for any fixed m, which approaches to one by increasing n to the infinity. We then propose a new scheme that achieves better worst case ratio of 1 + 1/g(n) where g(n) = Θ (n/log n) for any fixed m, which approaches to one more quickly than previous schemes.

  • A Probabilistic Approach for the Determination of Sleep Interval in IEEE 802.16e

    Jung-Ryun REE  Jeong Woo LEE  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E92-B No:8
      Page(s):
    2743-2746

    The IEEE 802.16e standard adopts a power-saving mode (PSM) with a truncated binary exponent (TBE) algorithm for determining sleep intervals. Although the TBE algorithm allows more flexibility in determining sleep intervals, it does not consider the network delay of a response packet. In this letter, we suggest PSM that is based on the conditional probability density function (c-pdf) for the response packet's arrival time at the base station (BS). The proposed algorithm determines sleep interval placement so that the response packet may arrive at the BS during each sleep interval with the same conditional probability. The results show that the proposed algorithm outperforms the TBE algorithm with respect to the packet-buffering delay in the BS and the energy consumption of a mobile station (MS).

  • User-Defined On-Demand Matching

    Masaki NAKAMURA  Kazuhiro OGATA  Kokichi FUTATSUGI  

     
    PAPER-Computation and Computational Models

      Vol:
    E92-D No:7
      Page(s):
    1401-1411

    We propose a user-defined on-demand matching strategy, called O-matching, in which users can control the order of matching arguments of each operation symbol. In ordinary matching schemes it is not important to set the order of matching, however, in on-demand matching schemes, it is very important since an input term may be changed while doing the on-demand matching process. O-matching is suitable to combine with the E-strategy, which is a user-defined reduction strategy in which users can control the order of reducing arguments. We show a sufficient condition under which the E-strategy with O-matching is correct for head normal forms, that is, any reduced term is a head normal form.

  • Estimation of a Long-Term Variation of a Magnetic-Storm Index Using the Merging Particle Filter

    Shin'ya NAKANO  Tomoyuki HIGUCHI  

     
    PAPER

      Vol:
    E92-D No:7
      Page(s):
    1382-1387

    The Dst index is the most popular measure of a scale of magnetic storms, and it is widely used as a monitor of the conditions of the Earth's magnetosphere. Since the Dst index contains contributions from multiple magnetospheric phenomena, it is important to distinguish each of the contributions in order to obtain meaningful information about the conditions of the magnetosphere. There have been several efforts which modeled temporal evolution of the Dst index empirically, and these empirical models considers some contributions separately. However, they take only short-term varations into accout, and contributions from phenomena which show long-term variations are neglected. In the present study, we have developed a technique for estimating the component of long-term variations of the Dst index using solar wind data and a nonlinear empirical model. The newly-developed technique adopts an algorithm which is similar to the particle filter. This algorithm allows an on-line processing of a long sequence of Dst data, which would enable a real-time estimation of system variables in a nonlinear system model. The estimates of the long-term variations can be used for accurate estimation of other contributions to the Dst index, which would provide credible information about the conditions of the magnetosphere. The framework proposed in the present study could be applied for the purpose of continuous real-time monitoring of the environment of the magnetosphere.

  • More Efficient Threshold Signature Scheme in Gap Diffie-Hellman Group

    DaeHun NYANG  Akihiro YAMAMURA  

     
    LETTER-Cryptography and Information Security

      Vol:
    E92-A No:7
      Page(s):
    1720-1723

    By modifying the private key and the public key setting in Boneh-Lynn-Shacham's short signature shcheme, a variation of BLS' short signature scheme is proposed. Based on this variation, we present a very efficient threshold signature scheme where the number of pairing computation for the signaure share verification reduces to half.

  • Spatial-Temporal Combining-Based ZF Detection in Ultra-Wideband Communications

    Jinyoung AN  Sangchoon KIM  

     
    LETTER-Communication Theory and Signals

      Vol:
    E92-A No:7
      Page(s):
    1727-1730

    The performance of ultra-wideband (UWB) multiple input multiple output (MIMO) receiver based on the RAKE maximal ratio combiner (MRC) followed by a zero forcing (ZF) detector is analytically examined. For a UWB MIMO system with NT transmit antennas, NR receive antennas, and L resolvable multipath components, the proposed MIMO detection scheme is shown to have the diversity order of LNR-NT+1 and its analytical error rate expression is presented in a log-normal fading channel. We also compare the analytical BERs with the simulated results.

  • Effective Scheduling Algorithms for I/O Blocking with a Multi-Frame Task Model

    Shan DING  Hiroyuki TOMIYAMA  Hiroaki TAKADA  

     
    PAPER-System Programs

      Vol:
    E92-D No:7
      Page(s):
    1412-1420

    A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. Conventional hard real-time scheduling theories use framework of rate monotonic analysis (RMA) to schedule such I/O blocking tasks. However, most of them are pessimistic. In this paper, we propose effective algorithms that can schedule a task set which has I/O blocking tasks under dynamic priority assignment. We present a new critical instant theorem for the multi-frame task set under dynamic priority assignment. The schedulability is analyzed under the new critical instant theorem. For the schedulability analysis, this paper presents saturation summation which is used to calculate the maximum interference function (MIF). With saturation summation, the schedulability of a task set having I/O blocking tasks can be analyzed more accurately. We propose an algorithm which is called Frame Laxity Monotonic Scheduling (FLMS). A genetic algorithm (GA) is also applied. From our experiments, we can conclude that FLMS can significantly reduce the calculation time, and GA can improve task schedulability ratio more than is possible with FLMS.

  • Integrated Lithium Niobate Mach-Zehnder Interferometers for Advanced Modulation Formats Open Access

    Tetsuya KAWANISHI  Takahide SAKAMOTO  Akito CHIBA  

     
    INVITED PAPER

      Vol:
    E92-C No:7
      Page(s):
    915-921

    We present recent progress of high-speed Mach-Zehnder modulator technologies for advanced modulation formats. Multi-level quadrature amplitude modulation signal can be synthesized by using parallel Mach-Zehnder modulators. We can generate complicated multi-level optical signals from binary data streams, where binary modulated signals are vectorially summed in optical circuits. Frequency response of each Mach-Zehnder interferometer is also very important to achieve high-speed signals. We can enhance the bandwidth of the response, with thin substrate. 87 Gbaud modulation was demonstrated with a dual-parallel Mach-Zehnder modulator.

  • Recent Advances in Ultra-High-Speed Waveguide Photodiodes for Optical Communication Systems Open Access

    Kikuo MAKITA  Kazuhiro SHIBA  Takeshi NAKATA  Emiko MIZUKI  Sawaki WATANABE  

     
    INVITED PAPER

      Vol:
    E92-C No:7
      Page(s):
    922-928

    This paper describes the recent advances in semiconductor photodiodes for use in ultra-high-speed optical systems. We developed two types of waveguide photodiodes (WG-PD) -- an evanescently coupled waveguide photodiode (EC-WG-PD) and a separated-absorption-and-multiplication waveguide avalanche photodiode (WG-APD). The EC-WG-PD is very robust under high optical input operation because of its distribution of photo current density along the light propagation. The EC-WG-PD simultaneously exhibited a high external quantum efficiency of 70% for both 1310 and 1550 nm, and a wide bandwidth of more than 40 GHz. The WG-APD, on the other hand, has a wide bandwidth of 36.5 GHz and a gain-bandwidth product of 170 GHz as a result of its small waveguide mesa structure and a thin multiplication layer. Record high receiver sensitivity of -19.6 dBm at 40 Gbps was achieved. Additionally, a monolithically integrated dual EC-WG-PD for differential phase shift-keying (DPSK) systems was developed. Each PD has equivalent characteristics with 3-dB-down bandwidth of more than 40 GHz and external quantum efficiency of 70% at 1550 nm.

  • Synchronization Scheme for Frame Differential IR-UWB Receivers

    Jyh-Horng WEN  Hsi-Chou HSU  Po-Wei CHEN  

     
    PAPER-Transmission Systems and Transmission Equipment for Communications

      Vol:
    E92-B No:7
      Page(s):
    2389-2396

    Synchronization poses a major challenge in ultra wideband (UWB) systems due to low signal duty cycles in UWB. This study develops an effective synchronization scheme for frame-differential IR-UWB receivers to improve the synchronization speed. The proposed parallel search mechanism reduces the search region of the symbol boundaries to only a single frame duration. Moreover, only one delay element is needed in each branch, since a shared looped delay-line (SLD) is also proposed to lower the implementation complexity of the parallel search mechanism. Simulations and performance analysis show that the proposed scheme achieves a lower mean square error and a higher probability of detection than other alternatives.

  • Performance of Block-Double Differential Design for Broadband Cooperative Communications with Carrier Frequency Offsets

    Zhenzhen GAO  Shihua ZHU  Jing XU  Zhimeng ZHONG  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E92-B No:7
      Page(s):
    2507-2511

    In this letter, a relay-assisted transmission scenario over frequency-selective fading channels perturbed by different random carrier frequency offsets is considered. OFDM and block-double differential (BDD) design are implemented to overcome the problem of intersymbol interference (ISI) and carrier frequency offsets (CFOs). We analyze the symbol error rate (SER) performance of decode-and-forward relaying with BDD design in wireless cooperative communications over frequency-selective fading channels and derive a theoretical upper bound for average SER when the relay (R) is error free. It can be seen from our analysis that the system performance is influenced by the ability of R to decode, and when R decodes without error, both spatial and multipath diversity can be obtained without requiring any knowledge of channel state information and CFO information at the receivers. Numerical examples are provided to corroborate our theoretical analysis.

  • Preamble-Assisted Estimation for Frequency-Dependent I/Q Mismatch in Direct-Conversion OFDM Receivers

    Ming-Fu SUN  Terng-Yin HSU  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E92-B No:7
      Page(s):
    2426-2432

    In direct-conversion orthogonal frequency division multiplexing (OFDM) receivers, the impact of frequency-dependent I/Q mismatch (IQ-M) with carrier frequency offset (CFO) must be considered. A preamble-assisted estimation is developed to circumvent the frequency-dependent IQ-M with CFO. The results of a simulation and an experiment show that the proposed method could provide good estimation efficiency and enhance the system performance. Moreover, the proposed scheme is compatible with current wireless local area network standards.

  • A Synchronous Digital Duplexing Technique for OFDMA-Based Indoor Communications

    Chang-Hwan PARK  Yo-Han KO  Yeong-Jun KIM  Kyung-Won PARK  Won-Gi JEON  Jong-Ho PAIK  Seok-Pil LEE  Yong-Soo CHO  

     
    LETTER-Transmission Systems and Transmission Equipment for Communications

      Vol:
    E92-B No:7
      Page(s):
    2492-2495

    In this paper, we propose a new digital duplexing scheme, called synchronous digital duplexing (SDD), which can increase data efficiency and flexibility of resource by transmitting uplink signal and downlink signal simultaneously in wireless communication. In order to transmit uplink and downlink signals simultaneously, the proposed SDD obtains mutual information among subscriber stations (SSs) with a mutual ranging symbol. This information is used for selection of transmission time, decision on cyclic suffix (CS) insertion, determination of CS length, and re-establishment of FFT starting point.

  • An Efficient Algorithm for Sliding Window-Based Weighted Frequent Pattern Mining over Data Streams

    Chowdhury Farhan AHMED  Syed Khairuzzaman TANBEER  Byeong-Soo JEONG  Young-Koo LEE  

     
    PAPER

      Vol:
    E92-D No:7
      Page(s):
    1369-1381

    Traditional frequent pattern mining algorithms do not consider different semantic significances (weights) of the items. By considering different weights of the items, weighted frequent pattern (WFP) mining becomes an important research issue in data mining and knowledge discovery area. However, the existing state-of-the-art WFP mining algorithms consider all the data from the very beginning of a database to discover the resultant weighted frequent patterns. Therefore, their approaches may not be suitable for the large-scale data environment such as data streams where the volume of data is huge and unbounded. Moreover, they cannot extract the recent change of knowledge in a data stream adaptively by considering the old information which may not be interesting in the current time period. Another major limitation of the existing algorithms is to scan a database multiple times for finding the resultant weighted frequent patterns. In this paper, we propose a novel large-scale algorithm WFPMDS (Weighted Frequent Pattern Mining over Data Streams) for sliding window-based WFP mining over data streams. By using a single scan of data stream, the WFPMDS algorithm can discover important knowledge from the recent data elements. Extensive performance analyses show that our proposed algorithm is very efficient for sliding window-based WFP mining over data streams.

  • Statistical Mechanical Analysis of Simultaneous Perturbation Learning

    Seiji MIYOSHI  Hiroomi HIKAWA  Yutaka MAEDA  

     
    LETTER-Neural Networks and Bioengineering

      Vol:
    E92-A No:7
      Page(s):
    1743-1746

    We show that simultaneous perturbation can be used as an algorithm for on-line learning, and we report our theoretical investigation on generalization performance obtained with a statistical mechanical method. Asymptotic behavior of generalization error using this algorithm is on the order of t to the minus one-third power, where t is the learning time or the number of learning examples. This order is the same as that using well-known perceptron learning.

  • New Perfect Polyphase Sequences and Mutually Orthogonal ZCZ Polyphase Sequence Sets

    Fanxin ZENG  

     
    LETTER-Spread Spectrum Technologies and Applications

      Vol:
    E92-A No:7
      Page(s):
    1731-1736

    In communication systems, ZCZ sequences and perfect sequences play important roles in removing multiple-access interference (MAI) and synchronization, respectively. Based on an uncorrelated polyphase base sequence set, a novel construction method, which can produce mutually orthogonal (MO) ZCZ polyphase sequence (PS) sets and perfect PSs, is presented. The obtained ZCZ PSs of each set are of ideal periodic cross-correlation functions (PCCFs), in other words, the PCCFs between such two different sequences vanishes, and the sequences between different sets are orthogonal. On the other hand, the proposed perfect PSs include Frank perfect PSs as a special case and the family size of the former is quite larger than that of the latter.

  • Mobile Handsets as Sensing Nodes in an Auto-Configured Hierarchical Cognitive Radio Network Scheme for Immediate Post-Disaster Communications

    Sonia MAJID  Kazi AHMED  

     
    PAPER-Network

      Vol:
    E92-B No:7
      Page(s):
    2397-2405

    A critical problem after a natural/manmade disaster is to provide immediate post-disaster communication links between the disaster victims and some overlay networks. This paper proposes a novel scheme that uses the surviving Mobile handSets (MS) as sensing nodes to form an auto-configured Hierarchical Cognitive Radio Network (H-CRN). The implementation of this H-CRN is explained through detailed problem scenario statement and step-by-step implementation of automatic identification of emergency situation by the MS nodes. An overview of the cross-layer framework used by the MS nodes is also presented. This novel scheme is tested through some hypothesis along with probability calculations for successful identification of emergency situation, formation of ad hoc group and Emergency Beacon Message (EBM) transmission.

8861-8880hit(20498hit)