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

Keyword Search Result

[Keyword] TIA(1376hit)

701-720hit(1376hit)

  • The Interaction of Art, Technology and Customers in Picture Making

    John J. MCCANN  Yoichi MIYAKE  

     
    INVITED PAPER

      Vol:
    E91-A No:6
      Page(s):
    1369-1382

    Human interest in pictures dates back to 14,000 BC. Pictures can be drawn by hand or imaged by optical means. Over time pictures have changed from being rare and unique to ubiquitous and common. They have changed from treasures to transients. This paper summarizes many picture technologies, and discusses their dynamic range, their color and tone scale rendering. This paper discusses the interactions between advances in technology and the interests of its users over time. It is the combination of both technology and society's usage that has shaped imaging since its beginning and continues to do so.

  • Performance Comparison of Detection Methods for Combined STBC and SM Systems

    Xuan Nam TRAN  Huan Cong HO  Tadashi FUJINO  Yoshio KARASAWA  

     
    PAPER-Smart Antennas & MIMO

      Vol:
    E91-B No:6
      Page(s):
    1734-1742

    This paper considers detection schemes for the combined space-time block coding and spatial multiplexing (STBC-SM) transmission systems. We propose a symbol detection scheme which allows to extend the limit on the number of transmit antennas imposed by the previous group detection scheme. The proposed scheme allows to double multiplexing gain as well as provides better bit error rate (BER) performance over the group detection scheme. It is shown that the proposed QR-SIC (combined QR-decomposition and successive interference cancellation) symbol detector provides good trade-off between the BER and computational complexity performance and, thus, is the most suitable detector for the combined STBC-SM system.

  • A Secure Content Delivery System Based on a Partially Reconfigurable FPGA

    Yohei HORI  Hiroyuki YOKOYAMA  Hirofumi SAKANE  Kenji TODA  

     
    PAPER-Contents Protection

      Vol:
    E91-D No:5
      Page(s):
    1398-1407

    We developed a content delivery system using a partially reconfigurable FPGA to securely distribute digital content on the Internet. With partial reconfigurability of a Xilinx Virtex-II Pro FPGA, the system provides an innovative single-chip solution for protecting digital content. In the system, a partial circuit must be downloaded from a server to the client terminal to play content. Content will be played only when the downloaded circuit is correctly combined (=interlocked) with the circuit built in the terminal. Since each circuit has a unique I/O configuration, the downloaded circuit interlocks with the corresponding built-in circuit designed for a particular terminal. Thus, the interface of the circuit itself provides a novel authentication mechanism. This paper describes the detailed architecture of the system and clarify the feasibility and effectiveness of the system. In addition, we discuss a fail-safe mechanism and future work necessary for the practical application of the system.

  • Wolf Attack Probability: A Theoretical Security Measure in Biometric Authentication Systems

    Masashi UNE  Akira OTSUKA  Hideki IMAI  

     
    PAPER-Biometrics

      Vol:
    E91-D No:5
      Page(s):
    1380-1389

    This paper will propose a wolf attack probability (WAP) as a new measure for evaluating security of biometric authentication systems. The wolf attack is an attempt to impersonate a victim by feeding "wolves" into the system to be attacked. The "wolf" means an input value which can be falsely accepted as a match with multiple templates. WAP is defined as a maximum success probability of the wolf attack with one wolf sample. In this paper, we give a rigorous definition of the new security measure which gives strength estimation of an individual biometric authentication system against impersonation attacks. We show that if one reestimates using our WAP measure, a typical fingerprint algorithm turns out to be much weaker than theoretically estimated by Ratha et al. Moreover, we apply the wolf attack to a finger-vein-pattern based algorithm. Surprisingly, we show that there exists an extremely strong wolf which falsely matches all templates for any threshold value.

  • Measurement-Based Performance Evaluation of Coded MIMO-OFDM Spatial Multiplexing with MMSE Spatial Filtering in an Indoor Line-of-Sight Environment

    Hiroshi NISHIMOTO  Toshihiko NISHIMURA  Takeo OHGANE  Yasutaka OGAWA  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E91-B No:5
      Page(s):
    1648-1652

    The MIMO system can meet the growing demand for higher capacity in wireless communication fields. So far, the authors have reported that, based on channel measurements, uncoded performance of narrowband MIMO spatial multiplexing in indoor line-of-sight (LOS) environments generally outperforms that in non-LOS (NLOS) ones under the same transmit power condition. In space-frequency coded MIMO-OFDM spatial multiplexing, however, we cannot expect high space-frequency diversity gain in LOS environments because of high fading correlations and low frequency selectivity of channels so that the performance may degrade unlike uncoded cases. In this letter, we present the practical performance of coded MIMO-OFDM spatial multiplexing based on indoor channel measurements. The results show that an LOS environment tends to provide lower space-frequency diversity effect whereas the MIMO-OFDM spatial multiplexing performance is still better in the environment compared with an NLOS environment.

  • A Fuzzy Method for Medical Diagnosis of Headache

    Jeong-Yong AHN  Kill-Sung MUN  Young-Hyun KIM  Sun-Young OH  Beom-Soo HAN  

     
    LETTER-Biological Engineering

      Vol:
    E91-D No:4
      Page(s):
    1215-1217

    In this note we propose a fuzzy diagnosis of headache. The method is based on the relations between symptoms and diseases. For this purpose, we suggest a new diagnosis measure using the occurrence information of patient's symptoms and develop an improved interview chart with fuzzy degrees assigned according to the relation among symptoms and three labels of headache. The proposed method is illustrated by two examples.

  • Boundary Conditions for Numerical Stability Analysis of Periodic Solutions of Ordinary Differential Equations

    Sunao MURASHIGE  

     
    PAPER-Nonlinear Problems

      Vol:
    E91-A No:4
      Page(s):
    1162-1168

    This paper considers numerical methods for stability analyses of periodic solutions of ordinary differential equations. Stability of a periodic solution can be determined by the corresponding monodromy matrix and its eigenvalues. Some commonly used numerical methods can produce inaccurate results of them in some cases, for example, near bifurcation points or when one of the eigenvalues is very large or very small. This work proposes a numerical method using a periodic boundary condition for vector fields, which preserves a critical property of the monodromy matrix. Numerical examples demonstrate effectiveness and a drawback of this method.

  • Highly Reliable Multiple-Valued Current-Mode Comparator Based on Active-Load Dual-Rail Operation

    Masatomo MIURA  Takahiro HANYU  

     
    PAPER

      Vol:
    E91-C No:4
      Page(s):
    589-594

    In this paper, a multiple-valued current-mode (MVCM) circuit based on active-load dual-rail differential logic is proposed for a high-performance arithmetic VLSI system with crosstalk-noise immunity. The use of dual-rail complementary differential-pair circuits (DPCs), whose outputs are summed up by wiring makes it possible to reduce the common-mode noise, and yet enhance the switching speed. By using the diode-connected cross-coupled PMOS active loads, the rapid transition of switching in the DPC is relaxed appropriately, which can also eliminate spiked input noise. It is demonstrated that the noise reduction ratio and the switching delay of the proposed MVCM circuit in a 90 nm CMOS technology is superior to those of the corresponding ordinary implementation.

  • New Recursive Least Squares Algorithms without Using the Initial Information

    Jung Hun PARK  Zhonghua QUAN  Soohee HAN  Wook Hyun KWON  

     
    LETTER-Navigation, Guidance and Control Systems

      Vol:
    E91-B No:3
      Page(s):
    968-971

    In this letter, we propose a new type of recursive least squares (RLS) algorithms without using the initial information of a parameter or a state to be estimated. The proposed RLS algorithm is first obtained for a generic linear model and is then extended to a state estimator for a stochastic state-space model. Compared with the existing algorithms, the proposed RLS algorithms are simpler and more numerically stable. It is shown through simulation that the proposed RLS algorithms have better numerical stability for digital computations than existing algorithms.

  • New H FIR Smoother for Linear Discrete-Time State-Space Models

    ChoonKi AHN  SooHee HAN  

     
    LETTER-Fundamental Theories for Communications

      Vol:
    E91-B No:3
      Page(s):
    896-899

    This letter propose a new H∞ smoother (HIS) with a finite impulse response (FIR) structure for discrete-time state-space models. This smoother is called an H∞ FIR smoother (HIFS). Constraints such as linearity, quasi-deadbeat property, FIR structure, and independence of the initial state information are required in advance. Among smoothers with these requirements, we choose the HIFS to optimize H∞ performance criterion. The HIFS is obtained by solving the linear matrix inequality (LMI) problem with a parametrization of a linear equality constraint. It is shown through simulation that the proposed HIFS is more robust against uncertainties and faster in convergence than the conventional HIS.

  • An Enhanced Route Recovery Protocol for Mobile Ad Hoc Networks

    Sangkyung KIM  Noyeul PARK  Changhwa KIM  Seung-sik CHOI  

     
    LETTER-Network

      Vol:
    E91-B No:2
      Page(s):
    597-600

    In case of link failures, many ad hoc routing protocols recover a route by employing source-initiated route re-discovery, but this approach can degrade system performance. Some use localized route recovery, which may yield non-optimal paths. Our proposal provides a mechanism that can enhance the overall routing performance by initiating route recovery at the destination node. We elucidate the effects through simulations including comparisons with AODV and AODV with local repair.

  • LSI On-Chip Optical Interconnection with Si Nano-Photonics

    Junichi FUJIKATA  Kenichi NISHI  Akiko GOMYO  Jun USHIDA  Tsutomu ISHI  Hiroaki YUKAWA  Daisuke OKAMOTO  Masafumi NAKADA  Takanori SHIMIZU  Masao KINOSHITA  Koichi NOSE  Masayuki MIZUNO  Tai TSUCHIZAWA  Toshifumi WATANABE  Koji YAMADA  Seiichi ITABASHI  Keishi OHASHI  

     
    INVITED PAPER

      Vol:
    E91-C No:2
      Page(s):
    131-137

    LSI on-chip optical interconnections are discussed from the viewpoint of a comparison between optical and electrical interconnections. Based on a practical prediction of our optical device development, optical interconnects will have an advantage over electrical interconnects within a chip that has an interconnect length less than about 10 mm at the hp32-22 nm technology node. Fundamental optical devices and components used in interconnections have also been introduced that are small enough to be placed on top of a Si LSI and that can be fabricated using methods compatible with CMOS processes. A SiON waveguide showed a low propagation loss around 0.3 dB/cm at a wavelength of 850 nm, and excellent branching characteristics were achieved for MMI (multimode interference) branch structures. A Si nano-photodiode showed highly enhanced speed and efficiency with a surface plasmon antenna. By combining our Si nano-photonic devices with the advanced TIA-less optical clock distribution circuits, clock distribution above 10 GHz can be achieved with a small footprint on an LSI chip.

  • Partial CSI Reporting for Spatial Scheduling in Multiuser MIMO Systems

    Yoshitaka HARA  Kazuyoshi OSHIMA  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E91-B No:2
      Page(s):
    479-487

    This paper proposes a new partial channel state information (CSI) reporting method for spatial scheduling in TDD/MIMO systems. In the proposed method, a terminal transmits pilot signals using transmit beams which have large channel gains between the base station (BS) and the terminal. Then, the BS can obtain partial CSI through responses of the pilot signals. Furthermore, adaptive allocation of pilot signals is proposed, in which pilot signals for CSI reporting are adaptively allocated to terminals depending on the number of terminals. We evaluate system throughput of spatial scheduling under the partial CSI reporting from multiple terminals. Numerical results show that the proposed method reduces uplink signalling for CSI reporting effectively, keeping high system throughput of spatial scheduling.

  • Improved Channel Estimation in Spatially-Correlated Flat-Fading MIMO Systems: A Parametric Approach

    Ming LUO  Qinye YIN  Ang FENG  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E91-B No:2
      Page(s):
    662-665

    We address pilot-aided channel estimation for a flat-fading spatially-correlated MIMO system, which employing Uniform Linear Arrays (ULA) on dual side and working in sparse scattering (multipath) environment. In case of sparse scattering, channel matrix and spatial correlation of flat-fading MIMO systems are parameterized by structure of multipaths, which is represented as Direction of Arrivals (DOAs), Direction of Departures (DODs) and complex path fading of each path. Based on this and block-fading property of channel, we design a channel estimation method via estimating multipath parameters using ESPRIT-like DOA-Matrix method which exploits shift-invariance property of ULA. The proposed method is able to obtain improved Mean-Square-Error performance than Least-Square method without prior information of spatial correlation.

  • Some Efficient Algorithms for the Final Exponentiation of ηT Pairing

    Masaaki SHIRASE  Tsuyoshi TAKAGI  Eiji OKAMOTO  

     
    PAPER-Implementation

      Vol:
    E91-A No:1
      Page(s):
    221-228

    Recently Tate pairing and its variations are attracted in cryptography. Their operations consist of a main iteration loop and a final exponentiation. The final exponentiation is necessary for generating a unique value of the bilinear pairing in the extension fields. The speed of the main loop has become fast by the recent improvements, e.g., the Duursma-Lee algorithm and ηT pairing. In this paper we discuss how to enhance the speed of the final exponentiation of the ηT pairing in the extension field F36n. Indeed, we propose some efficient algorithms using the torus T2(F33n) that can efficiently compute an inversion and a powering by 3n + 1. Consequently, the total processing cost of computing the ηT pairing can be reduced by 16% for n=97.

  • Prevention of Information Leakage by Photo-Coupling in Smart Card

    Sung-Shiou SHEN  Jung-Hui CHIU  

     
    PAPER-Side Channel Attacks

      Vol:
    E91-A No:1
      Page(s):
    160-167

    Advances in smart card technology encourages smart card use in more sensitive applications, such as storing important information and securing application. Smart cards are however vulnerable to side channel attacks. Power consumption and electromagnetic radiation of the smart card can leak information about the secret data protected by the smart card. Our paper describes two possible hardware countermeasures that protect against side channel information leakage. We show that power analysis can be prevented by adopting photo-coupling techniques. This method involves the use of LED with photovoltaic cells and photo-couplers on the power, reset, I/O and clock lines of the smart card. This method reduces the risk of internal data bus leakage on the external data lines. Moreover, we also discuss the effectiveness of reducing electromagnetic radiation by using embedded metal plates.

  • An Analysis of Leakage Factors for Dual-Rail Pre-Charge Logic Style

    Daisuke SUZUKI  Minoru SAEKI  

     
    PAPER-Side Channel Attacks

      Vol:
    E91-A No:1
      Page(s):
    184-192

    In recent years, certain countermeasures against differential power analysis (DPA) at the logic level have been proposed. Recently, Popp and Mangard proposed a new countermeasure-masked dual-rail pre-charge logic (MDPL); this countermeasure combines dual-rail circuits with random masking to improve the wave dynamic differential logic (WDDL). They claimed that it could implement secure circuits using a standard CMOS cell library without special constraints for the place-and-route method because the difference between the loading capacitances of all the pairs of complementary logic gates in MDPL can be compensated for by the random masking. In this paper, we particularly focus on the signal transition of MDPL gates and evaluate the DPA-resistance of MDPL in detail. Our evaluation results reveal that when the input signals have different delay times, leakage occurs in the MDPL as well as WDDL gates, even if MDPL is effective in reducing the leakage caused by the difference in loading capacitances. Furthermore, in order to validate our evaluation, we demonstrate a problem with different input signal delays by conducting measurements for an FPGA.

  • Side Channel Attacks against Hash-Based MACs with PGV Compression Functions

    Katsuyuki OKEYA  

     
    PAPER-Side Channel Attacks

      Vol:
    E91-A No:1
      Page(s):
    168-175

    HMAC is one of the most famous keyed hash functions, and widely utilized. In order to design secure hash functions, we often use PGV construction consisting of 64 schemes, each of which utilizes a block cipher. If the underlying block cipher is ideal, 12 schemes are proven to be secure. In this paper, we evaluate the security of these schemes in view of side channel attacks. As it turns out, HMACs based on 11 out of 12 secure PGV schemes are vulnerable to side channel attacks, even if the underlying block cipher is secure against side channel attacks. These schemes are classified into two groups based on their vulnerabilities. For the first group which contains 8 schemes, we show that the attacker can reveal the whole key of HMAC, and selectively forge in consequence. For the other group which contains 3 schemes, we specify the importance of the execution sequence for the inner operations of the scheme, and refine it. If wrong orders of operations are used, the attacker can reveal a portion of the key of HMAC. Hence, the use of HMACs based on such PGV schemes as they are is not recommended when the resistance against side channel attacks is necessary.

  • MIMO Spatial Spectrum Sharing for High Efficiency Mesh Network

    Fumie ONO  Kei SAKAGUCHI  

     
    PAPER-Spectrum Sharing

      Vol:
    E91-B No:1
      Page(s):
    62-69

    In this paper, an architecture of MIMO mesh network which avoids co-channel interference and supplies link multiplexing simultaneously, namely MIMO spatial spectrum sharing, is proposed. As a MIMO transmission scheme, linear (such as zero-forcing) and nonlinear (such as dirty paper coding and successive interference cancellation) MIMO algorithm are developed for the proposed mesh network. It is found from numerical analysis that the proposed MIMO mesh network achieves significantly higher channel capacity than that of conventional mesh networks.

  • A Secure Authenticated Key Exchange Protocol for Credential Services

    SeongHan SHIN  Kazukuni KOBARA  Hideki IMAI  

     
    PAPER-Protocols

      Vol:
    E91-A No:1
      Page(s):
    139-149

    In this paper, we propose a leakage-resilient and proactive authenticated key exchange (called LRP-AKE) protocol for credential services which provides not only a higher level of security against leakage of stored secrets but also secrecy of private key with respect to the involving server. And we show that the LRP-AKE protocol is provably secure in the random oracle model with the reduction to the computational Diffie-Hellman problem. In addition, we discuss about some possible applications of the LRP-AKE protocol.

701-720hit(1376hit)