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

Keyword Search Result

[Keyword] Q(6809hit)

3561-3580hit(6809hit)

  • Channel Estimation and Interference Cancellation for MIMO-OFDM Systems

    Van-Duc NGUYEN  Matthias PATZOLD  Fumiaki MAEHARA  Harald HAAS  Minh-Viet PHAM  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E90-B No:2
      Page(s):
    277-290

    This paper proposes a new channel estimation method and a new interference cancellation scheme for multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems in the presence of intersymbol interference (ISI). The proposed channel estimation method uses special training sequences (TSs) to have a desirable crest-factor of the transmitted training signal, and to prevent the influence of ISI on the channel estimation performance. By using the recommended training sequences, the ill-conditioned problem of the least square (LS) filter integrated in the proposed channel estimator can be avoided. The proposed interference cancellation scheme uses the estimated channel coefficients and the channel state information (CSI) to reproduce the interference components, which are then iteratively cancelled from the received signals. To reduced the error-floor of the demodulated symbols using for the calculations of the interference components, the so-called remodulation technique is also included in the proposed interference cancellation scheme. Simulation results show that the proposed channel estimation method outperforms conventional channel estimation methods, especially in the presence of ISI and if the signal-to-noise ratio (SNR) is larger than 15 dB. The combination of the proposed method with a space-time block code (STBC) to combat the interference influences results in an excellent system performance in terms of symbol error ratio (SER). In comparison with a STBC MIMO-OFDM system with sufficient guard interval (GI), this combination gains 1.52 dB of SNR at the same SER of 1.110-6 even after performing only one iteration of interference cancellation.

  • A Quadrature CMOS VCO Using Transformer Coupling and Current Reuse Topology

    Shao-Hwa LEE  Yun-Hsueh CHUANG  Sheng-Lyang JANG  Ming-Tsung CHUANG  Ren-Hong YEN  

     
    LETTER-Devices/Circuits for Communications

      Vol:
    E90-B No:2
      Page(s):
    346-348

    A new current reused quadrature voltage controlled oscillator (QVCO) is proposed and implemented using UMC 0.18 µm CMOS 1P6M process. The proposed circuit topology is made up two low voltage LC-tank VCOs, where the QVCO is obtained using the transformer coupling and current reuse technique. At 1.8 V supply voltage, the phase noise of the VCO is -117.13 dBc/Hz at 1 MHz offset frequency from the carrier frequency of 2.18 GHz, the core power consumption is 4.14 mW, the total power consumption is 6.48 mW and tuning range is about 160 MHz.

  • Multiple-Step Rectangular Horn with Two Orthogonal Sectoral Tapers for Elliptical Beam

    Hirotsugu URATA  Masataka OHIRA  Hiroyuki DEGUCHI  Mikio TSUJI  

     
    PAPER-Aperture Antennas

      Vol:
    E90-C No:2
      Page(s):
    217-223

    This paper proposes a new rectangular horn with two orthogonal multiple-step taper sections for obtaining a dual-polarized elliptical-beam. One of the sections has a stepwise sectoral taper configuration on both sidewalls that starts with a square waveguide feed and then the other is a taper one on both top and bottom walls toward the rectangular aperture. The proposed taper configuration is useful enough to control higher-order modes required for an elliptical beam and is so simple to apply optimization design based on mode-matching approach. As a design example, we present a rectangular horn with -10 dB beamwidth of 33 90at 9.5-10.5 GHz. The effectiveness of the proposed horn is verified numerically and experimentally.

  • Robust Quantum Algorithms Computing OR with ε-Biased Oracles

    Tomoya SUZUKI  Shigeru YAMASHITA  Masaki NAKANISHI  Katsumasa WATANABE  

     
    PAPER-Quantum Computing

      Vol:
    E90-D No:2
      Page(s):
    395-402

    This paper considers the quantum query complexity of ε-biased oracles that return the correct value with probability only 1/2 + ε. In particular, we show a quantum algorithm to compute N-bit OR functions with O(/ε) queries to ε-biased oracles. This improves the known upper bound of O(/ε2) and matches the known lower bound; we answer the conjecture raised by the paper [1] affirmatively. We also show a quantum algorithm to cope with the situation in which we have no knowledge about the value of ε. This contrasts with the corresponding classical situation, where it is almost hopeless to construct a bounded error algorithm without knowing the value of ε.

  • Score Sequence Pair Problems of (r11, r12, r22)-Tournaments--Determination of Realizability--

    Masaya TAKAHASHI  Takahiro WATANABE  Takeshi YOSHIMURA  

     
    PAPER-Graph Algorithms

      Vol:
    E90-D No:2
      Page(s):
    440-448

    Let G be any graph with property P (for example, general graph, directed graph, etc.) and S be nonnegative and non-decreasing integer sequence(s). The prescribed degree sequence problem is a problem to determine whether there is a graph G having S as the prescribed sequence(s) of degrees or outdegrees of the vertices. From 1950's, P has attracted wide attentions, and its many extensions have been considered. Let P be the property satisfying the following (1) and (2):(1) G is a directed graph with two disjoint vertex sets A and B. (2) There are r11 (r22, respectively) directed edges between every pair of vertices in A(B), and r12 directed edges between every pair of vertex in A and vertex in B. Then G is called an (r11, r12, r22)-tournament ("tournament", for short). The problem is called the score sequence pair problem of a "tournament" (realizable, for short). S is called a score sequence pair of a "tournament" if the answer of the problem is "yes." In this paper, we propose the characterizations of a score sequence pair of a "tournament" and an algorithm for determining in linear time whether a pair of two integer sequences is realizable or not.

  • Optimization Design of Biorthogonal Wavelets for Embedded Image Coding

    Zaide LIU  Nanning ZHENG  Yuehu LIU  Huub VAN DE WETERING  

     
    PAPER-Image Processing and Video Processing

      Vol:
    E90-D No:2
      Page(s):
    569-578

    We present here a simple technique for parametrization of popular biorthogonal wavelet filter banks (BWFBs) having vanishing moments (VMs) of arbitrary multiplicity. Given a prime wavelet filter with VMs of arbitrary multiplicity, after formulating it as a trigonometric polynomial depending on two free parameters, we prove the existence of its dual filter based on the theory of Diophantine equation. The dual filter permits perfect reconstruction (PR) and also has VMs of arbitrary multiplicity. We then give the complete construction of two-parameter families of 17/11 and 10/18 BWFBs, from which any linear-phase 17/11 and 10/18 BWFB possessing desired features could be derived with ease by adjusting the free parameters. In particular, two previously unpublished BWFBs for embedded image coding are constructed, both have optimum coding gains and rational coef ficients. Extensive experiments show that our new BWFBs exhibit performance equal to Winger's W-17/11 and Villasenor's V-10/18 (superior to CDF-9/7 by Cohen et al. and Villasenor's V-6/10) for image compression, and yet require slightly lower computational costs.

  • Fast Transient Simulation of Power Distribution Networks Containing Dispersion Based on Parallel-Distributed Leapfrog Algorithm

    Takayuki WATANABE  Yuichi TANJI  Hidemasa KUBOTA  Hideki ASAI  

     
    PAPER

      Vol:
    E90-A No:2
      Page(s):
    388-397

    This paper presents a fast transient simulation method for power distribution networks (PDNs) of the PCB/Package. Because these PDNs are modeled as large-scale linear circuits consisting of a large number of RLC elements, it takes large costs to solve by conventional circuit simulators, such as SPICE. Our simulation method is based on the leapfrog algorithm, and can solve RLC circuits of PDNs faster than SPICE. Actual PDNs have frequency-dependent dispersions such as the skin-effect of conductors and the dielectric loss. To model these dispersions, more number of RLC elements are required, and circuit structures of these dispersion models are hard to solve by using the leapfrog algorithm. This paper shows that the circuit structures of dispersion models can be converted to suitable structures for the leapfrog algorithm. Further, in order to reduce the simulation time, our proposed method exploits parallel computation techniques. Numerical results show that our proposed method using single processing element (PE) enables a speedup of 20-100 times and 10 times compared to HSPICE and INDUCTWISE with the same level of accuracy, respectively. In a large-scale example with frequency-dependent dispersions, our method achieves over 94% parallel efficiency with 5PEs.

  • Universal Lossy Coding for Individual Sequences Based on Complexity Functions

    Shigeaki KUZUOKA  Tomohiko UYEMATSU  

     
    PAPER-Information Theory

      Vol:
    E90-A No:2
      Page(s):
    491-503

    This paper investigates the fixed-rate and fixed-distortion lossy coding problems of individual sequences subject to the subadditive distortion measure. The fixed-rate and fixed-distortion universal lossy coding schemes based on the complexity of the sequence are proposed. The obtained coding theorems reveal that the optimal distortion (resp. rate) attainable by the fixed-rate (resp. fixed-distortion) lossy coding is equal to the optimal average distortion (resp. rate) with respect to the overlapping empirical distribution of the given sequence. Some connections with the lossy coding problem of ergodic sources are also investigated.

  • Enhancement of ZCZ Sequence Set Construction Procedure

    Hideyuki TORII  Makoto NAKAMURA  

     
    LETTER-Spread Spectrum Technologies and Applications

      Vol:
    E90-A No:2
      Page(s):
    535-538

    In our previous work, we have proposed a method for constructing ZCZ sequence sets. The method proposed by the previous work is based on perfect sequences and unitary matrices. This method can generate ZCZ sequence sets which possess a good feature concerning the length of zero-correlation zones. In this letter, we propose a new method for constructing ZCZ sequence sets by improving the previous method. The proposed method can generate new ZCZ sequence sets which can not be obtained from the previous method. These ZCZ sequence sets also possess the good feature concerning the length of zero-correlation zones.

  • Complexity-Reduced Adaptive Subchannel, Bit, and Power Allocation Algorithm and Its Throughput Analysis for Cellular OFDM System

    Kwang Man OK  Chung Gu KANG  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E90-B No:2
      Page(s):
    269-276

    We introduce an adaptive subchannel, bit, and power allocation (ASBPA) algorithm to maximize the bandwidth efficiency of the mobile communication system that use orthogonal frequency division multiplexing (OFDM). We propose a suboptimal rate adaptive ASBPA algorithm that guarantees fairness in resource allocation and overcomes inherent co-channel interference (CCI) in the cellular system. Furthermore, we evaluate the maximum possible bandwidth efficiency of the cellular OFDM system achieved by the ASBPA algorithm which is practical to implement. Our simulation results show that the proposed algorithm outperforms the existing ones and achieves the cellular bandwidth efficiency of up to 5 b/s/Hz/cell. We also investigate some of the conditions that govern the bandwidth efficiency of the cellular OFDM system using the proposed ASBPA algorithm.

  • All-Optical Analog-to-Digital Conversion Using Optical Delay Line Encoders

    Takashi NISHITANI  Tsuyoshi KONISHI  Kazuyoshi ITOH  

     
    LETTER

      Vol:
    E90-C No:2
      Page(s):
    479-480

    We propose and demonstrate the all-optical analog-to-digital conversion (ADC) using optical delay line encoders. Experimental results show that input analog signals are successfully converted into 3-bit digital signals at a bit rate of 40 Gb/s.

  • Fast Concatenative Speech Synthesis Using Pre-Fused Speech Units Based on the Plural Unit Selection and Fusion Method

    Masatsune TAMURA  Tatsuya MIZUTANI  Takehiko KAGOSHIMA  

     
    PAPER-Speech and Hearing

      Vol:
    E90-D No:2
      Page(s):
    544-553

    We have previously developed a concatenative speech synthesizer based on the plural speech unit selection and fusion method that can synthesize stable and human-like speech. In this method, plural speech units for each speech segment are selected using a cost function and fused by averaging pitch-cycle waveforms. This method has a large computational cost, but some platforms require a speech synthesis system that can work within limited hardware resources. In this paper, we propose an offline unit fusion method that reduces the computational cost. In the proposed method, speech units are fused in advance to make a pre-fused speech unit database. At synthesis time, a speech unit for each segment is selected from the pre-fused speech unit database and the speech waveform is synthesized by applying prosodic modification and concatenation without the computationally expensive unit fusion process. We compared several algorithms for constructing the pre-fused speech unit database. From the subjective and objective evaluations, the effectiveness of the proposed method is confirmed by the results that the quality of synthetic speech of the offline unit fusion method with 100 MB database is close to that of the online unit fusion method with 93 MB JP database and is slightly lower to that of the 390 MB US database, while the computational time is reduced by 80%. We also show that the frequency-weighted VQ-based method is effective for construction of the pre-fused speech unit database.

  • Lyapunov-Based Error Estimations of MIMO Interconnect Reductions by Using the Global Arnoldi Algorithm

    Chia-Chi CHU  Ming-Hong LAI  Wu-Shiung FENG  

     
    LETTER

      Vol:
    E90-A No:2
      Page(s):
    415-418

    We present theoretical foundations about error estimations of the global Krylov subspace techniques for multiple-inputs multiple-outputs (MIMO) Interconnect reductions. Analytical relationships between Lyapunov functions of the original interconnect network and those of the reduced system generated by the global Arnoldi algorithm will be developed. Under this framework, a new moment matching reduced network is proposed. Also, we will show that the reduced system can be expressed as the original network with some additive perturbations.

  • Analytical Evaluation of Analog Component Effects on AMC Performance in HSDPA System

    Masahiko SHIMIZU  Akira ITO  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E90-B No:2
      Page(s):
    302-311

    We analytically evaluated the effects of the analog components on a high-speed downlink packet access (HSDPA) system standardized by 3GPP. We considered the phase noise of synthesizers, the imbalance of demodulators between in-phase and quadrature channels, and the filters. The components are represented by the appropriate equations. We applied adaptive modulation and coding methods for HSDPA systems and base station transmission of adequate data rate signals complying with quality estimated by mobile stations (MSs). The quality represents a data rate indicating that MSs can receive the signals. We estimated the quality using a conventional signal-to-interference measurement of the common pilot channel (CPICH) and found that the phase noise creates a mismatch relationship between the quality and the data rate, while the demodulator imbalance and filters create a suitable relationship. We confirmed this using analytic methods and computer simulation.

  • Stability-Guaranteed Horizon Size for Receding Horizon Control

    Zhonghua QUAN  Soohee HAN  Wook Hyun KWON  

     
    LETTER-Systems and Control

      Vol:
    E90-A No:2
      Page(s):
    523-525

    We propose a stability-guaranteed horizon size (SgHS) for stabilizing receding horizon control (RHC). It is shown that the proposed SgHS can be represented explicitly in terms of the known parameters of the given system model and is independent of the terminal weighting matrix in the cost function. The proposed SgHS is validated via a numerical example.

  • Simultaneous Frequency Conversion Technique Utilizing an SOA-MZI for Full-Duplex WDM Radio over Fiber Applications

    Jong-In SONG  Ho-Jin SONG  

     
    INVITED PAPER

      Vol:
    E90-C No:2
      Page(s):
    351-358

    Simultaneous all-optical frequency up/downconversion technique utilizing a single semiconductor optical amplifier Mach-Zehnder interferometer (SOA-MZI) for full-duplex WDM radio over fiber (RoF) applications is presented. Using this technique, error-free simultaneous upconversion and downconversion of RoF signals with a finite-length single mode fiber were experimentally demonstrated. The results show the potential of the proposed scheme for use in a cost-effective full-duplex WDM RoF link.

  • Transfer Function Preserving Transformations on Equal-Ripple RC Polyphase Filters for Reducing Design Efforts

    Hiroaki TANABE  Hiroshi TANIMOTO  

     
    PAPER

      Vol:
    E90-A No:2
      Page(s):
    333-338

    Element value spread of an equal-ripple RC polyphase filter depends heavily on the order of zero assignment. To find the optimum design, we must conduct exhaustive design for all the possible zero assignments. This paper describes two circuit transformations on equal-ripple RC polyphase filters, which preserve their transfer functions, for reducing circuit design efforts. Proposed Method I exchanges (R,C) values to (1/C,1/R) for each stage. This gives a new circuit with different zero assignment for each stage of its original circuit. Method II flips over the original circuit and exchanges the resulting (Ri,Ci) values for (Cn-i+1,Rn-i+1) for each i-th stage. Those circuit transformations can reduce a number of circuit designs down to 1/4 of the straight-forward method. This considerably reduces a burden for exhaustive design for searching the minimum element value spread condition. Some design examples are given to illustrate the proposed methods.

  • Frequency Offset Estimator for OFDM Using a Special Preamble

    Yun WU  Hanwen LUO  Ming DING  Renmao LIU  Haibin ZHANG  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E90-B No:2
      Page(s):
    388-391

    In this letter,we design a special preamble composed of two OFDM training blocks with different numbers of identical parts. Based on the designed preamble, we propose a method to estimate frequency offset utilizing initial estimates from the two OFDM training symbols. By elaborately selecting the numbers of identical parts for the two training blocks, the proposed estimator provides a much larger estimate range than conventional estimators using identical parts. Computer simulations show that the proposed estimator exhibits superior estimate performance, while maintaining low computational complexity.

  • 10-GHz SiGe BiCMOS Sub-Harmonic Gilbert Mixer Using the Fully Symmetrical and Time-Delay Compensated LO Cells

    Tzung-Han WU  Chinchun MENG  

     
    PAPER

      Vol:
    E90-A No:2
      Page(s):
    326-332

    A 10-GHz sub-harmonic Gilbert mixer is demonstrated in this paper using the 0.35 µm SiGe BiCMOS technology. The time-delay when the sub-harmonic LO (Local Oscillator) stage generates sub-harmonic LO signals is compensated by using fully symmetrical multiplier pairs. High RF-to-IF isolation and sub-harmonic LO Gilbert cell with excellent frequency response can be achieved by the elimination of the time-delay. The SiGe BiCMOS sub-harmonic micromixer exhibits 17 dB conversion gain, -74 dB 2LO-to-RF isolation, IP1 dB of -20 dBm, and IIP3 of -10 dBm. The measured double sideband noise figure is 16 dB from 100-kHz to 100-MHz because the SiGe bipolar device has very low 1/f noise corner.

  • Beam-Space MUSIC DOA System Using Phase Shifter

    Seung-Wook NAH  Hiroyuki ARAI  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E90-B No:2
      Page(s):
    291-295

    This paper presents a low cost and portable DOA (Direction Of Arrival) estimation system for surveillance using a modifed beamspace MUSIC (MUltiple Signal Classification) by a quasi-orthogonal multi-beam. This is instead of DFT processing and hardware system consisting of chip-sized phase shifters, a single ADC (Analogue to Digital Converter) and a single TR (TRanceiver) module for an antenna array. In the beamspace MUSIC, generated beampatterns have orthogonal properties. This proposed system cannot make such a beampattern due to the variable range limitation of phase shifter, then we use the quasi-orthogonal beam obtained by the calculation of correlation coefficient for beampattern. We demonstrate the proposed system using 4-element microstrip array antenna and chip-sized phase shifters. The DOA experiment in anechoic chamber confirms the proposed system performance.

3561-3580hit(6809hit)