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

Keyword Search Result

[Keyword] TE(21534hit)

9701-9720hit(21534hit)

  • A Study on Possibility of Detecting IEEE802.15.4a Signals for Spectrum Sharing

    Makoto HASEGAWA  Tetsushi IKEGAMI  Kenichi TAKIZAWA  

     
    LETTER

      Vol:
    E91-A No:11
      Page(s):
    3201-3205

    In March, 2007, IEEE802.15.4a was standardized as a low-rate and low-power UWB system for sensor networks. In general, detection of the IEEE802.15.4a signal is considered to be difficult because of its low transmitting power density and low duty cycle. However, if detecting of the IEEE802.15.4a signal is available, it is possible to avoid interference issues both among the IEEE802.15.4a systems and between the 15.4a and other UWB systems. This letter proposes a simple detection method using non-coherent detectors. The possibility of detecting of the IEEE802.15.4a signal by proposal detection method was examined. By conducting experiments with an emulated 15.4a RF signal, the signal detection probability was examined, and 15.4a signal from the range of about 11 meters in the radius could be detected. From this observation, the CSMA/CA method with detecting the signal in 15.4a system may be applied for alternative access method for 15.4a systems.

  • A Formal Approach for Milk-Run Transport Logistics

    Ichiro SATOH  

     
    PAPER

      Vol:
    E91-A No:11
      Page(s):
    3261-3268

    A formal approach for specifying and reasoning about earth-friendly logistics management systems is presented. To reduce fossil fuel consumption and carbon dioxide emissions resulting from transport, we must enhance the transport efficiency of trucks, which play an essential role as carriers in modern logistics services. This paper addresses the milk-run approach. It is one of the most effective and popular solutions to this problem, but it makes it be complicated to implement in a logistics management system. We propose a language for specifying the routes of trucks and an order relation between the requirements of routes and the possible routes of trucks. The former is formulated as process calculus and the latter selects suitable trucks according to their routes.

  • An Elliptic-Function Bandpass Filter Utilizing Left-Handed Operations of an Inter-Digital Coupled Line

    Hiromitsu UCHIDA  Naofumi YONEDA  Yoshihiko KONISHI  

     
    PAPER

      Vol:
    E91-C No:11
      Page(s):
    1772-1777

    A new elliptic-function bandpass filter (BPF) is proposed, which utilizes an inter-digital coupled line (IDCPL) as a left-handed transmission line. The IDCPL is employed in order to realize a negative coupling between non-adjacent resonators in a wideband BPF. As the authors' knowledge, the left-handed operations of the IDCPL has rarely utilized before, although the IDCPL itself has been widely used in many microwave circuits without being paid attention to the left-handed operations. Measured characteristics of two BPFs are presented in this paper, one is targeted for 3-4 GHz WiMAX systems, and the other is for 3-5 GHz ultra wideband communication systems (UWB).

  • Routing Autonomous Vehicles in the Improving Initial Task Assignment and Avoiding Deadlock Method

    Yusuke MORIHIRO  Toshiyuki MIYAMOTO  Sadatoshi KUMAGAI  

     
    PAPER

      Vol:
    E91-A No:11
      Page(s):
    3229-3236

    This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for Autonomous Transportation Systems (ATSs) in manufacturing systems. The TARP is a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW). In our former study, a cooperative algorithm, called the triple loop method, with autonomous distributed agents has been proposed. The Improving initial Task Assignment and Avoiding Deadlock method (ITAAD) is a faster algorithm than the triple loop method. In this paper, we propose a new vehicle routing method for the ITAAD. Results of computational experiments show effectiveness of the proposed routing method.

  • Configuration Sharing to Reduce Reconfiguration Overhead Using Static Partial Reconfiguration

    Sungjoon JUNG  Tag Gon KIM  

     
    PAPER-Computer Systems

      Vol:
    E91-D No:11
      Page(s):
    2675-2684

    Reconfigurable architectures are one of the most promising solutions satisfying both performance and flexibility. However, reconfiguration overhead in those architectures makes them inappropriate for repetitive reconfigurations. In this paper, we introduce a configuration sharing technique to reduce reconfiguration overhead between similar applications using static partial reconfiguration. Compared to the traditional resource sharing that configures multiple temporal partitions simultaneously and employs a time-multiplexing technique, the proposed configuration sharing reconfigures a device incrementally as an application changes and requires a backend adaptation to reuse configurations between applications. Adopting a data-flow intermediate representation, our compiler framework extends a min-cut placer and a negotiation-based router to deal with the configuration sharing. The results report that the framework could reduce 20% of configuration time at the expense of 1.9% of computation time on average.

  • K-Band Second Harmonic Oscillator Using Mutually Synchronized Gunn Diodes Embedded on Slot Line Resonators

    Kengo KAWASAKI  Takayuki TANAKA  Masayoshi AIKAWA  

     
    PAPER

      Vol:
    E91-C No:11
      Page(s):
    1751-1756

    This paper represents a novel second harmonic power combining oscillator using mutually synchronized Gunn diodes embedded on slot line resonators. A both-sided MIC technology is adopted in the oscillator. The oscillator consists of Gunn diodes, slot line resonators and microstrip lines. By embedding Gunn diodes on the slot line resonators, the harmonic RF signal can be generated very easily. The microstrip lines are used for the power combining output circuit. This oscillator has advantages such as easy circuit design, simple circuit configuration and miniaturization of the circuit size. The second harmonic oscillator is designed and fabricated in K-Band. The output power is +5.75 dBm at the design frequency of 19.0 GHz (2f0) with the phase noise of -111.7 dBc/Hz at the offset frequency of 1 MHz. Excellent suppression of the undesired fundamental frequency signal (f0) of -39 dBc is achieved.

  • A Left-Handed Transmission Line Composed of Two Waveguides with Stubs

    Hiroshi KUBO  Hidetaka KUWAHARA  Atsushi SANADA  

     
    PAPER

      Vol:
    E91-C No:11
      Page(s):
    1765-1771

    A new structure of a waveguide-type left-handed transmission line is proposed. It is composed of two rectangular waveguides with many stubs. One waveguide is put on another waveguide symmetrically. When one mode with odd electric field distribution is excited, the stubs work as open stubs and the mode propagates with very small loss. Guided regions of the left-handed mode and a right-handed mode are discussed using an approximate equivalent circuit. Tuning the structure parameters, the band gap between the two regions can be removed, and the wave propagates continuously from the left-handed frequency regions to the right-handed frequency region. The transmission line is applied to a leaky waveguide. It is confirmed experimentally that the beam angle of the radiation wave changes from the backward to the forward directions.

  • Improvement of Vehicle Positioning Using Car-to-Car Communications in Consideration of Communication Delay

    Hidekata HONTANI  Yuya HIGUCHI  

     
    PAPER

      Vol:
    E91-B No:11
      Page(s):
    3461-3468

    In this article, we propose a vehicle positioning method that can estimate positions of cars even in areas where the GPS is not available. For the estimation, each car measures the relative distance to a car running in front, communicates the measurements with other cars, and uses the received measurements for estimating its position. In order to estimate the position even if the measurements are received with time-delay, we employed the time-delay tolerant Kalman filtering. For sharing the measurements, it is assumed that a car-to-car communication system is used. Then, the measurements sent from farther cars are received with larger time-delay. It follows that the accuracy of the estimates of farther cars become worse. Hence, the proposed method manages only the states of nearby cars to reduce computing effort. The authors simulated the proposed filtering method and found that the proposed method estimates the positions of nearby cars as accurate as the distributed Kalman filtering.

  • High-Rate Space-Time Block Coding Schemes

    Duy H. N. NGUYEN  Ha H. NGUYEN  Tuan D. HOANG  

     
    LETTER-Coding Theory

      Vol:
    E91-A No:11
      Page(s):
    3393-3397

    A rate-6/4 full-diversity orthogonal space-time block code (STBC) is constructed for QPSK and 2 transmit antennas by applying constellation scaling and rotation to the set of quaternions used in Alamouti code. Also given is a rate-9/8 full-diversity quasi-orthogonal space-time block code (QOSTBC) for 4 transmit antennas. Lastly, a rate-10/8 code is presented for 4 transmit antennas. Simulation results indicate that these high-rate codes achieve better throughputs in the high signal-to-noise ratio region.

  • A Novel Channel Estimation Method Using Virtual Pilots in MIMO OFDM Systems

    Chengyu LIN  Wenjun ZHANG  Feng YANG  Youyun XU  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E91-B No:11
      Page(s):
    3764-3767

    To improve the performance of the optimal pilot sequences over multiple OFDM symbols in fast time-varying channels, this letter proposes a novel channel estimation method using virtual pilot tones in multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. Assuming that the superimposed virtual pilot tones at the data locations over the specific sub-carriers are transmitted from all transmit antennas, the corresponding virtual received pilot signals at the same locations are obtained from the neighboring real received pilot signals over the same sub-carriers by Wiener filter. Based on the least squares (LS) channel estimation, the channel parameters can be obtained from the combination of the virtual and real received pilot signals over one OFDM symbol. Simulation results show that the proposed channel estimation method greatly outperforms the previous method for the optimal pilot sequences over multiple OFDM symbols in fast time-varying channels, as well as approaches the method for the comb-type optimal pilot sequences in performance.

  • Quality Adaptive Video Streaming Mechanism Using the Temporal Scalability

    Sunhun LEE  Kwangsue CHUNG  

     
    PAPER-Network

      Vol:
    E91-B No:11
      Page(s):
    3584-3594

    In video streaming applications over the Internet, TCP-friendly rate control schemes are useful for improving network stability and inter-protocol fairness. However, they do not always guarantee a smooth video streaming. To simultaneously satisfy both the network and user requirements, video streaming applications should be quality-adaptive. In this paper, we propose a new quality adaptation mechanism to adjust the quality of congestion-controlled video stream by controlling the frame rate. Based on the current network condition, it controls the frame rate of video stream and the sending rate in a TCP-friendly manner. Through a simulation, we prove that our adaptation mechanism appropriately adjusts the quality of video stream while improving network stability.

  • Effective Selective Detection Scheme Based on Pulse Repetition for Coherent UWB Systems

    Jaewoon KIM  Sekwon KIM  Wonjin SUNG  Yoan SHIN  

     
    LETTER

      Vol:
    E91-B No:11
      Page(s):
    3569-3573

    We propose a selective detection scheme based on pulse repetition considering both BER (Bit Error Rate) performance and complexity in coherent UWB (Ultra Wide Band) systems. To take system complexity into account, the proposed scheme transmits the UWB signals by pulse repetition at the transmitter, like conventional PRC (Pulse Repetition Coding). However, to effectively improve BER performance of the system, the proposed scheme performs selective detection by estimating the SNR (Signal-to-Noise Ratio) of the received pulse-repeated signal at the UWB receiver.

  • Efficient RFID Search Protocols Using Counters

    Sangjin KIM  Jihwan LIM  Jaehong HAN  Heekuck OH  

     
    PAPER

      Vol:
    E91-B No:11
      Page(s):
    3552-3559

    In an RFID search protocol, a reader uses a designated query instead of an unspecified query commonly used in RFID authentication protocols. Due to this fundamental difference, techniques used in RFID authentication protocols may not be suitable for RFID search protocols. Tan et al.'s protocol, however, is based on techniques used in previous works such as using random values. In this paper, we propose two RFID search protocols, one based on static ID and the other based on dynamic ID, both which does not require additional measures to satisfy security requirements of RFID protocols. We achieve this by using counters.

  • Optimal Sensor Deployment for Wireless Surveillance Sensor Networks by a Hybrid Steady-State Genetic Algorithm

    Jae-Hyun SEO  Yong-Hyuk KIM  Hwang-Bin RYOU  Si-Ho CHA  Minho JO  

     
    PAPER

      Vol:
    E91-B No:11
      Page(s):
    3534-3543

    An important objective of surveillance sensor networks is to effectively monitor the environment, and detect, localize, and classify targets of interest. The optimal sensor placement enables us to minimize manpower and time, to acquire accurate information on target situation and movement, and to rapidly change tactics in the dynamic field. Most of previous researches regarding the sensor deployment have been conducted without considering practical input factors. Thus in this paper, we apply more real-world input factors such as sensor capabilities, terrain features, target identification, and direction of target movements to the sensor placement problem. We propose a novel and efficient hybrid steady-state genetic algorithm giving low computational overhead as well as optimal sensor placement for enhancing surveillance capability to monitor and locate target vehicles. The proposed algorithm introduces new two-dimensional geographic crossover and mutation. By using a new simulator adopting the proposed genetic algorithm developed in this paper, we demonstrate successful applications to the wireless real-world surveillance sensor placement problem giving very high detection and classification rates, 97.5% and 87.4%, respectively.

  • Compact and High-Power Spatial Power Combiner by Active Integrated Antenna Technique at 5.8 GHz

    Harunobu SEITA  Shigeo KAWASAKI  

     
    PAPER

      Vol:
    E91-C No:11
      Page(s):
    1757-1764

    Compact and planar active integrated antenna arrays with a high power multi-stage amplifier were developed with effective heat sink mechanism. By attaching an aluminum plate to the backside of the creased amplifier circuit board, effective cooling can be achieved. The nonlinear behavior of the amplifier agrees well with the simulation based on the Angelov model. The high power amplifier circuit consisted of the three-stage amplifier and operated with an output power of 4 W per each element at 5.8 GHz. The 32-element active integrated antenna array stably operated with the output power of 120 W under the effective heat sink design. With a weight of 4 kg, the weight-to-output power ratio and the volume-to-output power ratio of the antenna array are 33.3 g/W and 54.5 cm3/W, respectively. Wireless power transmission was also successfully demonstrated.

  • Robust Detection Algorithm for Spread Spectrum Audio Watermarking

    Lili LI  Xiangzhong FANG  

     
    LETTER-Cryptography and Information Security

      Vol:
    E91-A No:11
      Page(s):
    3389-3392

    In this letter we propose a robust detection algorithm for audio watermarking for copyright protection. The watermark is embedded in the time domain of an audio signal by the normally used spread spectrum technique. The scheme of detection is an improvement of the conventional correlation detector. A high-pass filter is applied along with the linear prediction error filter for whitening the audio signal and an adaptive threshold is chosen for decision comparing. Experimental results show that our detection algorithm outperforms the conventional one not only because it improves the robustness to normal attacks but also because it can provide the robustness to time-invariant pitch-scale modification.

  • Lossless-by-Lossy Coding for Scalable Lossless Image Compression

    Kazuma SHINODA  Hisakazu KIKUCHI  Shogo MURAMATSU  

     
    PAPER-Image

      Vol:
    E91-A No:11
      Page(s):
    3356-3364

    This paper presents a method of scalable lossless image compression by means of lossy coding. A progressive decoding capability and a full decoding for the lossless rendition are equipped with the losslessly encoded bit stream. Embedded coding is applied to large-amplitude coefficients in a wavelet transform domain. The other wavelet coefficients are encoded by a context-based entropy coding. The proposed method slightly outperforms JPEG-LS in lossless compression. Its rate-distortion performance with respect to progressive decoding is close to that of JPEG2000. The spatial scalability with respect to resolution is also available.

  • Counter-Based Broadcasting with Hop Count Aware Random Assessment Delay Extension for Wireless Sensor Networks

    Shintaro IZUMI  Takashi TAKEUCHI  Takashi MATSUDA  Hiroshi KAWAGUCHI  Chikara OHTA  Masahiko YOSHIMOTO  

     
    PAPER

      Vol:
    E91-B No:11
      Page(s):
    3489-3498

    Broadcasting is an elementary operation in wireless multi-hop networks. Flooding is a simple broadcast protocol but it frequently causes serious redundancy, contention and collisions. Probability based methods are promising because they can reduce broadcast messages without additional hardware and control packets. In this paper, the counter-based scheme which is one of the probability based methods is focused on as a broadcast protocol, and the RAD (Random Assessment Delay) Extension is proposed to improve the original counter-based scheme. The RAD Extension can be implemented without additional hardware, so that the strength of the counter-based scheme can be preserved. In addition, we propose the additional algorithm called Hop Count Aware RAD Extension to establish shorter path from the source node. Simulation results show that both of the RAD Extension and the Hop Count Aware RAD Extension reduce the number of retransmitting nodes by about 10% compared with the original scheme. Furthermore, the Hop Count Aware RAD Extension can establish almost the same path length as the counter-based scheme.

  • Handling Dynamic Weights in Weighted Frequent Pattern Mining

    Chowdhury Farhan AHMED  Syed Khairuzzaman TANBEER  Byeong-Soo JEONG  Young-Koo LEE  

     
    PAPER-Knowledge Discovery and Data Mining

      Vol:
    E91-D No:11
      Page(s):
    2578-2588

    Even though weighted frequent pattern (WFP) mining is more effective than traditional frequent pattern mining because it can consider different semantic significances (weights) of items, existing WFP algorithms assume that each item has a fixed weight. But in real world scenarios, the weight (price or significance) of an item can vary with time. Reflecting these changes in item weight is necessary in several mining applications, such as retail market data analysis and web click stream analysis. In this paper, we introduce the concept of a dynamic weight for each item, and propose an algorithm, DWFPM (dynamic weighted frequent pattern mining), that makes use of this concept. Our algorithm can address situations where the weight (price or significance) of an item varies dynamically. It exploits a pattern growth mining technique to avoid the level-wise candidate set generation-and-test methodology. Furthermore, it requires only one database scan, so it is eligible for use in stream data mining. An extensive performance analysis shows that our algorithm is efficient and scalable for WFP mining using dynamic weights.

  • Exact Error Rate Analysis for Pulsed DS- and Hybrid DS/TH-CDMA in Nakagami Fading

    Mohammad Azizur RAHMAN  Shigenobu SASAKI  Hisakazu KIKUCHI  Hiroshi HARADA  Shuzo KATO  

     
    PAPER

      Vol:
    E91-A No:11
      Page(s):
    3150-3162

    Exact bit error probabilities (BEP) are derived in closed-form for binary pulsed direct sequence (DS-) and hybrid direct sequence time hopping code division multiple access (DS/TH-CDMA) systems that have potential applications in ultra-wideband (UWB) communications. Flat Nakagami fading channel is considered and the characteristic function (CF) method is adopted. An exact expression of the CF is obtained through a straightforward method, which is simple and good for any arbitrary pulse shape. The CF is then used to obtain the exact BEP that requires less computational complexity than the method based on improved Gaussian approximation (IGA). It is shown under identical operating conditions that the shape of the CF, as well as, the BEP differs considerably for the two systems. While both the systems perform comparably in heavily faded channel, the hybrid system shows better BEP performance in lightly-faded channel. The CF and BEP also strongly depend on chip length and chip-duty that constitute the processing gain (PG). Different combinations of the parameters may result into the same PG and the BEP of a particular system for a constant PG, though remains nearly constant in a highly faded channel, may vary substantially in lightly-faded channel. A comparison of the results from the exact method with those from the standard Gaussian approximation (SGA) reveals that the SGA, though accurate for both the systems in highly-faded channel, becomes extremely optimistic for low-duty systems in lightly-faded channel. The SGA also fails to track several other system trade-offs.

9701-9720hit(21534hit)