Narrow-wall-connected microstrip-to-waveguide transition using V-shaped patch element in millimeter-wave band is proposed. Since the microstrip line on the narrow-wall is perpendicular to the E-plane of the waveguide, waveguide field does not couple directly to the microstrip line. The current on the V-shaped patch element flows along inclined edges, then current on the V-shaped patch element couples to the microstrip line efficiently. Three types of transitions are investigated. A numerical investigation of these transitions show some relations between bandwidth and insertion loss. It is confirmed that the improved transition exhibits an insertion loss of 0.6 dB from 76 to 77 GHz, and a bandwidth of 4.1% (3.15 GHz) for the reflection coefficient below -15 dB.

Opto-Thermal analysis of Semiconductor Blue-Multi-Laser-Diode Annealing (BLDA) for amorphous Si (a-Si) film is conducted by varying the irradiation power, the scanning velocity and the beam shape of blue-laser of 445 nm. Thermal profiles, maximum temperature of the a-Si film and the melting duration are evaluated. By comparing the simulated results with the experimental results, the excellent controllability of BLDA for arbitrary grain size can be explained consistently by the relation between irradiation time and melting duration. The results are useful to estimate poly-crystallized phase such as micro-polycrystalline Si, polycrystalline Si and anisotropic lateral growth of single-crystal-like Si.

Design of high gain and high efficiency antennas is one of the key challenges in antenna engineering and especially in millimeter wave communication systems. Various types of planar waveguide arrays with series-fed traveling wave operation have been developed in Tokyo Tech with the special focus upon efficiency enhancement as well as reduction of fabrication cost. In this review, four kinds of single layer waveguide arrays characterized with the series fed travelling wave operation are surveyed first. To cope with the bandwidth narrowing effects due to long line effects associated with the series fed operation, authors have introduced partially corporate feed embedded in the single layer waveguide. They further extended the study to cover fully corporate feed arrays with multiple layer waveguide as well; a new fabrication technique of diffusion bonding of laminated thin plates has the potential to realize the low cost mass production of multi-layer structures for the millimeter wave application. Secondly, the novel methods for loss evaluation of copper plate substrate are established for the design of post-wall waveguide arrays where dielectric loss and conductor loss is determined in wide range of millimeter wave band, by using the Whispering gallery mode resonator. This enables us to design the planar arrays with the loss taken into account. Finally, the planar arrays are now applied to two kinds of systems in the Tokyo Tech millimeter wave project; the indoor short range file-transfer systems and the outdoor communication systems for the medium range backhaul links. The latter has been field-tested in the model network built in Tokyo Tech Ookayama campus. Early stage progress of the project including unique propagation data is also reported.

In a direct-sequence spread spectrum communication system, its multiple access interference, security and user number are mainly decided by correlation, linear span and family size of spreading sequences employed by such a system, respectively. In this letter, based on several families of the known sequences, a method for improving their linear span and family sizes is presented. It is worthy of mentioning that although the number of the proposed sequences with linear span not less than that of the known sequences is enormously increased, the former's correlation distribution is the same as the latter's one. In addition, the proposed sequences include No sequences and the known sequences mentioned above as special cases.

A method was developed for analyzing a system comprised of identical and indistinguishable elements with nonlinear dynamics. First, a moment vector equation (MVE) for the system was derived so as to avoid the curse of dimensionality by using the property that the elements are identical and indistinguishable. Next, an algorithm was developed to solve the MVE for deriving the moment vector in a steady state. It effectively uses eigen analysis on the basis of the property of the MVE. It can thus be used to clarify the structure of the solutions in the moment vector space and to derive multiple solutions by setting the initial value to the moment vector orthogonal to the solutions already obtained. Finally, the probability density function (pdf) for the state of the system was derived using the moment vectors in a steady state. Comparison of the pdfs thereby derived with those derived using numerical simulation showed that the method provided good approximations of the pdfs. Moreover, multiple solutions that are difficult to do using numerical simulation were derived.

Threshold testing, which is an LSI testing method based on the acceptability of faults, is effective in yield enhancement of LSIs and selective hardening for LSI systems. In this paper, we propose test generation models for threshold test generation. Using the proposed models, we can efficiently identify acceptable faults and generate test patterns for unacceptable faults with a general test generation algorithm, i.e., without a test generation algorithm specialized for threshold testing. Experimental results show that our approach is, in practice, effective.

