IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Volume E101.A , Issue 8
Showing 1-14 articles out of 14 articles from the selected issue
Regular Section
  • Kenichi FUKUDA, Toshimitsu USHIO
    Type: PAPER
    Subject area: Systems and Control
    2018 Volume E101.A Issue 8 Pages 1156-1161
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    A composite system consists of many subsystems, which have interconnections with other subsystems. For such a system, in general, we utilize decentralized control, where each subsystem is controlled by a local controller. On the other hand, event-triggered control is one of useful approaches to reduce the amount of communications between a controller and a plant. In the event-triggered control, an event triggering mechanism (ETM) monitors the information of the plant, and determines the time to transmit the data. In this paper, we propose a design of ETMs for the decentralized event-triggered control of nonlinear composite systems using an M-matrix. We consider the composite system where there is an ETM for each subsystem, and ETMs monitor local states of the corresponding subsystems. Each ETM is designed so that the composite system is stabilized. Moreover, we deal with the case of linear systems. Finally, we perform simulation to show that the proposed triggering rules are useful for decentralized control.

    Download PDF (1250K)
  • Youngjun YOO, Daesung JUNG, Sangchul WON
    Type: PAPER
    Subject area: Systems and Control
    2018 Volume E101.A Issue 8 Pages 1162-1171
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    We propose a weighted subtask controller and sufficient conditions for boundedness of the controller both velocity and acceleration domain. Prior to designing the subtask controller, a task controller is designed for global asymptotic stability of task space error and subtask error. Although the subtask error converges to zero by the task controller, the boundedness of the subtask controller is also important, therefore its boundedness conditions are presented. The weighted pseudo inverse is introduced to relax the constraints of the null-space of Jacobian. Using the pseudo inverse, we design subtask controller and propose sufficient conditions for boundedness of the auxiliary signal to show the existence of the inverse kinematic solution. The results of experiments using 7-DOF WAM show the effectiveness of the proposed controller.

    Download PDF (3439K)
  • Shoko KIMURA, Yoshihiko SUSUKI, Atsushi ISHIGAME
    Type: PAPER
    Subject area: Systems and Control
    2018 Volume E101.A Issue 8 Pages 1172-1184
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    We address a BEMS (Building Energy Management System) to guarantee reliability of electric-power supply in dynamic uncertain environments. The building microgrid as the target of BEMS has multiple distributed power sources including a photo-voltaic power system and Electric-Vehicle (EV). EV is regarded as an autonomously-moving battery due to the original means of transportation and is hence a cause of dynamic uncertainty of the building microgrid. The main objective of synthesis of BEMS in this paper is to guarantee the continuous supply of power to the most critical load in a building microgrid and to realize the power supply to the other loads according to a ranking of load importance. We synthesize the BEMS as a reactive control system that monitors changes of dynamic uncertain environment of the microgrid including departure and arrival of an EV, and determines a route of power supply to the most critical load. Also, we conduct numerical experiments of the reactive BEMS using models of power flows in the building and of charging states of the batteries. The experiments are incorporated with data measured in a practical office building and demonstration project of EMS at Osaka, Japan. We show that the BEMS works for extending the time duration of continuous power supply to the most critical load.

    Download PDF (1913K)
  • Nobutaro SHIBATA, Mitsuo NAKAMURA
    Type: PAPER
    Subject area: VLSI Design Technology and CAD
    2018 Volume E101.A Issue 8 Pages 1185-1196
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    Timing vernier (i.e., digital-to-time converter) is a key component of the pin-electronics circuit board installed in automated digital-VLSI test equipment, and it is used to create fine delays of less than one-cycle time of a clock signal. This paper presents a new on-the-fly (timing-) jitter suppression technique which makes it possible to use low-power plain-CMOS-logic-based timing verniers. Using a power-compensation line installed at the poststage of the digitally variable delay line, we make every pulse (used as a timing signal) consume a fixed amount of electric energy independent of the required delay amount. Since the power load of intrapowerlines is kept constantly, the jitter increase in the situation of changing the required delay amount on the fly is suppressed. On the basis of the concept, a 10-ns span, 125-MHz timing-vernier macro was designed and fabricated with a CMOS process for logic VLSIs. Every macro installed in a real-time timing-signal generator VLSI achieved the required timing resolution of 31.25ps with a linearity error within 15ps. The on-the-fly jitter was successfully suppressed to a random jitter level (<26ps p-p).

    Download PDF (1163K)
  • Zhihua NIU, Deyu KONG, Yanli REN, Xiaoni DU
    Type: PAPER
    Subject area: Cryptography and Information Security
    2018 Volume E101.A Issue 8 Pages 1197-1203
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    The k-error linear complexity of a sequence is a fundamental concept for assessing the stability of the linear complexity. After computing the k-error linear complexity of a sequence, those bits that cause the linear complexity reduced also need to be determined. For binary sequences with period 2pn, where p is an odd prime and 2 is a primitive root modulo p2, we present an algorithm which computes the minimum number k such that the k-error linear complexity is not greater than a given constant c. The corresponding error sequence is also obtained.

    Download PDF (1281K)
  • Atsushi IWASAKI, Ken UMENO
    Type: PAPER
    Subject area: Cryptography and Information Security
    2018 Volume E101.A Issue 8 Pages 1204-1214
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    The Discrete Fourier Transform Test (DFTT) is a randomness test in NIST SP800-22. However, to date, the theoretical reference distribution of the DFTT statistic has not been derived, which is problematic. We propose a new test using power spectrum variance as the test statistic whose reference distribution can be derived theoretically. Note that the purpose of both the DFTT and the proposed test is to detect periodic features. Experimental results demonstrate that the proposed test has stronger detection power than the DFTT and that it test can be used even for short sequences.

    Download PDF (945K)
  • Ryutaroh MATSUMOTO
    Type: PAPER
    Subject area: Coding Theory
    2018 Volume E101.A Issue 8 Pages 1215-1222
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    We show a construction of a quantum ramp secret sharing scheme from a nested pair of linear codes. Necessary and sufficient conditions for qualified sets and forbidden sets are given in terms of combinatorial properties of nested linear codes. An algebraic geometric construction for quantum secret sharing is also given.

    Download PDF (360K)
  • Toshihiro NIINOMI, Hideki YAGI, Shigeichi HIRASAWA
    Type: PAPER
    Subject area: Coding Theory
    2018 Volume E101.A Issue 8 Pages 1223-1234
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    Recently, Hof et al. extended the type-2 Duman and Salehi (DS2) bound to generalized decoding, which was introduced by Forney, with decision criterion FR. From this bound, they derived two significant bounds. One is the Shulman-Feder bound for generalized decoding (GD) with the binary-input output-symmetric channel. The other is an upper bound for an ensemble of linear block codes, by applying the average complete weight distribution directly to the DS2 bound for GD. For the Shulman-Feder bound for GD, the authors derived a condition under which an upper bound is minimized at an intermediate step and show that this condition yields a new bound which is tighter than Hof et al.'s bound. In this paper, we first extend this result for non-binary linear block codes used over a class of symmetric channels called the regular channel. Next, we derive a new tighter bound for an ensemble of linear block codes, which is based on the average weight distribution.

    Download PDF (936K)
  • Shunsuke UEDA, Ken IKUTA, Takuya KUSAKA, Md. Al-Amin KHANDAKER, Md. Ar ...
    Type: PAPER
    Subject area: Coding Theory
    2018 Volume E101.A Issue 8 Pages 1235-1244
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    Generalized Minimum Distance (GMD) decoding is a well-known soft-decision decoding for linear codes. Previous research on GMD decoding focused mainly on unquantized AWGN channels with BPSK signaling for binary linear codes. In this paper, a study on the design of a 4-level uniform quantizer for GMD decoding is given. In addition, an extended version of a GMD decoding algorithm for a 4-level quantizer is proposed, and the effectiveness of the proposed decoding is shown by simulation.

    Download PDF (2045K)
  • Yuyang HUANG, Li-Ta HSU, Yanlei GU, Shunsuke KAMIJO
    Type: PAPER
    Subject area: Intelligent Transport System
    2018 Volume E101.A Issue 8 Pages 1245-1256
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    Accurate pedestrian navigation remains a challenge in urban environments. GNSS receiver behaves poorly because the reflection and blockage of the GNSS signals by buildings or other obstacles. Integration of GNSS positioning and Pedestrian Dead Reckoning (PDR) could provide a more smooth navigation trajectory. However, the integration system cannot present the satisfied performance if GNSS positioning has large error. This situation often happens in the urban scenario. This paper focuses on improving the accuracy of the pedestrian navigation in urban environment using a proposed altitude map aided GNSS positioning method. Firstly, we use consistency check algorithm, which is similar to receiver autonomous integrity monitoring (RAIM) fault detection, to distinguish healthy and multipath contaminated measurements. Afterwards, the erroneous signals are corrected with the help of an altitude map. We called the proposed method altitude map aided GNSS. After correcting the erroneous satellite signals, the positioning mean error could be reduced from 17 meters to 12 meters. Usually, good performance for integration system needs accurately calculated GNSS accuracy value. However, the conventional GNSS accuracy calculation is not reliable in urban canyon. In this paper, the altitude map is also utilized to calculate the GNSS localization accuracy in order to indicate the reliability of the estimated position solution. The altitude map aided GNSS and accuracy are used in the integration with PDR system in order to provide more accurate and continuous positioning results. With the help of the proposed GNSS accuracy, the integration system could achieve 6.5 meters horizontal positioning accuracy in urban environment.

    Download PDF (7362K)
  • Bin HU, Xiaochuan WU, Xin ZHANG, Qiang YANG, Di YAO, Weibo DENG
    Type: LETTER
    Subject area: Digital Signal Processing
    2018 Volume E101.A Issue 8 Pages 1257-1262
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    A new method for adaptive digital beamforming technique with compressed sensing (CS) for sparse receiving arrays with gain/phase uncertainties is presented. Because of the sparsity of the arriving signals, CS theory can be adopted to sample and recover receiving signals with less data. But due to the existence of the gain/phase uncertainties, the sparse representation of the signal is not optimal. In order to eliminating the influence of the gain/phase uncertainties to the sparse representation, most present study focus on calibrating the gain/phase uncertainties first. To overcome the effect of the gain/phase uncertainties, a new dictionary optimization method based on the total least squares (TLS) algorithm is proposed in this paper. We transfer the array signal receiving model with the gain/phase uncertainties into an EIV model, treating the gain/phase uncertainties effect as an additive error matrix. The method we proposed in this paper reconstructs the data by estimating the sparse coefficients using CS signal reconstruction algorithm and using TLS method toupdate error matrix with gain/phase uncertainties. Simulation results show that the sparse regularized total least squares algorithm can recover the receiving signals better with the effect of gain/phase uncertainties. Then adaptive digital beamforming algorithms are adopted to form antenna beam using the recovered data.

    Download PDF (527K)
  • Lianfei LUO, Wenping MA, Feifei ZHAO
    Type: LETTER
    Subject area: Information Theory
    2018 Volume E101.A Issue 8 Pages 1263-1266
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    Let Fpm be the field of pm elements where p is an odd prime. In this letter, binary sequence pairs of period N=pm-1 are presented, where sequences are generated from the polynomial x2-c for any c ∈ Fpm\{0}. The cross-correlation values of sequence pairs are completely determined, our results show that those binary sequence pairs have optimal three-level correlation.

    Download PDF (247K)
  • Shanqi PANG, Xiao LIN, Jing WANG
    Type: LETTER
    Subject area: Information Theory
    2018 Volume E101.A Issue 8 Pages 1267-1272
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    In this study, we developed a new orthogonal partition concept for asymmetric orthogonal arrays and used it for the construction of orthogonal arrays for the first time. Permutation matrices and the Kronecker product were also successfully and skillfully used as our main tools. Hence, a new general iterative construction method for asymmetric orthogonal arrays of high strength was developed, and some new infinite families of orthogonal arrays of strength 3 and several new orthogonal arrays of strength 4, 5, and 6 were obtained.

    Download PDF (191K)
  • Min ZHANG, Jianxin DAI, Jin-Yuan WANG, Junxi ZHAO, Chonghu CHENG
    Type: LETTER
    Subject area: Communication Theory and Signals
    2018 Volume E101.A Issue 8 Pages 1273-1279
    Published: August 01, 2018
    Released: August 01, 2018
    JOURNALS RESTRICTED ACCESS

    This paper considers a multi-user large-scale multiple-input multiple-output (MIMO) system with single cell working in full-duplex mode. Maximum ratio combining/maximum ratio transmission (MRC/MRT) is applied to maximize the output signal to noise ratio (SNR) of the receiver. Then we deduce the asymptotic uplink and downlink sum rate in full-duplex mode by using the large number theorem, also giving the comparison of traditional half-duplex and full-duplex. Besides, we analyze the influence of Doppler shift on the performance of the system. Finally, the change of the system performance on the user velocity is illustrated.

    Download PDF (411K)
feedback
Top