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

Keyword Search Result

[Keyword] LD(1872hit)

201-220hit(1872hit)

  • Super Resolution Channel Estimation by Using Spread Spectrum Signal and Atomic Norm Minimization

    Dongshin YANG  Yutaka JITSUMATSU  

     
    PAPER-Communication Theory and Signals

      Vol:
    E101-A No:12
      Page(s):
    2141-2148

    Compressed Sensing (CS) is known to provide better channel estimation performance than the Least Square (LS) method for channel estimation. However, multipath delays may not be resolved if they span between the grids. This grid problem of CS is an obstacle to super resolution channel estimation. An Atomic Norm (AN) minimization is one of the methods for estimating continuous parameters. The AN minimization can successfully recover a spectrally sparse signal from a few time-domain samples even though the dictionary is continuous. There are studies showing that the AN minimization method has better resolution than conventional CS methods. In this paper, we propose a channel estimation method based on the AN minimization for Spread Spectrum (SS) systems. The accuracy of the proposed channel estimation is compared with the conventional LS method and Dantzig Selector (DS) of the CS. In addition to the application of channel estimation in wireless communication, we also show that the AN minimization can be applied to Global Positioning System (GPS) using Gold sequence.

  • A Note on Weight Distributions of Spatially “Mt. Fuji” Coupled LDPC Codes

    Yuta NAKAHARA  Toshiyasu MATSUSHIMA  

     
    LETTER-Coding theory and techniques

      Vol:
    E101-A No:12
      Page(s):
    2194-2198

    Spatially “Mt. Fuji” coupled (SFC) low density parity check (LDPC) codes are constructed as a chain of block LDPC codes. A difference between the SFC-LDPC codes and the original spatially coupled (SC) LDPC codes is code lengths of the underlying block LDPC codes. The code length of the block LDPC code at the middle of the chain is larger than that at the end of the chain. It is experimentally confirmed that the bit error probability in the error floor region of the SFC-LDPC code is lower than that of the SC-LDPC code whose code length and design rate are the same as those of the SFC-LDPC code. In this letter, we calculate the weight distribution of the SFC-LDPC code and try to explain causes of the low bit error rates of the SFC-LDPC code.

  • Performance of MMSE Interference Rejection Followed by Joint MLD for DAN

    Hirokazu MIYAGI  Yukitoshi SANADA  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2018/06/04
      Vol:
    E101-B No:12
      Page(s):
    2471-2478

    This paper applies minimum mean square error (MMSE) interference rejection followed by joint maximum likelihood detection (MLD) to a receiver in a distributed antenna network (DAN). DAN receivers capture not only the desired signals, but also the interference signals from nearby uncoordinated antennas. For the overloaded signal situation, non-linear detection schemes such as joint MLD can be applied to the received signals. However, the amount of metric calculations in joint MLD increases exponentially with the number of signal streams. Therefore, MMSE interference rejection followed by MLD detection is proposed. The proposed scheme reduces the complexity by a factor of 1/2M(NT-1) where NT is the number of interference signals with 2MQAM modulation. The effect of residual interference after the MMSE interference rejection is evaluated. Numerical results obtained through computer simulation and experiment show that the performance of the proposed scheme is about 4.0dB worse at a bit error rate (BER) of 10-3 than that of the joint MLD while its complexity is four times lower for QPSK signal streams. The BER performance degradation can be suppressed to about 2.5dB by adjusting the value of the coefficient in the MMSE matrix.

  • Low-Power Fifth-Order Butterworth OTA-C Low-Pass Filter with an Impedance Scaler for Portable ECG Applications

    Shuenn-Yuh LEE  Cheng-Pin WANG  Chuan-Yu SUN  Po-Hao CHENG  Yuan-Sun CHU  

     
    PAPER-Electronic Circuits

      Vol:
    E101-C No:12
      Page(s):
    942-952

    This study proposes a multiple-output differential-input operational transconductance amplifier-C (MODI OTA-C) filter with an impedance scaler to detect cardiac activity. A ladder-type fifth-orderButterworth low-pass filter with a large time constant and low noise is implemented to reduce coefficient sensitivity and address signal distortion. Moreover, linearized MODI OTA structures with reduced transconductance and impedance scaler circuits for noise reduction are used to achieve a wide dynamic range (DR). The OTA-based circuit is operated in the subthreshold region at a supply voltage of 1 V to reduce the power consumption of the wearable device in long-term use. Experimental results of the filter with a bandwidth of 250 Hz reveal that DR is 57.6 dB, and the harmonic distortion components are below -59 dB. The power consumption of the filter, which is fabricated through a TSMC 0.18 µm CMOS process, is lower than 390 nW, and the active area is 0.135 mm2.

  • Field Uniformity and Correlation Coefficient Analysis of KRISS Reverberation Chamber

    Aditia Nur BAKTI  No-Weon KANG  Jae-Yong KWON  

     
    PAPER-Electromagnetic Compatibility(EMC)

      Pubricized:
    2018/04/25
      Vol:
    E101-B No:11
      Page(s):
    2289-2296

    Reverberation chambers (RCs) are used widely in the electromagnetic measurement area. An RC is designed to have a long reverberation time, generate numerous modes, and provide good field uniformity within the chamber. The purpose of this paper is to describe the design process and measurement of the KRISS Reverberation Chamber (KRC). KRC models with 4.5m × 3.4m × 2.8m dimensions are simulated by 3D numerical simulation software. The field uniformity and correlation coefficient are then analyzed at 200MHz to obtain the optimized model. The simulation results show good performance in terms of field uniformity and are confirmed by measurement from 200MHz to 1GHz. The lowest usable frequency (LUF) of KRC was confirmed by field uniformity to be 200MHz. However, the stirrer correlation coefficient results show good performance above 300MHz.

  • A Comparison Study on Front- and Back-of-Device Touch Input for Handheld Displays

    Liang CHEN  Dongyi CHEN  Xiao CHEN  

     
    BRIEF PAPER

      Vol:
    E101-C No:11
      Page(s):
    880-883

    Touch screen has become the mainstream manipulation technique on handheld devices. However, its innate limitations, e.g. the occlusion problem and fat finger problem, lower user experience in many use scenarios on handheld displays. Back-of-device interaction, which makes use of input units on the rear of a device for interaction, is one of the most promising approaches to address the above problems. In this paper, we present the findings of a user study in which we explored users' pointing performances in using two types of touch input on handheld devices. The results indicate that front-of-device touch input is averagely about two times as fast as back-of-device touch input but with higher error rates especially in acquiring the narrower targets. Based on the results of our study, we argue that in the premise of keeping the functionalities and layouts of current mainstream user interfaces back-of-device touch input should be treated as a supplement to front-of-device touch input rather than a replacement.

  • Transistor Characteristics of Single Crystalline C8-BTBT Grown in Coated Liquid Crystal Solution on Photo-Alignment Films

    Risa TAKEDA  Yosei SHIBATA  Takahiro ISHINABE  Hideo FUJIKAKE  

     
    BRIEF PAPER

      Vol:
    E101-C No:11
      Page(s):
    884-887

    We examined single crystal growth of benzothienobenzothiophene-based organic semiconductors by solution coating method using liquid crystal and investigated its electrical characteristics. As the results, we revealed that the averaged mobility in the saturation region reached 2.08 cm2/Vs along crystalline b-axis, and 1.08 cm2/Vs along crystalline a-axis.

  • Key Parameter Estimation for Pulse Radar Signal Intercepted by Non-Cooperative Nyquist Folding Receiver

    Zhaoyang QIU  Qi ZHANG  Jun ZHU  Bin TANG  

     
    LETTER-Digital Signal Processing

      Vol:
    E101-A No:11
      Page(s):
    1934-1939

    Nyquist folding receiver (NYFR) is a novel reconnaissance receiving architecture and it can realize wideband receiving with small amount of equipment. As a tradeoff of non-cooperative wideband receiving, the NYFR output will add an unknown key parameter that is called Nyquist zone (NZ) index. In this letter, we concentrate on the NZ index estimation of the NYFR output. Focusing on the basic pulse radar signals, the constant frequency signal, the binary phase coded signal and the linear frequency modulation signal are considered. The matching component function is proposed to estimate the NZ indexes of the NYFR outputs without the prior information of the signal modulation type. In addition, the relations between the matching component function and the parameters of the NYFR are discussed. Simulation results demonstrate the efficacy of the proposed method.

  • Zero-Knowledge Identification Scheme Using LDPC Codes

    Haruka ITO  Masanori HIROTOMO  Youji FUKUTA  Masami MOHRI  Yoshiaki SHIRAISHI  

     
    PAPER-Cryptographic Techniques

      Pubricized:
    2018/08/22
      Vol:
    E101-D No:11
      Page(s):
    2688-2697

    Recently, IoT compatible products have been popular, and various kinds of things are IoT compliant products. In these devices, cryptosystems and authentication are not treated properly, and security measures for IoT devices are not sufficient. Requirements of authentication for IoT devices are power saving and one-to-many communication. In this paper, we propose a zero-knowledge identification scheme using LDPC codes. In the proposed scheme, the zero-knowledge identification scheme that relies on the binary syndrome decoding problem is improved and the computational cost of identification is reduced by using the sparse parity-check matrix of the LDPC codes. In addition, the security level, computational cost and safety of the proposed scheme are discussed in detail.

  • Secure and Fast Near-Field Acoustic Communication Using Acoustic and Vibrational Signals

    Saki NISHIHARA  Tadashi EBIHARA  Koichi MIZUTANI  Naoto WAKATSUKI  

     
    PAPER-Communication Theory and Signals, Digital Signal Processing

      Vol:
    E101-A No:11
      Page(s):
    1841-1848

    In this paper, we propose a secure near-field communication (NFC) for smartphones by combining acoustic and vibrational communication. In our hybrid system, a transmitter transmits an encrypted message and encryption key from a loudspeaker and vibration motor, respectively. While the sound emitted from the loudspeaker propagates through the air, the vibration emitted by the vibration motor propagates through the body of smartphones. Hence, only receivers touching the transmitter can receive both the encrypted message and the key, resulting in secure communication. We designed a software modulator and demodulator suitable for the vibrational communication by using return-to-zero (RZ) code. Then we established a hybrid communication system by combining acoustic and vibrational communication modems, and evaluated its performance in experiments. The results indicate that our hybrid system achieved a secure (among physically contacted devices) and fast (800kbps) NFC for smartphones.

  • Deterministic Constructions of Compressed Sensing Matrices Based on Affine Singular Linear Space over Finite Fields

    Gang WANG  Min-Yao NIU  Jian GAO  Fang-Wei FU  

     
    LETTER-Coding Theory

      Vol:
    E101-A No:11
      Page(s):
    1957-1963

    Compressed sensing theory provides a new approach to acquire data as a sampling technique and makes sure that a sparse signal can be reconstructed from few measurements. The construction of compressed sensing matrices is a main problem in compressed sensing theory (CS). In this paper, the deterministic constructions of compressed sensing matrices based on affine singular linear space over finite fields are presented and a comparison is made with the compressed sensing matrices constructed by DeVore based on polynomials over finite fields. By choosing appropriate parameters, our sparse compressed sensing matrices are superior to the DeVore's matrices. Then we use a new formulation of support recovery to recover the support sets of signals with sparsity no more than k on account of binary compressed sensing matrices satisfying disjunct and inclusive properties.

  • Analysis of Super-Steep Subthreshold Slope Body-Tied SOI MOSFET and its Possibility for Ultralow Voltage Application

    Takayuki MORI  Jiro IDA  

     
    PAPER-Semiconductor Materials and Devices

      Vol:
    E101-C No:11
      Page(s):
    916-922

    In this paper, we review a super-steep subthreshold slope (SS) (<1 mV/dec) body-tied (BT) silicon on insulator (SOI) metal oxide semiconductor field effect transistor (MOSFET) fabricated with 0.15 µm SOI technology and discuss the possibility of its use in ultralow voltage applications. The mechanism of the super-steep SS in the BT SOI MOSFET was investigated with technology computer-aided design simulation. The gate length/width and Si thickness optimizations promise further reductions in operation voltage, as well as improvement of the ION/IOFF ratio. In addition, we demonstrated control of the threshold voltage and hysteresis characteristics using the substrate and body bias in the BT SOI MOSFET.

  • Upper Bound for Coded MIMO Systems without Enumeration of Codewords

    Jin-Taek SEONG  Jin-Ho YOU  

     
    PAPER-Communication Theory and Signals

      Vol:
    E101-A No:11
      Page(s):
    1925-1933

    In this paper, we consider coded multi-input multi-output (MIMO) systems with low-density parity-check (LDPC) codes and space-time block code (STBC) in MIMO channels. The LDPC code takes the role of a channel code while the STBC provides spatial-temporal diversity. The performance of such coded MIMO system has been shown to be excellent in the past. In this paper, we present a performance analysis for an upper bound on probability of error for coded MIMO schemes. Compared to previous works, the proposed approach for the upper bound can avoid any explicit weight enumeration of codewords and provide a significant step for the upper bound by using a multinomial theorem. In addition, we propose a log domain convolution that enables us to handle huge numbers, e.g., 10500. Comparison of system simulations and numerical evaluations shows that the proposed upper bound is applicable for various coded MIMO systems.

  • RbWL: Recency-Based Static Wear Leveling for Lifetime Extension and Overhead Reduction in NAND Flash Memory Systems

    Sang-Ho HWANG  Jong Wook KWAK  

     
    LETTER-Software System

      Pubricized:
    2018/07/09
      Vol:
    E101-D No:10
      Page(s):
    2518-2522

    In this letter, we propose a static wear leveling technique, called Recency-based Wear Leveling (RbWL). The basic idea of RbWL is to execute static wear leveling at minimum levels, because the frequent migrations of cold data by static wear leveling cause significant overhead in a NAND flash memory system. RbWL adjusts the execution frequency according to a threshold value that reflects the lifetime difference of the hot/cold blocks and the total lifetime of the NAND flash memory system. The evaluation results show that RbWL improves the lifetime of NAND flash memory systems by 52%, and it also reduces the overhead of wear leveling from 8% to 42% and from 13% to 51%, in terms of the number of erase operations and the number of page migrations of valid pages, respectively, compared with other algorithms.

  • Finding Important People in a Video Using Deep Neural Networks with Conditional Random Fields

    Mayu OTANI  Atsushi NISHIDA  Yuta NAKASHIMA  Tomokazu SATO  Naokazu YOKOYA  

     
    PAPER-Image Recognition, Computer Vision

      Pubricized:
    2018/07/20
      Vol:
    E101-D No:10
      Page(s):
    2509-2517

    Finding important regions is essential for applications, such as content-aware video compression and video retargeting to automatically crop a region in a video for small screens. Since people are one of main subjects when taking a video, some methods for finding important regions use a visual attention model based on face/pedestrian detection to incorporate the knowledge that people are important. However, such methods usually do not distinguish important people from passers-by and bystanders, which results in false positives. In this paper, we propose a deep neural network (DNN)-based method, which classifies a person into important or unimportant, given a video containing multiple people in a single frame and captured with a hand-held camera. Intuitively, important/unimportant labels are highly correlated given that corresponding people's spatial motions are similar. Based on this assumption, we propose to boost the performance of our important/unimportant classification by using conditional random fields (CRFs) built upon the DNN, which can be trained in an end-to-end manner. Our experimental results show that our method successfully classifies important people and the use of a DNN with CRFs improves the accuracy.

  • Designing Coded Aperture Camera Based on PCA and NMF for Light Field Acquisition

    Yusuke YAGI  Keita TAKAHASHI  Toshiaki FUJII  Toshiki SONODA  Hajime NAGAHARA  

     
    PAPER

      Pubricized:
    2018/06/20
      Vol:
    E101-D No:9
      Page(s):
    2190-2200

    A light field, which is often understood as a set of dense multi-view images, has been utilized in various 2D/3D applications. Efficient light field acquisition using a coded aperture camera is the target problem considered in this paper. Specifically, the entire light field, which consists of many images, should be reconstructed from only a few images that are captured through different aperture patterns. In previous work, this problem has often been discussed from the context of compressed sensing (CS), where sparse representations on a pre-trained dictionary or basis are explored to reconstruct the light field. In contrast, we formulated this problem from the perspective of principal component analysis (PCA) and non-negative matrix factorization (NMF), where only a small number of basis vectors are selected in advance based on the analysis of the training dataset. From this formulation, we derived optimal non-negative aperture patterns and a straight-forward reconstruction algorithm. Even though our method is based on conventional techniques, it has proven to be more accurate and much faster than a state-of-the-art CS-based method.

  • On Searching Linear Transformations for the Register R of MICKEY-Family Ciphers

    Lin WANG  Ying GAO  Yu ZHOU  Xiaoni DU  

     
    LETTER

      Vol:
    E101-A No:9
      Page(s):
    1546-1547

    MICKEY-family ciphers are lightweight cryptographic primitives and include a register R determined by two related maximal-period linear transformations. Provided that primitivity is efficiently decided in finite fields, it is shown by quantitative analysis that potential parameters for R can be found in probabilistic polynomial time.

  • Reciprocal Kit-Build Concept Map: An Approach for Encouraging Pair Discussion to Share Each Other's Understanding

    Warunya WUNNASRI  Jaruwat PAILAI  Yusuke HAYASHI  Tsukasa HIRASHIMA  

     
    PAPER-Educational Technology

      Pubricized:
    2018/05/29
      Vol:
    E101-D No:9
      Page(s):
    2356-2367

    Collaborative learning is an active teaching and learning strategy, in which learners who give each other elaborated explanations can learn most. However, it is difficult for learners to explain their own understanding elaborately in collaborative learning. In this study, we propose a collaborative use of a Kit-Build concept map (KB map) called “Reciprocal KB map”. In a Reciprocal KB map for a pair discussion, at first, the two participants make their own concept maps expressing their comprehension. Then, they exchange the components of their maps and request each other to reconstruct their maps by using the components. The differences between the original map and the reconstructed map are diagnosed automatically as an advantage of the KB map. Reciprocal KB map is expected to encourage pair discussion to recognize the understanding of each other and to create an effective discussion. In an experiment reported in this paper, Reciprocal KB map was used for supporting a pair discussion and was compared with a pair discussion which was supported by a traditional concept map. Nineteen pairs of university students were requested to use the traditional concept map in their discussion, while 20 pairs of university students used Reciprocal KB map for discussing the same topic. The results of the experiment were analyzed using three metrics: a discussion score, a similarity score, and questionnaires. The discussion score, which investigates the value of talk in discussion, demonstrates that Reciprocal KB map can promote more effective discussion between the partners compared to the traditional concept map. The similarity score, which evaluates the similarity of the concept maps, demonstrates that Reciprocal KB map can encourage the pair of partners to understand each other better compared to the traditional concept map. Last, the questionnaires illustrate that Reciprocal KB map can support the pair of partners to collaborate in the discussion smoothly and that the participants accepted this method for sharing their understanding with each other. These results suggest that Reciprocal KB map is a promising approach for encouraging pairs of partners to understand each other and to promote the effective discussions.

  • An Advantage of the Vehicle to Vehicle Communication for an Automated Driving Car at the Encounter with an Ambulance

    Hideaki NANBA  Yukihito IKAMI  Kenichiro IMAI  Kenji KOBAYASHI  Manabu SAWADA  

     
    PAPER

      Vol:
    E101-A No:9
      Page(s):
    1281-1289

    When the automated driving cars are in widespread usage, traffic will coexist with prioritized vehicles (e.g., ambulances, fire trucks, police vehicles) and automated driving cars. Automated driving cars are expected to be safer and lower stress than manual driving vehicles because of passengers paying less attention to driving. However, there are many challenges for automated driving cars to get along with surrounding transport participants. In particular, when an ambulance is driving into an intersection with the red traffic signal, the automated driving car is required to deal with a situation differently from normal traffic situations. In order to continue safe driving, it is necessary to recognize the approach of the ambulance at an earlier time. Possible means of recognizing ambulances include siren sound, rotating red lights and vehicle to vehicle communication. Based on actual traffic data, the authors created a mathematical model of deceleration for giving way and consider the status of suitable behavior by automated driving cars. The authors calculate the detection distance required to take suitable action. The results indicate that there are advantages in vehicle to vehicle communication in detecting ambulances by automated driving cars.

  • Computational Power of Threshold Circuits of Energy at most Two

    Hiroki MANIWA  Takayuki OKI  Akira SUZUKI  Kei UCHIZAWA  Xiao ZHOU  

     
    PAPER

      Vol:
    E101-A No:9
      Page(s):
    1431-1439

    The energy of a threshold circuit C is defined to be the maximum number of gates outputting ones for an input assignment, where the maximum is taken over all the input assignments. In this paper, we study computational power of threshold circuits of energy at most two. We present several results showing that the computational power of threshold circuits of energy one and the counterpart of energy two are remarkably different. In particular, we give an explicit function which requires an exponential size for threshold circuits of energy one, but is computable by a threshold circuit of size just two and energy two. We also consider MOD functions and Generalized Inner Product functions, and show that these functions also require exponential size for threshold circuits of energy one, but are computable by threshold circuits of substantially less size and energy two.

201-220hit(1872hit)