This paper considers the power allocation (PA) problem for three-node decode-and-forward (DF) relay communication systems, where the aggregate transmit power constraint is imposed on the source and the relay and the optimization target is to maximize the system's instantaneous information rate. Since the relay is equipped with multiple antennas, the receiver and transmitter beamforming strategies are generally adopted. In this paper, we start by proposing a closed-form solution for the frequency-flat (FF) fading environment, then give a bisection algorithm with low complexity to obtain an optimal solution for the frequency-selective (FS) fading scenario. Finally, simulations validate the proposed methods.
Sungho JEON Junghyun KIM Jaekwon LEE Young-Woo SUH Jong-Soo SEO
In this paper, we propose a power amplifier linearization technique combined with iterative noise cancelation. This method alleviates the effect of added noises which prevents the predistorter (PD) from estimating the exact characteristics of the power amplifier (PA). To iteratively cancel the noise added in the feedback signal, the output signal of the power amplifier without noise is reconstructed by applying the inverse characteristics of the PD to the predistorted signals. The noise can be revealed by subtracting the reconstructed signals from the feedback signals. Simulation results based on the mean-square error (MSE) and power spectral density (PSD) criteria are presented to evaluate PD performance. The results show that the iterative noise cancelation significantly enhances the MSE performance, which leads to an improvement of the out-of-band power suppression. The performance of the proposed technique is verified by computer simulation and hardware test results.
In this paper, we investigate two improved turbo receivers for the Long Term Evolution (LTE) uplink in the presence of transmitter (Tx) in-phase and quadrature-phase imbalance (IQI) with parameters known at eNodeB. For multiuser multiple-input multiple-output (MU-MIMO) single-carrier frequency division multiple access (SC-FDMA) systems, we derive a optimal joint linear minimum mean square error (MMSE) turbo multiuser detector (MUD) based on the mirror symmetry clusters. For the single use SC-FDMA system with Tx IQI, we derive an optimal widely linear MMSE (WLMMSE) turbo equalizer. Both receivers are implemented in the discrete frequency domain and only slightly increase the computational complexity compared to the conventional turbo receivers. Monte Carlo simulations show that the proposed receivers significantly outperform the conventional turbo receivers. The simulation results are then confirmed by the extrinsic information transfer (EXIT) chart analysis.
Hui DENG Xiaoming TAO Ning GE Jianhua LU
This letter studies cellular controlled short-range communication in OFDMA networks. The network needs to decide when to allow direct communication between a closely located device-to-device (D2D) pair instead of conveying data from one device to the other via the base station and when not to, in addition to subchannel and power allocation. Our goal is to maximize the total network throughput while guaranteeing the rate requirements of all users. For that purpose, we formulate an optimization problem subject to subchannel and power constraints. A scheme which combines a joint mode selection and subchannel allocation algorithm based on equal power allocation with a power reallocation scheme is proposed. Simulation results show that our proposed scheme can improve the network throughput and outage probability compared with other schemes.
Shuang BAI Tetsuya MATSUMOTO Yoshinori TAKEUCHI Hiroaki KUDO Noboru OHNISHI
In this letter, we introduce a novel patch sampling strategy for the task of image classification, which is fundamentally different from current patch sampling strategies. A top-down guidance learned from training images is used to guide patch sampling towards informative regions. Experiment results show that this approach achieved noticeable improvement over baseline patch sampling strategies for the classification of both object categories and scene categories.
Jin-Ping HE Guang-Da SU Jian-Sheng CHEN
To reconstruct low-resolution facial photographs which are in focus and without motion blur, a novel algorithm based on local similarity preserving is proposed. It is based on the theories of local manifold learning. The innovations of the new method include mixing point-based entropy and Euclidian distance to search for the nearest points, adding point-to-patch degradation model to restrict the linear weights and compensating the fusing patch to keep energy coherence. The compensation reduces the algorithm dependence on training sets and keeps the luminance of reconstruction constant. Experiments show that our method can effectively reconstruct 1612 images with the magnification of 88 and the 3224 facial photographs in focus and without motion blur.
Seung-Yeon KIM Sang-Sik AHN Seungwan RYU Choong-Ho CHO Hyong-Woo LEE
In this letter, we propose and analyze a cooperative transmission scheme (CTS) that uses transmission timing control for LTE enterprise femtocells. In our scheme, the user equipment (UE) can receive the desired signal from an adjacent fBS as well as its serving femtocell BS (fBS). Thus, UE achieves an improved signal to interference ratio (SIR) due to the synchronization of the two signals. Analysis and simulation results show that the proposed scheme can reduce the outage probability for enterprise femtocells compared to the conventional system. In particular, a significant performance improvement can be achieved for UEs located at cell edges.
Tadachika OKI Satoshi TAOKA Toshiya MASHIMA Toshimasa WATANABE
The k-edge-connectivity augmentation problem with bipartition constraints (kECABP, for short) is defined by “Given an undirected graph G=(V, E) and a bipartition π = {VB, VW} of V with VB ∩ VW = ∅, find an edge set Ef of minimum cardinality, consisting of edges that connect VB and VW, such that G'=(V, E ∪ Ef) is k-edge-connected.” The problem has applications for security of statistical data stored in a cross tabulated table, and so on. In this paper we propose a fast algorithm for finding an optimal solution to (σ + 1)ECABP in O(|V||E| + |V2|log |V|) time when G is σ-edge-connected (σ > 0), and show that the problem can be solved in linear time if σ ∈ {1, 2}.
This paper presents recent progress made in the development of an optical packet and circuit integrated network. From the viewpoint of end users, this is a single network that provides both high-speed, inexpensive services and deterministic-delay, low-data-loss services according to the users' usage scenario. From the viewpoint of network service providers, this network provides large switching capacity with low energy requirements, high flexibility, and efficient resource utilization with a simple control mechanism. The network we describe here will contribute to diversification of services, enhanced functional flexibility, and efficient energy consumption, which are included in the twelve design goals of Future Networks announced by ITU-T (International Telecommunication Union - Telecommunication Standardization Sector). We examine the waveband-based network architecture of the optical packet and circuit integrated network. Use of multi-wavelength optical packet increases the switch throughput while minimizing energy consumption. A rank accounting method provides a solution to the problem of inter-domain signaling for end-to-end lightpath establishment. Moving boundary control for packet and circuit services makes for efficient resource utilization. We also describe related advanced technologies such as waveband switching, elastic lightpaths, automatic locator numbering assignment, and biologically-inspired control of optical integrated network.
Yo-Han KO Chang-Hwan PARK Soon-Jik KWON Yong-Soo CHO
In this paper, cell searching and direction-of-arrival (DoA) estimation methods are proposed for mobile relay stations with a uniform linear arrays in OFDM-based cellular systems. The proposed methods can improve the performance of cell searching and DoA estimation, even when there exist symbol timing offsets among the signals received from adjacent base stations and Doppler frequency shifts caused by the movement of the mobile relay station. The performances and computational complexities of the proposed cell searching and DoA estimation methods are evaluated by computer simulation under a mobile WiMAX environment.
Hideaki MISAWA Keiichi HORIO Nobuo MOROTOMI Kazumasa FUKUDA Hatsumi TANIGUCHI
In the present paper, we address the problem of extrapolating group proximities from member relations, which we refer to as the group proximity problem. We assume that a relational dataset consists of several groups and that pairwise relations of all members can be measured. Under these assumptions, the goal is to estimate group proximities from pairwise relations. In order to solve the group proximity problem, we present a method based on embedding and distribution mapping, in which all relational data, which consist of pairwise dissimilarities or dissimilarities between members, are transformed into vectorial data by embedding methods. After this process, the distributions of the groups are obtained. Group proximities are estimated as distances between distributions by distribution mapping methods, which generate a map of distributions. As an example, we apply the proposed method to document and bacterial flora datasets. Finally, we confirm the feasibility of using the proposed method to solve the group proximity problem.
Xinhai XU Xuejun YANG Yufei LIN
As supercomputers increase in size, the mean time between failures (MTBF) of a system becomes shorter, and the reliability problem of supercomputers becomes more and more serious. MPI is currently the de facto standard used to build high-performance applications, and researches on the fault tolerance methods of MPI are always hot topics. However, due to the characteristics of MPI programs, most current checkpointing methods for MPI programs need to modify the MPI library (even operating system), or implement a complicated protocol by logging lots of messages. In this paper, we carry forward the idea of Application-Level Checkpointing (ALC). Based on the general fact that programmers are familiar with the communication characteristics of applications, we have developed BC-ALC, a new portable blocking coordinated ALC for MPI programs. BC-ALC neither modifies the MPI library (even operating system) nor logs any message. It implements coordination only by the Barrier operations instead of any complicated protocol. Furthermore, in order to reduce the cost of fault-tolerance, we reduce the synchronization range of the barrier, and design WBC-ALC, a weak blocking coordinated ALC utilizing group synchronization instead of global synchronization based on the communication relationship between processes. We also propose a fault-tolerance framework developed on top of WBC-ALC and discuss an implementation of it. Experimental results on NPB3.3-MPI benchmarks validate BC-ALC and WBC-ALC, and show that compared with BC-ALC, the average coordination time and the average backup time of a single checkpoint in WBC-ALC are reduced by 44.5% and 5.7% respectively.
Masanobu ISHIKAWA Katsuhisa YAMANAKA Yota OTACHI Shin-ichi NAKANO
This paper presents an efficient algorithm to generate all (unordered) rooted trees with exactly n vertices including exactly k leaves. There are known results on efficient enumerations of some classes of graphs embedded on a plane, for instance, biconnected and triconnected triangulations [3],[6], and floorplans [4]. On the other hand, it is difficult to enumerate a class of graphs without a fixed embedding. The paper is on enumeration of rooted trees without a fixed embedding. We already proposed an algorithm to generate all “ordered” trees with n vertices including k leaves [11], while the algorithm cannot seem to efficiently generate all (unordered) rooted trees with n vertices including k leaves. We design a simple tree structure among such trees, then by traversing the tree structure we generate all such trees in constant time per tree in the worst case. By repeatedly applying the algorithm for each k=1,2, ...,n-1, we can also generate all rooted trees with exactly n vertices.
Keisuke KUROIWA Masaki KADOWAKI Masataka MORIYA Hiroshi SHIMADA Yoshinao MIZUGAKI
Superconducting integrated circuits should be operated at low temperature below a half of their critical temperatures. Thermal heat from a bias resistor could rise the temperature in Josephson junctions, and would reduce their critical currents. In this study, we estimate the temperature in a Josephson junction heated by a bias resistor at the bath temperature of 4.2 K, and introduce a parameter β that connects the thermal heat from a bias resistor and the temperature elevation of a Josephson junction. By using β, the temperature in the Josephson junction can be estimated as functions of the current through the resistor.
Takamichi SAITO Kiyomi SEKIGUCHI Ryosuke HATSUGAI
While the Secure Socket Layer or Transport Layer Security (SSL/TLS) is assumed to provide secure communications over the Internet, many web applications utilize basic or digest authentication of Hyper Text Transport Protocol (HTTP) over SSL/TLS. Namely, in the scheme, there are two different authentication schemes in a session. Since they are separated by a layer, these are not convenient for a web application. Moreover, the scheme may also cause problems in establishing secure communication. Then we provide a scheme of authentication binding between SSL/TLS and HTTP without modifying SSL/TLS protocols and its implementation, and we show the effectiveness of our proposed scheme.
Sumiko MIYATA Katsunori YAMAOKA
We have proposed a novel call admission control (CAC) for maximizing total user satisfaction in a heterogeneous traffic network and showed the effectiveness of our CAC by using an optimal threshold from numerical analysis [1]. In our previous CAC, when a new broadband flow arrives and the total accommodated bandwidth is more than or equal to the threshold, the arriving new broadband flow is rejected. In actual networks, however, users may agree to wait for a certain period until the broadband flow, such as video, begins to play. In this paper, when total accommodated bandwidth is more than or equal to the threshold, arriving broadband flows wait instead of being rejected. As a result, we can greatly improve total user satisfaction.
Kyung-Hoon WON Jun-Hee JANG Hyung-Jin CHOI
In 3GPP (3-rd Generation Partnership Project) LTE (Long Term Evolution) system, the use of PRS (Positioning Reference Signal) for OTDOA (Observed Time Difference of Arrival) based positioning method has been agreed. However, PRSs can be overlapped at the receiver side in synchronous network because the frequency shift pattern of PRS is decided by cell ID (Identity). Moreover, in asynchronous network, the loss of orthogonality between received PRSs generates continuous interferences. Even though autonomous muting can be applied to solve the interference problems in synchronous and asynchronous networks, the muting scheme degrades the overall positioning efficiency and requires additional network complexity. Therefore, in this paper, we propose novel OTDOA based positioning methods at the receiver side to improve positioning efficiency: cancellation method of serving PRS for synchronous network, TDORS (Time Domain Orthogonal Reference Signal) generation and useful CIR (Channel Impulse Response) selection methods for asynchronous network. We verified that the proposed methods can achieve an accurate estimation and stable operation without PRS muting.
Yasutoshi ISHIHARA Tsuyoshi KUWABARA Takumi HONMA Yohei NAKAGAWA
Magnetic particle imaging (MPI), in which the nonlinear interaction between internally administered magnetic nanoparticles (MNPs) and electromagnetic waves irradiated from outside of the body is utilized, has attracted attention for its potential to achieve early diagnosis of diseases such as cancer. In MPI, the local magnetic field distribution is scanned, and the magnetization signal from MNPs within a selected region is detected. However, the signal sensitivity and image resolution are degraded by interference from magnetization signals generated by MNPs outside of the selected region, mainly because of imperfections (limited gradients) in the local magnetic field distribution. Here, we propose new methods based on correlation information between the observed signal and the system function–defined as the interaction between the magnetic field distribution and the magnetizing properties of MNPs. We performed numerical analyses and found that, although the images were somewhat blurred, image artifacts could be significantly reduced and accurate images could be reconstructed without the inverse-matrix operation used in conventional image reconstruction methods.
Yeo-Chan YOON Myung-Gil JANG Hyun-Ki KIM So-Young PARK
In this paper, we propose a duplicate document detection model recognizing both partial duplicates and near duplicates. The proposed model can detect partial duplicates as well as exact duplicates by splitting a large document into many small sentence fingerprints. Furthermore, the proposed model can detect even near duplicates, the result of trivial revisions, by filtering the common words and reordering the word sequence.
Shinichiro YAMAMOTO Daisuke ISHIHARA Kenichi HATAKEYAMA
This paper proposes a method of designing EM absorber panels under oblique incident waves. TM and TE wave reflection characteristics of the absorber panel show its anisotropy under oblique incidence. By using the wire array sheet proposed this paper, TM and TE reflection coefficients in oblique incidence can be matched at almost the same frequency range.