This letter proposes a novel dynamic channel assignment (DCA) scheme to improve the downlink system capacity in heterogeneous networks (HetNets) with fractional frequency reuse (FFR). In the proposed DCA scheme, the macro base station (MBS) finds small-cell base stations (SBSs) that give strong interference to macro user equipments (MUEs) and then dynamically assigns subchannels to the SBSs to serve their small-cell user equipments (SUEs) according to the cross-tier interference information to MUEs. Through simulation results, it is shown that the proposed DCA scheme outperforms other schemes in terms of the total system capacity.
Tsuyoshi SUGIURA Satoshi FURUTA Tadamasa MURAKAMI Koki TANJI Norihisa OTANI Toshihiko YOSHIMASU
This paper presents high efficiency Class-E and compact Doherty power amplifiers (PAs) with novel harmonics termination for handset applications using a GaAs/InGaP heterojunction bipolar transistor (HBT) process. The novel harmonics termination circuit effectively reduces the insertion loss of the matching circuit, allowing a device with a compact size. The Doherty PA uses a lumped-element transformer which consists of metal-insulator-metal (MIM) capacitors on an IC substrate, a bonding-wire inductor and short micro-strip lines on a printed circuit board (PCB). The fabricated Class-E PA exhibits a power added efficiency (PAE) as high as 69.0% at 1.95GHz and as high as 67.6% at 2.535GHz. The fabricated Doherty PA exhibits an average output power of 25.5dBm and a PAE as high as 50.1% under a 10-MHz band width quadrature phase shift keying (QPSK) 6.16-dB peak-to-average-power-ratio (PAPR) LTE signal at 1.95GHz. The fabricated chip size is smaller than 1mm2. The input and output Doherty transformer areas are 0.5mm by 1.0mm and 0.7mm by 0.7mm, respectively.
Zhiyu SHAO Juan WU Qiangqiang OUYANG
Many quality metrics have been proposed for the compliance perception to assess haptic device performance and perceived results. Perceived compliance may be influenced by factors such as object properties, experimental conditions and human perceptual habits. In this paper, analysis of softness perception was conducted to find out relevant quality metrics dominating in the compliance perception system and their correlation with perception results, by expressing these metrics by basic physical parameters that characterizing these factors. Based on three psychophysical experiments, just noticeable differences (JNDs) for perceived softness of combination of different stiffness coefficients and damping levels rendered by haptic devices were analyzed. Interaction data during the interaction process were recorded and analyzed. Preliminary experimental results show that the discrimination ability of softness perception changes with the ratio of damping to stiffness when subjects exploring at their habitual speed. Analysis results indicate that quality metrics of Rate-hardness, Extended Rate-hardness and ratio of damping to stiffness have high correlation for perceived results. Further analysis results show that parameters that reflecting object properties (stiffness, damping), experimental conditions (force bandwidth) and human perceptual habits (initial speed, maximum force change rate) lead to the change of these quality metrics, which then bring different perceptual feeling and finally result in the change of discrimination ability. Findings in this paper may provide a better understanding of softness perception and useful guidance in improvement of haptic and teleoperation devices.
Tomohiko MITANI Shogo KAWASHIMA Naoki SHINOHARA
A retrodirective system utilizing harmonic reradiation from a rectenna is developed and verified for long-range wireless power transfer applications, such as low-power or battery-less devices and lightweight aerial vehicles. The second harmonic generated by the rectifying circuit is used instead of a pilot signal, and thus an oscillator for creating the pilot signal is not required. The proposed retrodirective system consists of a 2.45 GHz transmitter with a two-element phased array antenna, a 4.9 GHz direction-of-arrival (DoA) estimation system, a phase control system, and a rectenna. The rectenna, consisting of a half-wave dipole antenna, receives microwave power from the 2.45 GHz transmitter and reradiates the harmonic toward the 4.9 GHz DoA estimation system. The rectenna characteristics and experimental demonstrations of the proposed retrodirective system are described. From measurement results, the dc output power pattern for the developed retrodirective system is in good agreement with that obtained using manual beam steering. The measured DoA estimation errors are within the range of -2.4° to 4.8°.
Luyang LI Dong ZHENG Qinglan ZHAO
Boolean functions and vectorial Boolean functions are the most important components of stream ciphers. Their cryptographic properties are crucial to the security of the underlying ciphers. And how to construct such functions with good cryptographic properties is a nice problem that worth to be investigated. In this paper, using two small nonlinear functions with t-1 resiliency, we provide a method on constructing t-resilient n variables Boolean functions with strictly almost optimal nonlinearity >2n-1-2n/2 and optimal algebraic degree n-t-1. Based on the method, we give another construction so that a large class of resilient vectorial Boolean functions can be obtained. It is shown that the vectorial Boolean functions also have strictly almost optimal nonlinearity and optimal algebraic degree.
Peng LI Zhongyuan ZHOU Mingjie SHENG Peng HU Qi ZHOU
An underdetermined direction of arrival estimation method based on signal sparsity is proposed when independent and coherent signals coexist. Firstly, the estimate of the mixing matrix of the impinging signals is obtained by clustering the single source points which are detected by the ratio of time-frequency transforms of the received signals. Then, each column vector of the mixing matrix is processed by exploiting the forward and backward vectors in turn to obtain the directions of arrival of all signals. The number of independent signals and coherent signal groups that can be estimated by the proposed method can be greater than the number of sensors. The validity of the method is demonstrated by simulations.
Shanding XU Xiwang CAO Jian GAO
As a generalization of perfect nonlinear (PN) functions, zero-difference balanced (ZDB) functions play an important role in coding theory, cryptography and communications engineering. Inspired by a foregoing work of Liu et al. [1], we present a class of ZDB functions with new parameters based on the cyclotomy in finite fields. Employing these ZDB functions, we obtain simultaneously optimal constant composition codes and perfect difference systems of sets.
Yiheng JIAN Xiao YU Zhou XU Ziyi MA
Fault prediction aims to identify whether a software module is defect-prone or not according to metrics that are mined from software projects. These metric values, also known as features, may involve irrelevance and redundancy, which hurt the performance of fault prediction models. In order to filter out irrelevant and redundant features, a Hybrid Feature Selection (abbreviated as HFS) method for software fault prediction is proposed. The proposed HFS method consists of two major stages. First, HFS groups features with hierarchical agglomerative clustering; second, HFS selects the most valuable features from each cluster to remove irrelevant and redundant ones based on two wrapper based strategies. The empirical evaluation was conducted on 11 widely-studied NASA projects, using three different classifiers with four performance metrics (precision, recall, F-measure, and AUC). Comparison with six filter-based feature selection methods demonstrates that HFS achieves higher average F-measure and AUC values. Compared with two classic wrapper feature selection methods, HFS can obtain a competitive prediction performance in terms of average AUC while significantly reducing the computation cost of the wrapper process.
Yingwei FU Kele XU Haibo MI Qiuqiang KONG Dezhi WANG Huaimin WANG Tie HONG
Sound event detection is intended to identify the sound events in audio recordings, which has widespread applications in real life. Recently, convolutional recurrent neural network (CRNN) models have achieved state-of-the-art performance in this task due to their capabilities in learning the representative features. However, the CRNN models are of high complexities with millions of parameters to be trained, which limits their usage for the mobile and embedded devices with limited computation resource. Model distillation is effective to distill the knowledge of a complex model to a smaller one, which can be deployed on the devices with limited computational power. In this letter, we propose a novel multi model-based distillation approach for sound event detection by making use of the knowledge from models of multiple teachers which are complementary in detecting sound events. Extensive experimental results demonstrated that our approach achieves a compression ratio about 50 times. In addition, better performance is obtained for the sound event detection task.
Edge-preserving smoothing filter smoothes the textures while preserving the information of sharp edges. In image processing, this kind of filter is used as a fundamental process of many applications. In this paper, we propose a new approach for edge-preserving smoothing filter. Our method uses 2D local filter to smooth images and we apply indicator function to restrict the range of filtered pixels for edge-preserving. To define the indicator function, we recalculate the distance between each pixel by using edge information. The nearby pixels in the new domain are used for smoothing. Since our method constrains the pixels used for filtering, its running time is quite fast. We demonstrate the usefulness of our new edge-preserving smoothing method for some applications.
Yan LIN Qiaoqiao XIA Wenwu HE Qinglin ZHANG
Using linear programming (LP) decoding based on alternating direction method of multipliers (ADMM) for low-density parity-check (LDPC) codes shows lower complexity than the original LP decoding. However, the development of the ADMM-LP decoding algorithm could still be limited by the computational complexity of Euclidean projections onto parity check polytope. In this paper, we proposed a bisection method iterative algorithm (BMIA) for projection onto parity check polytope avoiding sorting operation and the complexity is linear. In addition, the convergence of the proposed algorithm is more than three times as fast as the existing algorithm, which can even be 10 times in the case of high input dimension.
Zhangkai LUO Zhongmin PEI Bo ZOU
In this letter, a polarization filtering based transmission (PFBT) scheme is proposed to enhance the spectrum efficiency in wireless communications. In such scheme, the information is divided into several parts and each is conveyed by a polarized signal with a unique polarization state (PS). Then, the polarized signals are added up and transmitted by the dual-polarized antenna. At the receiver side, the oblique projection polarization filters (OPPFs) are adopted to separate each polarized signal. Thus, they can be demodulated separately. We mainly focus on the construction methods of the OPPF matrix when the number of the separate parts is 2 and 3 and evaluate the performance in terms of the capacity and the bit error rate. In addition, we also discuss the probability of the signal separation when the number of the separate parts is equal or greater than 4. Theoretical results and simulation results demonstrate the performance of the proposed scheme.
Kazuaki UEDA Kenji YOKOTA Jun KURIHARA Atsushi TAGAMI
Information-Centric Networking (ICN) can offer rich functionalities to the network, e.g, in-network caching, and name-based forwarding. Incremental deployment of ICN is a key challenge that enable smooth migration from current IP network to ICN. We can say that Network Function Virtualization (NFV) must be one of the key technologies to achieve this deployment because of its flexibility to support new network functions. However, when we consider the ICN deployment with NFV, there exist two performance issues, processing delay of name-based forwarding and computational overhead of virtual machine. In this paper we proposed a NFV infrastructure-assisted ICN packet forwarding by integrating the name look-up to the Open vSwitch. The contributions are twofold: 1) First, we provide the novel name look-up scheme that can forward ICN packets without costly longest prefix match searching. 2) Second, we design the ICN packet forwarding scheme that integrates the partial name look-up into the virtualization infrastructure to mitigate computation overhead.
Tingxiao YANG Yuichiro YOSHIMURA Akira MORITA Takao NAMIKI Toshiya NAKAGUCHI
In this paper, we propose a Pyramid Predictive Attention Network (PPAN) for medical image segmentation. In the medical field, the size of dataset generally restricts the performance of deep CNN and deploying the trained network with gross parameters into the terminal device with limited memory is an expectation. Our team aims to the future home medical diagnosis and search for lightweight medical image segmentation network. Therefore, we designed PPAN mainly made of Xception blocks which are modified from DeepLab v3+ and consist of separable depthwise convolutions to speed up the computation and reduce the parameters. Meanwhile, by utilizing pyramid predictions from each dimension stage will guide the network more accessible to optimize the training process towards the final segmentation target without degrading the performance. IoU metric is used for the evaluation on the test dataset. We compared our designed network performance with the current state of the art segmentation networks on our RGB tongue dataset which was captured by the developed TIAS system for tongue diagnosis. Our designed network reduced 80 percentage parameters compared to the most widely used U-Net in medical image segmentation and achieved similar or better performance. Any terminal with limited storage which is needed a segment of RGB image can refer to our designed PPAN.
Yuto KITAGAWA Tasuku ISHIGOOKA Takuya AZUMI
This paper proposes an anomaly prediction method based on k-means clustering that assumes embedded devices with memory constraints. With this method, by checking control system behavior in detail using k-means clustering, it is possible to predict anomalies. However, continuing clustering is difficult because data accumulate in memory similar to existing k-means clustering method, which is problematic for embedded devices with low memory capacity. Therefore, we also propose k-means clustering to continue clustering for infinite stream data. The proposed k-means clustering method is based on online k-means clustering of sequential processing. The proposed k-means clustering method only stores data required for anomaly prediction and releases other data from memory. Due to these characteristics, the proposed k-means clustering realizes that anomaly prediction is performed by reducing memory consumption. Experiments were performed with actual data of control system for anomaly prediction. Experimental results show that the proposed anomaly prediction method can predict anomaly, and the proposed k-means clustering can predict anomalies similar to standard k-means clustering while reducing memory consumption. Moreover, the proposed k-means clustering demonstrates better results of anomaly prediction than existing online k-means clustering.
Boolean functions used in the filter model of stream ciphers should have balancedness, large nonlinearity, optimal algebraic immunity and high algebraic degree. Besides, one more criterion called strict avalanche criterion (SAC) can be also considered. During the last fifteen years, much work has been done to construct balanced Boolean functions with optimal algebraic immunity. However, none of them has the SAC property. In this paper, we first present a construction of balanced Boolean functions with SAC property by a slight modification of a known method for constructing Boolean functions with SAC property and consider the cryptographic properties of the constructed functions. Then we propose an infinite class of balanced functions with optimal algebraic immunity and SAC property in odd number of variables. This is the first time that such kind of functions have been constructed. The algebraic degree and nonlinearity of the functions in this class are also determined.
Ryosuke TSUCHIYA Kazuki NISHIKAWA Hironori WASHIZAKI Yoshiaki FUKAZAWA Yuya SHINOHARA Keishi OSHIMA Ryota MIBE
Traceability links between software artifacts can assist in several software development tasks. There are some automatic traceability recovery methods that help with managing the massive number of software artifacts and their relationships, but they do not work well for software artifacts whose descriptions are different in terms of language or abstraction level. To overcome these weakness, we propose the Connecting Links Method (CLM), which recovers transitive traceability links between two artifacts by intermediating a third artifact. In order to apply CLM for general use without limitation in terms of software artifact type, we have designed a standardized method to calculate the relation score of transitive traceability links using the scores of direct traceability links between three artifacts. Furthermore, we propose an improvement of CLM by considering software version. We evaluated CLM by applying it to three software products and found that it is more effective for software artifacts whose language type or vocabulary are different compared to previous methods using textual similarity.
Hongwei HAN Ke GUO Maozhi WANG Tingbin ZHANG Shuang ZHANG
The sparse unmixing of hyperspectral data has attracted much attention in recent years because it does not need to estimate the number of endmembers nor consider the lack of pure pixels in a given hyperspectral scene. However, the high mutual coherence of spectral libraries strongly affects the practicality of sparse unmixing. The collaborative sparse unmixing via variable splitting and augmented Lagrangian (CLSUnSAL) algorithm is a classic sparse unmixing algorithm that performs better than other sparse unmixing methods. In this paper, we propose a CLSUnSAL-based hyperspectral unmixing method based on dictionary pruning and reweighted sparse regression. First, the algorithm identifies a subset of the original library elements using a dictionary pruning strategy. Second, we present a weighted sparse regression algorithm based on CLSUnSAL to further enhance the sparsity of endmember spectra in a given library. Third, we apply the weighted sparse regression algorithm on the pruned spectral library. The effectiveness of the proposed algorithm is demonstrated on both simulated and real hyperspectral datasets. For simulated data cubes (DC1, DC2 and DC3), the number of the pruned spectral library elements is reduced by at least 94% and the runtime of the proposed algorithm is less than 10% of that of CLSUnSAL. For simulated DC4 and DC5, the runtime of the proposed algorithm is less than 15% of that of CLSUnSAL. For the real hyperspectral datasets, the pruned spectral library successfully reduces the original dictionary size by 76% and the runtime of the proposed algorithm is 11.21% of that of CLSUnSAL. These experimental results show that our proposed algorithm not only substantially improves the accuracy of unmixing solutions but is also much faster than some other state-of-the-art sparse unmixing algorithms.
In this paper, we propose a packet loss detection mechanism called Interest ACKnowledgement (ACK). Interest ACK provides information on the history of successful Interest packet receptions at a repository (i.e., content provider); this information is conveyed to the corresponding entity (i.e., content consumer) via the header of Data packets. Interest ACKs enable the entity to quickly and accurately detect Interest and Data packet losses in the network. We conduct simulations to investigate the effectiveness of Interest ACKs under several scenarios. Our results show that Interest ACKs are effective for improving the adaptability and stability of CCN with window-based flow control and that packet losses at the repository can be reduced by 10%-20%. Moreover, by extending Interest ACK, we propose a lossy link detection mechanism called LLD-IA (Lossy Link Detection with Interest ACKs), which is a mechanism for an entity to estimate the link where the packet was discarded in a network. Also, we show that LLD-IA can effectively detect links where packets were discarded under moderate packet loss ratios through simulation.
Naho ITO Most Shelina AKTAR Yuukou HORITA
In order to evaluate the vehicle detection method, it is necessary to know the correct vehicle position considered as “ground truth”. We propose indices considering subjective evaluation in vehicle detection utilizing IoU. Subjective evaluation experiments were carried out with respect to misregistration from ground truth in vehicle detection.