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

Keyword Search Result

[Keyword] TE(21534hit)

18561-18580hit(21534hit)

  • A Note on Bicomplex Representation for Electromagnetic Fields in Scattering and Diffraction Problems and Its High-Frequency and Low-Frequency Approximations

    Masahiro HASHIMOTO  

     
    PAPER

      Vol:
    E80-C No:11
      Page(s):
    1448-1456

    A bicomplex representation for time-harmonic electromagnetic fields appearing in scattering and diffraction problems is given using two imaginary units i and j. Fieldsolution integral-expressions obtained in the high-frequency and low-frequency limits are shown to provide the new relation between high-frequency diffraction and low-frequency scattering. Simple examples for direct scattering problems are illustrated. It may also be possible to characterize electric or magnetic currents induced on the obstacle in terms of geometrical optics far-fields. This paper outlines some algebraic rules of bicomplex mathematics for diffraction or scattering fields and describes mathematical evidence of the solutions. Major discussions on the relationship between high-frequency and low-frequency fields are relegated to the companion paper which will be published in another journal.

  • Linear Equivalent Circuit of a Digital Gate for Characterization of Malfunction Mechanism

    Naoki KAGAWA  Osami WADA  Ryuji KOGA  

     
    LETTER

      Vol:
    E80-B No:11
      Page(s):
    1652-1653

    Time-related jitters caused by small noise voltage due to electromagnetic noise induce malfunction of digital equipment. The jitters increase with not only magnitude of the noise but also resonance of digital circuits in the equipment. In this report, we proposes a linear equivalent circuit model of a digital CMOS gate for analyzing circuit resonance and verifies the validity of the model.

  • Performance Analysis of Mobile Radio Network with Fixed Power Assignment, Rayleigh Fading, and Near-Far Effects over AWGN Channel

    Jyh-Horng WEN  Wen-Yung YANG  

     
    PAPER-Mobile Communication

      Vol:
    E80-B No:11
      Page(s):
    1713-1721

    The capture effect caused by some of power assignment, Rayleigh fading, and near-far effect, can improve the performance of random-access techniques in mobile radio environment. Moreover, if we consider the overall effect of them, the system performance can be noticeably improved. In this paper, the combined effect of fixed power assignment scheme, Rayleigh fading, and near-far effect on the performance of slotted ALOHA are studied. Plus, the performance degradation caused by AWGN is also investigated. The type of signal capture to be considered is the one that a signal involved in a collision survives if its power level exceeds the sum of the other signals participating in the same collision. Numerical calculations are used to demonstrate the degree of improvement and degradation.

  • Use of Multi-Polarimetric Enhanced Images in SIR-C/X-SAR Land-Cover Classification

    Takeshi NAGAI  Yoshio YAMAGUCHI  Hiroyoshi YAMADA  

     
    PAPER-Measurement and Metrology

      Vol:
    E80-B No:11
      Page(s):
    1696-1702

    This paper presents a method for land cover classification using the SIR-C/X-SAR imagery based on the maximum likelihood method and the polarimetric filtering. The main feature is to use polarimetric enhanced image information in the pre-processing stage for the classification of SAR imagery. First, polarimetric filtered images are created where a specific target is enhanced versus another, then the image data are incorporated into the feature vector which is essential for the maximum likelihood classification. Specific target classes within the SAR image are categorized according to the maximum likelihood method using the wavelet transform. Addition of polarimetric enhanced image in the preprocessing stage contributes to the increase of classification accuracy. It is shown that the use of polarimetric enhanced images serves efficient classifications of land cover.

  • Time Domain Coupling between Non-parallel Transmission Lines

    Weikun LIU  Yoshio KAMI  

     
    PAPER

      Vol:
    E80-B No:11
      Page(s):
    1639-1644

    Coupling in time domain between two non-parallel transmission lines of finite length is analyzed by using a circuit concept. Coupling equations based on the Maxwell's equations for lossless transmission lines in a homogeneous medium are written by a set of non-homogeneous differential equations including distributed source terms produced by external electromagnetic fields. The forcing terms are expressed by vector potentials generated by currents in the line section and at the transitions. A set of solutions in frequency domain is obtained by a four-port network expression with regard to the terminal voltages and currents, and can be applied to estimation of the frequency-domain crosstalk. Utilizing the inverse fast Fourier transform (FFT), the crosstalk responses between the lines is studied in time domain. Comparison of theoretical and experimental results shows the validity of the method.

  • 3-D Object Recognition Using a Genetic Algorithm-Based Search Scheme

    Tsuyoshi KAWAGUCHI  Takeharu BABA  Ryo-ichi NAGATA  

     
    PAPER-Image Processing,Computer Graphics and Pattern Recognition

      Vol:
    E80-D No:11
      Page(s):
    1064-1073

    The main defficulty in recognizing 3-D objects from 2-D images is matching 2-D information to the 3-D object representation. The multiple-view approach makes this problem easy to solve by reducing the problem to 2-D to 2-D matching problem. This approach models each 3-D object by a collection of 2-D views from various viewing angles and recognizes an object in the image by finding a 2-D view that has the best match to the image. However, if the size of the model database becomes large, the approach requires long time for the recognition of objects. In this paper we present a 3-D object recognition algorithm based on multiple-view approach. To reduce the recognition time, the proposed algorithm uses the coarse-to-fine process previously proposed by the authors and a genetic algorithm-based search scheme for the selection of a best matched model in the database. And, we could verify from the results of the experiments that the algorithm proposed in this paper is useful to speed up the recognition process in multiple-view based object recognition systems.

  • Image Synthesis of Flickering Scenes Including Simulated Flames

    Jun-ya TAKAHASHI  Hiromichi TAKAHASHI  Norishige CHIBA  

     
    PAPER-Image Processing,Computer Graphics and Pattern Recognition

      Vol:
    E80-D No:11
      Page(s):
    1102-1108

    Producing realistic images and animations of flames is one of the most interesting subjects in the field of computer graphics. In a recent paper, we described a two-dimensional particle-based visual method of simulating flames. In the present paper, we first extend the simulation method, without losing any of its desirable features, in such a way that it functions in three-dimensional space. We then present an efficient method of producing an image of the scene, including flames acting as volume light sources, which normally requires a large amount of computing time in the usual simulation approaches. Finally, we demonstrate the capabilities of our visual simulation method by showing sample images generated by it, which are excerpted from an animation.

  • Design of Printed Circuit Boards as a Part of an EMC-Adequate System Development

    Werner JOHN  

     
    INVITED PAPER

      Vol:
    E80-B No:11
      Page(s):
    1604-1613

    The EMC-adequate design of microelectronic systems includes all actions intended to eliminate electromagnetic interference in electronic systems. Challenges faced in the microelectronic area include a growing system complexity, high integration levels and higher operating speeds at all levels of integration (chip, MCM, printed circuit board and system). The growing complexity, denser design and higher speed all lead to a substantial increase in EMC problems and accordingly the design time. EMC is not commonly accepted as a vital topic in microelectronic design. Microelectronic designers often are of the opinion that EMC is limited to electrical and electronic systems and the mandatory product regulations instead of setting requirements also for the integrated circuit they are designing. In this contribution a concept for an EMC-adequate design of electronic systems will be introduced. This concept is based on a generalized development process to integrate EMC-constraints into the system design. A prototype of an environment to analyse signal integrity effects on PCB based on a workflow oriented integration approach will be presented. Based on this approach the generation of user specific design and analysis environments including various set of EMC-tools is possible.

  • Self-Orthogonal Codes and Their Coordinate Ordering

    Sylvia ENCHEVA  Gerard COHEN  

     
    LETTER-Coding Theory/Communication

      Vol:
    E80-A No:11
      Page(s):
    2256-2259

    In this paper we consider all self-orthogonal [n, 1/2(n-1)] codes for n odd and 3 n 19, all self-dual [n, 1/2n] codes for n even and 2 n 24 and some other codes over GF(2) and answer to a question which of them have efficient coordinate ordering. As a result the exact values of their state complexities are determined. Sufficient conditions for codes to have an efficient coordinate ordering are derived also.

  • Texture Segmentation Using a Kernel Modifying Neural Network

    Keisuke KAMEYAMA  Kenzo MORI  Yukio KOSUGI  

     
    PAPER-Image Processing,Computer Graphics and Pattern Recognition

      Vol:
    E80-D No:11
      Page(s):
    1092-1101

    A novel neural network architecture for image texture classification is introduced. The proposed model (Kernel Modifying Neural Network: KM Net) which incorporates the convolution filter kernel and the classifier in one, enables an automated texture feature extraction in multichannel texture classification through the modification of the kernel and the connection weights by the backpropagation-based training rule. The first layer units working as the convolution kernels are constrained to be an array of Gabor filters, which achieves a most efficient texture feature localization. The following layers work as a classifier of the extracted texture feature vectors. The capability of the KM Net and its training rule is verified using a basic problem on a synthetic texture image. In addition, the possibilities of applying the KM Net to natural texture classification and biological tissue classification using an ultrasonic echo image have been tried.

  • A Simple Relation between Loss Performance and Buffer Contents in a Statistical Multiplexer with Periodic Vacations

    Koohong KANG  Bart STEYAERT  Cheeha KIM  

     
    LETTER-Communication Networks and Services

      Vol:
    E80-B No:11
      Page(s):
    1749-1752

    In this Letter, we investigate the loss performance of a discrete-time single-server queueing system with periodic vacations, with which we are often confronted in traffic control, such as cell scheduling or priority control schemes, at ATM nodes. Explicit expressions are derived for the cell loss ratio in terms of the distribution of the buffer contents in an infinite capacity queue.

  • Non-deterministic Constraint Generation for Analog and Mixed-Signal Layout

    Edoardo CHARBON  Enrico MALAVASI  Paolo MILIOZZI  Alberto SANGIOVANNI-VINCENTELLI  

     
    PAPER-Physical Design

      Vol:
    E80-D No:10
      Page(s):
    1032-1043

    In this paper we propose a comprehensive approach to physical design based on the constraint paradigm. Bounds on the most critical circuit parasitics are automatically generated to help designers and/or physical design tools meet a set of high-level specifications. The constraint generation engine is based on constrained optimization, where various parasitic effects on interconnect and devices are accounted for and dealt with in different manners according to their statistical behavior and their effect on performance.

  • Path Mapping: Delay Estimation for Technology Independent Synthesis

    Yutaka TAMIYA  

     
    PAPER

      Vol:
    E80-A No:10
      Page(s):
    1782-1788

    This paper proposes "path mapping," a method of delay estimation for technology independent combinational circuits. Path mapping provides fast and accurate delay estimation using common ideas with the tree covering based technology mapping. First, path mapping does technology mapping for all paths in the circuit with minimum mapped delay. Then, it finds the largest mapped delay among all the paths in the circuit, and answers it as an estimated circuit delay. Experimental results show path mapping estimates more accurate circuit delay than unit delay, and runs much faster than the technology mapping.

  • Parameter-Free Restoration Algorithms for Two Classes of Binary MRF Images Degraded by Flip-Flap Noises

    Bing ZHANG  Mehdi N. SHIRAZI  Hideki NODA  

     
    PAPER-Image Theory

      Vol:
    E80-A No:10
      Page(s):
    2022-2031

    The problem of restoring binary (black and white) images degraded by color-dependent flip-flap noises is considered. The real image is modeled by a Markov Random Field (MRF). The Iterated Conditional Modes (ICM) algorithm is adopted. It is shown that under certain conditions the ICM algorithm is insensitive to the MRF image model and noise parameters. Using this property, we propose a parameter-free restoration algorithm which does not require the estimations of the image model and noise parameters and thus can be implemented fully in parallel. The effectiveness of the proposed algorithm is shown through applying the algorithm to degraded hand-drawn and synthetic images.

  • New Write/Erase Operation Technology for Flash EEPROM Cells to lmprove the Read Disturb Characteristics

    Tetsuo ENDOH  Hirohisa IIZUKA  Riichirou SHIROTA  Fujio MASUOKA  

     
    PAPER-Integrated Electronics

      Vol:
    E80-C No:10
      Page(s):
    1317-1323

    This paper describes the new write/erase operation methods in order to improve the read disturb characteristics for Flash EEPROM cells which are written by channel hot electron injection and erased by F-N tunneling emission from the floating gate to the substrate. The new operation methods is either applying a reverse polarity pulse after each erase pulse or applying a series of shorter erase pulses instead of a long single erase pulse. It is confirmed that by using the above operation methods, the leakage current can be suppressed, and then the read disturb life time after 105 cycles write/erase operation is more than 10 times longer in comparison with the conventional method. This memory cell by using the proposed write/erase operation method has superior potential for application to 256 Mbit Flash memories as beyond.

  • Obtaining Unique Input/Output Sequences of Communication Protocols

    Wen-Huei CHEN  

     
    PAPER-Communication protocol

      Vol:
    E80-B No:10
      Page(s):
    1509-1513

    A Unique Input/Output (UIO) sequence for the state J of a protocol is a sequence of input/output pairs that is unique to state J. Obtaining UIO sequences from the protocol specification is a very important problem in protocol conformance testing. Let n and m be the total number of states and transitions of the protocol, respectively, and dmax be the largest outdegree of any state, W. Chun and P. D. Amer proposed an O(n2(dmax)2n-1) algorithm to obtain the minimum-length UIO sequences (where the length refers to the number of input/output pairs). However, n and m are normally very large for real protocols. In this paper, we propose an O(n*m) algorithm for obtaining UIO sequences. In theory, our algorithm yields a UIO sequence which contains at most n1 input/output pairs. In experimentation, ten protocol examples collected from recent papers, the ISO TP0 protocol, the ISDN Q. 931 network-side protocol, and the CCITT X. 25 protocol show that in average the obtained UIO sequences are only 11.8% longer than the minimum-length ones, and 97.4% of the existent UIO sequences can be found. And our algorithm is extended for minimizing the cost of UIO sequences and for obtaining synchronizable UIO sequences, which have not been achieved by any algorithm proposed earlier.

  • On Regular Segmented 2-D FPGA Routing

    Yu-Liang WU  Malgorzata MAREK-SADOWSKA  

     
    PAPER

      Vol:
    E80-A No:10
      Page(s):
    1871-1877

    In this paper we analyze the properties of regular segmentation schemes for 2-D Field Programmable Gate Arrays (FPGAs). Such schemes can be viewed as generalization of the Xilinx-like wire segmentations. We discuss their routing properties and propose a new FPGA design concept of applying architectural coupling to improve chip routability. We give the experimental routing results of such architectures for justification.

  • Performance Improvement of TCP over EFCI-Based ABR Service Class by Tuning of Congestion Control Parameters

    Go HASEGAWA  Hiroyuki OHSAKI  Masayuki MURATA  Hideo MIYAHARA  

     
    PAPER-Communication protocol

      Vol:
    E80-B No:10
      Page(s):
    1444-1453

    We investigate performance of TCP protocol over ATM networks by using a simulation technique. As the ATM layer, we consider (1) rate-based control of the ABR service class and (2) an EPD (Early Packet Discard) technique applied to the UBR service class and (3) and EPD with per-VC accounting for fairness enhancement applied to the UBR service class. In comparison, we adopt a multi-hop network model where the multiple ATM switches are interconnected. In such a network, unfairness among connections is a possible cause of the problem due to differences of the number of hops and/or the round trip times among connections. Simulation results show that the rate-based control method of ABR achieves highest throughput and best fairness in most circumstances. However, the performance of TCP over ABR is degraded once the cell loss takes place due to the inappropriate control parameter setting. To avoid this performance degradation, we investigate the appropriate parameter set suitable to TCP on ABR service. As a result, parameter tuning can improve the performance of TCP over ABR, but limited. We therefore consider TCP over ABR with EPD enhancement where the EPD technique is incorporated into ABR. We last consider the multimedia network environment, where the VBR traffic exists in the network in addition to the ABR/UBR traffic. By this, we investigate an applicability of the above observations to a more generic model. Through simulation experiments, we find that the similar results can be obtained, but it is also shown that parameters of the rate-based congestion control must be chosen carefully by taking into account the existence of VBR traffic. For this, we discuss the method to determine the appropriate control parameters.

  • Generalized Satellite Beam-Switching Modes

    Yiu Kwok THAM  

     
    PAPER-Switching and Communication Processing

      Vol:
    E80-B No:10
      Page(s):
    1523-1528

    Satellite beam-switching problems are studied where there are m up-link beams, n down-link beams and multiple carriers per beam. By augmenting a traffic matrix with an extra row and column, it is possible to find a sequence of switching modes ((0,1)-matrices with genrally multiple unit entries in each row and column) that realize optimal transmission time. Switching modes generated are shown to be linearly independent. The number of switching modes required for an mn matrix is bounded by (m1)(n1)1. For an augmented (m1)(n1) matrix, the bound is then mn1. The bounds on the number of switching modes and the computational complexity for a number of related satellite transmission scheduling problems are lowered. In simplified form, the results (particularly the linear independence of permutation matrices generated) apply to algorithmic decomposition of doubly stochastic matrices into convex combinations of permutation matrices.

  • Art Gallery Information Service System on IP Over ATM Network

    Miwako DOI  Kenichi MORI  Yasuro SHOBATAKE  Tadahiro OKU  Katsuyuki MURATA  Takeshi SAITO  Yoshiaki TAKABATAKE  

     
    PAPER-System architecture

      Vol:
    E80-B No:10
      Page(s):
    1415-1420

    This paper describes technological and operational issues of an image-art-on-demand system, which provides visitors with high-definition images of fine art in a virtual gallery. The system is presented as a typical example of multimedia information service systems on IP over ATM network. The high-definition images of fine arts from a database are interactively selected in a virtual gallery which is generated by an advanced computer graphics (CG) workstation. The generated images of the virtual gallery are transmitted by MPEG-2 over TCP/IP on ATM at 30 frames per second. This system was opened from January 1996 to March 1997 as one project of NTT's joint utilization tests of multimedia communications. As far as we know, this system is the first real-time image-art-on-demand system using MPEG-2 on IP over ATM-WAN to be exhibited to the general public.

18561-18580hit(21534hit)