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

Keyword Search Result

[Keyword] vision(776hit)

361-380hit(776hit)

  • Channel Extrapolation Techniques for E-SDM System in Time-Varying Fading Environments

    Huu Phu BUI  Yasutaka OGAWA  Takeo OHGANE  Toshihiko NISHIMURA  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E89-B No:11
      Page(s):
    3083-3092

    Multiple-input multiple-output (MIMO) systems using eigenbeam space division multiplexing (E-SDM) perform well and have increased capacities compared with those using conventional space division multiplexing (SDM). However, channel state information (CSI) is required at a transmitter, and the performance of E-SDM systems depends much on the accuracy of the CSI at a transmitter and a receiver. In time-varying fading environments, the channel change between the transmit weight determination time and the actual data transmission time causes the system performance to degrade. To compensate for the channel error, a linear extrapolation method has been proposed for a time division duplexing system. Unfortunately, the system performance still deteriorates as the maximum Doppler frequency increases. Here, two new techniques of channel extrapolation are proposed. One is second order extrapolation, and the other is exponential extrapolation. Also, we propose maximum Doppler frequency estimation methods for exponential extrapolation. Simulation results for 4tx 4rx MIMO systems showed that using the proposed techniques, E-SDM system performs better in a higher Doppler frequency region.

  • A Hardware Algorithm for Integer Division Using the SD2 Representation

    Naofumi TAKAGI  Shunsuke KADOWAKI  Kazuyoshi TAKAGI  

     
    PAPER-VLSI Design Technology and CAD

      Vol:
    E89-A No:10
      Page(s):
    2874-2881

    A hardware algorithm for integer division is proposed. It is based on the radix-2 non-restoring division algorithm. Fast computation is achieved by the use of the radix-2 signed-digit (SD2) representation. The algorithm does not require normalization of the divisor, and hence, does not require an area-consuming leading-one (or zero) detection nor shifts of variable-amount. Combinational (unfolded) implementation of the algorithm yields a regularly structured array divider, and sequential implementation yields compact dividers.

  • A New Construction of Optimal p2-Ary Low Correlation Zone Sequences Using Unified Sequences

    Ji-Woong JANG  Jong-Seon NO  Habong CHUNG  

     
    PAPER-Sequences

      Vol:
    E89-A No:10
      Page(s):
    2656-2661

    In this paper, given an integer e and n such that e|n, and a prime p, we propose a method of constructing optimal p2-ary low correlation zone (LCZ) sequence set with parameters (pn-1, pe-1, (pn -1)/(pe -1), 1) from a p-ary sequence of the same length with ideal autocorrelation. The resulting p2-ary LCZ sequence set can be viewed as the generalization of the optimal quaternary LCZ sequence set by Kim, Jang, No, and Chung in respect of the alphabet size. This generalization becomes possible due to a completely new proof comprising any prime p. Under this proof, the quaternary case can be considered as a specific example for p = 2.

  • Multiple L-Shift Complementary Sequences

    Yan XIN  Ivan J. FAIR  

     
    PAPER-Sequences

      Vol:
    E89-A No:10
      Page(s):
    2640-2648

    We introduce an extension of Golay complementary sequences in which, for each sequence, there exists another sequence such that the sum of aperiodic autocorrelation functions of these two sequences for a given multiple L-shift (L≥1) is zero except for the zero shift. We call these sequences multiple L-shift complementary sequences. It is well-known that the peak-to-average power ratio (PAPR) value of any Golay complementary sequence is less than or equal to 2. In this paper, we show that the PAPR of each multiple L-shift complementary sequence is less than or equal to 2L. We also discuss other properties of the sequences and consider their construction.

  • Proportion Regulation in Task Allocation Systems

    Tsuyoshi MIZUGUCHI  Ken SUGAWARA  

     
    PAPER-Modelling, Systems and Simulation

      Vol:
    E89-A No:10
      Page(s):
    2745-2751

    Designable task allocation systems which consist of identical agents using stochastic automata are suggested. From the viewpoint of the group response and the individual behavior, the performances of a simple model and an improved one are compared numerically. Robots experiments are performed to compare between the two models.

  • A Dynamic Index Allocation Scheme for Data Retrieval and Provision in Peer-to-Peer Networks

    Atsushi ITO  Tomoyuki OHTA  Kouichi MITSUKAWA  Yoshiaki KAKUDA  

     
    PAPER

      Vol:
    E89-B No:9
      Page(s):
    2336-2346

    File-sharing Peer-to-Peer systems are effective for autonomous data retrieval and provision over the networks. However, the early data retrieval schemes such as Gnutella and Local Indices have low performance and large overhead. In order to solve weakness of early schemes, this paper proposes a dynamic scheme for data retrieval and provision, in which indices are adaptively allocated in appropriate nodes to variation of traffic patterns caused by query messages. The simulation experimental results show that the proposed scheme has good performance with reasonable overhead even when the traffic patterns vary as time proceeds.

  • Space-Time Block Coded Joint Transmit/Receive Diversity in a Frequency-Nonselective Rayleigh Fading Channel

    Hiromichi TOMEBA  Kazuaki TAKEDA  Fumiyuki ADACHI  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E89-B No:8
      Page(s):
    2189-2195

    Antenna diversity is an effective technique for improving the transmission performance in a multi-path fading channel. Recently, transmit diversity has been attracting much attention since it can alleviate the complexity problem of the mobile terminals. Joint transmit diversity/receive diversity achieves a much improved transmission performance. In this paper, we propose a new space-time block coding algorithm for joint transmit/receive diversity, which requires the channel state information (CSI) only at the transmitter side. Unlike the conventional space-time transmit diversity (STTD), the space-time block coded joint transmit/receive diversity (STBC-JTRD) can use arbitrary number of transmit antennas, while the number of receive antennas is limited to 4. STBC-JTRD achieves a larger diversity gain than joint STTD/receive antenna diversity. The bit error rate (BER) analysis in a frequency-nonselective Rayleigh fading channel is presented. The BER performance is evaluated and is confirmed by the computer simulation.

  • Adaptive DOA Tracking Approaches for Time-Space System in CDMA Mobile Environments

    Ann-Chen CHANG  

     
    PAPER-Antennas and Propagation

      Vol:
    E89-B No:8
      Page(s):
    2208-2217

    It was previously shown that the number of array elements must exceed the number of sources for multiple target direction of arrival (DOA) tracking. This is clearly not practical for code-division multiple access (CDMA) communications since the number of mobile users is very large. To overcome the restriction, adaptive angle tracking approaches employing the code-matched filters and parallel Kalman/H∞ algorithms are presented in this paper. The proposed approaches are applied to the base station of a mobile communication system. Different from Kalman prediction algorithm which minimize the squared tracking error, the adaptive H∞ filtering algorithm is a worst case optimization. It minimizes the effect of the worst disturbances (including modeling error of direction matrix models and array structure imperfection, process noise, and measurement noise). Hence, the difficult problem of tracking the crossing mobiles can be successfully handled by using the code-matched filters. Computer simulation is provided for illustrating the effectiveness of the adaptive angle tracking approaches.

  • A Complexity-Reduced Time Alignment Control in Uplink Dynamic Parameter Controlled OF/TDMA

    Ryota KIMURA  Ryuhei FUNADA  Hiroshi HARADA  Shigeru SHIMAMOTO  

     
    PAPER-Terrestrial Radio Communications

      Vol:
    E89-B No:8
      Page(s):
    2196-2207

    We have been investigating an orthogonal frequency division multiple access (OFDMA) based cellular system that is called "dynamic parameter controlled orthogonal frequency and time division multiple access (DPC-OF/TDMA)" for the development of beyond third generation (B3G) mobile communication systems. Moreover, we have already proposed a time alignment control (TAC) to compensate propagation delays that induce a multiple-access interference (MAI) in the uplink OFDMA. However, that TAC includes a large amount of computations. This means that it is quite difficult for the OFDMA systems to implement TAC into volume-limited hardware devices such as field programmable gate array (FPGA). Thus, we propose a new complexity-reduced TAC (CRTAC) in this paper. CRTAC can be implemented into such devices easily. In this paper, we show some computer simulation results, and then evaluate the error rate performances of DPC-OF/TDMA employing CRTAC. Moreover, we also show the benefit of the reasonable level of the implementation complexity made by CRTAC.

  • Single Carrier Frequency-Domain Equalization with Transmit Diversity over Mobile Multipath Channels

    Tae-Won YUNE  Chan-Ho CHOI  Gi-Hong IM  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E89-B No:7
      Page(s):
    2050-2060

    This paper discusses a cyclic prefixed single carrier frequency-domain equalization (SC-FDE) scheme with two types of transmit diversity. Firstly, we propose a SC-FDE system with space-frequency block coding (SFBC). The transmit sequence of the proposed system is designed to have spatial and frequency diversities, which is equivalent to the SFBC. The corresponding combining receiver is derived under a minimum mean square error (MMSE) criterion. It is shown that the proposed system significantly outperforms the SC-FDE system with space-time block coding (STBC) over fast fading channels, while providing lower computational complexity than orthogonal frequency division multiplexing (OFDM) combined with SFBC. We verify the performance of two-branch transmit diversity systems including the proposed one through bit error rate (BER) analysis. Secondly, as a scheme that combines STBC and SFBC, a space-time-frequency block code (STFBC) SC-FDE system is presented. Computer simulation results show that the proposed STFBC SC-FDE system has better immunity to the distortion caused by both fast fading and severe frequency selective fading, compared to the SC-FDE system with the STBC or the SFBC scheme. Complexity analysis is also conducted to compare their computational loads of the transceiver. It is shown that the proposed STFBC SC-FDE system has lower computational complexity than the STFBC OFDM system.

  • Reconfiguration Heuristics for Logical Topologies in Wide-Area WDM Networks

    Hironao TAKAGI  Yongbing ZHANG  Hideaki TAKAGI  

     
    PAPER-Fiber-Optic Transmission for Communications

      Vol:
    E89-B No:7
      Page(s):
    1994-2001

    Wavelength division multiplexing (WDM) technology offers the capability of building wide-area networks with high speed. Reconfigurability is a key feature of a WDM network that enables the network logical topology to change dynamically in response to the changing traffic patterns. There are two important issues involved in the reconfiguration of a network logical topology. One is how to determine the new logical topology corresponding to the current topology. It needs to consider a trade-off between the performance of the new target topology and the cost of the topology transition from the current topology to the new one. The other is how to determine the transition sequence from the current topology to the new one. It needs to control the disruption to the network as less as possible during the reconfiguration process. In this paper, we focus on the latter problem and propose several heuristic algorithms that reconfigure logical topologies in wide-area wavelength-routed optical networks. Our reconfiguration algorithms attempt to control the disruption to the network as less as possible during the reconfiguration process. For this purpose, a lightpath is taken as the minimum reconfiguration unit. The proposed algorithms are evaluated by using an NFSNET-like network model with 16 nodes and 25 links. The results show that very simple algorithms provide very small computational complexity but poor performance, i.e., large network disruption, and that an efficient algorithm provides reasonable computational complexity and very good performance. More complex algorithms may improve performance somewhat further but have unrealistically large computational complexity.

  • A New Efficient Stereo Line Segment Matching Algorithm Based on More Effective Usage of the Photometric, Geometric and Structural Information

    Ghader KARIMIAN  Abolghasem A. RAIE  Karim FAEZ  

     
    PAPER-Stereo and Multiple View Analysis

      Vol:
    E89-D No:7
      Page(s):
    2012-2020

    In this paper, a new stereo line segment matching algorithm is presented. The main purpose of this algorithm is to increase efficiency, i.e. increasing the number of correctly matched lines while avoiding the increase of mismatches. In this regard, the reasons for the elimination of correct matches as well as the existence of the erroneous ones in some existing algorithms have been investigated. An attempt was also made to make efficient uses of the photometric, geometric and structural information through the introduction of new constraints, criteria, and procedures. Hence, in the candidate determination stage of the designed algorithm two new constraints, in addition to the reliable epipolar, maximum and minimum disparity and orientation similarity constraints were employed. In the process of disambiguation and final matches selection, being the main problem of the matching issue, regarding the employed constraints, criterion function and its optimization, it is a completely new development. The algorithm was applied to the images of several indoor scenes and its high efficiency illustrated by correct matching of 96% of the line segments with no mismatches.

  • Surface Reconstruction from Stereo Data Using a Three-Dimensional Markov Random Field Model

    Hotaka TAKIZAWA  Shinji YAMAMOTO  

     
    PAPER-Stereo and Multiple View Analysis

      Vol:
    E89-D No:7
      Page(s):
    2028-2035

    In the present paper, we propose a method for reconstructing the surfaces of objects from stereo data. Both the fitness of stereo data to surfaces and interrelation between the surfaces are defined in the framework of a three-dimensional (3-D) Markov Random Field (MRF) model. The surface reconstruction is accomplished by searching for the most likely state of the MRF model. Three experimental results are shown for synthetic and real stereo data.

  • Estimation of the Visibility Distance by Stereovision: A Generic Approach

    Nicolas HAUTIERE  Raphael LABAYRADE  Didier AUBERT  

     
    PAPER-Intelligent Transport Systems

      Vol:
    E89-D No:7
      Page(s):
    2084-2091

    An atmospheric visibility measurement system capable of quantifying the most common operating range of onboard exteroceptive sensors is a key parameter in the creation of driving assistance systems. This information is then utilized to adapt sensor operations and processing or to alert the driver that the onboard assistance system is momentarily inoperative. Moreover, a system capable of either detecting the presence of fog or estimating visibility distances constitutes in itself a driving aid. In this paper, we first present a review of different optical sensors likely to measure the visibility distance. We then present our stereovision based technique to estimate what we call the "mobilized visibility distance". This is the distance to the most distant object on the road surface having a contrast above 5%. In fact, this definition is very close to the definition of the meteorological visibility distance proposed by the International Commission on Illumination (CIE). The method combines the computation of both a depth map of the vehicle environment using the "v-disparity" approach and of local contrasts above 5%. Both methods are described separately. Then, their combination is detailed. A qualitative evaluation is done using different video sequences. Finally, a static quantitative evaluation is also performed thanks to reference targets installed on a dedicated test site.

  • Performance of a Base Station Feedback-Type Adaptive Array Antenna with Limited Number of Feedback Bits

    Jeongkeun CHOI  Yoshihiko AKAIWA  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E89-B No:6
      Page(s):
    1793-1798

    Feedback-type Adaptive Array Antenna has been proposed for frequency division duplexed (FDD) system, where the mobile station (MS) measures channel characteristics and sends those back to the base station (BS). Using a higher number of feed-back bits provides better performance. However it wastes channel capacity of the up-link. On the other hand, error in feedback signals transmission causes significant performance degradation. To solve these problems, this paper proposes a method that the MS sends back the difference between the optimum weights calculated at the MS and weights which are currently used at the BS. Bit error rate performance of the system is shown under a realistic propagation condition.

  • Error Analysis for Ultra-Wideband DS- and Hybrid DS/TH-CDMA with Arbitrary Chip-Duty

    Mohammad Azizur RAHMAN  Shigenobu SASAKI  Hisakazu KIKUCHI  

     
    PAPER

      Vol:
    E89-A No:6
      Page(s):
    1668-1679

    In this paper, ultra-wideband (UWB) multiple access systems are introduced by using direct-sequence (DS) and hybrid direct-sequence time-hopping (DS/TH) code division multiple access (CDMA) that use arbitrary chip-duty of the spreading sequences. The bit error probabilities are presented. First of all, the variances of the multiple access interference are developed by investigating the collision properties of the signals. Afterward, various approximations are applied. The standard Gaussian approximation (SGA) for the DS system is shown to become extremely optimistic as the chip-duty becomes low. Though the hybrid system performs better, the SGA still remains optimistic. To obtain accurate results, Holtzman's simplified improved Gaussian approximation (SIGA) and Morrow and Lehnert's improved Gaussian approximation (IGA) are used. A shortcoming of the SIGA is rediscovered that renders it unusable for low-duty DS systems, especially, at high signal-to-noise ratio. However, for the hybrid system, the SIGA works as an excellent tool. The IGA is used to get accurate results for the low-duty DS systems. It is shown that lowering of chip-duty by keeping chip rate and chip length unchanged improves performance for asynchronous DS and both asynchronous and synchronous hybrid systems. However, under the same processing gain, a high-duty system performs better than a low-duty system. Performance of synchronous DS system remains independent of chip-duty.

  • Texture and Objects: Interruption of Same-Object Effect in Human Vision

    Taichi HIGASHI  Shinichi KITA  Isao WATANABE  

     
    PAPER-Vision and Image

      Vol:
    E89-D No:6
      Page(s):
    1806-1812

    The present research examines the relationship between texture processing and object processing in human vision. Recent computational studies have suggested a difference between the stages of processing. Texture processing can be performed by using statistical parameterization of the response of primary spatial filters. Object processing requires more complex and elaborate computation at a higher stage than texture processing. Our psychophysical experiments are conducted to clarify the relationship of the stages of texture processing and object processing, by focusing on same-object effect which facilitates and speeds attention shifts within the same object and also costs and delays attention shifts if the attention focus moves from one object to another. Texture is composed of lines parallel to, perpendicular to or inside of elongated rectangles used as objects. The same-object effect is measured with reaction time in a cued detection task. Vertical rectangles are used in xperiment 1 and horizontal ones are used in Experiment 2. Experiment 1 shows that the texture lines interrupt the same-object effect and that the interruption is nearly equal if texture lines are added both to the background and the inside of the objects. Experiment 2 yields the result same as Experiment 1. The interruption of the same-object effect by adding texture lines suggests that texture processing affects object processing.

  • Performance Analysis of Dynamic Channel Allocation Based on Reuse Partitioning in Multi-Cell OFDMA Uplink Systems

    Eunsung OH  Myeon-gyun CHO  Seungyoup HAN  Choongchae WOO  Daesik HONG  

     
    PAPER

      Vol:
    E89-A No:6
      Page(s):
    1566-1570

    Our investigation is presented into analysis of the co-channel interference (CCI) statistic in orthogonal frequency-division multiple access (OFDMA) uplink systems. The derived statistic is then used to analyze the performance of reuse partitioning (RP)-based dynamic channel allocation (DCA). Analysis and simulation results show that the performance of DCA in multi-cell environments is noticeably dependent on the CCI. Finally, the results of the analysis yield the optimum RP area for achieving the maximum spectral efficiency.

  • A Hybrid Decimal Division Algorithm Reducing Computational Iterations

    Yong-Dae KIM  Soon-Youl KWON  Seon-Kyoung HAN  Kyoung-Rok CHO  Younggap YOU  

     
    PAPER-Numerical Analysis and Optimization

      Vol:
    E89-A No:6
      Page(s):
    1807-1812

    This paper presents a hybrid decimal division algorithm to improve division speed. The proposed hybrid algorithm employs either non-restoring or restoring algorithm on each digit to reduce iterative computations. The selection of the algorithm is based on the relative remainder values with respect to the half of its divisor. The proposed algorithm requires maximum 7n+4 add/subtract operations for an n-digit quotient, whereas other restoring or non-restoring schemes comprise more than 10n+1 operations.

  • 3D Inspection on Wafer Solder Bumps Using Binary Grating Projection in Integrated Circuit Manufacturing

    Shu YUAN  Dongping TIAN  Yanxing ZENG  

     
    PAPER-Si Devices and Processes

      Vol:
    E89-C No:5
      Page(s):
    602-607

    For the measurement of the 3D surface of micro-solderballs in IC (Integrated Circuit) manufacturing inspection, a binary grating project lenses of high MTF (Modulation Transfer Function) with tilted project plane is designed in this paper. Using a combination of lenses and a tilted optical layout both on object and image plane, the wave-front aberrations are reduced and the nonlinear image distortion is corrected with nonlinearity compensation, This optical lens allows us to project the structured light pattern to the inspected objects efficiently for clear deformed coded imaging, it could be used to online measure 3D shape of micro-solderballs with high precision and accuracy.

361-380hit(776hit)