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

Keyword Search Result

[Keyword] TE(21534hit)

7001-7020hit(21534hit)

  • Study of the Multiplexing Schemes for COMPASS B1 Signals

    Wei LIU  Yuan HU  Xingqun ZHAN  

     
    LETTER-Navigation, Guidance and Control Systems

      Vol:
    E95-B No:3
      Page(s):
    1027-1030

    With the development of COMPASS system, finding suitable and efficient multiplexing solutions have become important for the system signal design. In this paper, based on the alternative BOC (AltBOC) modulation technique, the multiplexing scheme for COMPASS Phase II B1 signals is proposed. Then, to combine all COMPASS Phase III (CP III) B1 components into a composite signal with constant envelope, the generalized majority voting (GMV) technique is employed based on the characteristics of CP III B1 signals. The proposed multiplexing schemes also provide potential opportunities for GNSS modernization and construction, such as GPS, Galileo, etc.

  • Spreading and Interleaving Design for Synchronous Interleave-Division Multiple-Access

    Guanghui SONG  Jun CHENG  Yoichiro WATANABE  

     
    PAPER-Information Theory

      Vol:
    E95-A No:3
      Page(s):
    646-656

    A K-user interleave-division multiple-access (IDMA) system with symbol-synchronous and equal-power users is considered. In this IDMA system, the spreading, interleaving, and multiple-access channel (MAC) are jointly considered as an equivalent channel, referred to as an IDMA channel. Given channel signal-to-noise ratio (SNR), the sum capacity of the IDMA channel is only determined by a K-user spread-interleave (SI) matrix. First, it is shown that to maximize the sum capacity of the IDMA channel, rows or columns of its K-user SI matrix should be pairwise orthogonal. The optimal K-user SI matrix is constructed. Second, for the IDMA system with each user employing the same spreading sequence followed by random interleaving, it is shown that, as the number of users approaches infinity, the sum capacity of the IDMA channel converges to a determinate value, which is achieved by a balanced spreading sequence. Moreover, when both the number of users and the data length approach infinity, this determinate value of sum capacity is achieved by an arbitrary spreading sequence. Furthermore, for a finite number of users, an optimal spreading sequence is derived by minimizing an expected column correlation of the K-user SI matrix. It shows that this optimal spreading sequence provides the maximum ergodic sum capacity.

  • WBC-ALC: A Weak Blocking Coordinated Application-Level Checkpointing for MPI Programs

    Xinhai XU  Xuejun YANG  Yufei LIN  

     
    PAPER-Computer System

      Vol:
    E95-D No:3
      Page(s):
    786-796

    As supercomputers increase in size, the mean time between failures (MTBF) of a system becomes shorter, and the reliability problem of supercomputers becomes more and more serious. MPI is currently the de facto standard used to build high-performance applications, and researches on the fault tolerance methods of MPI are always hot topics. However, due to the characteristics of MPI programs, most current checkpointing methods for MPI programs need to modify the MPI library (even operating system), or implement a complicated protocol by logging lots of messages. In this paper, we carry forward the idea of Application-Level Checkpointing (ALC). Based on the general fact that programmers are familiar with the communication characteristics of applications, we have developed BC-ALC, a new portable blocking coordinated ALC for MPI programs. BC-ALC neither modifies the MPI library (even operating system) nor logs any message. It implements coordination only by the Barrier operations instead of any complicated protocol. Furthermore, in order to reduce the cost of fault-tolerance, we reduce the synchronization range of the barrier, and design WBC-ALC, a weak blocking coordinated ALC utilizing group synchronization instead of global synchronization based on the communication relationship between processes. We also propose a fault-tolerance framework developed on top of WBC-ALC and discuss an implementation of it. Experimental results on NPB3.3-MPI benchmarks validate BC-ALC and WBC-ALC, and show that compared with BC-ALC, the average coordination time and the average backup time of a single checkpoint in WBC-ALC are reduced by 44.5% and 5.7% respectively.

  • View-Based Object Recognition Using ND Tensor Supervised Neighborhood Embedding

    Xian-Hua HAN  Yen-Wei CHEN  Xiang RUAN  

     
    PAPER-Pattern Recognition

      Vol:
    E95-D No:3
      Page(s):
    835-843

    In this paper, we propose N-Dimensional (ND) Tensor Supervised Neighborhood Embedding (ND TSNE) for discriminant feature representation, which is used for view-based object recognition. ND TSNE uses a general Nth order tensor discriminant and neighborhood-embedding analysis approach for object representation. The benefits of ND TSNE include: (1) a natural way of representing data without losing structure information, i.e., the information about the relative positions of pixels or regions; (2) a reduction in the small sample size problem, which occurs in conventional supervised learning because the number of training samples is much less than the dimensionality of the feature space; (3) preserving a neighborhood structure in tensor feature space for object recognition and a good convergence property in training procedure. With Tensor-subspace features, the random forests is used as a multi-way classifier for object recognition, which is much easier for training and testing compared with multi-way SVM. We demonstrate the performance advantages of our proposed approach over existing techniques using experiments on the COIL-100 and the ETH-80 datasets.

  • Verification of Trusted Network Access Protocols in the Strand Space Model

    Yuelei XIAO  Yumin WANG  Liaojun PANG  

     
    LETTER-Cryptography and Information Security

      Vol:
    E95-A No:3
      Page(s):
    665-668

    Trusted network access protocols are proposed for the security and authorization of network-access requests. Because they differ greatly from traditional security protocols on security demands, they can not be analyzed with previous strand space works directly. To solve this problem, we first give some extensions necessary to verify them in this letter. Moreover, we point out Zhuo Ma et al.'s MN-TAP protocol is unsecure based on the Strand Space Model (SSM), and then improve the MN-TAP protocol and show that the improved MN-TAP protocol is secure in the SSM.

  • Depth Enhancement Considering Just Noticeable Difference in Depth

    Seung-Won JUNG  Sung-Jea KO  

     
    LETTER-Image

      Vol:
    E95-A No:3
      Page(s):
    673-675

    Recent advances in 3-D technologies draw an interest on the just noticeable difference in depth (JNDD) that describes a perceptual threshold of depth differences. In this letter, we address a new application of the JNDD to the depth image enhancement. In the proposed algorithm, a depth image is first segmented into multiple layers and then the depth range of the layer is expanded if the depth difference between adjacent layers is smaller than the JNDD. Therefore, viewers can effectively perceive the depth differences between layers and thus the human depth perception can be improved. The proposed algorithm can be applied to any depth-based 3-D display applications.

  • A Novel Half Mode Elliptic SIW (HMESIW) Filter with Bypass Coupling Substrate Integrated Circular Cavity (BCSICC)

    Boren ZHENG  Zhiqin ZHAO  Youxin LV  

     
    BRIEF PAPER-Microwaves, Millimeter-Waves

      Vol:
    E95-C No:3
      Page(s):
    408-411

    A novel half mode elliptic substrate integrated waveguide (HMESIW) filter with bypass coupling substrate integrated circular cavity (BCSICC) is proposed and fabricated by using standard PCB technology. Due to the use of an elliptical waveguide cavity, the tolerance sensitivity of the filter is reduced. The filter optimizing procedure is therefore simplified. The measured results demonstrate its superior performance in tolerance sensitivity and show good agreements with the simulation results.

  • Proposal of Novel Optical Burst Signal Receiver for ONU in Optical Switched Access Network

    Hiromi UEDA  Keita HAMASAKI  Takashi KURIYAMA  Toshinori TSUBOI  Hiroyuki KASAI  

     
    PAPER-Fiber-Optic Transmission for Communications

      Vol:
    E95-B No:3
      Page(s):
    819-831

    To realize economical optical burst signal receivers for the Optical Network Unit (ONU) of the Ethernet Optical Switched Access Network (E-OSAN), we previously implemented optical burst receivers with AC-coupling and DC-coupling using off-the-shelf components, and showed that the former offers better performance. This paper proposes a new optical burst signal receiver that uses the transfer function, Gn(s) = 1-Hn(s), where Hn(s) denotes a Bessel filter transfer function of order n. We also present a method for designing the proposed receiver and clarify that it has better performance than the conventional AC-coupling one. We then present an LCR circuit synthesis of Gn(s), which is necessary to actually implement a burst receiver based on the proposal.

  • Design of Predistorter with Efficient Updating Algorithm of Power Amplifier with Memory Effect

    Yasuyuki OISHI  Shigekazu KIMURA  Eisuke FUKUDA  Takeshi TAKANO  Daisuke TAKAGO  Yoshimasa DAIDO  Kiyomichi ARAKI  

     
    PAPER-Electronic Circuits

      Vol:
    E95-C No:3
      Page(s):
    382-394

    This paper describes a method to design a predistorter (PD) for a GaN-FET power amplifier (PA) by using nonlinear parameters extracted from measured IMD which has asymmetrical peaks peculiar to a memory effect with a second-order lag. While, computationally efficient equations have been reported by C. Rey et al. for the memory effect with a first-order lag. Their equations are extended to be applicable to the memory effect with the second-order lag. The extension provides a recursive algorithm for cancellation signals of the PD each of which updating is made by using signals in only two sampling points. The algorithm is equivalent to a memory depth of two in computational efficiency. The required times for multiplications and additions are counted for the updating of all the cancellation signals and it is confirmed that the algorithm reduces computational intensity lower than half of a memory polynomial in recent papers. A computer simulation has clarified that the PD improves the adjacent channel leakage power ratio (ACLR) of OFDM signals with several hundred subcarriers corresponding to 4G mobile radio communications. It has been confirmed that a fifth-order PD is effective up to a higher power level close to 1 dB compression. The improvement of error vector magnitude (EVM) by the PD is also simulated for OFDM signals of which the subcarrier channels are modulated by 16 QAM.

  • Outage Analysis of Cognitive Multihop Networks under Interference Constraints

    Vo Nguyen Quoc BAO  Trung Quang DUONG  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E95-B No:3
      Page(s):
    1019-1022

    In this letter, we consider a cognitive radio based multihop network under the spectrum sharing underlay paradigm. By taking into account the interference constraints, we present an exact closed-form expression for outage probability, which is valid for the whole signal-to-noise ratio regime. In addition, some numerical examples of interest that study the effect of the number of hops and/or the interferer threshold on primary users are illustrated and discussed. Numerical results show that multihop systems still offer a considerable gain as compared to direct transmission under the same limit of interference.

  • Iterative Superimposed Pilot-Assisted Channel Estimation Using Sliding Wiener Filtering for Single-Carrier Block Transmission

    Tetsuya UCHIUMI  Tatsunori OBARA  Kazuki TAKEDA  Fumiyuki ADACHI  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E95-B No:3
      Page(s):
    924-932

    In the conventional iterative superimposed pilot-assisted channel estimation (SI-PACE), simple averaging of the instantaneous channel estimates obtained by using the pilot over several single-carrier (SC) blocks (called the frame in this paper) is taken in order to reduce the interference from data symbols. Therefore, the conventional SI-PACE has low tracking ability against fading time variations. To solve the tracking problem, Wiener filtering (WF)-based averaging can be used instead of simple averaging. However, WF incurs high computational complexity. Furthermore, the estimation error of the fading autocorrelation function significantly degrades the channel estimation accuracy. In order to improve the channel estimation accuracy while keeping the computational complexity low, a new iterative SI-PACE using sliding WF (called iterative SWFSI-PACE) is proposed. The channel estimation is done by sliding a WF having a shorter filter size than the measurement interval. The bit error rate (BER) and throughput performances of SC-FDE using iterative SWFSI-PACE are investigated by computer simulation to show that the proposed scheme achieves good BER and throughput performances while keeping the computational complexity low irrespective of the fading rate (or maximum Doppler frequency).

  • Virtual Fiber Networking and Impact of Optical Path Grooming on Creating Efficient Layer One Services

    Fumisato NARUSE  Yoshiyuki YAMADA  Hiroshi HASEGAWA  Ken-ichi SATO  

     
    PAPER

      Vol:
    E95-B No:3
      Page(s):
    723-729

    This paper presents a novel “virtual fiber” network service that exploits wavebands. This service provides virtual direct tunnels that directly convey wavelength paths to connect customer facilities. To improve the resource utilization efficiency of the service, a network design algorithm is developed that can allow intermediate path grooming at limited nodes and can determine the best node location. Numerical experiments demonstrate the effectiveness of the proposed service architecture.

  • Cooperative Transmission Scheme Using Transmission Timing Control in LTE Enterprise Femtocell Networks

    Seung-Yeon KIM  Sang-Sik AHN  Seungwan RYU  Choong-Ho CHO  Hyong-Woo LEE  

     
    LETTER-Transmission Systems and Transmission Equipment for Communications

      Vol:
    E95-B No:3
      Page(s):
    987-990

    In this letter, we propose and analyze a cooperative transmission scheme (CTS) that uses transmission timing control for LTE enterprise femtocells. In our scheme, the user equipment (UE) can receive the desired signal from an adjacent fBS as well as its serving femtocell BS (fBS). Thus, UE achieves an improved signal to interference ratio (SIR) due to the synchronization of the two signals. Analysis and simulation results show that the proposed scheme can reduce the outage probability for enterprise femtocells compared to the conventional system. In particular, a significant performance improvement can be achieved for UEs located at cell edges.

  • Terahertz Radiation Emitted from Intrinsic Josephson Junctions in High-Tc Superconductor Bi2Sr2CaCu2O8+δ Open Access

    Hidetoshi MINAMI  Manabu TSUJIMOTO  Takanari KASHIWAGI  Takashi YAMAMOTO  Kazuo KADOWAKI  

     
    INVITED PAPER

      Vol:
    E95-C No:3
      Page(s):
    347-354

    The present status of superconducting terahertz emitter using the intrinsic Josephson junctions in high-Tc superconductor Bi2Sr2CaCu2O8+δ is reviewed. Fabrication methods of the emitting device, electrical and optical characteristics of them, synchronizing operation of two emitters and an example of applications to the terahertz imaging will be discussed. After the description of fabrication techniques by an Argon ion milling with photolithography or metal masks and by a focused ion beam, optical properties of radiation spectra, the line width, polarization and the spatial distribution of emission are presented with some discussion on the operation mechanism. For electrical properties, reversible and irreversible operations at high and low electrical currents, respectively, and electrical modulation of the radiation intensity for terahertz imaging are presented.

  • Distributed Channel Selection in CRAHNs with Heterogeneous Spectrum Opportunities: A Local Congestion Game Approach

    Yuhua XU  Qihui WU  Jinlong WANG  Neng MIN  Alagan ANPALAGAN  

     
    LETTER-Network

      Vol:
    E95-B No:3
      Page(s):
    991-994

    This letter investigates the problem of distributed channel selection in cognitive radio ad hoc networks (CRAHNs) with heterogeneous spectrum opportunities. Firstly, we formulate this problem as a local congestion game, which is proved to be an exact potential game. Then, we propose a spatial best response dynamic (SBRD) to rapidly achieve Nash equilibrium via local information exchange. Moreover, the potential function of the game reflects the network collision level and can be used to achieve higher throughput.

  • Evaluation of a 2-Channel NIRS-Based Optical Brain Switch for Motor Disabilities' Communication Tools

    Kazuhiko SAGARA  Kunihiko KIDO  

     
    PAPER-Rehabilitation Engineering and Assistive Technology

      Vol:
    E95-D No:3
      Page(s):
    829-834

    We have developed a portable NIRS-based optical BCI system that features a non-invasive, facile probe attachment and does not require muscle movement to control the target devices. The system consists of a 2-channel probe, a signal-processing unit, and an infrared-emission device, which measures the blood volume change in the participant's prefrontal cortex in a real time. We use the threshold logic as a switching technology, which transmits a control signal to a target device when the electrical waveforms exceed the pre-defined threshold. Eight healthy volunteers participated in the experiments and they could change the television channel or control the movement of a toy robot with average switching times of 11.5 ± 5.3 s and the hit rate was 83.3%. These trials suggest that this system provides a novel communication aid for people with motor disabilities.

  • SIS Junctions for Millimeter and Submillimeter Wave Mixers Open Access

    Takashi NOGUCHI  Toyoaki SUZUKI  Tomonori TAMURA  

     
    INVITED PAPER

      Vol:
    E95-C No:3
      Page(s):
    320-328

    We have developed a process for the fabrication of high-quality Nb/AlOx/Nb tunnel junctions with small area and high current densities for the heterodyne mixers at millimeter and submillimeter wavelengths. Their dc I-V curves are numerically studied, including the broadening of quasiparticle density of states resulting from the existence of an imaginary part of the gap energy of Nb. We have found both experimentally and numerically that the subgap current is strongly dependent on bias voltage at temperatures below 4.2 K unlike the prediction of the BCS tunneling theory. It is shown that calculated dc I-V curves taking into account the complex number of the gap energy agree well with those of Nb/AlOx/Nb junctions measured at temperatures from 0.4 to 4.2 K. We have successfully built receivers at millimeter and submillimeter wavelengths with the noise temperature as low as 4 times the quantum photon noise, employing those high-quality Nb/AlOx/Nb junctions. Those low-noise receivers are to be installed in the ALMA (Atacama Large Millimeter/Submillimeter Array) telescope and they are going into series production now.

  • Indexing All Rooted Subgraphs of a Rooted Graph

    Tomoki IMADA  Hiroshi NAGAMOCHI  

     
    PAPER

      Vol:
    E95-D No:3
      Page(s):
    712-721

    Let G be a connected graph in which we designate a vertex or a block (a biconnected component) as the center of G. For each cut-vertex v, let Gv be the connected subgraph induced from G by v and the vertices that will be separated from the center by removal of v, where v is designated as the root of Gv. We consider the set R of all such rooted subgraphs in G, and assign an integer, called an index, to each of the subgraphs so that two rooted subgraphs in R receive the same indices if and only if they are isomorphic under the constraint that their roots correspond each other. In this paper, assuming a procedure for computing a signature of each graph in a class of biconnected graphs, we present a framework for computing indices to all rooted subgraphs of a graph G with a center which is composed of biconnected components from . With this framework, we can find indices to all rooted subgraphs of a outerplanar graph with a center in linear time and space.

  • Performance Enhancement of Multi-Cyclic Detector for Cognitive Radios with an OFDM Primary System

    Minseok KIM  Kimtho PO  Jun-ichi TAKADA  

     
    PAPER-Terrestrial Wireless Communication/Broadcasting Technologies

      Vol:
    E95-B No:3
      Page(s):
    950-960

    Spectrum sensing, a key technical challenge in cognitive radios (CR) technology, is a technique that enables the spectrum of licensed systems to be accessed without causing undue interference. It is well known that cyclostationarity detectors have great advantages over energy detectors in terms of the robustness to noise uncertainty that significantly degrades the performance as well as the capability to distinguish the signal of interest from the other interferences and noise. The generalized likelihood ratio test (GLRT) is a recognized sensing technique that utilizes the inherent cyclostationarity of the signal and has been intensively studied. However, no comprehensive evaluation on its performance enhancement has been published to date. Moreover high computational complexity is still a significant problem for its realization. This paper proposes a maximum ratio combining multi-cyclic detector which uses multiple cyclic frequencies for performance enhancement with reduced computational complexity. An orthogonal frequency-division multiplexing (OFDM) signal based on the ISDB-T (integrated services digital broadcasting terrestrial), a Japanese digital television broadcasting standard, was used in the evaluation assuming this as a primary system in WRAN (wireless regional area network) applications like IEEE 802.22.

  • Authentication Binding between SSL/TLS and HTTP

    Takamichi SAITO  Kiyomi SEKIGUCHI  Ryosuke HATSUGAI  

     
    PAPER-Information Network

      Vol:
    E95-D No:3
      Page(s):
    797-803

    While the Secure Socket Layer or Transport Layer Security (SSL/TLS) is assumed to provide secure communications over the Internet, many web applications utilize basic or digest authentication of Hyper Text Transport Protocol (HTTP) over SSL/TLS. Namely, in the scheme, there are two different authentication schemes in a session. Since they are separated by a layer, these are not convenient for a web application. Moreover, the scheme may also cause problems in establishing secure communication. Then we provide a scheme of authentication binding between SSL/TLS and HTTP without modifying SSL/TLS protocols and its implementation, and we show the effectiveness of our proposed scheme.

7001-7020hit(21534hit)