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

Keyword Search Result

[Keyword] ATI(18690hit)

8201-8220hit(18690hit)

  • A Technique for Defining Metamodel Translations

    Iván GARCÍA-MAGARIÑO  Rubén FUENTES-FERNÁNDEZ  

     
    PAPER-Fundamentals of Software and Theory of Programs

      Vol:
    E92-D No:10
      Page(s):
    2043-2052

    Model-Driven Engineering and Domain-Specific Modeling Languages are encouraging an increased used of metamodels for the definition of languages and tools. Although the Meta Object Facility language is the standard for metamodeling, there are alternative metamodeling languages that are aimed at satisfying specific requirements. In this context, sharing information throughout different domains and tools requires not only being able to translate models between modeling languages defined with the same metamodeling language, but also between different metamodeling languages. This paper addresses this latter need describing a general technique to define transformations that perform this translation. In this work, two case studies illustrate the application of this process.

  • Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems

    Keiichirou KUSAKARI  Yasuo ISOGAI  Masahiko SAKAI  Frederic BLANQUI  

     
    PAPER-Computation and Computational Models

      Vol:
    E92-D No:10
      Page(s):
    2007-2015

    Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful method, the static dependency pair method, which is based on the notion of strong computability, in order to prove termination in STRSs. In this paper, we extend the method to HRSs. Since HRSs include λ-abstraction but STRSs do not, we restructure the static dependency pair method to allow λ-abstraction, and show that the static dependency pair method also works well on HRSs without new restrictions.

  • Expediting Experiments across Testbeds with AnyBed: A Testbed-Independent Topology Configuration System and Its Tool Set

    Mio SUZUKI  Hiroaki HAZEYAMA  Daisuke MIYAMOTO  Shinsuke MIWA  Youki KADOBAYASHI  

     
    PAPER-Network Architecture and Testbed

      Vol:
    E92-D No:10
      Page(s):
    1877-1887

    Building an experimental network within a testbed has been a tiresome process for experimenters, due to the complexity of the physical resource assignment and the configuration overhead. Also, the process could not be expedited across testbeds, because the syntax of a configuration file varies depending on specific hardware and software. Re-configuration of an experimental topology for each testbed wastes time, an experimenter could not carry out his/her experiments during the limited lease time of a testbed at worst. In this paper, we propose the AnyBed: the experimental network-building system. The conceptual idea of AnyBed is "If experimental network topologies can be portable across any kinds of testbed, then, it would expedite building an experimental network on a testbed while manipulating experiments by each testbed support tool". To achieve this concept, AnyBed divide an experimental network configuration into the logical and physical network topologies. Mapping these two topologies, AnyBed can build intended logical network topology on any PC clusters. We have evaluated the AnyBed implementation using two distinct clusters. The evaluation result shows a BGP topology with 150 nodes can be constructed on a large scale testbed in less than 113 seconds.

  • Fiber Access Networks: Reliability Analysis and Swedish Broadband Market Open Access

    Lena WOSINSKA  Jiajia CHEN  Claus Popp LARSEN  

     
    INVITED PAPER

      Vol:
    E92-B No:10
      Page(s):
    3006-3014

    Fiber access network architectures such as active optical networks (AONs) and passive optical networks (PONs) have been developed to support the growing bandwidth demand. Whereas particularly Swedish operators prefer AON, this may not be the case for operators in other countries. The choice depends on a combination of technical requirements, practical constraints, business models, and cost. Due to the increasing importance of reliable access to the network services, connection availability is becoming one of the most crucial issues for access networks, which should be reflected in the network owner's architecture decision. In many cases protection against failures is realized by adding backup resources. However, there is a trade off between the cost of protection and the level of service reliability since improving reliability performance by duplication of network resources (and capital expenditures CAPEX) may be too expensive. In this paper we present the evolution of fiber access networks and compare reliability performance in relation to investment and management cost for some representative cases. We consider both standard and novel architectures for deployment in both sparsely and densely populated areas. While some recent works focused on PON protection schemes with reduced CAPEX the current and future effort should be put on minimizing the operational expenditures (OPEX) during the access network lifetime.

  • Two-Dimensional Arrays Optimized for Wide-Scanning Phased Array Based on Potential Function Method

    Koji NISHIMURA  Toru SATO  

     
    PAPER-Antennas and Propagation

      Vol:
    E92-B No:10
      Page(s):
    3228-3235

    For phased and adaptive arrays of antennas, an optimal arrangement of antenna elements is essential to avoid grating lobes in the visible angular region of the array. Large sidelobes cause degradation in signal-to-noise ratio; grating lobes, in the worst case, cause malfunctions. One method of evaluating sidelobe level is square integration. For a given set element positions, evaluation by square integration of the sidelobes involves Fourier transform and numerical integration. For faster evaluation, we developed an equivalent transform algorithm that requires no numerical Fourier transform or integration. Using this new algorithm, we introduced a fast trial-and-error algorithm that iteratively applies random perturbation to the array, evaluates the function, and minimizes it. A number of separate runs of this algorithm have been conducted under the constraint of 3-fold rotational symmetry for stability. The optimal output, for which the function is minimized, is a uniformly spaced equilateral-triangular-type arrays that, unfortunately, has unwanted grating lobes. However the algorithm also yields variations trapped at local minima, some of which do not have grating lobes and whose sidelobe peaks are sufficiently low within a wide angular region. For the case N=12, a characteristic triagular-rectangular-type array often arises, which has not only better sidelobe properties as evaluated by square-integration and peak sidelobe, but also sufficient element-to-element clearance. For the case N=36, one of the results achieves a peak-sidelobe level of -8 dB, with a minimum element-to-element separation of 0.76 wavelength.

  • A New User Selection Measure in Block Diagonalization Algorithm for Multiuser MIMO Systems Open Access

    Riichi KUDO  Yasushi TAKATORI  Kentaro NISHIMORI  Atsushi OHTA  Shuji KUBOTA  Masato MIZOGUCHI  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E92-B No:10
      Page(s):
    3206-3218

    Multiuser -- Multiple Input Multiple Output (MU-MIMO) techniques were proposed to increase spectrum efficiency; a key assumption was that the Mobile Terminals (MTs) were simple with only a few antennas. This paper focuses on the Block Diagonalization algorithm (BD) based on the equal power allocation strategy as a practical MU-MIMO technique. When there are many MTs inside the service area of the access point (AP), the AP must determine, at each time slot, the subset of the MTs to be spatially multiplexed. Since the transmission performance depends on the subsets of MTs, the user selection method needs to use the Channel State Information (CSI) obtained in the physical layer to maximize the Achievable Transmission Rate (ATR). In this paper, we clarify the relationship between ATR with SU-MIMO and that with MU-MIMO in a high eigenvalue channel. Based on the derived relationship, we propose a new measure for user selection. The new measure, the eigenvalue decay factor, represents the degradation of the eigenvalues in null space compared to those in SU-MIMO; it is obtained from the signal space vectors of the MTs. A user selection method based on the proposed measure identifies the combination of MTs that yields the highest ATR; our approach also reduces the computational load of user selection. We evaluate the effectiveness of user selection with the new measure using numerical formulations and computer simulations.

  • Antenna Array Calibration Based on Frequency Selection in OFDMA/TDD Systems Open Access

    Yoshitaka HARA  Yasuhiro YANO  Hiroshi KUBO  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E92-B No:10
      Page(s):
    3195-3205

    This paper proposes a new antenna array calibration technique which uses frequency selection in orthogonal frequency division multiple access (OFDMA)/time division duplexing (TDD) systems. In the proposed method, subbands or frequencies of good channel conditions are initially selected for channel measurements. The relative calibration is performed at the selected subbands, which compensates for mismatch of analogue gains in multiple antennas using the measured uplink and downlink channel parameters. Furthermore, the calibration parameters are interpolated in the frequency domain for the whole bandwidth. The proposed calibration maintains accurate channel reciprocity for the whole bandwidth compared to the conventional calibration which does not use the frequency selection. The proposed calibration technique is effective in exploiting channel reciprocity at both base station and terminals with feasible amount of feedback and low-cost operation.

  • Stability Analysis of XCP (eXplicit Control Protocol) with Heterogeneous Flows

    Yusuke SAKUMOTO  Hiroyuki OHSAKI  Makoto IMASE  

     
    PAPER-Internet

      Vol:
    E92-B No:10
      Page(s):
    3174-3182

    In this paper, we analyze the stability of XCP (eXplicit Control Protocol) in a network with heterogeneous XCP flows (i.e., XCP flows with different propagation delays). Specifically, we model a network with heterogeneous XCP flows using fluid-flow approximation. We then derive the conditions that XCP control parameters should satisfy for stable XCP operation. Furthermore, through several numerical examples and simulation results, we quantitatively investigate effect of system parameters and XCP control parameters on stability of the XCP protocol. Our findings include: (1) when XCP flows are heterogeneous, XCP operates more stably than the case when XCP flows are homogeneous, (2) conversely, when variation in propagation delays of XCP flows is large, operation of XCP becomes unstable, and (3) the output link bandwidth of an XCP router is independent of stability of the XCP protocol.

  • Analysis and Design of a Reflection-Cancelling Transverse Slot-Pair Array with Grating-Lobe Suppressing Baffles

    Takehito SUZUKI  Jiro HIROKAWA  Makoto ANDO  

     
    PAPER-Antennas and Propagation

      Vol:
    E92-B No:10
      Page(s):
    3236-3242

    This paper presents the analysis and design of a reflection-cancelling transverse slot-pair array antenna with baffles by using the Spectrum of Two-Dimensional Solutions (S2DS) method. For the transverse slot array, the slot spacings with more than one free-space wavelength cause the grating-lobes. The baffles suppress the grating-lobes effectively. A one-dimensional slot array is extracted from the 2D array with in-phase excitation by assuming periodicity in the transversal direction. The uniform excitation over the finite array is synthesized iteratively to demonstrate the fast and accurate results by S2DS. A unit design model with the baffles is introduced to determine the initial parameters of the slot-pairs, which greatly accelerate the iterations process. Experiments at 25.3 GHz demonstrate the suppression of the grating lobes to the level less than -20.0 dB and also the good uniformity of the aperture field distribution.

  • Video Frame Interpolation by Image Morphing Including Fully Automatic Correspondence Setting

    Miki HASEYAMA  Makoto TAKIZAWA  Takashi YAMAMOTO  

     
    LETTER-Image Processing and Video Processing

      Vol:
    E92-D No:10
      Page(s):
    2163-2166

    In this paper, a new video frame interpolation method based on image morphing for frame rate up-conversion is proposed. In this method, image features are extracted by Scale-Invariant Feature Transform in each frame, and their correspondence in two contiguous frames is then computed separately in foreground and background regions. By using the above two functions, the proposed method accurately generates interpolation frames and thus achieves frame rate up-conversion.

  • Decoding of Separately Encoded Multiple Correlated Sources Transmitted over Noisy Channels

    Kentaro KOBAYASHI  Takaya YAMAZATO  Masaaki KATAYAMA  

     
    PAPER-Coding Theory

      Vol:
    E92-A No:10
      Page(s):
    2402-2410

    We propose an iterative channel decoding scheme for two or more multiple correlated sources. The correlated sources are separately turbo encoded without knowledge of the correlation and transmitted over noisy channels. The proposed decoder exploits the correlation of the multiple sources in an iterative soft decision decoding manner for joint detection of each of the transmitted data. Simulation results show that achieved performance for the more than two sources is also close to the Shannon and Slepian-Wolf limit and large additional SNR gain is obtained in comparison with the case of two sources. We also verify through simulation that no significant penalty results from the estimation of the source correlation in the decoding process and the code with a low error floor achieves good performance for a large number of the correlated sources.

  • Efficient Packet Classification with a Hybrid Algorithm

    Pi-Chung WANG  

     
    PAPER-QoS and Quality Management

      Vol:
    E92-D No:10
      Page(s):
    1915-1922

    Packet classification categorizes incoming packets into multiple forwarding classes based on pre-defined filters. This categorization makes information accessible for quality of service or security handling in the network. In this paper, we propose a scheme which combines the Aggregate Bit Vector algorithm and the Pruned Tuple Space Search algorithm to improve the performance of packet classification in terms of speed and storage. We also present the procedures of incremental update. Our scheme is evaluated with filter databases of varying sizes and characteristics. The experimental results demonstrate that our scheme is feasible and scalable.

  • Impact of Censoring on Estimation of Flow Duration Distribution and Its Mitigation Using Kaplan-Meier-Based Method

    Yuki SAKAI  Masato UCHIDA  Masato TSURU  Yuji OIE  

     
    LETTER-QoS and Quality Management

      Vol:
    E92-D No:10
      Page(s):
    1949-1952

    A basic and inevitable problem in estimating flow duration distribution arises from "censoring" (i.e., cutting off) the observed flow duration because of a finite measurement period. We extended the Kaplan-Meier method, which is used in the survival analysis field, and applied it to recover information on the flow duration distribution that was lost due to censoring. We show that the flow duration distribution from a short period of actual traffic data with censoring that was estimated using a Kaplan-Meier-based method can approximate well the flow duration distribution calculated from a sufficiently long period of actual traffic data.

  • Performance of Reed-Solomon Coded MC-DS-CDMA with Bi-orthogonal Modulation

    Hirokazu TANAKA  Kyung Woon JANG  Shoichiro YAMASAKI  Miki HASEYAMA  

     
    PAPER-Spread Spectrum Technologies and Applications

      Vol:
    E92-A No:10
      Page(s):
    2600-2608

    In this paper, an error correction scheme suitable for MC-DS-CDMA system with bi-orthogonal modulation is proposed. The input sequence of a bi-orthogonal modulator consists of n - 1 bit code selection bit sequence and 1 bit sign bit sequence. In order to apply an efficient error correction code, the following points should be considered; (1) if the code selection bits can be protected sufficiently, the sign bit error can also be reduced sufficiently, (2) since a code selection bit sequence consists of n - 1 bits, employing a symbol error correcting code is more effective for encoding code selection bits, (3) the complexity of the error correction encoder and decoder implementations should be minimum. Based on these conditions, we propose to employ Reed-Solomon (RS) code for encoding the code selection bits and no error correction code for the sign bit. Additionally, detection algorithm at the bi-orthogonal demodulator is modified for compensating degradations of the sign bit error rate performance. The performance in an Additive White Gaussian Noise (AWGN) channel is evaluated by both theoretical analysis and computer simulations. The performance evaluations by simulations on multi-path fading channels are also shown. It is shown that the proposed scheme has remarkable improvement.

  • A Multiphase Generator Based on VCDR (Voltage-Controlled Variable Delay Ring)

    Minseok WOO  Byoungkwon MOON  Daejeong KIM  

     
    BRIEF PAPER-Integrated Electronics

      Vol:
    E92-C No:10
      Page(s):
    1315-1318

    A new delay-locked loop (DLL)-based multiphase generator is presented. To achieve an arbitrary integer multiplication factor, a voltage-controlled variable delay ring (VCDR) is adopted, and a new "generate and reset" (GNR) cell is developed. The whole circuit of the closed loop was designed and characterized in a 1.2-V 0.13-µm CMOS process. The simulated results show that the loop operates from 1.0 MHz to 1.2 GHz under the supply voltage of 1.2 V, and the GNR cell exhibits low supply sensitivity of 1300-ps/V.

  • Wide-Band Dispersion Compensation for PCF with Uniform Air Hole Structure

    Kazuhide NAKAJIMA  Takashi MATSUI  Chisato FUKAI  

     
    LETTER-Optical Fiber for Communications

      Vol:
    E92-B No:9
      Page(s):
    2951-2953

    We investigate numerically the applicability of photonic crystal fiber (PCF) with a uniform air hole structure as a wide-band transmission medium. We show that accumulated dispersion over the PCF can be reduced effectively by optimizing the index profile of dispersion compensating fiber (DCF). We also show that a bandwidth of more than 300 nm will be available for 40 Gbit/s NRZ transmission by using the PCF as a transmission medium instead of conventional 1.3 µm zero-dispersion single-mode fiber (SMF).

  • Using Large-Scale FDTD Method to Obtain Precise Numerical Estimation of Indoor Wireless Local Area Network Office Environment

    Louis-Ray HARRIS  Takashi HIKAGE  Toshio NOJIMA  

     
    PAPER-Wireless LAN System

      Vol:
    E92-A No:9
      Page(s):
    2177-2183

    The Finite-Difference Time-Domain (FDTD) technique is presented in this paper as an estimation method for radio propagation prediction in large and complex wireless local area network (WLAN) environments. Its validity is shown by comparing measurements and Ray-trace method with FDTD data. The 2 GHz (802.11b/g) and 5 GHz (802.11a) frequency bands are used in both the calculations and experiments. The electric field (E-field) strength distribution has been illustrated in the form of histograms and cumulative ratio graphs. By using the FDTD method to vary the number of human bodies in the environment, the effects on E-field distribution due to human body absorption are also observed for 5 GHz WLAN design.

  • Ranking Multiple Dialogue States by Corpus Statistics to Improve Discourse Understanding in Spoken Dialogue Systems

    Ryuichiro HIGASHINAKA  Mikio NAKANO  

     
    PAPER-Natural Language Processing

      Vol:
    E92-D No:9
      Page(s):
    1771-1782

    This paper discusses the discourse understanding process in spoken dialogue systems. This process enables a system to understand user utterances from the context of a dialogue. Ambiguity in user utterances caused by multiple speech recognition hypotheses and parsing results sometimes makes it difficult for a system to decide on a single interpretation of a user intention. As a solution, the idea of retaining possible interpretations as multiple dialogue states and resolving the ambiguity using succeeding user utterances has been proposed. Although this approach has proven to improve discourse understanding accuracy, carefully created hand-crafted rules are necessary in order to accurately rank the dialogue states. This paper proposes automatically ranking multiple dialogue states using statistical information obtained from dialogue corpora. The experimental results in the train ticket reservation and weather information service domains show that the statistical information can significantly improve the ranking accuracy of dialogue states as well as the slot accuracy and the concept error rate of the top-ranked dialogue states.

  • Two-Phase Cycle DBA (TCDBA) for Differentiated Services on EPON

    Hye Kyung LEE  Won-Jin YOON  Tae-Jin LEE  Hyunseung CHOO  Min Young CHUNG  

     
    PAPER-Fiber-Optic Transmission for Communications

      Vol:
    E92-B No:9
      Page(s):
    2823-2837

    The Ethernet passive optical network (EPON), which is one of the PON technologies for realizing FTTx (Fiber-To-The-Curb/Home/Office), is a low-cost and high-speed solution to the bottleneck problem that occurs between a backbone network and end users. The EPON is compatible with existing customer devices that are equipped with an Ethernet card. To effectively control frame transmission from optical network units (ONUs) to an optical line termination (OLT), the EPON can use a multi-point control protocol (MPCP) with control functions in addition to the media access control (MAC) protocol function. In this paper, we propose a two-phase cycle dynamic bandwidth allocation (TCDBA) algorithm to increase the channel utilization on the uplink by allowing frame transmissions during computation periods, and combine the TCDBA algorithm with the queue management schemes performed within each ONU, in order to effectively support differentiated services. Additionally, we perform simulations to validate the effectiveness of the proposed algorithm. The results show that the proposed TCDBA algorithm improves the maximum throughput, average transmission delay, and average volume of frames discarded, compared with the existing algorithms. Furthermore, the proposed TCDBA algorithm is able to support differentiated quality of services (QoS).

  • Symmetric/Asymmetrical SIRs Dual-Band BPF Design for WLAN Applications

    Min-Hua HO  Hao-Hung HO  Mingchih CHEN  

     
    PAPER

      Vol:
    E92-C No:9
      Page(s):
    1137-1143

    This paper presents the dual-band bandpass filters (BPFs) design composed of λ/2 and symmetrically/asymmetrically paired λ/4 stepped impedance resonators (SIRs) for the WLAN applications. The filters cover both the operating frequencies of 2.45 and 5.2 GHz. The dual-coupling mechanism is used in the filter design to provide alternative routes for signals of selected frequencies. A prototype filter is composed of λ/2 and symmetrical λ/4 SIRs. The enhanced wide-stopband filter is then developed from the filter with the symmetrical λ/4 SIRs replaced by the asymmetrical ones. The asymmetrical λ/4 SIRs have their higher resonances frequencies isolated from the adjacent I/O SIRs and extend the enhanced filter an upper stopband limit beyond ten time the fundamental frequency. Also, the filter might possess a cross-coupling structure which introduces transmission zeros by the passband edges to improve the signal selectivity. The tapped-line feed is adopted in this circuit to create additional attenuation poles for improving the stopband rejection levels. Experiments are conducted to verify the circuit performance.

8201-8220hit(18690hit)