We propose a modification of the generalized gradient vector flow field techniques based on multiresolution analysis and phase portrait techniques. The original image is subjected to mutliresolutional analysis to create a sequence of approximation and detail images. The approximations are converted into an edge map and subsequently into a gradient field subjected to the generalized gradient vector flow transformation. The procedure removes noise and extends large gradients. At every iteration the algorithm obtains a new, improved vector field being filtered using the phase portrait analysis. The phase portrait is applied to a window with a variable size to find possible boundary points and the noise. As opposed to previous phase portrait techniques based on binary rules our method generates a continuous adjustable score. The score is a function of the eigenvalues of the corresponding linearized system of ordinary differential equations. The salient feature of the method is continuity: when the score is high it is likely to be the noisy part of the image, but when the score is low it is likely to be the boundary of the object. The score is used by a filter applied to the original image. In the neighbourhood of the points with a high score the gray level is smoothed whereas at the boundary points the gray level is increased. Next, a new gradient field is generated and the result is incorporated into the iterative gradient vector flow iterations. This approach combined with multiresolutional analysis leads to robust segmentations with an impressive improvement of the accuracy. Our numerical experiments with synthetic and real medical ultrasound images show that the proposed technique outperforms the conventional gradient vector flow method even when the filters and the multiresolution are applied in the same fashion. Finally, we show that the proposed algorithm allows the initial contour to be much farther from the actual boundary than possible with the conventional methods.

Boolean matching is a fundamental problem in FPGA synthesis, but existing Boolean matchers are not scalable to complex PLBs (programmable logic blocks) and large circuits. This paper proposes a filter-based Boolean matching method, F-BM, which accelerates Boolean matching using lookup tables implemented by Bloom filters storing pre-calculated matching results. To show the effectiveness of the proposed F-BM, a post-mapping re-synthesis minimizing area which employs Boolean matching as the kernel has been implemented. Tested on a broad selection of benchmarks, the re-synthesizer using F-BM is 80X faster with 0.5% more area, compared with the one using a SAT-based Boolean matcher.

We present a session initiation protocol (SIP) network design for a voice-over-IP network to prevent congestion caused by people calling friends and family after a disaster. The design increases the capacity of SIP servers in a network by using all of the SIP servers equally. It takes advantage of the fact that equipment for voice data packets is different from equipment for signaling packets in SIP networks. Furthermore, the design achieves simple routing on the basis of telephone numbers. We evaluated the performance of our design in preventing congestion through simulation. We showed that the proposed design has roughly 20 times more capacity, which is 57 times the normal load, than the conventional design if a disaster were to occur in Niigata Prefecture struck by the Chuetsu earthquake in 2004.

In this paper, we propose a high-throughput binary arithmetic coding architecture for CABAC (Context Adaptive Binary Arithmetic Coding) which is one of the entropy coding tools used in the H.264/AVC main and high profiles. The full CABAC encoding functions, including binarization, context model selection, arithmetic encoding and bits generation, are implemented in this proposal. The binarization and context model selection are implemented in a proposed binarizer, in which a FIFO is used to pack the binarization results and output 4 bins in one clock. The arithmetic encoding and bits generation are implemented in a four-stage pipeline with the encoding ability of 4 bins/clock. In order to improve the processing speed, the context variables access and update for 4 bins are paralleled and the pipeline path is balanced. Also, because of the outstanding bits issue, a bits packing and generation strategy for 4 bins paralleled processing is proposed. After implemented in verilog-HDL and synthesized with Synopsys Design Compiler using 90 nm libraries, this proposal can work at the clock frequency of 250 MHz and takes up about 58 K standard cells, 3.2 Kbits register files and 27.6 K bits ROM. The throughput of processing 1000 M bins per second can be achieved in this proposal for the HDTV applications.

The aim of this research is to study the power energy cost reduction of the mobile telecom industry through the supervisor control and data acquisition (SCADA) system application during globalization and liberalization competition. Yet this management system can be proposed functions: operating monitors, the analysis on load characteristics and dropping the cost of management.

The performance of the least-mean-square (LMS) beamformer is heavily dependent on the choice of the step-size, for it governs the convergence rate and steady-state excess mean squared error. To meet the conflicting requirement of low misadjustment, especially for the beamformer being modified in response to the multipath environmental changes, it needs to be controlled in a proper way. In this letter, we present an efficient adaptive step-size subarray LMS to achieve good performance. Simulation results are provided for illustrating the effectiveness of the proposed scheme.

This paper studies the performance of a coded convolutional spreading CDMA system with cyclic prefix (CS-CDMA/CP) combined with the zero correlation zone code generated from the M-sequence (M-ZCZ code) for downlink transmission over a multipath fast fading channel. In particular, we propose a new pilot-aided channel estimation scheme based on the shift property of the M-ZCZ code and show the robustness of the scheme against fast fading through comparison with the W-CDMA system empolying time-multiplexed pilot signals.

