This paper improves our previously proposed semi-blind uplink interference suppression scheme for multicell multiuser massive MIMO systems by incorporating the beamspace approach. The constant modulus algorithm (CMA), a known blind adaptive array scheme, can fully exploit the degree of freedom (DoF) offered by massive antenna arrays to suppress inter-user interference (IUI) and inter-cell interference (ICI). Unfortunately, CMA wastes a lot of the benefit of DoF for null-steering even when the number of incoming signal is fewer than that of receiving antenna elements. Our new proposal introduces the beamspace method which degenerates the number of array input for CMA from element-space to beamspace. It can control DoF expended for subsequent interference suppression by CMA. Optimizing the array beamforming gain and null-steering ability, can further improve the output signal-to-interference and noise power ratio (SINR). Computer simulation confirmed that our new proposal reduced the required number of data symbols by 34.6%. In addition, the 5th percentile SINR was also improved by 14.3dB.
Hao LUO Wenhao TAN Luoning GAN Houjun SUN
A W-band corporate-feed 16×16-slot array antenna with low sidelobe level is designed and fabricated. The basic unit of the array is a 2×2-circular-slot subarray with step square cavities and uses an E-plane waveguide as the feeding line. An efficient method to design an unequal power-splitting ratio but equal phase (UPEP) E-plane waveguide T-junction (E-T) is proposed for constructing a 1-to-64 power-tapering feed network, which is the critical part to realize low sidelobe level. The whole array is fabricated with aluminum by milling and bonded by the vacuum brazing process. The measured results demonstrate that the array can achieve a 7.2% bandwidth with VSWR<1.5 and holistic sidelobe levels lower than -23.5dB in E-plane and H-plane from 89GHz ∼ 95.8GHz. The measured gain is higher than 31.7dBi over the working band with the antenna efficiency better than 67.5%.
Daisuke KURITA Kiichi TATEISHI Daisuke KITAYAMA Atsushi HARADA Yoshihisa KISHIYAMA Hideshi MURAI Shoji ITOH Arne SIMONSSON Peter ÖKVIST
This paper evaluates a variety of key 5G technologies such as base station (BS) massive multiple-input multiple-output (MIMO) antennas, beamforming and tracking, intra-baseband unit (BBU) hand over (HO), and coverage. This is done in different interesting 5G areas with a variety of radio conditions such as an indoor office building lobby, an outdoor parking area, and a realistic urban deployment of a 5G radio access system with BSs installed in buildings to deploy a 5G trial area in the Tokyo Odaiba waterfront area. Experimental results show that throughput exceeding 10Gbps is achieved in a 730MHz bandwidth using 8 component carriers, and distributed MIMO throughput gain is achieved in various transmission point deployments in the indoor office building lobby and outdoor parking area using two radio units (RUs). In particular, in the outdoor parking area, a distinct advantage from distributed MIMO is expected and the distributed MIMO gain in throughput of 60% is achieved. The experimental results also clarify the downlink performance in an urban deployment. The experimental results show that throughput exceeding 1.5Gbps is achieved in the area and approximately 200 Mbps is achieved at 500m away from the BS. We also confirm that the beam tracking and intra-BBU HO work well compensating for high path loss at 28-GHz, and achieve coverage 500m from the BS. On the other hand, line of sight (LoS) and non-line-of sight (N-LoS) conditions are critical to 5G performance in the 28-GHz band, and we observe that 5G connections are sometimes dropped behind trees, buildings, and under footbridges.
We present a seven-bit multilayer true-time delay (TTD) circuit operating from 1 to 7GHz for wideband phased array antennas. By stacking advanced substrates with low dielectric loss, the TTD with PCB process is miniaturized and has low insertion loss. The signal vias with surrounding ground vias are designed to provide impedance matching throughout the band, allowing the overall group delay to be flat. The standard deviation of the TTD for all states is below 19ps, which is 1.87% of the maximum group delay. The maximum delay is 1016ps with resolution of 8ps. The implemented TTD is 36.6×19.4mm2 and consumes 0.65mW at 3.3V supply for all the delay states. The measured input/output return loss is better than 12.1dB for the band of 1-7GHz.
Cheolgi KIM Daechul LEE Jaehyun LEE Jaehwan LEE
Hadoop, a distributed processing framework for big-data, is now widely used for multimedia processing. However, when processing video data from a Hadoop distributed file system (HDFS), unnecessary network traffic is generated due to an inefficient HDFS block slice policy for picture frames in video files. We propose a new block replication policy to solve this problem and compare the newly proposed HDFS with the original HDFS via extensive experiments. The proposed HDFS reduces network traffic, and increases locality between processing cores and file locations.
Kazuma TAKAHASHI Tatsumi HATTORI Keisuke DOMAN Yasutomo KAWANISHI Takatsugu HIRAYAMA Ichiro IDE Daisuke DEGUCHI Hiroshi MURASE
We introduce a method to estimate the attractiveness of a food photo. It extracts image features focusing on the appearances of 1) the entire food, and 2) the main ingredients. To estimate the attractiveness of an arbitrary food photo, these features are integrated in a regression scheme. We also constructed and released a food image dataset composed of images of ten food categories taken from 36 angles and accompanied with attractiveness values. Evaluation results showed the effectiveness of integrating the two kinds of image features.
Hochong PARK Yong-Shik SHIN Seong-Hyeon SHIN
Speech captured by an in-ear microphone placed inside an occluded ear has a high signal-to-noise ratio; however, it has different sound characteristics compared to normal speech captured through air conduction. In this study, a method for blind speech quality enhancement is proposed that can convert speech captured by an in-ear microphone to one that resembles normal speech. The proposed method estimates an input-dependent enhancement function by using a neural network in the feature domain and enhances the captured speech via time-domain filtering. Subjective and objective evaluations confirm that the speech enhanced using our proposed method sounds more similar to normal speech than that enhanced using conventional equalizer-based methods.
Yinwei ZHAN Yaodong LI Zhuo YANG Yao ZHAO Huaiyu WU
Heat map is an important tool for eye tracking data analysis and visualization. It is very intuitive to express the area watched by observer, but ignores saccade information that expresses gaze shift. Based on conventional heat map generation method, this paper presents a novel heat map generation method for eye tracking data. The proposed method introduces a mixed data structure of fixation points and saccades, and considers heat map deformation for saccade type data. The proposed method has advantages on indicating gaze transition direction while visualizing gaze region.
Keiichi MIZUTANI Takeshi MATSUMURA Hiroshi HARADA
A variety of all-new systems such as a massive machine type communication (mMTC) system will be supported in 5G and beyond. Although each mMTC device occupies quite narrow bandwidth, the massive number of devices expected will generate a vast array of traffic and consume enormous spectrum resources. Therefore, it is necessary to proactively gather up and exploit fractional spectrum resources including guard bands that are secured but unused by the existing Long Term Evolution (LTE) systems. The guard band is originally secured as a margin for high out-of-band emission (OOBE) caused by the discontinuity between successive symbols in the cyclic prefix-based orthogonal frequency division multiplexing (CP-OFDM), and new-waveforms enabling high OOBE suppression have been widely researched to efficiently allocate narrowband communication to the frequency gap. Time-domain windowing is a well-known signal processing technique for reducing OOBE with low complexity and a universal time-domain windowed OFDM (UTW-OFDM) with a long transition duration exceeding the CP length has demonstrated its ability in WLAN-based systems. In this paper, we apply UTW-OFDM to the LTE downlink system and comprehensively evaluate its performance under the channel models defined by 3GPP. Specifically, we evaluate OOBE reduction and block error rate (BLER) by computer simulation and clarify how far OOBE can be reduced without degrading communication quality. Furthermore, we estimate the implementation complexity of the proposed UTW-OFDM, the conventional CP-OFDM, and the universal filtered-OFDM (UF-OFDM) by calculating the number of required multiplications. These evaluation and estimation results demonstrate that the proposed UTW-OFDM is a practical new-waveform applicable to the 5G and beyond.
Xiao XUE Song XIAO Hongping GAN
In compressive sensing theory (CS), the restricted isometry property (RIP) is commonly used for the measurement matrix to guarantee the reliable recovery of sparse signals from linear measurements. Although many works have indicated that random matrices with excellent recovery performance satisfy the RIP with high probability, Toeplitz-structured matrices arise naturally in real scenarios, such as applications of linear time-invariant systems. Thus, the corresponding measurement matrix can be modeled as a Toeplitz (partial) structured matrix instead of a completely random matrix. The structure characteristics introduce coherence and cause the performance degradation of the measurement matrix. To enhance the recovery performance of the Toeplitz structured measurement matrix in multichannel convolution source separation, an efficient construction of measurement matrix is presented, referred to as sparse random block-banded Toeplitz matrix (SRBT). The sparse signal is pre-randomized by locally scrambling its sample locations. Then, the signal is subsampled using the sparse random banded matrix. Finally, the mixing measurements are obtained. Based on the analysis of eigenvalues, the theoretical results indicate that the SRBT matrix satisfies the RIP with high probability. Simulation results show that the SRBT matrix almost matches the recovery performance of random matrices. Compared with the existing banded block Toeplitz matrix, SRBT significantly improves the probability of successful recovery. Additionally, SRBT has the advantages of low storage requirements and fast computation in reconstruction.
Hanxing XUE Jiali YOU Jinlin WANG
Smart-routers develop greatly in recent years as one of the representative products of IoT and Smart home. Different from traditional routers, they have storage and processing capacity. Actually, smart-routers in the same location or ISP have better link conditions and can provide high quality service to each other. Therefore, for the content required services, how to construct the overlay network and efficiently deploy replications of popular content in smart-routers' network are critical. The performance of existing centralized models is limited by the bottleneck of the single point's performance. In order to improve the stability and scalability of the system through the capability of smart-router, we propose a novel intelligent and decentralized content diffusion system in smart-router network. In the system, the content will be quickly and autonomously diffused in the network which follows the specific requirement of coverage rate in neighbors. Furthermore, we design a heuristic node selection algorithm (MIG) and a replacement algorithm (MCL) to assist the diffusion of content. Specifically, system based MIG will select neighbor with the maximum value of information gain to cache the replication. The replication with the least loss of the coverage rate gain will be replaced in the system based on MCL. Through the simulation experiments, at the same requirement of coverage rate, MIG can reduce the number of replications by at least 20.2% compared with other algorithms. Compared with other replacement algorithms, MCL achieves the best successful service rate which means how much ratio of the service can be provided by neighbors. The system based on the MIG and MCL can provide stable service with the lowest bandwidth and storage cost.
Junshan LUO Shilian WANG Qian CHENG
Joint transmit and receive antenna selection (JTRAS) for transceive spatial modulation (TRSM) is investigated in this paper. A couple of low-complexity and efficient JTRAS algorithms are proposed to improve the reliability of TRSM systems by maximizing the minimum Euclidean distance (ED) among all received signals. Specifically, the QR decomposition based ED-JTRAS achieves near-optimal error performance with a moderate complexity reduction as compared to the optimal ED-JTRAS method. The singular value decomposition based ED-JTRAS achieves sub-optimal error performance with a significant complexity reduction. Simulation results show that the proposed methods remarkably improve the system reliability in both uncorrelated and spatially correlated Rayleigh fading channels, as compared to the conventional norm based JTRAS method.
Xiangbin YU Xi WANG Tao TENG Qiyishu LI Fei WANG
In this paper, we study the power allocation (PA) scheme design for energy efficiency (EE) maximization with discrete-rate adaptive modulation (AM) in the downlink distributed antenna system (DAS). By means of the Karush-Kuhn-Tucker (KKT) conditions, an optimal PA scheme with closed-form expression is derived for maximizing the EE subject to maximum transmit power and target bit error rate (BER) constraints, where the number of active transmit antennas is also derived for attaining PA coefficients. Considering that the optimal scheme needs to calculate the PA of all transmit antennas for each modulation mode, its complexity is extremely high. For this reason, a low-complexity suboptimal PA is also presented based on the antenna selection method. By choosing one or two remote antennas, the suboptimal scheme offers lower complexity than the optimal one, and has almost the same EE performance as the latter. Besides, the outage probability is derived in a performance evaluation. Computer simulation shows that the developed optimal scheme can achieve the same EE as the exhaustive search based approach, which has much higher complexity, and the suboptimal scheme almost matches the EE of the optimal one as well. The suboptimal scheme with two-antenna selection is particularly effective in terms of balancing performance and complexity. Moreover, the derived outage probability is in good agreement with the corresponding simulation.
Tao WANG Mingfang WANG Yating WU Yanzan SUN
This paper proposes an energy efficiency (EE) maximized resource allocation (RA) algorithm in orthogonal frequency division multiple access (OFDMA) downlink networks with multiple relays, where a novel opportunistic subcarrier pair based decode-and-forward (DF) protocol with beamforming is used. Specifically, every data transmission is carried out in two consecutive time slots. During every transmission, multiple parallel paths, including relayed paths and direct paths, are established by the proposed RA algorithm. As for the protocol, each subcarrier in the 1st slot can be paired with any subcarrier in 2nd slot to best utilize subcarrier resources. Furthermore, for each relayed path, multiple (not just single or all) relays can be chosen to apply beamforming at the subcarrier in the 2nd slot. Each direct path is constructed by an unpaired subcarrier in either the 1st or 2nd slot. In order to guarantee an acceptable spectrum efficiency, we also introduce a minimum rate constraint. The EE-maximized problem is a highly nonlinear optimization problem, which contains both continuous, discrete variables and has a fractional structure. To solve the problem, the best relay set and resource allocation for a relayed path are derived first, then we design an iterative algorithm to find the optimal RA for the network. Finally, numerical experiments are taken to demonstrate the effectiveness of the proposed algorithm, and show the impact of minimum rate requirement, user number and circuit power on the network EE.
Hui ZHI Yukun ZHA Xiaotong FANG
A novel adaptive cross-layer optimal power allocation (OPA) scheme over physical layer and data-link layer for two-way relaying system with amplify-and-forward policy (TWR-AF) is proposed in this paper. Our goal is to find the optimal power allocation factors under each channel state information (CSI) to maximize the sum throughput of two sources under total transmit power constraint in the physical layer while guaranteeing the statistical delay quality-of-service (QoS) requirement in the data-link layer. By integrating information theory with the concept of effective capacity, the OPA problem is formulated into an optimization problem to maximize the sum effective capacity. It is solved through Lagrange multiplier approach, and the optimal power allocation factors are presented. Simulations are developed and the results show that the proposed cross-layer OPA scheme can achieve the best sum effective capacity with relatively low complexity when compared with other schemes. In addition, the proposed cross-layer OPA scheme achieves the maximal sum effective capacity when the relay is located in (or near) the middle of the two source nodes, and the sum effective capacity becomes smaller when the difference between two QoS exponents becomes larger.
Di YANG Songjiang LI Zhou PENG Peng WANG Junhui WANG Huamin YANG
Accurate traffic flow prediction is the precondition for many applications in Intelligent Transportation Systems, such as traffic control and route guidance. Traditional data driven traffic flow prediction models tend to ignore traffic self-features (e.g., periodicities), and commonly suffer from the shifts brought by various complex factors (e.g., weather and holidays). These would reduce the precision and robustness of the prediction models. To tackle this problem, in this paper, we propose a CNN-based multi-feature predictive model (MF-CNN) that collectively predicts network-scale traffic flow with multiple spatiotemporal features and external factors (weather and holidays). Specifically, we classify traffic self-features into temporal continuity as short-term feature, daily periodicity and weekly periodicity as long-term features, then map them to three two-dimensional spaces, which each one is composed of time and space, represented by two-dimensional matrices. The high-level spatiotemporal features learned by CNNs from the matrices with different time lags are further fused with external factors by a logistic regression layer to derive the final prediction. Experimental results indicate that the MF-CNN model considering multi-features improves the predictive performance compared to five baseline models, and achieves the trade-off between accuracy and efficiency.
Hideaki KINSHO Rie TAGYO Daisuke IKEGAMI Takahiro MATSUDA Jun OKAMOTO Tetsuya TAKINE
In this paper, we consider network monitoring techniques to estimate communication qualities in wide-area mobile networks, where an enormous number of heterogeneous components such as base stations, routers, and servers are deployed. We assume that average delays of neighboring base stations are comparable, most of servers have small delays, and delays at core routers are negligible. Under these assumptions, we propose Heterogeneous Delay Tomography (HDT) to estimate the average delay at each network component from end-to-end round trip times (RTTs) between mobile terminals and servers. HDT employs a crowdsourcing approach to collecting RTTs, where voluntary mobile users report their empirical RTTs to a data collection center. From the collected RTTs, HDT estimates average delays at base stations in the Graph Fourier Transform (GFT) domain and average delays at servers, by means of Compressed Sensing (CS). In the crowdsourcing approach, the performance of HDT may be degraded when the voluntary mobile users are unevenly distributed. To resolve this problem, we further extend HDT by considering the number of voluntary mobile users. With simulation experiments, we evaluate the performance of HDT.
Yuri USAMI Kazuaki ISHIKAWA Toshinori TAKAYAMA Masao YANAGISAWA Nozomu TOGAWA
It becomes possible to prevent accidents beforehand by predicting dangerous riding behavior based on recognition of bicycle behaviors. In this paper, we propose a bicycle behavior recognition method using a three-axis acceleration sensor and three-axis gyro sensor equipped with a smartphone when it is installed on a bicycle handlebar. We focus on the periodic handlebar motions for balancing while running a bicycle and reduce the sensor noises caused by them. After that, we use machine learning for recognizing the bicycle behaviors, effectively utilizing the motion features in bicycle behavior recognition. The experimental results demonstrate that the proposed method accurately recognizes the four bicycle behaviors of stop, run straight, turn right, and turn left and its F-measure becomes around 0.9. The results indicate that, even if the smartphone is installed on the noisy bicycle handlebar, our proposed method can recognize the bicycle behaviors with almost the same accuracy as the one when a smartphone is installed on a rear axle of a bicycle on which the handlebar motion noises can be much reduced.
Takaharu KOBAYASHI Masafumi TSUTSUI Takashi DATEKI Hiroyuki SEKI Morihiko MINOWA Chiyoshi AKIYAMA Tatsuki OKUYAMA Jun MASHINO Satoshi SUYAMA Yukihiko OKUMURA
Fifth-generation mobile communication systems (5G) must offer significantly higher system capacity than 4G in order to accommodate the rapidly increasing mobile data traffic. Cell densification has been considered an effective way to increase system capacity. Unfortunately, each user equipment (UE) will be in line-of-sight to many more transmission points (TPs) and the resulting inter-cell interference will degrade system capacity. We propose large-scale coordinated multi-user multiple-input multiple-output (LSC-MU-MIMO), which combines MU-MIMO with joint transmission from all the TPs connected to a centralized baseband unit. We previously investigated the downlink performance of LSC-MU-MIMO by computer simulation and found that it can significantly reduce inter-TP interference and improve the system capacity of high-density small cells. In this paper, we investigate the throughput of LSC-MU-MIMO through an indoor trial where the number of coordinated TPs is up to sixteen by using an experimental system that can execute real-time channel estimation based on TDD reciprocity and real-time data transmission. To clarify the improvement in the system capacity of LSC-MU-MIMO, we compared the throughput measured in the same experimental area with and without coordinated transmission in 4-TP, 8-TP, and 16-TP configurations. The results show that with coordinated transmission the system capacity is almost directly proportional to the number of TPs.
LINE is currently the most popular messaging service in Japan. Communications using LINE are protected by the original encryption scheme, called LINE Encryption, and specifications of the client-to-server transport encryption protocol and the client-to-client message end-to-end encryption protocol are published by the Technical Whitepaper. Though a spoofing attack (i.e., a malicious client makes another client misunderstand the identity of the peer) and a reply attack (i.e., a message in a session is sent again in another session by a man-in-the-middle adversary, and the receiver accepts these messages) to the end-to-end protocol have been shown, no formal security analysis of these protocols is known. In this paper, we show a formal verification result of secrecy of application data and authenticity for protocols of LINE Encryption (Version 1.0) by using the automated security verification tool ProVerif. Especially, since it is claimed that the transport protocol satisfies forward secrecy (i.e., even if the static private key is leaked, security of application data is guaranteed), we verify forward secrecy for client's data and for server's data of the transport protocol, and we find an attack to break secrecy of client's application data. Moreover, we find the spoofing attack and the reply attack, which are reported in previous papers.