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

Keyword Search Result

[Keyword] ICE(1726hit)

201-220hit(1726hit)

  • Non-Linear Precoding Scheme Using MMSE Based Successive Inter-User Interference Pre-Cancellation and Perturbation Vector Search for Downlink MU-MIMO Systems

    Kenji HOSHINO  Manabu MIKAMI  Sourabh MAITI  Hitoshi YOSHINO  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2017/08/22
      Vol:
    E101-B No:2
      Page(s):
    451-461

    Non-linear precoding (NLP) scheme for downlink multi-user multiple-input multiple-output (DL-MU-MIMO) transmission has received much attention as a promising technology to achieve high capacity within the limited bandwidths available to radio access systems. In order to minimize the required transmission power for DL-MU-MIMO and achieve high spectrum efficiency, Vector Perturbation (VP) was proposed as an optimal NLP scheme. Unfortunately, the original VP suffers from significant computation complexity in detecting the optimal perturbation vector from an infinite number of the candidates. To reduce the complexity with near transmission performance of VP, several recent studies investigated various efficient NLP schemes based on the concept of Tomlinson-Harashima precoding (THP) that applies successive pre-cancellation of inter-user interference (IUI) and offsets the transmission vector based on a modulo operation. In order to attain transmission performance improvement over the original THP, a previous work proposed Minimum Mean Square Error based THP (MMSE-THP) employing IUI successive pre-cancellation based on MMSE criteria. On the other hand, to improve the transmission performance of MMSE-THP, other previous works proposed Ordered MMSE-THP and Lattice-Reduction-Aided MMSE-THP (LRA MMSE-THP). This paper investigates the further transmission performance improvement of Ordered MMSE-THP and LRA MMSE-THP. This paper starts by proposing an extension of MMSE-THP employing a perturbation vector search (PVS), called PVS MMSE-THP as a novel NLP scheme, where the modulo operation is substituted by PVS and a subtraction operation from the transmit signal vector. Then, it introduces an efficient search algorithm of appropriate perturbation vector based on a depth-first branch-and-bound search for PVS MMSE-THP. Next, it also evaluates the transmission performance of PVS MMSE-THP with the appropriate perturbation vector detected by the efficient search algorithm. Computer simulations quantitatively clarify that PVS MMSE-THP achieves better transmission performance than the conventional NLP schemes. Moreover, it also clarifies that PVS MMSE-THP increases the effect of required transmission power reduction with the number of transmit antennas compared to the conventional NLP schemes.

  • Statistical Model Using Geometrical-Optical Space Classification: Expansion of Applicable Frequencies to the 5 GHz Band

    Takahiro HASHIMOTO  Takayuki NAKANISHI  Yoshio INASAWA  Yasuhiro NISHIOKA  Hiroaki MIYASHITA  

     
    BRIEF PAPER-Electromagnetic Theory

      Vol:
    E101-C No:2
      Page(s):
    135-138

    The method for estimating propagation loss that classifies receiving points into multiple groups by focusing on the number of reflections and diffractions, and applies a separate statistical model to each group was extended from only 2.4 GHz band to both 2.4 GHz and 5 GHz band. The extended statistical model was created from received power measurements. First, an appropriate grouping method was investigated based on the fitting error of statistical model. Non-line-of-sight (NLOS) receiving points were grouped in order of points that a wave reflected one time reaches, points that a wave reflected two times reaches, and points that a wave diffracted one time reaches. Next, the effectiveness of the proposed method was verified by comparison with conventional statistical models (one-slope, dual-slope, multi-wall, partitioned) on three office floors that differ from the environment used to create the statistical model. The average NLOS estimation error for the three evaluation environments was 4.9 dB, demonstrating that the proposed method has accuracy equal to or better than that of conventional methods.

  • Painterly Morphing Effects for Mobile Smart Devices

    SungIk CHO  JungHyun HAN  

     
    LETTER-Computer Graphics

      Pubricized:
    2017/11/06
      Vol:
    E101-D No:2
      Page(s):
    568-571

    This paper proposes a painterly morphing algorithm for mobile smart devices, where each frame in the morphing sequence looks like an oil-painted picture with brush strokes. It can be presented, for example, during the transition between the main screen and a specific application screen. For this, a novel dissimilarity function and acceleration data structures are developed. The experimental results show that the algorithm produces visually stunning effects at an interactive time.

  • Safe-Region Generation Method for Versatile Continuous Vicinity Queries in the Road Network Distance

    Tin Nilar WIN  Htoo HTOO  Yutaka OHSAWA  

     
    PAPER-Intelligent Transport System

      Vol:
    E101-A No:2
      Page(s):
    472-480

    This paper proposes a fast safe-region generation method for several kinds of vicinity queries including set k nearest neighbor (NN) queries, ordered kNN queries, reverse kNN queries, and distance range queries. When a user is driving a car on a road network, he/she wants to know about objects located in the vicinity of the car. However, the result changes according to the movement of the car, and therefore, the user needs to request up-to-date result to the server. On the other hand, frequent requests for up-to-date results cause heavy loadings on the server. To cope with this problem efficiently, the idea of the safe-region has been proposed, however, it takes long processing time in existing works. This paper proposes a fast generation method of the safe-region applicable to several types of vicinity queries. Through experimental evaluations, we demonstrate that the proposed method outperforms the existing algorithms in the processing time by one or two orders of magnitude.

  • Joint Attack-Defense Strategy Based on Game Theory for Cognitive Devices in Covert Communication Networks

    Van-Hiep VU  Insoo KOO  

     
    LETTER-Communication Theory and Signals

      Vol:
    E101-A No:2
      Page(s):
    544-548

    This research addresses improvements in the efficiency of spectrum utilization by defending against jamming attacks and corrupting the communications of the adversary network by executing its own jamming strategy. The proposed scheme, based on game theory, selects the best operational strategy (i.e., communications and jamming strategies) to maximize the successful communications and jamming rates of the network. Moreover, an estimation algorithm is investigated to predict the behavior of the adversary network in order to improve the efficiency of the proposed game theory-based scheme.

  • Recent Developments in Post-Quantum Cryptography

    Tsuyoshi TAKAGI  

     
    INVITED PAPER

      Vol:
    E101-A No:1
      Page(s):
    3-11

    The security of current public-key cryptosystems relies on the hardness of factoring large integers or solving discrete logarithm problems. However, these mathematical problems can be solved in polynomial time using a quantum computer. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016. In this expository article, we give an overview of recent research on post-quantum cryptography. In particular, we describe the construction and security of multivariate polynomial cryptosystems and lattice-based cryptosystems, which are the main candidates of post-quantum cryptography.

  • Performance of Interference Rejection Combining Receiver Employing Minimum Mean Square Error Filter for Licensed-Assisted Access

    Jumpei YAMAMOTO  Shunichi BUSHISUE  Nobuhiko MIKI  

     
    PAPER-Fundamental Theories for Communications

      Pubricized:
    2017/07/13
      Vol:
    E101-B No:1
      Page(s):
    137-145

    To support the rapid increase of mobile traffic, the LTE-based air interface is expected to be employed in the unlicensed spectrum known as “Licensed-Assisted Access (LAA).” The LAA terminal, which employs an LTE-based air interface, suffers from interference from WiFi access points as well as the LAA base station. The interference rejection combining (IRC) receiver, which employs a linear minimum mean square error (MMSE) filter, can suppress this interference from WiFi access points in addition to that of the LAA base station. The IRC receiver is effective, since it requires no knowledge of the interference, which is generally difficult to obtain for different systems. In this paper, we use a link-level simulation to evaluate the performance of the IRC receiver in suppressing the interference from WiFi access points, and show that the IRC receiver can effectively cancel the interference from WiFi systems as well as LTE systems, although we observed a slight performance degradation due to the covariance matrix estimation error caused by the WiFi interference fluctuation in the frequency-domain.

  • Research Challenges for Network Function Virtualization - Re-Architecting Middlebox for High Performance and Efficient, Elastic and Resilient Platform to Create New Services - Open Access

    Kohei SHIOMOTO  

     
    INVITED SURVEY PAPER-Network

      Pubricized:
    2017/07/21
      Vol:
    E101-B No:1
      Page(s):
    96-122

    Today's enterprise, data-center, and internet-service-provider networks deploy different types of network devices, including switches, routers, and middleboxes such as network address translation and firewalls. These devices are vertically integrated monolithic systems. Software-defined networking (SDN) and network function virtualization (NFV) are promising technologies for dis-aggregating vertically integrated systems into components by using “softwarization”. Software-defined networking separates the control plane from the data plane of switch and router, while NFV decouples high-layer service functions (SFs) or Network Functions (NFs) implemented in the data plane of a middlebox and enables the innovation of policy implementation by using SF chaining. Even though there have been several survey studies in this area, this area is continuing to grow rapidly. In this paper, we present a recent survey of this area. In particular, we survey research activities in the areas of re-architecting middleboxes, state management, high-performance platforms, service chaining, resource management, and trouble shooting. Efforts in these research areas will enable the development of future virtual-network-function platforms and innovation in service management while maintaining acceptable capital and operational expenditure.

  • Fisheye Map Using Stroke-Based Generalization for Web Map Services

    Daisuke YAMAMOTO  Masaki MURASE  Naohisa TAKAHASHI  

     
    PAPER-Data Engineering, Web Information Systems

      Pubricized:
    2017/10/05
      Vol:
    E101-D No:1
      Page(s):
    171-180

    A fisheye map lets users view both detailed and wide areas. The Focus+Glue+Context map is a fisheye map suited for Web map systems; it consists of a detailed map (i.e., Focus), wide-area map (i.e., Context), and an area to absorb the difference in scales between Focus and Context (i.e., Glue). Because Glue is compressed, the road density is too high to draw all of the roads in this area. Although existing methods can filter roads to draw, they have problems with rendering the road density and connectivity in Glue. This paper proposes an improved method to filter roads in Glue by applying a generalization method based on weighted strokes. In addition, a technique to speed up the proposed method by using a weighted stroke database is described. A prototype Web map system with a high level of response was developed and evaluated in terms of its connectivity, road density, and response.

  • HMM-Based Maximum Likelihood Frame Alignment for Voice Conversion from a Nonparallel Corpus

    Ki-Seung LEE  

     
    LETTER-Speech and Hearing

      Pubricized:
    2017/08/23
      Vol:
    E100-D No:12
      Page(s):
    3064-3067

    One of the problems associated with voice conversion from a nonparallel corpus is how to find the best match or alignment between the source and the target vector sequences without linguistic information. In a previous study, alignment was achieved by minimizing the distance between the source vector and the transformed vector. This method, however, yielded a sequence of feature vectors that were not well matched with the underlying speaker model. In this letter, the vectors were selected from the candidates by maximizing the overall likelihood of the selected vectors with respect to the target model in the HMM context. Both objective and subjective evaluations were carried out using the CMU ARCTIC database to verify the effectiveness of the proposed method.

  • On a Characterization of a State of Rank-Modulation Scheme Over Multi-Cell Ranking by a Group Action

    Tomoharu SHIBUYA  Takeru SUDO  

     
    PAPER-Coding Theory and Techniques

      Vol:
    E100-A No:12
      Page(s):
    2558-2571

    In this paper, we propose a group theoretic representation suitable for the rank-modulation (RM) scheme over the multi-cell ranking presented by En Gad et al. By introducing an action of the group of all permutation matrices on the set of all permutations, the scheme is clearly reformulated. Moreover, we introduce the concept of r-dominating sets over the multi-cell ranking, which is a generalization of conventional dominating sets, in the design of rank-modulation rewriting codes. The concept together with the proposed group theoretic representation yields an explicit formula of an upper bound on the size of the set of messages that can be stored in the memory by using RM rewriting codes over multi-cell ranking. This bound enables us to consider the trade-off between the size of the storable message set and the rewriting cost more closely. We also provide a concrete example of RM rewriting code that is not available by conventional approaches and whose size of the storable message set can not be achieved by conventional codes.

  • Deep Learning-Based Fault Localization with Contextual Information

    Zhuo ZHANG  Yan LEI  Qingping TAN  Xiaoguang MAO  Ping ZENG  Xi CHANG  

     
    LETTER-Software Engineering

      Pubricized:
    2017/09/08
      Vol:
    E100-D No:12
      Page(s):
    3027-3031

    Fault localization is essential for solving the issue of software faults. Aiming at improving fault localization, this paper proposes a deep learning-based fault localization with contextual information. Specifically, our approach uses deep neural network to construct a suspiciousness evaluation model to evaluate the suspiciousness of a statement being faulty, and then leverages dynamic backward slicing to extract contextual information. The empirical results show that our approach significantly outperforms the state-of-the-art technique Dstar.

  • Precise Indoor Localization Method Using Dual-Facing Cameras on a Smart Device via Visible Light Communication

    Yohei NAKAZAWA  Hideo MAKINO  Kentaro NISHIMORI  Daisuke WAKATSUKI  Makoto KOBAYASHI  Hideki KOMAGATA  

     
    PAPER-Vision

      Vol:
    E100-A No:11
      Page(s):
    2295-2303

    In this paper, we propose a precise indoor localization method using visible light communication (VLC) with dual-facing cameras on a smart device (mobile phone, smartphone, or tablet device). This approach can assist the visually impaired with navigation, or provide mobile-robot control. The proposed method is different from conventional techniques in that dual-facing cameras are used to expand the localization area. The smart device is used as the receiver, and light-emitting diodes on the ceiling are used as localization landmarks. These are identified by VLC using a rolling shutter effect of complementary metal-oxide semiconductor image sensors. The front-facing camera captures the direct incident light of the landmarks, while the rear-facing camera captures mirror images of landmarks reflected from the floor face. We formulated the relationship between the poses (position and attitude) of the two cameras and the arrangement of landmarks using tilt detection by the smart device accelerometer. The equations can be analytically solved with a constant processing time, unlike conventional numerical methods, such as least-squares. We conducted a simulation and confirmed that the localization area was 75.6% using the dual-facing cameras, which was 3.8 times larger than that using only the front-facing camera. As a result of the experiment using two landmarks and a tablet device, the localization error in the horizontal direction was less than 98 mm at 90% of the measurement points. Moreover, the error estimation index can be used for appropriate route selection for pedestrians.

  • Lattice-Reduction Aided Signal Detection Method with Switching Detection Based on Channel Condition

    Seung-Jin CHOI  Jong-Kwang KIM  Hyoung-Kyu SONG  

     
    LETTER-Communication Theory and Signals

      Vol:
    E100-A No:11
      Page(s):
    2539-2542

    In this letter, a switching detection scheme based on a channel condition number for the MIMO-OFDM system is proposed. The switching algorithm operates by selecting one of three detection schemes of QRD-M, LR-aided MMSE-DFE, and LR-aided MMSE. The switching detection uses the threshold based on the switching algorithm according to the channel condition number. From the simulation results, the proposed detection scheme shows error detection performance and computational complexity in accordance with the threshold for switching detection.

  • Relay Mobile Device Discovery with Proximity Services for User-Provided IoT Networks

    Masanori ISHINO  Yuki KOIZUMI  Toru HASEGAWA  

     
    PAPER-Network

      Pubricized:
    2017/05/19
      Vol:
    E100-B No:11
      Page(s):
    2038-2048

    Internet of Things (IoT) devices deployed in urban areas are seen as data sources for urban sensing IoT applications. Since installing cellular interfaces on a huge number of IoT devices is expensive, we propose to use a user equipment (UE) device with a local wireless interface as a mobile IoT gateway for fixed IoT devices. In this paper, we design a new mobile architecture based on cellular networks to accommodate non-cellular fixed IoT devices by UE devices working as IoT gateways. One key feature is that our architecture leverages proximity services (ProSe) to discover relay UE devices with low overhead in terms of discovery messages. Through simulation studies, we clarify the feasibility of our architecture including the relay UE discovery mechanism in urban areas.

  • Non-Orthogonal Multiple Access Relaying for Device-to-Device Communication

    Young Bae SONG  Duk Kyung KIM  

     
    LETTER-Mobile Information Network and Personal Communications

      Vol:
    E100-A No:11
      Page(s):
    2551-2555

    Recently, non-orthogonal multiple access (NOMA) has gained a great deal of attention due to its ability to simultaneously transmit multiple streams. Device-to-device (D2D) relaying can increase the spectral efficiency via direct communication between two devices, and extends coverage by relaying signals from the base station. In this letter, we propose applying the NOMA technique for D2D relay where D2D relaying and D2D communication can be done simultaneously in the power domain. The proposed scheme can achieve higher spectral efficiency, and its performance is evaluated through extensive simulations in multiple-cell environments, compared with conventional D2D relay schemes.

  • A Generic and Efficient Local Service Function Chaining Framework for User VM-Dedicated Micro-VNFs

    Ryota KAWASHIMA  Hiroshi MATSUO  

     
    PAPER

      Pubricized:
    2017/05/16
      Vol:
    E100-B No:11
      Page(s):
    2017-2026

    The heart of Network Functions Virtualization (NFV) is both the softwarization of existing network middleboxes as Virtual Network Functions (VNFs) and the Service Function Chaining (SFC), also known as Service Chaining of them. Most existing VNFs are realized as VM-based general purpose appliances and shared by multiple user VMs. However, the cover range of VNF can be extended to directly reinforce network functionality of user VMs by introducing VM-specific VNFs. In this study, we propose micro-VNFs (µVNFs) and a VM-specific service chaining framework (vNFChain). Micro-VNFs are VM-specific lightweight VNFs that directly attach to a user VM, and can support not only traditional L2-L4 protocols but also stateful custom L7 protocols. The vNFChain framework constructs local service chains of µVNFs and transparently attaches the chain to the VM. Importantly, our framework achieves zero touch configuration for user VMs as well as no modification for existing system environments, such as virtual switch, hypervisor, and OS. In this paper, we describe architectural design and implementation of the framework. In addition, we evaluate the proposed approach in terms of throughput and CPU usage by comparing it with a DPDK-enabled VM-based µVNF model.

  • High-Speed 3-D Electroholographic Movie Playback Using a Digital Micromirror Device Open Access

    Naoki TAKADA  Masato FUJIWARA  ChunWei OOI  Yuki MAEDA  Hirotaka NAKAYAMA  Takashi KAKUE  Tomoyoshi SHIMOBABA  Tomoyoshi ITO  

     
    INVITED PAPER

      Vol:
    E100-C No:11
      Page(s):
    978-983

    This study involves proposing a high-speed computer-generated hologram playback by using a digital micromirror device for high-definition spatiotemporal division multiplexing electroholography. Consequently, the results indicated that the study successfully reconstructed a high-definition 3-D movie of 3-D objects that was comprised of approximately 900,000 points at 60 fps when each frame was divided into twelve parts.

  • A Paper Book Type Input Device for Page Navigation in Digital Documents Open Access

    Shohei MASUNAGA  Xingya XU  Hiroki TERABE  Kazuo SHIBUTA  Hirohito SHIBATA  

     
    INVITED PAPER

      Vol:
    E100-C No:11
      Page(s):
    984-991

    This paper aims to support quick and easy page access in digital documents. We tried to use a paper book as a device to navigate pages for digital documents. Our proposed system allows the users to perform the same interaction as a paper book such as inserting fingers among pages or folding an edge of the page as a dog-ear. Three experiments were conducted to confirm the effectiveness of the proposed system. As a result, we confirmed our proposed system was superior to conventional navigation methods especially in moving back and forth among pages.

  • Trend and Factor Analysis of Office Related Research in LOIS Technical Committee Open Access

    Toshihiko WAKAHARA  Toshitaka MAKI  Noriyasu YAMAMOTO  Akihisa KODATE  Manabu OKAMOTO  Hiroyuki NISHI  

     
    INVITED PAPER

      Pubricized:
    2017/07/21
      Vol:
    E100-D No:10
      Page(s):
    2383-2390

    The Life Intelligence and Office Information System (LOIS) Technical Committee of the Institute of Electronics, Information and Communication Engineers (IEICE) dates its origin to May 1986. This Technical Committee (TC) has covered the research fields of the office related systems for more than 30 years. Over this time, this TC, under its multiple name changes, has served as a forum for research and provided many opportunities for not only office users but also ordinary users of systems and services to present ideas and discussions. Therefore, these advanced technologies have been diffused from big enterprises to small companies and home users responsible for their management and operation. This paper sums up the technology trends and views of the office related systems and services covered in the 30 years of presentations of the LOIS Technical Committees by using the new literature analysis system based on the IEICE Knowledge Discovery system (I-Scover system).

201-220hit(1726hit)