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

Keyword Search Result

[Keyword] IDT(386hit)

41-60hit(386hit)

  • Resource Management Architecture of Metro Aggregation Network for IoT Traffic Open Access

    Akira MISAWA  Masaru KATAYAMA  

     
    INVITED PAPER

      Pubricized:
    2017/09/19
      Vol:
    E101-B No:3
      Page(s):
    620-627

    IoT (Internet of Things) services are emerging and the bandwidth requirements for rich media communication services are increasing exponentially. We propose a virtual edge architecture comprising computation resource management layers and path bandwidth management layers for easy addition and reallocation of new service node functions. These functions are performed by the Virtualized Network Function (VNF), which accommodates terminals covering a corresponding access node to realize fast VNF migration. To increase network size for IoT traffic, VNF migration is limited to the VNF that contains the active terminals, which leads to a 20% reduction in the computation of VNF migration. Fast dynamic bandwidth allocation for dynamic bandwidth paths is realized by proposed Hierarchical Time Slot Allocation of Optical Layer 2 Switch Network, which attain the minimum calculation time of less than 1/100.

  • A Bandwidth Allocation Scheme to Improve Fairness and Link Utilization in Data Center Networks

    Yusuke ITO  Hiroyuki KOGA  Katsuyoshi IIDA  

     
    PAPER

      Pubricized:
    2017/09/19
      Vol:
    E101-B No:3
      Page(s):
    679-687

    Cloud computing, which enables users to enjoy various Internet services provided by data centers (DCs) at anytime and anywhere, has attracted much attention. In cloud computing, however, service quality degrades with user distance from the DC, which is unfair. In this study, we propose a bandwidth allocation scheme based on collectable information to improve fairness and link utilization in DC networks. We have confirmed the effectiveness of this approach through simulation evaluations.

  • Passive-Filter-Configuration-Based Reduction of Up-to-Several-Hundred-MHz EMI Noises in H-Bridge PWM Micro-Stepping Motor Driver Circuits

    Keonil KANG  Kyung-Young JUNG  Sang Won NAM  

     
    PAPER-Electromagnetic Theory

      Vol:
    E101-C No:2
      Page(s):
    104-111

    Recently, H-bridge pulse width modulation (PWM) micro-stepping motor drivers have been widely used for 3-D printers, robots, and medical instruments. Differently from a simple PWM motor driver circuit, the H-bridge PWM micro-stepping motor driver circuit can generate radio frequency (RF) electromagnetic interference (EMI) noises of up to several hundred MHz frequencies, due to digital interface circuits and a high-performance CPU. For medical instrument systems, the minimization of EMI noises can assure operating safety and greatly reduce the chance of malfunction between instruments. This work proposes a passive-filter configuration-based circuit design for reducing up-to-several-hundred-MHz EMI noises generated from the H-bridge PWM micro-stepping motor driver circuit. More specifically, the proposed RF EMI reduction approach consists of proper passive filter design, shielding in motor wires, and common ground design in the print circuit board. The proposed passive filter configuration design is validated through the overall reduction of EMI noises at RF band. Finally, the proposed EMI reduction approach is tested experientially through a prototype and about 16 dB average reduction of RF EMI noises is demonstrated.

  • A Bitwidth-Aware High-Level Synthesis Algorithm Using Operation Chainings for Tiled-DR Architectures

    Kotaro TERADA  Masao YANAGISAWA  Nozomu TOGAWA  

     
    PAPER

      Vol:
    E100-A No:12
      Page(s):
    2911-2924

    As application hardware designs and implementations in a short term are required, high-level synthesis is more and more essential EDA technique nowadays. In deep-submicron era, interconnection delays are not negligible even in high-level synthesis thus distributed-register and -controller architectures (DR architectures) have been proposed in order to cope with this problem. It is also profitable to take data-bitwidth into account in high-level synthesis. In this paper, we propose a bitwidth-aware high-level synthesis algorithm using operation chainings targeting Tiled-DR architectures. Our proposed algorithm optimizes bitwidths of functional units and utilizes the vacant tiles by adding some extra functional units to realize effective operation chainings to generate high performance circuits without increasing the total area. Experimental results show that our proposed algorithm reduces the overall latency by up to 47% compared to the conventional approach without area overheads by eliminating unnecessary bitwidths and adding efficient extra FUs for Tiled-DR architectures.

  • A Segmentation Method of Single- and Multiple-Touching Characters in Offline Handwritten Japanese Text Recognition

    Kha Cong NGUYEN  Cuong Tuan NGUYEN  Masaki NAKAGAWA  

     
    PAPER-Pattern Recognition

      Pubricized:
    2017/08/23
      Vol:
    E100-D No:12
      Page(s):
    2962-2972

    This paper presents a method to segment single- and multiple-touching characters in offline handwritten Japanese text recognition with practical speed. Distortions due to handwriting and a mix of complex Chinese characters with simple phonetic and alphanumeric characters leave optical handwritten text recognition (OHTR) for Japanese still far from perfection. Segmentation of characters, which touch neighbors on multiple points, is a serious unsolved problem. Therefore, we propose a method to segment them which is made in two steps: coarse segmentation and fine segmentation. The coarse segmentation employs vertical projection, stroke-width estimation while the fine segmentation takes a graph-based approach for thinned text images, which employs a new bridge finding process and Voronoi diagrams with two improvements. Unlike previous methods, it locates character centers and seeks segmentation candidates between them. It draws vertical lines explicitly at estimated character centers in order to prevent vertically unconnected components from being left behind in the bridge finding. Multiple candidates of separation are produced by removing touching points combinatorially. SVM is applied to discard improbable segmentation boundaries. Then, ambiguities are finally solved by the text recognition employing linguistic context and geometric context to recognize segmented characters. The results of our experiments show that the proposed method can segment not only single-touching characters but also multiple-touching characters, and each component in our proposed method contributes to the improvement of segmentation and recognition rates.

  • A Safe and Comprehensive Route Finding Algorithm for Pedestrians Based on Lighting and Landmark Conditions

    Siya BAO  Tomoyuki NITTA  Masao YANAGISAWA  Nozomu TOGAWA  

     
    PAPER-Intelligent Transport System

      Vol:
    E100-A No:11
      Page(s):
    2439-2450

    In this paper, we propose a safe and comprehensive route finding algorithm for pedestrians based on lighting and landmark conditions. Safety and comprehensiveness can be predicted by the five possible indicators: (1) lighting conditions, (2) landmark visibility, (3) landmark effectiveness, (4) turning counts along a route, and (5) road widths. We first investigate impacts of these five indicators on pedestrians' perceptions on safety and comprehensiveness during route findings. After that, a route finding algorithm is proposed for pedestrians. In the algorithm, we design the score based on the indicators (1), (2), (3), and (5) above and also introduce a turning count reduction strategy for the indicator (4). Thus we find out a safe and comprehensive route through them. In particular, we design daytime score and nighttime score differently and find out an appropriate route depending on the time periods. Experimental simulation results demonstrate that the proposed algorithm obtains higher scores compared to several existing algorithms. We also demonstrate that the proposed algorithm is able to find out safe and comprehensive routes for pedestrians in real environments in accordance with questionnaire results.

  • A Genetic Algorithm for Packing CAN FD Frame with Real-Time Constraints

    Shan DING  Gang ZENG  Ryo KURACHI  Ruifeng HUANG  

     
    PAPER-Software System

      Pubricized:
    2017/07/18
      Vol:
    E100-D No:10
      Page(s):
    2505-2514

    As a next-generation CAN (Controller Area Network), CAN FD (CAN with flexible data rate) has attracted much attention recently. However, how to use the improved bus bandwidth efficiently in CAN FD is still an issue. Contrasting with existing methods using greedy approximate algorithms, this paper proposes a genetic algorithm for CAN FD frame packing. It tries to minimize the bandwidth utilization by considering the different periods of signals when packing them in the same frame. Moreover, it also checks the schedulability of packed frames to guarantee the real-time constraints of each frame and proposed a merging algorithm to improve the schedulability for signal set with high bus load. Experimental results validate that the proposed algorithm can achieve significantly less bandwidth utilization and improved schedulability than existing methods for a given set of signals.

  • Experimental Verification of a Doppler Velocity Measurement Method with Second-Time-Around Echo Suppression for Synthetic Bandwidth Radars

    Kentaro ISODA  Teruyuki HARA  

     
    PAPER-Sensing

      Pubricized:
    2017/03/15
      Vol:
    E100-B No:10
      Page(s):
    1968-1975

    Range resolution is one of the metrics of radar performance. Synthetic bandwidth radar has been proposed for high-range-resolution. The transmitted frequency and down-conversion frequency of this type of radar are shifted by fixed amounts from pulse to pulse. Received signals are synthesized by taking IFFT for high-range-resolution. However, this type of radar has a problem with second-time-around echoes since multiple pulses are utilized. Moreover, a range shift occurs due to Doppler velocity. Thus second-time-around echo suppression and Doppler velocity compensation are required for accurate target range measurement. We show in this paper a Doppler velocity measurement method with second-time-around echo suppression for synthetic bandwidth radars. Our proposed method interleaves the transmission of ascending and descending frequency sequences. The Doppler velocity is measured by using a Fourier transform of the multiplication of the signals received using both sequences. The transmitted frequency difference of the adjacent pulses is wider than the bandwidth of the matched filter, so the second-time-around echoes are down-converted to the outside band of the matched filter and suppressed. We verify the principle of the proposed method using numerical simulations and experiments. The results show that second-time-around echoes were suppressed by 7.8dB, the Doppler velocity could be obtained and the range shift due to Doppler velocity was reduced by 7.37 times compared to the conventional SBR.

  • A Polynomial Time Pattern Matching Algorithm on Graph Patterns of Bounded Treewidth

    Takayoshi SHOUDAI  Takashi YAMADA  

     
    PAPER

      Vol:
    E100-A No:9
      Page(s):
    1764-1772

    This paper deals with a problem to decide whether a given graph structure appears as a pattern in the structure of a given graph. A graph pattern is a triple p=(V,E,H), where (V,E) is a graph and H is a set of variables, which are ordered lists of vertices in V. A variable can be replaced with an arbitrary connected graph by a kind of hyperedge replacements. A substitution is a collection of such replacements. The graph pattern matching problem (GPMP) is the computational problem to decide whether or not a given graph G is obtained from a given graph pattern p by a substitution. In this paper, we show that GPMP for a graph pattern p and a graph G is solvable in polynomial time if the length of every variable in p is 2, p is of bounded treewidth, and G is connected.

  • A Wide Bandwidth Current Mode Filter Technique Using High Power Efficiency Current Amplifiers with Complementary Input

    Tohru KANEKO  Yuya KIMURA  Masaya MIYAHARA  Akira MATSUZAWA  

     
    PAPER

      Vol:
    E100-C No:6
      Page(s):
    539-547

    60GHz wireless communication requires analog baseband circuits having a bandwidth of about 1GHz. This paper presents a wide bandwidth current-mode low pass filter technique which involves current amplifiers, resistors and capacitors. The proposed current-mode filter is obtained by replacing an integrator employing an op-amp with another integrator employing a current amplifier. With the low input impedance current amplifier having little variation of the input impedance, the proposed filter is expected to improve linearity and power efficiency. The proposed current amplifier which employs super source follower topology with complementary input is suitable for the filter because of its class AB operation. Although simulation results shows the conventional current amplifier which employs super source follower topology without the complementary input has 12Ω variation and 30Ω input impedance, the proposed current amplifier has 1Ω variation and 21Ω input impedance. A fourth order 1GHz bandwidth filter which involves the proposed current amplifiers is designed in a 65nm CMOS technology. The filter can achieve IIP3 of 1.3dBV and noise of 0.6mVrms with power consumption of 13mW under supply voltage of 1.2V according to simulation results with layout parasitic extraction models. Active area of the filter is 380μm×170μm.

  • Correlation-Based Optimal Chirp Rate Allocation for Chirp Spread Spectrum Using Multiple Linear Chirps

    Kwang-Yul KIM  Seung-Woo LEE  Yu-Min HWANG  Jae-Seang LEE  Yong-Sin KIM  Jin-Young KIM  Yoan SHIN  

     
    LETTER-Spread Spectrum Technologies and Applications

      Vol:
    E100-A No:4
      Page(s):
    1088-1091

    A chirp spread spectrum (CSS) system uses a chirp signal which changes the instantaneous frequency according to time for spreading a transmission bandwidth. In the CSS system, the transmission performance can be simply improved by increasing the time-bandwidth product which is known as the processing gain. However, increasing the transmission bandwidth is limited because of the spectrum regulation. In this letter, we propose a correlation-based chirp rate allocation method to improve the transmission performance by analyzing the cross-correlation coefficient in the same time-bandwidth product. In order to analyze the transmission performance of the proposed method, we analytically derive the cross-correlation coefficient according to the time-bandwidth separation product and simulate the transmission performance. The simulation results show that the proposed method can analytically allocate the optimal chirp rate and improve the transmission performance.

  • Design of Miniaturized and Bandwidth-Enhanced Implantable Antenna on Dielectric/Ferrite Substrate for Wireless Biotelemetry

    Jae-Ho LEE  Dong-Wook SEO  

     
    PAPER

      Vol:
    E100-B No:2
      Page(s):
    227-233

    A miniaturized and bandwidth-enhanced implantable antenna is designed for wireless biotelemetry in the medical implantable communications service (MICS) frequency band of 402-405MHz. To reduce the antenna size and enhance the available bandwidth with regard to the reflection coefficients, a meandered planar inverted-F antenna (PIFA) structure is adopted on a dielectric/ferrite substrate which is an artificial magneto-dielectric material. The potential of the proposed antenna for the intended applications is verified through prototype fabrication and measurement with a 2/3 human muscle phantom. Good agreement is observed between the simulation and measurement in terms of resonant characteristics and gain radiation patterns; the bandwidth is enhanced in comparison with that of the ferrite-removed antenna, and antenna gain of -27.7dB is obtained in the measurement. Allowances are made for probable fabrication inaccuracies and practical operating environments. An analysis of 1-g SAR distribution is conducted to confirm compliance with the specific absorption rate limitation (1.6W/kg) of the American National Standards Institute (ANSI).

  • Recommendation-Based Bandwidth Calendaring for Packet Transport Network

    Shohei KAMAMURA  Rie HAYASHI  Hiroki DATE  Hiroshi YAMAMOTO  Takashi MIYAMURA  Yoshihiko UEMATSU  Kouichi GENDA  

     
    PAPER-Network

      Pubricized:
    2016/08/04
      Vol:
    E100-B No:1
      Page(s):
    122-130

    This paper proposes a recommendation-based bandwidth calendaring system for packet transport networks. The system provides a user-portal interface with which users can directly reserve packet transport resources. In this regard, the system recommends multi-grade (e.g., multi-price) reservation plans. By adjusting grades of plans in accordance with network resource utilization, this system provides not only reservation flexibility for users but also efficient utilization of network resources. For recommending multi-grade plans, pre-computation of resource allocation is required for every time slot. Because the number of time slots is huge, we also propose an algorithm for fast computation of resource allocation based on time-slot aggregation. Our evaluation suggests that our algorithm can produce a sub-optimal solution within quasi-real time for a large-scale network. We also show that our recommendation-based system can increase the service-provider-revenue in peaky traffic demand environments.

  • Resource Allocation Method of Service Chaining for Guaranteeing Minimum Bandwidth and High Resource Utilization

    Hirofumi YAMAZAKI  Konomi MOCHIZUKI  Shunsuke HOMMA  Koji SUGISONO  Masaaki OMOTANI  

     
    PAPER-Network

      Pubricized:
    2016/07/19
      Vol:
    E100-B No:1
      Page(s):
    98-109

    Service chaining (SC) is a method for realizing a service by transferring flows among several service functions (SFs) that process packets. A route among SFs is called a service path (SP). Service chaining is being developed to reduce costs, increase flexibility, and shorten time-to-market. SC technologies are expected to be applied to carrier networks so that large communication carriers benefit from them. We assume that SPs process the traffic of services that treat all users in the same way such as an Internet access service for home users. An SP processes flows from several users. We do not assume that each SP is assigned to a user. Because a carrier network accommodates many users, each service will be heavily utilized. Therefore, it is assumed that the amount of traffic of a service is larger than the resource of an SF apparatus. Several SPs are required to process the traffic. SPs are supposed to meet two requirements. One is guaranteeing minimum bandwidth. The other is reducing the number of SF apparatuses, i.e., high resource utilization. Resource utilization depends on the combination of the resource quantities of SF apparatuses. Network operators have to determine the bandwidth of each SP within the range from the minimum bandwidth to the resource quantities of SF apparatuses to maximize resource utilization. Methods for determining the bandwidth of each SP have not been proposed for meeting the two requirements. Therefore, we propose a resource allocation method for this purpose. The proposed method determines the bandwidth of each SP on the basis of the combination of the resource quantities of SF apparatuses for guaranteeing the minimum bandwidth and maximizing resource utilization and allocates necessary resources to each SP. We also evaluate the proposed method and confirm that it can guarantee the minimum bandwidth of SPs and achieve high resource utilization regardless of the combination of the resource quantities of SF apparatuses. Although SF apparatuses are generally produced without considering the combinations of resource quantities of SF apparatuses in SPs, the proposed method can provide more options for selecting SF apparatuses.

  • Isolation Enhanced Multiway Power Divider for Wideband (4:1) Beamforming Arrays

    Dooheon YANG  Minyoung YOON  Sangwook NAM  

     
    BRIEF PAPER-Microwaves, Millimeter-Waves

      Vol:
    E99-C No:12
      Page(s):
    1327-1330

    This paper proposes a multiway power divider for wideband (4:1) beamforming arrays. The divider's input reflection characteristic (S11) is achieved using a multisection stepped-impedance transformer. Moreover, the divider's isolation (S32) bandwidth is increased by incorporating inductors and capacitors in addition to the conventional resistor only isolation networks of the divider. The analysis of the proposed divider and comparison with the previous research model was conducted with four-way configuration. A prototype of a wideband eight-way power divider is fabricated and measured. The measured fractional bandwidth is about 137% from 1.3 to 6.8GHz with the -10dB criteria of input reflection (S11), output reflection (S22) and isolation (S32) simultaneously.

  • Distributed Optimization in Transportation and Logistics Networks Open Access

    K. Y. Michael WONG  David SAAD  Chi Ho YEUNG  

     
    INVITED PAPER

      Vol:
    E99-B No:11
      Page(s):
    2237-2246

    Many important problems in communication networks, transportation networks, and logistics networks are solved by the minimization of cost functions. In general, these can be complex optimization problems involving many variables. However, physicists noted that in a network, a node variable (such as the amount of resources of the nodes) is connected to a set of link variables (such as the flow connecting the node), and similarly each link variable is connected to a number of (usually two) node variables. This enables one to break the problem into local components, often arriving at distributive algorithms to solve the problems. Compared with centralized algorithms, distributed algorithms have the advantages of lower computational complexity, and lower communication overhead. Since they have a faster response to local changes of the environment, they are especially useful for networks with evolving conditions. This review will cover message-passing algorithms in applications such as resource allocation, transportation networks, facility location, traffic routing, and stability of power grids.

  • A Wideband Asymmetric Digital Predistortion Architecture for 60 GHz Short Range Wireless Transmitters

    Kenji MIYANAGA  Masashi KOBAYASHI  Noriaki SAITO  Naganori SHIRAKATA  Koji TAKINAMI  

     
    PAPER

      Vol:
    E99-C No:10
      Page(s):
    1190-1199

    This paper presents a wideband digital predistortion (DPD) architecture suitable for wideband wireless systems, such as IEEE 802.11ad/WiGig, where low oversampling ratio of the digital-to-analog converter (DAC) is a bottleneck for available linearization bandwidth. In order to overcome the bandwidth limitation in the conventional DPD, the proposed DPD introduces a complex coefficient filter in the DPD signal processing, which enables it to achieve asymmetric linearization. This approach effectively suppresses one side of adjacent channel leakages with twice the bandwidth as compared to the conventional DPD. The concept is verified through system simulation and measurements. Using a scaled model of a 2 GHz RF carrier frequency, the measurement shows a 4.2 dB advantage over the conventional DPD in terms of adjacent channel leakage.

  • Statistical Bandwidth Extension for Speech Synthesis Based on Gaussian Mixture Model with Sub-Band Basis Spectrum Model

    Yamato OHTANI  Masatsune TAMURA  Masahiro MORITA  Masami AKAMINE  

     
    PAPER-Voice conversion

      Pubricized:
    2016/07/19
      Vol:
    E99-D No:10
      Page(s):
    2481-2489

    This paper describes a novel statistical bandwidth extension (BWE) technique based on a Gaussian mixture model (GMM) and a sub-band basis spectrum model (SBM), in which each dimensional component represents a specific acoustic space in the frequency domain. The proposed method can achieve the BWE from speech data with an arbitrary frequency bandwidth whereas the conventional methods perform the conversion from fixed narrow-band data. In the proposed method, we train a GMM with SBM parameters extracted from full-band spectra in advance. According to the bandwidth of input signal, the trained GMM is reconstructed to the GMM of the joint probability density between low-band SBM and high-band SBM components. Then high-band SBM components are estimated from low-band SBM components of the input signal based on the reconstructed GMM. Finally, BWE is achieved by adding the spectra decoded from estimated high-band SBM components to the ones of the input signal. To construct the full-band signal from the narrow-band one, we apply this method to log-amplitude spectra and aperiodic components. Objective and subjective evaluation results show that the proposed method extends the bandwidth of speech data robustly for the log-amplitude spectra. Experimental results also indicate that the aperiodic component extracted from the upsampled narrow-band signal realizes the same performance as the restored and the full-band aperiodic components in the proposed method.

  • Fast and Flow-Controlled Multi-Stage Network Recovery from Large-Scale Physical Failures

    Kouichi GENDA  Hiroshi YAMAMOTO  Shohei KAMAMURA  

     
    PAPER-Network

      Pubricized:
    2016/03/01
      Vol:
    E99-B No:8
      Page(s):
    1824-1834

    When a massive network disruption occurs, repair of the damaged network takes time, and the recovery process involves multiple stages. We propose a fast and flow-controlled multi-stage network recovery method for determining the pareto-optimal recovery order of failed physical components reflecting the balance requirement between maximizing the total amount of traffic on all logical paths, called total network flow, and providing adequate logical path flows. The pareto-optimal problem is formulated by mixed integer linear programming (MILP). A heuristic algorithm, called the grouped-stage recovery (GSR), is also introduced to solve the problem when the problem formulated by MILP is computationally intractable in a large-scale failure. The effectiveness of the proposed method was numerically evaluated. The results show that the pareto-optimal recovery order can be determined from the balance between total network flow and adequate logical path flows, the allocated minimum bandwidth of the logical path can be drastically improved while maximizing total network flow, and the proposed method with GSR is applicable to large-scale failures because a nearly optimal recovery order with less than 10% difference rate can be determined within practical computation time.

  • Optical DP-High Order-QAM Transmission System for High-Speed Short Links Utilizing Copropagating Twin Local Lights

    Hiroto KAWAKAMI  Takayuki KOBAYASHI  Yutaka MIYAMOTO  

     
    PAPER-Transmission Systems and Transmission Equipment for Communications

      Vol:
    E99-B No:8
      Page(s):
    1799-1804

    A novel optical high order quadrature amplitude modulation (QAM) transmission system for high-speed short links is described. Dual-polarization (DP) QAM and twin local lights are generated from one light source in the system, and these lightwaves are simultaneously transmitted via standard single mode fiber. The receiver can be constructed simply because it does not require a coherent light source under wavelength control. The system enables a 3.1 Gbaud DP-16-QAM signal to be successfully demodulated after 80-km transmission without using an optical dispersion compensator. It also achieves high tolerance against phase noise in the signal light source.

41-60hit(386hit)