Rui LI Ruqi XIAO Hong GU Weimin SU
A novel direction of arrival (DOA) estimation method for the coherent signal is presented in this paper. The proposed method applies the eigenvector associated with max eigenvalue, which contains the DOAs of all signals, to form a Toeplitz matrix, yielding an unconstrained optimization problem. Then, the DOA is obtained by peak searching of the pseudo power spectrum without the knowledge of signal number. It is illustrated that the method has a great performance and low computation complexity for the coherent signal. Simulation results verify the usefulness of the method.
Lin YAN Mingyong ZENG Shuai REN Zhangkai LUO
Traffic categorization aims to classify network traffic into major service types. A modern deep neural network based on temporal sequence modeling is proposed for encrypted traffic categorization. The contemporary techniques such as dilated convolution and residual connection are adopted as the basic building block. The raw traffic files are pre-processed to generate 1-dimensional flow byte sequences and are feed into our specially-devised network. The proposed approach outperforms other existing methods greatly on a public traffic dataset.
In color image processing, preservation of hue is required. Therefore, perceptual color models such as HSI and HSV have been used. Hue-Saturation-Intensity (HSI) is a public color model, and many color applications have been made based on this model. However, the transformation from the conventional HSI (C-HSI) color space to the RGB color space after processing intensity/saturation in the C-HSI color space often generates the gamut problem, because the shape of C-HSI color space is a triangular pyramid which includes the RGB color space. When the output of intensity/saturation processing result is located in the outside of the common region of RGB color space and C-HSI color space, it is necessary to move to the RGB color space. The effective way of hue and intensity preserving saturation correction algorithm is proposed. According to the proposed saturation correction algorithm, the corrected saturation value is same as the processing result in the ideal HSI color space whose gamut same as the RGB gamut.
Takumi UCHIDA Keisuke ISHIBASHI Kensuke FUKUDA
This paper introduces a method to estimate latent traffic from its origin to destination from the link packet loss rate and traffic volume. In addition, we propose a method for the joint optimization of routing and link provisioning based on the estimated latent traffic. Observed traffic could deviate from the original traffic demand and become latent when the traffic passes through congested links because of changes in user behavioral and/or applications as a result of degraded quality of experience (QoE). The latent traffic is actualized by improving congested link capacity. When link provisioning is based on observed traffic, actual traffic might cause new congestion at other links. Thus, network providers need to estimate the origin-destination (OD) original traffic demand for network planning. Although the estimation of original traffic has been well studied, the estimation was only applicable for links. In this paper, we propose a method to estimate latent OD traffic by combining and expanding techniques. The method consists of three steps. The first step is to estimate the actual OD traffic and loss rate from the actual traffic and packet loss rate of the links. The second step is to estimate the latent traffic demand. Finally, using this estimated demand, the link capacity and routing matrix are optimized. We evaluate our method by simulation and confirm that congestion could be avoided by capacity provisioning based on estimated latent traffic, while provisioning based on observed traffic retains the congestion. The combined method can avoid congestion with an increment of 23% compared with capacity provisioning only. We also evaluated our method's adaptability, i.e., the ability to estimate the required parameter for the estimations using fewer given values, but values obtained in the environment.
Takuya KUWAHARA Takayuki KURODA Takao OSAKI Kozo SATODA
Network service providers need to appropriately design systems and carefully configuring the settings and parameters to ensure that the systems keep running consistently and deliver the desired services. This can be a heavy and error-prone task. Intent-based system design methods have been developed to help with such tasks. These methods receive service-level requirements and generate service configurations to fulfill the given requirements. One such method is search-based system design, which can flexibly generate systems of various architectures. However, it has difficulty dealing with constraints on the quantitative parameters of systems, e.g., disk volume, RAM size, and QoS. To deal with practical cases, intent-based system design engines need to be able to handle quantitative parameters and constraints. In this work, we propose a new intent-based system design method based on search-based design that augments search states with quantitative constraints. Our method can generate a system that meets both functional and quantitative service requirements by combining a search-based design method with constraint checking. Experimental results show that our method can automatically generate a system that fulfills all given requirements within a reasonable computation time.
Shumpei YAMASAKI Daiki NOBAYASHI Kazuya TSUKAMOTO Takeshi IKENAGA Myung J. LEE
With the development and spread of Internet of Things technologies, various types of data for IoT applications can be generated anywhere and at any time. Among such data, there are data that depend heavily on generation time and location. We define these data as spatio-temporal data (STD). In previous studies, we proposed a STD retention system using vehicular networks to achieve the “Local production and consumption of STD” paradigm. The system can quickly provide STD for users within a specific location by retaining the STD within the area. However, this system does not take into account that each type of STD has different requirements for STD retention. In particular, the lifetime of STD and the diffusion time to the entire area directly influence the performance of STD retention. Therefore, we propose an efficient diffusion and elimination control method for retention based on the requirements of STD. The results of simulation evaluation demonstrated that the proposed method can satisfy the requirements of STD, while maintaining a high coverage rate in the area.
Mizuki SUGA Yushi SHIRATO Naoki KITA Takeshi ONIZAWA
We propose two simple weight calculation methods (primary method and enhanced method), that estimate approximated phase plane from a few antenna phase and calculate weights of all antenna elements, for wireless backhaul systems that utilize millimeter wave band massive antenna arrays. Such systems are expected to be used instead of optical fiber for connecting many small cell base stations (SCBSs) to the core network, and supporting the rapid deployment of SCBSs. However, beamforming with massive antenna arrays requires many analog-digital converters (ADCs) and incurs the issue of implementation complexity. The proposed methods overcome the problem by reducing the number of ADCs. Computer simulations clarify the appropriate layout and the number of ADCs connected to antenna elements; the effectiveness of the proposed methods is confirmed by evaluations with measured channel state information (CSI) in propagation experiments on a wireless backhaul system. Experimental verifications on the case of calculating the weight of 200 elements from the phases of just 9 elements show that the array gain degradation from ideal (the case in which the phases of all elements are used estimation) with both methods is less than 0.4 dB in the direct wave dominant environment. In addition, the enhanced method holds the array gain degradation to under 0.8dB in an environment existing reflected waves. These results show that the proposed methods can attain high accuracy beamforming while reducing ADC number.
Yi TIAN Takahiro NOI Takuya YOSHIHIRO
Wireless Mesh Networks (WMNs) are often designed on IEEE 802.11 standards and are being widely studied due to their adaptability in practical network scenarios, where the overall performance has been improved by the use of the Multi-Radio and Multi-Channel (MRMC) configuration. However, because of the limitation on the number of available orthogonal channels and radios on each router, the network still suffers from low throughput due to packet collisions. Many studies have demonstrated that the optimized channel assignment to radio interfaces so as to avoid interference among wireless links is an effective solution. However, no existing channel assignment scheme can achieve hidden-terminal-free transmission and thus avoid communication performance degradation given the limited number of orthogonal channels. In this paper, we propose a new static channel assignment scheme CASCA (CSMA-aware Static Channel Assignment) based on a Partial MAX-SAT formulation of the channel assignment problem that incorporates a CSMA-aware interference model. The evaluation results show that CASCA achieves hidden-terminal-freedom in both grid and random topology networks with 3-4 orthogonal channels with preservation of network connectivity. In addition, the network simulation results show that CASCA presents good communication performance with low MAC-layer collision rate.
Fengning DU Hidekazu MURATA Mampei KASAI Toshiro NAKAHIRA Koichi ISHIHARA Motoharu SASAKI Takatsune MORIYAMA
Distributed detection techniques of multiple-input multiple-output (MIMO) spatially multiplexed signals are studied in this paper. This system considered employs multiple mobile stations (MSs) to receive signals from a base station, and then share their received signal waveforms with collaborating MSs. In order to reduce the amount of traffic over the collaborating wireless links, distributed detection techniques are proposed, in which multiple MSs are in charge of detection by making use of both the shared signal waveforms and its own received waveform. Selection combining schemes of detected bit sequences are studied to finalize the decisions. Residual error coefficients in iterative MIMO equalization and detection are utilized in this selection. The error-ratio performance is elucidated not only by computer simulations, but also by offline processing using experimental signals recorded in a measurement campaign.
Yan CHEN Chen LIU Mujun QIAN Yu HUANG Wenfeng SUN
This paper studies a harvested power-oriented simultaneous wireless information and power transfer (SWIPT) scheme over multiple-input multiple-output (MIMO) interference channels in which energy harvesting (EH) circuits exhibit nonlinearity. To maximize the power harvested by all receivers, we propose an algorithm to jointly optimize the transmit beamforming vectors, power splitting (PS) ratios and the receive decoding vectors. As all variables are coupled to some extent, the problem is non-convex and hard to solve. To deal with this non-convex problem, an iterative optimization method is proposed. When two variables are fixed, the third variable is optimized. Specifically, when the transmit beamforming vectors are optimized, the transferred objective function is the sum of several fractional functions. Non-linear sum-of-ratios programming is used to solve the transferred objective function. The convergence and advantage of our proposed scheme compared with traditional EH circuits are validated by simulation results.
Ruilin ZHANG Xingyu WANG Hirofumi SHINOHARA
In this paper, we describe a post-processing technique having high extraction efficiency (ExE) for de-biasing and de-correlating a random bitstream generated by true random number generators (TRNGs). This research is based on the N-bit von Neumann (VN_N) post-processing method. It improves the ExE of the original von Neumann method close to the Shannon entropy bound by a large N value. However, as the N value increases, the mapping table complexity increases exponentially (2N), which makes VN_N unsuitable for low-power TRNGs. To overcome this problem, at the algorithm level, we propose a waiting strategy to achieve high ExE with a small N value. At the architectural level, a Hamming weight mapping-based hierarchical structure is used to reconstruct the large mapping table using smaller tables. The hierarchical structure also decreases the correlation factor in the raw bitstream. To develop a technique with high ExE and low cost, we designed and fabricated an 8-bit von Neumann with waiting strategy (VN_8W) in a 130-nm CMOS. The maximum ExE of VN_8W is 62.21%, which is 2.49 times larger than the ExE of the original von Neumann. NIST SP 800-22 randomness test results proved the de-biasing and de-correlation abilities of VN_8W. As compared with the state-of-the-art optimized 7-element iterated von Neumann, VN_8W achieved more than 20% energy reduction with higher ExE. At 0.45V and 1MHz, VN_8W achieved the minimum energy of 0.18pJ/bit, which was suitable for sub-pJ low energy TRNGs.
Yuta UKON Shimpei SATO Atsushi TAKAHASHI
Advanced information-processing services such as computer vision require a high-performance digital circuit to perform high-load processing at high speed. To achieve high-speed processing, several image-processing applications use an approximate computing technique to reduce idle time of the circuit. However, it is difficult to design the high-speed image-processing circuit while controlling the error rate so as not to degrade service quality, and this technique is used for only a few applications. In this paper, we propose a method that achieves high-speed processing effectively in which processing time for each task is changed by roughly detecting its completion. Using this method, a high-speed processing circuit with a low error rate can be designed. The error rate is controllable, and a circuit design method to minimize the error rate is also presented in this paper. To confirm the effectiveness of our proposal, a ripple-carry adder (RCA), 2-dimensional discrete cosine transform (2D-DCT) circuit, and histogram of oriented gradients (HOG) feature calculation circuit are evaluated. Effective clock periods of these circuits obtained by our method with around 1% error rate are improved about 64%, 6%, and 12%, respectively, compared with circuits without error. Furthermore, the impact of the miscalculation on a video monitoring service using an object detection application is investigated. As a result, more than 99% of detection points required to be obtained are detected, and it is confirmed the miscalculation hardly degrades the service quality.
Thi Diem TRAN Yasuhiko NAKASHIMA
Convolutional neural networks (CNNs) have dominated a range of applications, from advanced manufacturing to autonomous cars. For energy cost-efficiency, developing low-power hardware for CNNs is a research trend. Due to the large input size, the first few convolutional layers generally consume most latency and hardware resources on hardware design. To address these challenges, this paper proposes an innovative architecture named SLIT to extract feature maps and reconstruct the first few layers on CNNs. In this reconstruction approach, total multiply-accumulate operations are eliminated on the first layers. We evaluate new topology with MNIST, CIFAR, SVHN, and ImageNet datasets on image classification application. Latency and hardware resources of the inference step are evaluated on the chip ZC7Z020-1CLG484C FPGA with Lenet-5 and VGG schemes. On the Lenet-5 scheme, our architecture reduces 39% of latency and 70% of hardware resources with a 0.456 W power consumption compared to previous works. Even though the VGG models perform with a 10% reduction in hardware resources and latency, we hope our overall results will potentially give a new impetus for future studies to reach a higher optimization on hardware design. Notably, the SLIT architecture efficiently merges with most popular CNNs at a slightly sacrificing accuracy of a factor of 0.27% on MNIST, ranging from 0.5% to 1.5% on CIFAR, approximately 2.2% on ImageNet, and remaining the same on SVHN databases.
This study proposes a design method for a rectifier circuit that can be rapidly charged by focusing on the design-load value of the circuit and the load fluctuation of a storage capacitor. The design-load value is suitable for rapidly charging the capacitor. It can be obtained at the lowest reflection condition and estimated according to the circuit design. This is a conventional method for designing the rectifier circuit using the optimum load. First, we designed rectifier circuits for the following three cases. The first circuit design uses a load set to 10 kΩ. The second design uses a load of 30 kΩ that is larger than the optimum load. The third design utilizes a load of 3 kΩ. Then, we measure the charging time to design the capacitor on each circuit. Consequently, the results show that the charge time could be shortened by employing the design-load value lower than that used in the conventional design. Finally, we discuss herein whether this design method can be applied regardless of the rectifier circuit topology.
Qi WEI Xiaolin YAO Luan LIU Yan ZHANG
We investigate an online problem of a robot exploring the outer boundary of an unknown simple polygon P. The robot starts from a specified vertex s and walks an exploration tour outside P. It has to see all points of the polygon's outer boundary and to return to the start. We provide lower and upper bounds on the ratio of the distance traveled by the robot in comparison to the length of the shortest path. We consider P in two scenarios: convex polygon and concave polygon. For the first scenario, we prove a lower bound of 5 and propose a 23.78-competitive strategy. For the second scenario, we prove a lower bound of 5.03 and propose a 26.5-competitive strategy.
Aryo PINANDITO Yusuke HAYASHI Tsukasa HIRASHIMA
Concept map has been widely used as an interactive media to deliver contents in learning. Incorporating concept maps into collaborative learning could promote more interactive and meaningful learning environments. Furthermore, delivering concept maps in a digital form, such as in Kit-Build concept map, could improve learning interaction further. Collaborative learning with Kit-Build concept map has been shown to have positive effects on students' understanding. The way students compose their concept maps while discussing with others is presumed to affect their learning. However, supporting collaborative learning in an online setting is formidable to keep the interaction meaningful and fluid. This study proposed a new approach of real-time collaborative learning with Kit-Build concept map. This study also investigated how concept map recomposition with Kit-Build concept map could help students collaboratively learn EFL reading comprehension from a distance by comparing it with the traditional open-ended concept mapping approach. The learning effect and students' conversation during collaboration with the proposed online Kit-Build concept map system were investigated. Comparative analysis with a traditional collaborative concept mapping approach is also presented. The results suggested that collaborative learning with Kit-Build concept map yielded better outcomes and more meaningful discussion than the traditional open-end concept mapping.
Masakazu IWAMURA Shunsuke MORI Koichiro NAKAMURA Takuya TANOUE Yuzuko UTSUMI Yasushi MAKIHARA Daigo MURAMATSU Koichi KISE Yasushi YAGI
Most gait recognition approaches rely on silhouette-based representations due to high recognition accuracy and computational efficiency. A fundamental problem for those approaches is how to extract individuality-preserved silhouettes from real scenes accurately. Foreground colors may be similar to background colors, and the background is cluttered. Therefore, we propose a method of individuality-preserving silhouette extraction for gait recognition using standard gait models (SGMs) composed of clean silhouette sequences of various training subjects as shape priors. The SGMs are smoothly introduced into a well-established graph-cut segmentation framework. Experiments showed that the proposed method achieved better silhouette extraction accuracy by more than 2.3% than representative methods and better identification rate of gait recognition (improved by more than 11.0% at rank 20). Besides, to reduce the computation cost, we introduced approximation in the calculation of dynamic programming. As a result, without reducing the segmentation accuracy, we reduced 85.0% of the computational cost.
Takaaki SAEKI Yuki SAITO Shinnosuke TAKAMICHI Hiroshi SARUWATARI
This paper proposes two high-fidelity and computationally efficient neural voice conversion (VC) methods based on a direct waveform modification using spectral differentials. The conventional spectral-differential VC method with a minimum-phase filter achieves high-quality conversion for narrow-band (16 kHz-sampled) VC but requires heavy computational cost in filtering. This is because the minimum phase obtained using a fixed lifter of the Hilbert transform often results in a long-tap filter. Furthermore, when we extend the method to full-band (48 kHz-sampled) VC, the computational cost is heavy due to increased sampling points, and the converted-speech quality degrades due to large fluctuations in the high-frequency band. To construct a short-tap filter, we propose a lifter-training method for data-driven phase reconstruction that trains a lifter of the Hilbert transform by taking into account filter truncation. We also propose a frequency-band-wise modeling method based on sub-band multi-rate signal processing (sub-band modeling method) for full-band VC. It enhances the computational efficiency by reducing sampling points of signals converted with filtering and improves converted-speech quality by modeling only the low-frequency band. We conducted several objective and subjective evaluations to investigate the effectiveness of the proposed methods through implementation of the real-time, online, full-band VC system we developed, which is based on the proposed methods. The results indicate that 1) the proposed lifter-training method for narrow-band VC can shorten the tap length to 1/16 without degrading the converted-speech quality, and 2) the proposed sub-band modeling method for full-band VC can improve the converted-speech quality while reducing the computational cost, and 3) our real-time, online, full-band VC system can convert 48 kHz-sampled speech in real time attaining the converted speech with a 3.6 out of 5.0 mean opinion score of naturalness.
Jinhua WANG Xuewei LI Hongzhe LIU
At present, the generative adversarial network (GAN) plays an important role in learning tasks. The basic idea of a GAN is to train the discriminator and generator simultaneously. A GAN-based inverse tone mapping method can generate high dynamic range (HDR) images corresponding to a scene according to multiple image sequences of a scene with different exposures. However, subsequent tone mapping algorithm processing is needed to display it on a general device. This paper proposes an end-to-end multi-exposure image fusion algorithm based on a relative GAN (called RaGAN-EF), which can fuse multiple image sequences with different exposures directly to generate a high-quality image that can be displayed on a general device without further processing. The RaGAN is used to design the loss function, which can retain more details in the source images. In addition, the number of input image sequences of multi-exposure image fusion algorithms is often uncertain, which limits the application of many existing GANs. This paper proposes a convolutional layer with weights shared between channels, which can solve the problem of variable input length. Experimental results demonstrate that the proposed method performs better in terms of both objective evaluation and visual quality.
Zheng WAN Kaizhi HUANG Lu CHEN
In this paper, a deep learning-based secret key generation scheme is proposed for FDD multiple-input and multiple-output (MIMO) systems. We built an encoder-decoder based convolutional neural network to characterize the wireless environment to learn the mapping relationship between the uplink and downlink channel. The designed neural network can accurately predict the downlink channel state information based on the estimated uplink channel state information without any information feedback. Random secret keys can be generated from downlink channel responses predicted by the neural network. Simulation results show that deep learning based SKG scheme can achieve significant performance improvement in terms of the key agreement ratio and achievable secret key rate.