This paper proposes methods for accelerating DPA by using the CPU and the GPU in a parallel manner. The overhead of naive DPA evaluation software increases excessively as the number of points in a trace or the number of traces is enlarged due to the rapid increase of file I/O overhead. This paper presents some techniques, with respect to DPA-arithmetic and file handling, which can make the overhead of DPA software become not extreme but gradual as the increase of the amount of trace data to be processed. Through generic experiments, we show that the software, equipped with the proposed methods, using both CPU and GPU can shorten the time for evaluating the DPA resistance of devices by almost half.

Correlation power analysis (CPA) is a well-known attack against cryptographic modules with which an attacker evaluates the correlation between the power consumption and the sensitive data candidates calculated from a guessed sub-key and known data such as plaintexts and ciphertexts. This paper enhances CPA to propose a new general power analysis, built-in determined sub-key CPA (BS-CPA), which finds a new sub-key by using the previously determined sub-keys recursively to compute the sensitive data candidates and to increase the signal-to-noise ratio in its analysis. BS-CPA also reuses the power traces in the repetitions of finding sub-keys to decrease the total number of the required traces for determining the all sub-keys. BS-CPA is powerful and effective when the multiple sensitive data blocks such as sbox outputs are processed simultaneously as in the hardware implementation. We apply BS-CPA to the power traces provided at the DPA contest and succeed in finding a DES key using fewer traces than the original CPA does.

This paper proposes a self-taught classifier of gateways for hybrid SLAM. Gateways are detected and recognized by the self-taught classifier, which is a SVM classifier and self-taught in that its training samples are produced and labeled without user's intervention. Since the detection of gateways at the topological boundaries of an acquired metric map reduces computational complexity in partitioning the metric map into sub-maps as compared with previous hybrid SLAM approaches using spectral clustering methods, from O(2n) to O(n), where n is the number of sub-maps. This makes possible real time hybrid SLAM even for large-scale metric maps. We have confirmed that the self-taught classifier provides satisfactory consistency and computationally efficiency in hybrid SLAM through different experiments.

This paper proposes cooperative coding using cyclic delay diversity (CDD) for OFDM systems. The cooperative diversity is combined with channel coding while CDD is applied to the cooperative transmission of the multiple relays to improve the beneficial effects of the cooperating relays. Analyses of frame error probability (FEP) and the average channel power of the proposed scheme are shown. Simulation results show the frame error rate (FER) of the proposed scheme. The proposed scheme provides not only a simple code design and low system complexity compared to conventional space-time processing, but better FER and diversity gain compared to direct transmission and conventional cooperative coding without CDD.

This paper presents a commercial shot classification scheme combining well-designed visual and textual features to automatically detect TV commercials. To identify the inherent difference between commercials and general programs, a special mid-level textual descriptor is proposed, aiming to capture the spatio-temporal properties of the video texts typical of commercials. In addition, we introduce an ensemble-learning based combination method, named Co-AdaBoost, to interactively exploit the intrinsic relations between the visual and textual features employed.

This paper discusses an efficient discrete model for nonlinear RF power amplifier (PA) with long-term memory effects and analyzes its error. The procedure of converting RF signals and systems into a discrete domain is explained for a discrete baseband memory polynomial model. Unlike a previous simple memory polynomial model, the proposed discrete model has two different sampling frequencies: one for nonlinear system with long-term memory effects and one for input signal. A method to choose an optimal sampling frequency for the system and a discrete memory depth is proposed to minimize the sensitivity of the system for perturbation of the measured data. A two-dimensional sensitivity function which is a product of relative residual and matrix condition number is defined for least square problem of the proposed model. Examples with a wideband WiBro 3FA signal and a WCDMA 4FA signal for nonlinear transmitters are presented to describe the overall procedure and effectiveness of the proposed scheme.

Time synchronization is an essential service for wireless sensor networks (WSNs). However, fixed-period time synchronization can not serve multiple users efficiently in terms of energy consumption. This paper proposes a lightweight precision-adaptive protocol for cluster-based multi-user networks. It consists of a basic average time synchronization algorithm and an adaptive control loop. The basic average time synchronization algorithm achieves 1 µs instantaneous synchronization error performance. It also prolongs re-synchronization period by taking the average of two specified nodes' local time to be cluster global time. The adaptive control loop realizes diverse levels of synchronization precision based on the proportional relationship between sync error and re-synchronization period. Experimental results show that the proposed precision-adaptive protocol can respond to the sync error bound change within 2 steps. It is faster than the exponential convergence of the adaptive protocols based on multiplicative iterations.