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

Keyword Search Result

[Keyword] EE(4079hit)

601-620hit(4079hit)

  • In-Vehicle Voice Interface with Improved Utterance Classification Accuracy Using Off-the-Shelf Cloud Speech Recognizer

    Takeshi HOMMA  Yasunari OBUCHI  Kazuaki SHIMA  Rintaro IKESHITA  Hiroaki KOKUBO  Takuya MATSUMOTO  

     
    PAPER-Speech and Hearing

      Pubricized:
    2018/08/31
      Vol:
    E101-D No:12
      Page(s):
    3123-3137

    For voice-enabled car navigation systems that use a multi-purpose cloud speech recognition service (cloud ASR), utterance classification that is robust against speech recognition errors is needed to realize a user-friendly voice interface. The purpose of this study is to improve the accuracy of utterance classification for voice-enabled car navigation systems when inputs to a classifier are error-prone speech recognition results obtained from a cloud ASR. The role of utterance classification is to predict which car navigation function a user wants to execute from a spontaneous utterance. A cloud ASR causes speech recognition errors due to the noises that occur when traveling in a car, and the errors degrade the accuracy of utterance classification. There are many methods for reducing the number of speech recognition errors by modifying the inside of a speech recognizer. However, application developers cannot apply these methods to cloud ASRs because they cannot customize the ASRs. In this paper, we propose a system for improving the accuracy of utterance classification by modifying both speech-signal inputs to a cloud ASR and recognized-sentence outputs from an ASR. First, our system performs speech enhancement on a user's utterance and then sends both enhanced and non-enhanced speech signals to a cloud ASR. Speech recognition results from both speech signals are merged to reduce the number of recognition errors. Second, to reduce that of utterance classification errors, we propose a data augmentation method, which we call “optimal doping,” where not only accurate transcriptions but also error-prone recognized sentences are added to training data. An evaluation with real user utterances spoken to car navigation products showed that our system reduces the number of utterance classification errors by 54% from a baseline condition. Finally, we propose a semi-automatic upgrading approach for classifiers to benefit from the improved performance of cloud ASRs.

  • Design and Analysis of A Low-Power High-Speed Accuracy-Controllable Approximate Multiplier

    Tongxin YANG  Tomoaki UKEZONO  Toshinori SATO  

     
    PAPER

      Vol:
    E101-A No:12
      Page(s):
    2244-2253

    Multiplication is a key fundamental function for many error-tolerant applications. Approximate multiplication is considered to be an efficient technique for trading off energy against performance and accuracy. This paper proposes an accuracy-controllable multiplier whose final product is generated by a carry-maskable adder. The proposed scheme can dynamically select the length of the carry propagation to satisfy the accuracy requirements flexibly. The partial product tree of the multiplier is approximated by the proposed tree compressor. An 8×8 multiplier design is implemented by employing the carry-maskable adder and the compressor. Compared with a conventional Wallace tree multiplier, the proposed multiplier reduced power consumption by between 47.3% and 56.2% and critical path delay by between 29.9% and 60.5%, depending on the required accuracy. Its silicon area was also 44.6% smaller. In addition, results from two image processing applications demonstrate that the quality of the processed images can be controlled by the proposed multiplier design.

  • Phase Locking Value Calculator Based on Hardware-Oriented Mathematical Expression

    Tomoki SUGIURA  Jaehoon YU  Yoshinori TAKEUCHI  

     
    PAPER

      Vol:
    E101-A No:12
      Page(s):
    2254-2261

    A phase locking value (PLV) in electrocorticography is an essential indicator for analysis of cognitive activities and detection of severe diseases such as seizure of epilepsy. The PLV computation requires a simultaneous pursuit of high-throughput and low-cost implementation in hardware acceleration. The PLV computation consists of bandpass filtering, Hilbert transform, and mean phase coherence (MPC) calculation. The MPC calculation includes trigonometric functions and divisions, and these calculations require a lot of computational amounts. This paper proposes an MPC calculation method that removes high-cost operations from the original MPC with mathematically identical derivations while the conventional methods sacrifice either computational accuracy or throughput. This paper also proposes a hardware implementation of MPC calculator whose latency is 21 cycles and pipeline interval is five cycles. Compared with the conventional implementation with the same standard cell library, the proposed implementation marks 2.8 times better hardware implementation efficiency that is defined as throughput per gate counts.

  • Extending Distributed-Based Transversal Filter Method to Spectral Amplitude Encoded CDMA

    Jorge AGUILAR-TORRENTERA  Gerardo GARCÍA-SÁNCHEZ  Ramón RODRÍGUEZ-CRUZ  Izzat Z. DARWAZEH  

     
    PAPER-Electronic Circuits

      Vol:
    E101-C No:12
      Page(s):
    953-962

    In this paper, the analog code modulation characteristics of distributed-based transversal filters (DTFs) suitable for use in spectrally encoded CDMA systems are presented. The DTF is verified as an appropriate method to use in high-speed CDMA systems as opposed to previously proposed methods, which are intended for Direct Sequence (DS) CDMA systems. The large degree of freedom of DTF design permits controlling the filter pulse response to generate well specified temporal phase-coded signals. A decoder structure that performs bipolar detection of user subbands giving rise to a Spectral-Amplitude Encoded CDMA system is considered. Practical implementations require truncating the spreading signals by a time window of duration equal to the span time of the tapped delay line. Filter functions are chosen to demodulate the matched channel and achieve improved user interference rejection avoiding the need for transversal filters featuring a large number of taps. As a proof-of-concept of the electronic SAE scheme, practical circuit designs are developed at low speeds (3-dB point at 1 GHz) demonstrating the viability of the proposal.

  • New Classes of Optimal Low Hit Zone Frequency Hopping Sequence Set with Large Family Size

    Long LING  Xianhua NIU  Bosen ZENG  Xing LIU  

     
    LETTER-Sequence

      Vol:
    E101-A No:12
      Page(s):
    2213-2216

    The construction of frequency hopping sequences with good Hamming correlation is the foundation of research in frequency hopping communication. In this letter, classes of optimal low hit zone frequency hopping sequence set are constructed based on the interleaving technology. The results of the study show that the sequence set with large family size is optimal for the Peng-Fan-Lee bound. And all the sequences in the set are inequivalent.

  • Two Constructions of Semi-Bent Functions with Perfect Three-Level Additive Autocorrelation

    Deng TANG  Shaojing FU  Yang YANG  

     
    LETTER-Cryptography and Information Security

      Vol:
    E101-A No:12
      Page(s):
    2402-2404

    Semi-bent functions have very high nonlinearity and hence they have many applications in symmetric-key cryptography, binary sequence design for communications, and combinatorics. In this paper, we focus on studying the additive autocorrelation of semi-bent functions. We provide a lower bound on the maximum additive autocorrelation absolute value of semi-bent functions with three-level additive autocorrelation. Semi-bent functions with three-level additive autocorrelation achieving this bound with equality are said to have perfect three-level additive autocorrelation. We present two classes of balanced semi-bent functions with optimal algebraic degree and perfect three-level additive autocorrelation.

  • Order Adjustment Approach Using Cayley Graphs for the Order/Degree Problem

    Teruaki KITASUKA  Takayuki MATSUZAKI  Masahiro IIDA  

     
    PAPER-Graph Algorithms

      Pubricized:
    2018/09/18
      Vol:
    E101-D No:12
      Page(s):
    2908-2915

    The order/degree problem consists of finding the smallest diameter graph for a given order and degree. Such a graph is beneficial for designing low-latency networks with high performance for massively parallel computers. The average shortest path length (ASPL) of a graph has an influence on latency. In this paper, we propose a novel order adjustment approach. In the proposed approach, we search for Cayley graphs of the given degree that are close to the given order. We then adjust the order of the best Cayley graph to meet the given order. For some order and degree pairs, we explain how to derive the smallest known graphs from the Graph Golf 2016 and 2017 competitions.

  • Enhanced F-RIT Protocol for Wireless Smart Utility Networks with High Traffic Bi-Directional Communications

    Ryota OKUMURA  Jun FUJIWARA  Keiichi MIZUTANI  Hiroshi HARADA  

     
    PAPER-Terrestrial Wireless Communication/Broadcasting Technologies

      Pubricized:
    2018/05/30
      Vol:
    E101-B No:12
      Page(s):
    2487-2497

    In this paper, an enhanced feathery receiver initiated transmission (eF-RIT) protocol is proposed for wireless smart utility network (Wi-SUN) systems with high traffic bi-directional communications such as emergency gas automatic meter infrastructure (AMI) cases. Firstly, we evaluate the conventional F-RIT protocol by simulation and experiment. The measurement results show that the IEEE 802.15.4e compliant conventional F-RIT protocol can achieve over 90% transmission success rates under the practical AMI specified conditions. However, the transmission success rates decline in high traffic environments. Detailed analyses indicate the degradation of the performance is caused by the timeout problem which occurs when the destination terminal is in the wait duration of the data transmission, and so does not transmit an RIT data request frame. To overcome this problem, we propose the eF-RIT protocol that suppresses the frequency of timeout occurrence. The proposed eF-RIT protocol is also evaluated by simulation and experiment. The evaluation results indicate that the proposed eF-RIT protocol reduces the incident of timeout by up to 31%, and achieves transmission success rates as high as 90% when the data generation rate is 1.0×10-2s-1.

  • Enhancing Job Scheduling on Inter-Rackscale Datacenters with Free-Space Optical Links

    Yao HU  Michihiro KOIBUCHI  

     
    PAPER-Information networks

      Pubricized:
    2018/09/18
      Vol:
    E101-D No:12
      Page(s):
    2922-2932

    Datacenter growth in traffic and scale is driving innovations in constructing tightly-coupled facilities with low-latency communication for different specific applications. A famous custom design is rackscale (RS) computing by gathering key server resource components into different resource pools. Such a resource-pooling implementation requires a new software stack to manage resource discovery, resource allocation and data communication. The reconfiguration of interconnection networks on their components is potentially needed to support the above demand in RS. In this context as an evolution of the original RS architecture the inter-rackscale (IRS) architecture, which disaggregates hardware components into different racks according to their own areas, has been proposed. The heart of IRS is to use a limited number of free-space optics (FSO) channels for wireless connections between different resource racks, via which selected pairs of racks can communicate directly and thus resource-pooling requirements are met without additional software management. In this study we evaluate the influences of FSO links on IRS networks. Evaluation results show that FSO links reduce average communication hop count for user jobs, which is close to the best possible value of 2 hops and thus provides comparable benchmark performance to that of the counterpart RS architecture. In addition, if four FSO terminals per rack are allowed, the CPU/SSD (GPU) interconnection latency is reduced by 25.99% over Fat-tree and by 67.14% over 2-D Torus. We also present the advantage of an FSO-equipped IRS system in average turnaround time of dispatched jobs for given sets of benchmark workloads.

  • High-Performance Super-Resolution via Patch-Based Deep Neural Network for Real-Time Implementation

    Reo AOKI  Kousuke IMAMURA  Akihiro HIRANO  Yoshio MATSUDA  

     
    PAPER-Image Processing and Video Processing

      Pubricized:
    2018/08/20
      Vol:
    E101-D No:11
      Page(s):
    2808-2817

    Recently, Super-resolution convolutional neural network (SRCNN) is widely known as a state of the art method for achieving single-image super resolution. However, performance problems such as jaggy and ringing artifacts exist in SRCNN. Moreover, in order to realize a real-time upconverting system for high-resolution video streams such as 4K/8K 60 fps, problems such as processing delay and implementation cost remain. In the present paper, we propose high-performance super-resolution via patch-based deep neural network (SR-PDNN) rather than a convolutional neural network (CNN). Despite the very simple end-to-end learning system, the SR-PDNN achieves higher performance than the conventional CNN-based approach. In addition, this system is suitable for ultra-low-delay video processing by hardware implementation using an application-specific integrated circuit (ASIC) or a field-programmable gate array (FPGA).

  • Adjusting Holdoff Algorithm Dynamically According to Network Conditions for Improving Performance of Wireless Mesh Networks

    Santong LI  Xuejun TIAN  Takashi OKUDA  

     
    PAPER-Fundamental Theories for Communications

      Pubricized:
    2018/05/11
      Vol:
    E101-B No:11
      Page(s):
    2250-2258

    Unlike Wi-Fi, Broadband Wireless Access (BWA) technology provides a high-speed communication in a wide area. The IEEE 802.16 (WiMAX) standard of wireless mesh networks is one of the widely used BWA standards. WiMAX mesh mode achieves data transmission in conflict-free manner in multihop networks by using the control messages (three way handshake messages or MSH-DSCH messages) to reserve channel for sending data. Concurrently, the coordination of three way handshake messages depends on the mechanism named Election based Transmission Timing (EBTT). However, IEEE 802.16 mesh mode uses a static holdoff algorithm, which leads to a low performance in the majority of cases. In this paper, after analyzing the IEEE 802.16 mesh mode with coordinated distributed scheduling, we propose a novel method to improve the throughput by a dynamic holdoff algorithm. The simulation results show that our proposal gets a better throughput performance.

  • A Summer-Embedded Sense Amplifier for High-Speed Decision Feedback Equalizer

    Il-Min YI  Naoki MIURA  Hiroyuki FUKUYAMA  Hideyuki NOSAKA  

     
    LETTER-VLSI Design Technology and CAD

      Vol:
    E101-A No:11
      Page(s):
    1949-1951

    A summer-embedded sense amplifier (SE SA) is proposed to reduce feedback loop delay (TFB) in a decision feedback equalizer (DFE). In the SE SA, the position of the ISI compensator is changed from the latch input to the latch output, and hence the TFB is reduced. The simulated DFE achieves 32Gb/s and 66fJ/b with a 1-V 65-nm CMOS process.

  • Multiple Symbol Differential Detection Scheme for IEEE 802.15.4 BPSK Receivers

    Gaoyuan ZHANG  Hong WEN  Longye WANG  Xiaoli ZENG  Jie TANG  Runfa LIAO  Liang SONG  

     
    LETTER-Communication Theory and Signals

      Vol:
    E101-A No:11
      Page(s):
    1975-1979

    A simple and novel multiple-symbol differential detection (MSDD) scheme is proposed for IEEE 802.15.4 binary phase shift keying (BPSK) receivers. The detection is initiated by estimating and compensating the carrier frequency offset (CFO) effect in the chip sample of interest. With these new statistics, the decisions are jointly made by allowing the observation window length to be longer than two bit intervals. Simulation results demonstrate that detection reliability of the IEEE 802.15.4 BPSK receivers is significantly improved. Namely, at packet error rate (PER) of 1×10-3, the signal-to-noise ratio (SNR) gap between ideal coherent detection (perfect carrier reference phase and no CFO) with differential decoding and conventional optimal single differential coherent detection (SDCD) is filled by 2.1dB when the observation window length is set to 6bit intervals. Then, the benefit that less energy consumed by retransmissions is successfully achieved.

  • Critical Nodes Identification of Power Grids Based on Network Efficiency

    WenJie KANG  PeiDong ZHU  JieXin ZHANG  JunYang ZHANG  

     
    PAPER-Information Network

      Pubricized:
    2018/07/27
      Vol:
    E101-D No:11
      Page(s):
    2762-2772

    Critical nodes identification is of great significance in protecting power grids. Network efficiency can be used as an evaluation index to identify the critical nodes and is an indicator to quantify how efficiently a network exchanges information and transmits energy. Since power grid is a heterogeneous network and can be decomposed into small functionally-independent grids, the concept of the Giant Component does not apply to power grids. In this paper, we first model the power grid as the directed graph and define the Giant Efficiency sub-Graph (GEsG). The GEsG is the functionally-independent unit of the network where electric energy can be transmitted from a generation node (i.e., power plants) to some demand nodes (i.e., transmission stations and distribution stations) via the shortest path. Secondly, we propose an algorithm to evaluate the importance of nodes by calculating their critical degree, results of which can be used to identify critical nodes in heterogeneous networks. Thirdly, we define node efficiency loss to verify the accuracy of critical nodes identification (CNI) algorithm and compare the results that GEsG and Giant Component are separately used as assessment criteria for computing the node efficiency loss. Experiments prove the accuracy and efficiency of our CNI algorithm and show that the GEsG can better reflect heterogeneous characteristics and power transmission of power grids than the Giant Component. Our investigation leads to a counterintuitive finding that the most important critical nodes may not be the generation nodes but some demand nodes.

  • Gain Relaxation: A Solution to Overlooked Performance Degradation in Speech Recognition with Signal Enhancement

    Ryoji MIYAHARA  Akihiko SUGIYAMA  

     
    PAPER-Digital Signal Processing, Speech and Hearing

      Vol:
    E101-A No:11
      Page(s):
    1832-1840

    This paper proposes gain relaxation in signal enhancement designed for speech recognition. Gain relaxation selectively applies softer enhancement of a target signal to eliminate potential degradation in speech recognition caused by small undesirable distortion in the target signal components. The softer enhancement is a solution to overlooked performance degradation in signal enhancement combined with speech recognition which is encountered in commercial products with an unaware small local noise source. Evaluation of directional interference suppression with signals recorded by a commercial PC (personal computer) demonstrates that signal enhancement over the input is achieved without sacrificing the performance for clean speech.

  • Deep Convolutional Neural Networks for Manga Show-Through Cancellation

    Taku NAKAHARA  Kazunori URUMA  Tomohiro TAKAHASHI  Toshihiro FURUKAWA  

     
    LETTER-Image Processing and Video Processing

      Pubricized:
    2018/08/02
      Vol:
    E101-D No:11
      Page(s):
    2844-2848

    Recently, the demand for the digitization of manga is increased. Then, in the case of an old manga where the original pictures have been lost, we have to digitize it from comics. However, the show-through phenomenon would be caused by scanning of the comics since it is represented as the double sided images. This letter proposes the manga show-through cancellation method based on the deep convolutional neural network (CNN). Numerical results show that the effectiveness of the proposed method.

  • Analysis of Super-Steep Subthreshold Slope Body-Tied SOI MOSFET and its Possibility for Ultralow Voltage Application

    Takayuki MORI  Jiro IDA  

     
    PAPER-Semiconductor Materials and Devices

      Vol:
    E101-C No:11
      Page(s):
    916-922

    In this paper, we review a super-steep subthreshold slope (SS) (<1 mV/dec) body-tied (BT) silicon on insulator (SOI) metal oxide semiconductor field effect transistor (MOSFET) fabricated with 0.15 µm SOI technology and discuss the possibility of its use in ultralow voltage applications. The mechanism of the super-steep SS in the BT SOI MOSFET was investigated with technology computer-aided design simulation. The gate length/width and Si thickness optimizations promise further reductions in operation voltage, as well as improvement of the ION/IOFF ratio. In addition, we demonstrated control of the threshold voltage and hysteresis characteristics using the substrate and body bias in the BT SOI MOSFET.

  • Distributed Energy Efficient Resource Allocation for OFDMA Smallcell Networks

    Guodong ZHANG  Shibing ZHANG  Zhihua BAO  

     
    PAPER-Terrestrial Wireless Communication/Broadcasting Technologies

      Pubricized:
    2018/04/27
      Vol:
    E101-B No:11
      Page(s):
    2362-2370

    Smallcells have recently emerged as a potential approach for local area deployments that can satisfy high data rate requirements, reduce energy consumption and enhance network coverage. In this paper, we work on maximizing the weighted sum energy efficiency (WS-EE) for densely deployed smallcell networks. Due to the combinatorial and the general fractional program nature of the resource allocation problem, WS-EE maximization is non-convex and the optimal joint resource blocks (RBs) and power allocation is NP-hard. To solve this complex problem, we propose to decompose the primal problem into two subproblems (referred as RBs allocation and power control) and solve the subproblems sequentially. For the RBs allocation subproblem given any feasible network power profile, the optimal solution can be solved by maximizing throughput locally. For the power control subproblem, we propose to solve it locally based on a new defined pricing factor. Then, a distributed power control algorithm with guaranteed convergence is designed to achieve a Karush-Kuhn-Tucker (KKT) point of the primal problem. Simulation results verify the performance improvement of our proposed resource allocation scheme in terms of WS-EE. Besides, the performance evaluation shows the tradeoff between the WS-EE and the sum rate of the smallcell networks.

  • A Load Balancing Algorithm for Layer 2 Routing in IEEE 802.15.10

    Takuya HABARA  Keiichi MIZUTANI  Hiroshi HARADA  

     
    PAPER

      Pubricized:
    2018/04/13
      Vol:
    E101-B No:10
      Page(s):
    2131-2141

    In this paper, we propose an IEEE 802.15.10-based layer 2 routing (L2R) method with a load balancing algorithm; the proposal considers fairness in terms of the cumulative number of sending packets at each terminal to resolve the packet concentration problem for the IEEE 802.15.4-based low-power consumption wireless smart utility network (Wi-SUN) systems. The proposal uses the accumulated sending times of each terminal as a weight in calculating each path quality metric (PQM) to decide multi-hopping routes with load balancing in the network. Computer simulation of the mesh network with 256 terminals shows that the proposed routing method can improve the maximum sending ratio (MSR), defined as the ratio of the maximum sending times to the average number of sending times in the network, by 56% with no degradation of the end-to-end communication success ratio (E2E-SR). The proposed algorithm is also experimentally evaluated by using actual Wi-SUN modules. The proposed routing method also improves the MSR by 84% with 70 terminals. Computer simulations and experiments prove the effectiveness of the proposed method in terms of load balancing.

  • User Satisfaction Constraint Adaptive Sleeping in 5G mmWave Heterogeneous Cellular Network

    Gia Khanh TRAN  Hidekazu SHIMODAIRA  Kei SAKAGUCHI  

     
    PAPER

      Pubricized:
    2018/04/13
      Vol:
    E101-B No:10
      Page(s):
    2120-2130

    Densification of mmWave smallcells overlaid on the conventional macro cell is considered to be an essential technology for enhanced mobile broadband services and future IoT applications requiring high data rate e.g. automated driving in 5G communication networks. Taking into account actual measurement mobile traffic data which reveal dynamicity in both time and space, this paper proposes a joint optimization of user association and smallcell base station (BS)'s ON/OFF status. The target is to improve the system's energy efficiency while guaranteeing user's satisfaction measured through e.g. delay tolerance. Numerical analyses are conducted to show the effectiveness of the proposed algorithm against dynamic traffic variation.

601-620hit(4079hit)