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

Keyword Search Result

[Keyword] time(2217hit)

281-300hit(2217hit)

  • A Polynomial Time Pattern Matching Algorithm on Graph Patterns of Bounded Treewidth

    Takayoshi SHOUDAI  Takashi YAMADA  

     
    PAPER

      Vol:
    E100-A No:9
      Page(s):
    1764-1772

    This paper deals with a problem to decide whether a given graph structure appears as a pattern in the structure of a given graph. A graph pattern is a triple p=(V,E,H), where (V,E) is a graph and H is a set of variables, which are ordered lists of vertices in V. A variable can be replaced with an arbitrary connected graph by a kind of hyperedge replacements. A substitution is a collection of such replacements. The graph pattern matching problem (GPMP) is the computational problem to decide whether or not a given graph G is obtained from a given graph pattern p by a substitution. In this paper, we show that GPMP for a graph pattern p and a graph G is solvable in polynomial time if the length of every variable in p is 2, p is of bounded treewidth, and G is connected.

  • BEM Channel Estimation for OFDM System in Fast Time-Varying Channel

    Fei LI  Zhizhong DING  Yu WANG  Jie LI  Zhi LIU  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2017/02/09
      Vol:
    E100-B No:8
      Page(s):
    1462-1471

    In this paper, the problem of channel estimation in orthogonal frequency-division multiplexing systems over fast time-varying channel is investigated by using a Basis Expansion Model (BEM). Regarding the effects of the Gibbs phenomenon in the BEM, we propose a new method to alleviate it and reduce the modeling error. Theoretical analysis and detail comparison results show that the proposed BEM method can provide improved modeling error compared with other BEMs such as CE-BEM and GCE-BEM. In addition, instead of using the frequency-domain Kronecker delta structure, a new clustered pilot structure is proposed to enhance the estimation performance further. The new clustered pilot structure can effectively reduce the inter-carrier interference especially in the case of high Doppler spreads.

  • Cooperative Distributed Antenna Transmission for 5G Mobile Communications Network

    Fumiyuki ADACHI  Amnart BOONKAJAY  Yuta SEKI  Tomoyuki SAITO  Shinya KUMAGAI  Hiroyuki MIYAZAKI  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2017/02/08
      Vol:
    E100-B No:8
      Page(s):
    1190-1204

    In this paper, the recent advances in cooperative distributed antenna transmission (CDAT) are introduced for spatial diversity and multi-user spatial multiplexing in 5G mobile communications network. CDAT is an advanced version of the coordinated multi-point (CoMP) transmission. Space-time block coded transmit diversity (STBC-TD) for spatial diversity and minimum mean square error filtering combined with singular value decomposition (MMSE-SVD) for multi-user spatial multiplexing are described under the presence of co-channel interference from adjacent macro-cells. Blind selected mapping (blind SLM) which requires no side information transmission is introduced in order to suppress the increased peak-to-average signal power ratio (PAPR) of the transmit signals when CDAT is applied. Some computer simulation results are presented to confirm the effectiveness of CDAT techniques.

  • A Client Based DNSSEC Validation System with Adaptive Alert Mechanism Considering Minimal Client Timeout

    Yong JIN  Kunitaka KAKOI  Nariyoshi YAMAI  Naoya KITAGAWA  Masahiko TOMOISHI  

     
    PAPER-Internet Security

      Pubricized:
    2017/05/18
      Vol:
    E100-D No:8
      Page(s):
    1751-1761

    The widespread usage of computers and communication networks affects people's social activities effectively in terms of intercommunication and the communication generally begins with domain name resolutions which are mainly provided by DNS (Domain Name System). Meanwhile, continuous cyber threats to DNS such as cache poisoning also affects computer networks critically. DNSSEC (DNS Security Extensions) is designed to provide secure name resolution between authoritative zone servers and DNS full resolvers. However high workload of DNSSEC validation on DNS full resolvers and complex key management on authoritative zone servers hinder its wide deployment. Moreover, querying clients use the name resolution results validated on DNS full resolvers, therefore they only get errors when DNSSEC validation fails or times out. In addition, name resolution failure can occur on querying clients due to technical and operational issues of DNSSEC. In this paper, we propose a client based DNSSEC validation system with adaptive alert mechanism considering minimal querying client timeout. The proposed system notifies the user of alert messages with answers even when the DNSSEC validation on the client fails or timeout so that the user can determine how to handle the received answers. We also implemented a prototype system and evaluated the features on a local experimental network as well as in the Internet. The contribution of this article is that the proposed system not only can mitigate the workload of DNS full resolvers but also can cover querying clients with secure name resolution, and by solving the existing operation issues in DNSSEC, it also can promote DNSSEC deployment.

  • A Novel Channel Assignment Method to Ensure Deadlock-Freedom for Deterministic Routing

    Ryuta KAWANO  Hiroshi NAKAHARA  Seiichi TADE  Ikki FUJIWARA  Hiroki MATSUTANI  Michihiro KOIBUCHI  Hideharu AMANO  

     
    PAPER-Computer System

      Pubricized:
    2017/05/19
      Vol:
    E100-D No:8
      Page(s):
    1798-1806

    Inter-switch networks for HPC systems and data-centers can be improved by applying random shortcut topologies with a reduced number of hops. With minimal routing in such networks; however, deadlock-freedom is not guaranteed. Multiple Virtual Channels (VCs) are efficiently used to avoid this problem. However, previous works do not provide good trade-offs between the number of required VCs and the time and memory complexities of an algorithm. In this work, a novel and fast algorithm, named ACRO, is proposed to endorse the arbitrary routing functions with deadlock-freedom, as well as consuming a small number of VCs. A heuristic approach to reduce VCs is achieved with a hash table, which improves the scalability of the algorithm compared with our previous work. Moreover, experimental results show that ACRO can reduce the average number of VCs by up to 63% when compared with a conventional algorithm that has the same time complexity. Furthermore, ACRO reduces the time complexity by a factor of O(|N|⋅log|N|), when compared with another conventional algorithm that requires almost the same number of VCs.

  • Increasing Splitting Ratio of Extended-Reach WDM/TDM-PON by Using Central Office Sited Automatic Gain Controlled SOAs

    Masamichi FUJIWARA  Ryo KOMA  

     
    PAPER-Fiber-Optic Transmission for Communications

      Pubricized:
    2017/02/02
      Vol:
    E100-B No:8
      Page(s):
    1388-1396

    To drastically increase the splitting ratio of extended-reach (40km span) time- and wavelength-division multiplexed passive optical networks (WDM/TDM-PONs), we modify the gain control scheme of our automatic gain controlled semiconductor optical amplifiers (AGC-SOAs) that were developed to support upstream transmission in long-reach systems. While the original AGC-SOAs are located outside the central office (CO) as repeaters, the new AGC-SOAs are located inside the CO and connected to each branch of an optical splitter in the CO. This arrangement has the potential to greatly reduce the costs of CO-sited equipment as they are shared by many more users if the new gain control scheme works properly even when the input optical powers are low. We develop a prototype and experimentally confirm its effectiveness in increasing the splitting ratio of extended-reach systems to 512.

  • Design and Analysis of Scalability in Current-Mode Analog-to-Time Converter for an Energy-Efficient and High-Resolution CMOS Biosensor Array

    Kei IKEDA  Atsuki KOBAYASHI  Kazuo NAKAZATO  Kiichi NIITSU  

     
    BRIEF PAPER

      Vol:
    E100-C No:6
      Page(s):
    597-601

    High-resolution bio-imaging is a key component for the advancement of life science. CMOS electronics is one of the promising candidates for emerging high-resolution devices because it offers nano-scale transistors. However, the resolution of the existing CMOS bio-imaging devices is several micrometers, which is insufficient for analyzing small objects such as bacteria and viruses. This paper presents the results of an analysis of the scalability of a current-mode analog-to-time converter (CMATC) to develop a high-resolution CMOS biosensor array. Simulations were performed using 0.6-µm, 0.25-µm, and 0.065-µm CMOS technology nodes. The Simulation results for the power consumption and resolution (cell size) showed that the CMATC has high-scalability and is a promising candidate to enable high-resolution CMOS bio-imaging.

  • Spatial Modulation for Layered Space-Time Coding Used in Image-Sensor-Based Visible Light Communication

    Keisuke MASUDA  Koji KAMAKURA  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2016/12/14
      Vol:
    E100-B No:6
      Page(s):
    932-940

    Spatial modulation (SM) is introduced into layered space-time coding (L-STC) used in image sensor (IS)-based visible light communication (VLC) systems. STC was basically investigated for extending the communication range of the IS-based VLC link [10], although it is out of the range when IS receivers are at the long distance from the LED array of the transmitter where the number of pixels capturing the transmitter on the image plane is less than the number of LEDs of the array. Furthermore, L-STC was done in [11] for increasing the reception rate with improving the pixel resolution while the receiver was approaching the transmitter. In this paper, SM is combined into L-STC by mapping additional information bits on the location of the pair of STC bit matrices of each layer. Experimental results show that additional SM bits are extracted with no error, without deteriorating the reception quality of and shrinking the transmission range of the original L-STC.

  • Second-Order Sampling of 2-D Frequency Distributions by Using the Concepts of Tiling Clusters and Pair Regions

    Toshihiro HORI  

     
    PAPER-Analog Signal Processing

      Vol:
    E100-A No:6
      Page(s):
    1286-1295

    Second-order sampling of 2-D frequency distributions is examined in this paper. When a figure in the frequency space can fill up the entire frequency space by tiling, we call this figure a tiling cluster. We also introduce the concept of pair regions. The results obtained for the second-order sampling of 1-D and 2-D frequency distributions are arranged using these two concepts. The sampling functions and sampling positions of second-order sampling of a 2-D rectangular-complement highpass frequency distribution, which have not been solved until now, are explicitly presented by using these two concepts.

  • Image Sensors Meet LEDs Open Access

    Koji KAMAKURA  

     
    INVITED PAPER-Wireless Communication Technologies

      Pubricized:
    2016/12/14
      Vol:
    E100-B No:6
      Page(s):
    917-925

    A new class of visible light communication (VLC) systems, namely image sensor (IS) based VLC systems, has emerged. An IS consists of a two-dimensional (2D) array of photodetectors (PDs), and then VLC systems with an IS receiver are capable of exploiting the spatial dimensions invoked for transmitting information. This paper aims for providing a brief survey of topics related to the IS-based VLC, and then provides a matrix representation of how to map a series of one dimensional (1D) symbols onto a set of 2D symbols for efficiently exploit the associate grade of freedom offered by 2D VLC systems. As an example, the matrix representation is applied to the symbol mapping of layered space-time coding (L-STC), which is presented to enlarge the coverage of IS-based VLC that is limited by pixel resolution of ISs.

  • High Resolution Mixed-Domain Delta-Sigma Time-to-Digital Converter Using Compensated Charge-Pump Integrator

    Anugerah FIRDAUZI  Zule XU  Masaya MIYAHARA  Akira MATSUZAWA  

     
    PAPER

      Vol:
    E100-C No:6
      Page(s):
    548-559

    This paper presents a high resolution mixed-domain Delta-Sigma (ΔΣ) time-to-digital converter (TDC) which utilizes a charge pump as time-to-voltage converter, a low resolution SAR ADC as quantizer, and a pair of delay-line digital-to-time converters to form a negative feedback. By never resetting the sampling capacitor of the charge-pump, an integrator is realized and first order noise shaping can be achieved. However, since the integrating capacitor is never cleared, this circuit is prone to charge-sharing issue during input sampling which can degrade TDC's performance. To deal with this issue, a compensation circuit consists of another pair of sampling capacitors and charge-pumps with doubled current is proposed. This TDC is designed and simulated in 65 nm CMOS technology and can operate at 200 MHz sampling frequency. For 2.5 MHz bandwidth, simulation shows that this TDC achieves 66.4 dB SNDR and 295 fsrms integrated noise for ±1 ns input range. The proposed TDC consumes 1.78 mW power that translates to FoM of 208 fJ/conv.

  • Adaptive Elastic Spectrum Allocation Based on Traffic Fluctuation Estimate under Time-Varying Traffic in Flexible OFDM-Based Optical Networks

    Mirai CHINO  Misato KAMIO  Jun MATSUMOTO  Eiji OKI  Satoru OKAMOTO  Naoaki YAMANAKA  

     
    PAPER-Fiber-Optic Transmission for Communications

      Pubricized:
    2016/12/12
      Vol:
    E100-B No:6
      Page(s):
    962-973

    A flexible orthogonal frequency-division multiplexing optical network enables the bandwidth to be flexibly changed by changing the number of sub-carriers. We assume that users request to dynamically change the number of sub-carriers. Dynamic bandwidth changes allow the network resources to be used more efficiently but each change takes a significant amount of time to complete. Service centric resource allocation must be considered in terms of the waiting time needed to change the number of sub-carriers. If the user demands drastically increase such as just after a disaster, the waiting time due to a chain-change of bandwidth becomes excessive because disaster priority telephone services are time-critical. This paper proposes a Grouped-elastic spectrum allocation scheme to satisfy the tolerable waiting time of the service in an optical fiber link. Spectra are grouped to restrict a waiting time in the proposed scheme. In addition, the proposed scheme determines a bandwidth margin between neighbor spectra to spectra to prevent frequent reallocation by estimating real traffic behavior in each group. Numerical results show that the bandwidth requirements can be minimized while satisfying the waiting time constraints. Additionally measurement granularity and channel alignment are discussed.

  • A 500 MHz-BW -52.5 dB-THD Voltage-to-Time Converter Utilizing Two-Step Transition Inverter Delay Lines in 28 nm CMOS

    Takuji MIKI  Noriyuki MIURA  Kento MIZUTA  Shiro DOSHO  Makoto NAGATA  

     
    PAPER

      Vol:
    E100-C No:6
      Page(s):
    560-567

    In this paper, a 500 MHz-BW -52.5 dB-THD Voltage-to-Time Converter (VTC) in 28 nm CMOS is presented. A two-step transition inverter raises the Voltage-to-Time (VT) conversion gain to 100 ps/V which is >10x higher than a conventional current-starved inverter. The number of required inverter stages is reduced to 4 from 64, resulting in 1/8 conversion latency and thus 13.2 dB THD suppression at a 500 MHz full Nyquist frequency. A feedback control of the bias voltage in the two-step transition inverter suppresses PVT variations in the VT conversion gain. A test-chip measurement successfully demonstrates -52.5 dB THD at 500 MHz input frequency without sampling-and-hold circuits. Effective VT conversion range over +/-64 ps time difference is measured with 1.2 Vpp differential input while keeping high linearity of less than +/-0.53 LSB INL/DNL, which results in 1 ps/LSB conversion linearity. The proposed VTC occupies 84 um2 silicon area and consumes 0.18 mW at 1 GS/s.

  • Null-Space Expansion for Multiuser Massive MIMO Inter-User Interference Suppression in Time Varying Channels Open Access

    Tatsuhiko IWAKUNI  Kazuki MARUTA  Atsushi OHTA  Yushi SHIRATO  Takuto ARAI  Masataka IIZUKA  

     
    PAPER-Terrestrial Wireless Communication/Broadcasting Technologies

      Pubricized:
    2016/11/21
      Vol:
    E100-B No:5
      Page(s):
    865-873

    This paper proposes a null-space expansion scheme for multiuser massive MIMO transmission in order to suppress inter-user interference (IUI) triggered by the temporal variation of the channel. The downlink multiuser MIMO channel capacity of time varying channels is severely degraded since IUI must be suppressed at the transmitter side by using past estimated channel state information at the transmitter side (CSIT). Massive MIMO has emerged as one of the most promising technologies for further capacity enhancement by increasing the number of base station (BS) antenna elements. Exploiting the excess degrees of freedom (DoFs) inherent in massive MIMO, a BS with the proposed IUI suppression scheme performs multiple null-steering for each UE (User Equipment) antenna element, which expands the null-space dimension. Computer simulations show that the proposed scheme has superior IUI suppression performance to the existing channel prediction scheme in time varying channels.

  • Design Differences in Pedestrian Navigation Systems Depending on the Availability of Carriable Navigation Information

    Tetsuya MANABE  Takaaki HASEGAWA  

     
    PAPER-Intelligent Transport System

      Vol:
    E100-A No:5
      Page(s):
    1197-1205

    In this paper, the differences in navigation information design, which is important for kiosk-type pedestrian navigation systems, were experimentally examined depending on presence or absence of carriable navigation information in order to acquire the knowledge to contribute design guidelines of kiosk-type pedestrian navigation systems. In particular, we used route complexity information calculated using a regression equation that contained multiple factors. In the absence of carriable navigation information, both the destination arrival rate and route deviation rate improved. Easy routes were designed as M (17 to 39 characters in Japanese), while complicated routes were denoted as L (40 or more characters in Japanese). On the contrary, in the presence of carriable navigation information, the user's memory load was found to be reduced by carrying the same navigation information as kiosk-type terminals. Thus, the reconsideration of kiosk-type pedestrian navigation systems design, e.g., the means of presenting navigation information, is required. For example, if the system attaches importance to a high destination arrival rate, L_Carrying without regard to route complexity is better. If the system attaching importance to the low route deviation rate, M_Carrying in the case of easy routes and L_Carrying in the case of complicated routes have been better. Consequently, this paper presents the differences in the designs of pedestrian navigation systems depending on whether carriable navigation information is absent or present.

  • HVTS: Hadoop-Based Video Transcoding System for Media Services

    Seokhyun SON  Myoungjin KIM  

     
    LETTER-Graphs and Networks

      Vol:
    E100-A No:5
      Page(s):
    1248-1253

    In this letter, we propose a Hadoop-based Video Transcoding System (HVTS), which is designed to run on all major cloud computing services. HVTS is highly adapted to the structure and policies of Hadoop, thus it has additional capacities for transcoding, task distribution, load balancing, and content replication and distribution. To evaluate, our proposed system, we carry out two performance tests on our local testbed, transcoding and robustness to data node and task failures. The results confirmed that our system delivers satisfactory performance in facilitating seamless streaming services in cloud computing environments.

  • Non-Coherent MIMO of Per Transmit Antenna Differential Mapping (PADM) Employing Asymmetric Space-Time Mapping and Channel Prediction

    Hiroshi KUBO  Takuma YAMAGISHI  Toshiki MORI  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2016/11/16
      Vol:
    E100-B No:5
      Page(s):
    808-817

    This paper proposes performance improvement schemes for non-coherent multiple-input multiple-output (MIMO) communication systems employing per transmit antenna differential mapping (PADM). PADM is one form of differential space-time coding (DSTC), which generates an independent differentially encoded sequence for each of the multiple transmit antennas by means of space-time coding and mapping. The features of the proposed schemes are as follows: 1) it employs an asymmetric space-time mapping instead of the conventional symmetric space-time mapping in order to lower the required signal to noise power ratio (SNR) for maintaining the bit error rate (BER) performance; 2) it employs an analytically derived branch metric criterion based on channel prediction for per-survivor processing (PSP) in order to track fast time-varying channels. Finally, computer simulation results confirm that the proposed schemes improve the required SNR by around 1dB and can track at the maximum Doppler frequency normalized by symbol rate of 5%.

  • A Method for FDOA Estimation with Expansion of RMS Integration Time

    Shangyu ZHANG  Zhen HUANG  Zhenqiang LI  Xinlong XIAO  Dexiu HU  

     
    PAPER-Sensing

      Pubricized:
    2016/11/29
      Vol:
    E100-B No:5
      Page(s):
    893-900

    The measurement accuracy of frequency difference of arrival (FDOA) is usually determinant for emitters location system using rapidly moving receivers. The classic technique of expanding the integration time of the cross ambiguity function (CAF) to achieve better performance of FDOA is likely to incur a significant computational burden especially for wideband signals. In this paper, a nonconsecutive short-time CAF's methods is proposed with expansion of root mean square (RMS) integration time, instead of the integration time, and a factor of estimation precision improvement is given which is relative to the general consecutive method. Furthermore, by analyzing the characteristic of coherent CAF and the influence of FDOA rate, an upper bound of the precision improvement factor is derived. Simulation results are provided to confirm the effectiveness of the proposed method.

  • Improving Security Level of LTE Access Procedure by Using Short-Life Shared Key

    Fawad AHMAD  Marnel PERADILLA  Akanksha SAINI  Younchan JUNG  

     
    PAPER-Network

      Pubricized:
    2016/11/21
      Vol:
    E100-B No:5
      Page(s):
    738-748

    To ensure secure mobile communication, the communicating entities must know their mutual identities. The entities which need to be identified in a mobile communication system are mobile devices and the network. Third Generation Partnership Project (3GPP) has specified Evolved Packet System Authentication and Key Agreement (EPS AKA) procedure for the mutual authentication of user and the Long Term Evolution (LTE) network. EPS AKA certainly overcomes most of the vulnerabilities in the Global System for Mobile Communications (GSM) and Universal Mobile Telecommunication System (UMTS) access procedures. However, the LTE access procedure still has security weaknesses against some of the sophisticated security threats, such as, Denial-of-Service (DoS) attacks, Man-in-the-Middle (MitM) attacks, rogue base station attacks and fails to ensure privacy protection for some of the important parameters. This paper proposes an improved security framework for the LTE access procedure by ensuring the confidentiality protection of International Mobile Subscriber Identity (IMSI) and random-challenge RAND. Also, our proposed system is designed to reduce the impact of DoS attacks which try to overwhelm the network with useless computations. We use a one-time shared key with a short lifetime between the UE and MME to protect IMSI and RAND privacy. Finally, we explore the parameters design for the proposed system which leads to satisfy the requirements imposed on computational load and latency as well as security strength.

  • Improved Quasi Sliding Mode Control with Adaptive Compensation for Matrix Rectifier

    Zhanhu HU  Wang HU  Zhiping WANG  

     
    LETTER-Systems and Control

      Vol:
    E100-A No:5
      Page(s):
    1240-1243

    To improve the quality of waveforms and achieve a high input power factor (IPF) for matrix rectifier, a novel quasi sliding mode control (SMC) with adaptive compensation is proposed in this letter. Applying quasi-SMC can effective obviate the disturbances of time delay and spatial lag, and SMC based on continuous function is better than discontinuous function to eliminate the chattering. Furthermore, compared with conventional compensation, an adaptive quasi-SMC compensation without any accurate detection for internal parameters is easier to be implementated, which has shown a superior advance. Theoretical analysis and experiments are carried out to validate the correctness of the novel control scheme.

281-300hit(2217hit)