This paper applies the Evolutionary Programming (EP) algorithm and a risk assessment technique to obtain an optimal solution to the Unit Maintenance Scheduling Decision (UMSD) problem subject to economic cost and power security constraints. The proposed approach employs a risk assessment model to evaluate the security of the power supply system and uses the EP algorithm to establish the optimal unit maintenance schedule. The effectiveness of the proposed methodology is verified through testing using the IEEE Reliability Test System (RTS). The test results confirm that the proposed approach can to ensure that the system security and outperforms the existing deterministic and stochastic optimization methods both in terms of the quality of the solution and the computational effort required. Therefore, the proposed methodology represents a particular effective technique for the UMSD.
Chooi-Ling GOH Taro WATANABE Hirofumi YAMAMOTO Eiichiro SUMITA
We present a method to constrain a statistical generative word alignment model with the output from a discriminative model. The discriminative model is trained using a small set of hand-aligned data that ensures higher precision in alignment. On the other hand, the generative model improves the recall of alignment. By combining these two models, the alignment output becomes more suitable for use in developing a translation model for a phrase-based statistical machine translation (SMT) system. Our experimental results show that the joint alignment model improves the translation performance. The improvement in average of BLEU and METEOR scores is around 1.0-3.9 points.
Hideki NAKAYAMA Tatsuya HARADA Yasuo KUNIYOSHI
Generic image recognition techniques are widely studied for automatic image indexing. However, many of these methods are computationally too heavy for a practically large setup. Thus, for realizing scalability, it is important to properly balance the trade-off between performance and computational cost. In recent years, methods based on a bag-of-keypoints approach have been successful and widely used. However, the preprocessing cost for building visual words becomes immense in large-scale datasets. On the other hand, methods based on global image features have been used for a long time. Because global image features can be extracted rapidly, it is relatively easy to use them with large datasets. However, the performance of global feature methods is usually poor compared to the bag-of-keypoints methods. This paper proposes a simple but powerful scheme of boosting the performance of global image features by densely sampling low-level statistical moments of local features. Also, we use a scalable learning and classification method which is substantially lighter than a SVM. Our method achieved performance comparable to state-of-the-art methods despite its remarkable simplicity.
Kohei MIYASE Xiaoqing WEN Seiji KAJIHARA Yuta YAMATO Atsushi TAKASHIMA Hiroshi FURUKAWA Kenji NODA Hideaki ITO Kazumi HATAYAMA Takashi AIKYO Kewal K. SALUJA
Capture-safety, (defined as the avoidance of timing error due to unduly high launch switching activity in capture mode during at-speed scan testing), is critical in avoiding test induced yield loss. Although several sophisticated techniques are available for reducing capture IR-drop, there are few complete capture-safe test generation flows. This paper addresses the problem by proposing a novel and practical capture-safe test generation flow, featuring (1) a complete capture-safe test generation flow; (2) reliable capture-safety checking; and (3) effective capture-safety improvement by combining X-bit identification & X-filling with low launch-switching-activity test generation. The proposed flow minimizes test data inflation and is compatible with existing automatic test pattern generation (ATPG) flow. The techniques proposed in the flow achieve capture-safety without changing the circuit-under-test or the clocking scheme.
Ramesh K. POKHAREL Kenta UCHIDA Abhishek TOMAR Haruichi KANAYA Keiji YOSHIDA
A method to realize the fine frequency-tuning steps using tiny capacitors instead of Metal-Insulator-Metal (MIM) capacitors is proposed for a digitally controlled oscillator (DCO). The tiny capacitors are realized by the coplanar transmission lines which are arranged unsymmetrical in a 6 metal layers (M6) foundry of 0.18 µm CMOS technology. These transmission line based capacitors are designed by using electro-magnetic field simulator, and co-designed by using SPICE simulator. Finally, these capacitors are employed to design 15 bit DCO and fabricated the proposed DCO in 0.18 µm CMOS technology, and tested. The measured phase noise of DCO was -118.3 dBc/Hz (@1 MHz offset frequency), and the oscillating frequency tuned from 4.86 GHz to 5.36 GHz in the minimum frequency-tuning step of 18 kHz.
Giordano SPADACINI Sergio A. PIGNARI
This work presents a statistical model for the radiated susceptibility (RS) of an unshielded twisted-wire pair (TWP) running above ground, illuminated by a random electromagnetic field. The incident field is modeled as a superposition of elemental plane waves with random angular density, phase, and polarization. The statistical properties of both the differential-mode (DM) and the common-mode (CM) noise voltages induced across the terminal loads are derived and discussed.
Yoshiharu AKIYAMA Hiroshi YAMANE Nobuo KUWABARA
We investigated the effect of a high-speed power line communication (PLC) signal induced into a very high-speed digital subscriber line (VDSL) system by conductive coupling based on a network model. Four electronic devices with AC mains and telecommunication ports were modeled using a 4-port network, and the parameters of the network were obtained from measuring impedance and transmission loss. We evaluated the decoupling factor from the mains port to the telecommunication port of a VDSL modem using these parameters for the four electric and electronic devices. The results indicate that the mean value of the decoupling factor for the differential and common mode signals were more than 88 and 62 dB, respectively, in the frequency range of a PLC system. Taking the following parameters into consideration; decoupling factor Ld, the average transmission signal powers of VDSL and PLC, desired and undesired (DU) ratio, and transmission loss of a typical 300-m-long indoor telecommunication line, the VDSL system cannot be disturbed by the PLC signal induced into the VDSL modem from the AC mains port in normal installation.
Illsoo SOHN Joonil CHOI Byong OK LEE Kwang-Bok LEE
This letter proposes a new practical multiuser MIMO (MU-MIMO) scheme, which is an evolution of the well-known Per User Unitary beamforming Rate Control (PU2RC) proposed for 3GPP-LTE and IEEE802.16m standards. The proposed scheme includes an efficient user scheduling algorithm which alleviates the major weakness of the conventional PU2RC. Numerical results show that the proposed scheme provides notable performance improvement especially with small and medium user pool since it effectively exploits the benefit from large codebook size.
Chul NAM Joon-Sung PARK Young-Gun PU Kang-Yoon LEE
This paper presents a wide range DCO with fine discrete tuning steps using a ΣΔ modulation technique for UWB frequency synthesizer. The proposed discrete tuning scheme provides a low effective frequency resolution without any degradation of the phase noise performance. With its three step discrete tunings, the DCO simultaneously has a wide tuning range and fine tuning steps. The frequency synthesizer was implemented using 0.13 µm CMOS technology. The tuning range of the DCO is 5.8-6.8 GHz with an effective frequency resolution of 3.9 kHz. It achieves a measured phase noise of -108 dBc/Hz at 1 MHz offset and a tuning range of 16.8% with the power consumption of 5.9 mW. The figure of merit with the tuning range is -181.5 dBc/Hz.
This paper presents a new approach to precompute points [3]P, [5]P,..., [2k-1]P, for some k ≥ 2 on an elliptic curve over Fp. Those points are required for the efficient evaluation of a scalar multiplication, the most important operation in elliptic curve cryptography. The proposed method precomputes the points in affine coordinates and needs only one single field inversion for the computation. The new method is superior to all known methods that also use one field inversion, if the required memory is taken into consideration. Compared to methods that require several field inversions for the precomputation, the proposed method is faster for a broad range of ratios of field inversions and field multiplications. The proposed method benefits especially from ratios as they occur on smart cards.
Muhammad Mahbub ALAM Md. Abdul HAMID Md. Abdur RAZZAQUE Choong Seon HONG
Broadband wireless access networks are promising technology for providing better end user services. For such networks, designing a scheduling algorithm that fairly allocates the available bandwidth to the end users and maximizes the overall network throughput is a challenging task. In this paper, we develop a centralized fair scheduling algorithm for IEEE 802.16 mesh networks that exploits the spatio-temporal bandwidth reuse to further enhance the network throughput. The proposed mechanism reduces the length of a transmission round by increasing the number of non-contending links that can be scheduled simultaneously. We also propose a greedy algorithm that runs in polynomial time. Performance of the proposed algorithms is evaluated by extensive simulations. Results show that our algorithms achieve higher throughput than that of the existing ones and reduce the computational complexity.
Yeong-Sam KIM Seong-Hyun JANG Sang-Hun YOON Jong-Wha CHONG
A new estimation algorithm of clock drift in symbol duration for high precision ranging, based on multiple symbols of chirp spread spectrum (CSS) is proposed. Since the permissible error of a crystal oscillator in CSS is relatively high given the need to lower device costs, ranging results are perturbed by clock drift. We establish the phenomenon of clock drift in multiple symbols of CSS, and estimate the clock drift in symbol duration based on phase difference between adjacent symbols. The proposed algorithm is analyzed, and verified by Monte Carlo simulations.
Tuan Thanh TA Suguru KAMEDA Tadashi TAKAGI Kazuo TSUBOUCHI
In this paper, a fully integrated 5 GHz voltage controlled oscillator (VCO) is presented. The VCO is designed with 0.18 µm silicon complementary metal oxide semiconductor (Si-CMOS) process. To achieve low phase noise, a novel varactors pair circuit is proposed to cancel effects of capacitance fluctuation that makes harmonic currents which increase phase noise of VCO. The VCO with the proposed varactor circuit has tuning range from 5.1 GHz to 6.1 GHz (relative value of 17.9%) and phase noise of lower than -110.8 dBc/Hz at 1 MHz offset over the full tuning range. Figure-of-merit-with-tuning-range (FOMT) of the proposed VCO is -182 dBc/Hz.
Po-Hung CHEN Min-Chiao CHEN Chun-Lin KO Chung-Yu WU
A direct-conversion receiver integrated with the CMOS subharmonic frequency tripler (SFT) for V-band applications is designed, fabricated and measured using 0.13-µm CMOS technology. The receiver consists of a low-noise amplifier, a down-conversion mixer, an output buffer, and an SFT. A fully differential SFT is introduced to relax the requirements on the design of the frequency synthesizer. Thus, the operational frequency of the frequency synthesizer in the proposed receiver is only 20 GHz. The fabricated receiver has a maximum conversion gain of 19.4 dB, a minimum single-side band noise figure of 10.2 dB, the input-referred 1-dB compression point of -20 dBm and the input third order inter-modulation intercept point of -8.3 dB. It draws only 15.8 mA from a 1.2-V power supply with a total chip area of 0.794 mm0.794 mm. As a result, it is feasible to apply the proposed receiver in low-power wireless transceiver in the V-band applications.
Akinori NAKAJIMA Noriyuki FUKUI Hiroshi KUBO
For multiple-input multiple-output (MIMO) spatial multiplexing, signal separation/detection is one of the most important signal processing parts, so that signal separation/detection schemes are being vigorously researched. As a promising signal separation/detection scheme, frequency-domain iterative soft interference cancellation (FD-SIC) has been proposed. Although iterative FD-SIC can provide the transmission performance close to lower bound for QPSK, the accuracy of signal separation/detection significantly degrades in case of high level data modulation. Therefore, in this paper, we propose layered soft interference cancellation (LSIC). We consider single-carrier (SC)-MIMO spatial multiplexing with frequency domain equalization (FDE). The achievable frame error rate (FER) performances with LSIC are evaluated by computer simulation to show that LSIC can provide better FER performance than iterative FD-SIC.
Hoang NGUYEN Raoul RIVAS Klara NAHRSTEDT
With the big success of 802.11 wireless networks, there have been many proposals addressing end-to-end QoS guarantees in 802.11 WLAN. However, we have found that current end-to-end QoS architectures lack of one or more important properties such as cross-layer interaction, end-to-end integration, reconfigurability and modularity. In this work, we present an end-to-end reference QoS architecture for 802.11 WLAN that encapsulates in an unifying fashion software-based QoS components (mechanisms, algorithms, services), proposed in the literature. To show the usefulness and correctness of the reference architecture, we present three case studies of end-to-end QoS architectures addressing different QoS requirements such as bandwidth and delay with different approaches such as differentiated services and integrated services. We will give an architectural comparison and performance evaluation of these architectures. We believe the reference QoS architectures can help QoS designers to understand the importance and the complexity of various QoS components during the design phase and thus choose these QoS components appropriately.
Bag-of-Visual-Words representation has recently become popular for scene classification. However, learning the visual words in an unsupervised manner suffers from the problem when faced these patches with similar appearances corresponding to distinct semantic concepts. This paper proposes a novel supervised learning framework, which aims at taking full advantage of label information to address the problem. Specifically, the Gaussian Mixture Modeling (GMM) is firstly applied to obtain "semantic interpretation" of patches using scene labels. Each scene induces a probability density on the low-level visual features space, and patches are represented as vectors of posterior scene semantic concepts probabilities. And then the Information Bottleneck (IB) algorithm is introduce to cluster the patches into "visual words" via a supervised manner, from the perspective of semantic interpretations. Such operation can maximize the semantic information of the visual words. Once obtained the visual words, the appearing frequency of the corresponding visual words in a given image forms a histogram, which can be subsequently used in the scene categorization task via the Support Vector Machine (SVM) classifier. Experiments on a challenging dataset show that the proposed visual words better perform scene classification task than most existing methods.
Yoshifumi UKITA Tomohiko SAITO Toshiyasu MATSUSHIMA Shigeichi HIRASAWA
In digital signal processing, the sampling theorem states that any real valued function f can be reconstructed from a sequence of values of f that are discretely sampled with a frequency at least twice as high as the maximum frequency of the spectrum of f. This theorem can also be applied to functions over finite domain. Then, the range of frequencies of f can be expressed in more detail by using a bounded set instead of the maximum frequency. A function whose range of frequencies is confined to a bounded set is referred to as bandlimited function. And a sampling theorem for bandlimited functions over Boolean domain has been obtained. Here, it is important to obtain a sampling theorem for bandlimited functions not only over Boolean domain (GF(2)n domain) but also over GF(q)n domain, where q is a prime power and GF(q) is Galois field of order q. For example, in experimental designs, although the model can be expressed as a linear combination of the Fourier basis functions and the levels of each factor can be represented by GF(q), the number of levels often take a value greater than two. However, the sampling theorem for bandlimited functions over GF(q)n domain has not been obtained. On the other hand, the sampling points are closely related to the codewords of a linear code. However, the relation between the parity check matrix of a linear code and any distinct error vectors has not been obtained, although it is necessary for understanding the meaning of the sampling theorem for bandlimited functions. In this paper, we generalize the sampling theorem for bandlimited functions over Boolean domain to a sampling theorem for bandlimited functions over GF(q)n domain. We also present a theorem for the relation between the parity check matrix of a linear code and any distinct error vectors. Lastly, we clarify the relation between the sampling theorem for functions over GF(q)n domain and linear codes.
Phuong Thi Thu PHAM Tomohisa WADA
This paper presents a pilot-aided channel estimation method which is particularly suitable for mobile WiMAX 802.16e Downlink Partial Usage of Subchannel mode. Based on this mode, several commonly used channel estimation methods are studied and the method of least squares line fitting is proposed. As data of users are distributed onto permuted clusters of subcarriers in the transmitted OFDMA symbol, the proposed channel estimation method utilizes these advantages to provide better performance than conventional approaches while offering remarkably low complexity in practical implementation. Simulation results with different ITU-channels for mobile environments show that depending on situations, enhancement of 5 dB or more in term of SNR can be achieved.
Zul Azri BIN MUHAMAD NOH Takahiro SUZUKI Shuji TASAKA
This paper proposes a cross-layer packet scheduling scheme for QoS support in audio-video transmission with IEEE 802.11e HCCA and assesses application-level QoS and QoE of the scheduling scheme under lossy channel conditions. In the proposed scheme, the access point (AP) basically allocates transmission opportunity (TXOP) for each station in a service interval (SI) like the reference scheduler of the IEEE 802.11e standard, which is referred to as the TGe scheme in this paper. In the proposed scheme, however, the AP calculates the number of MAC service data units (MSDUs) arrived in an SI, considering the inter-arrival time of audio samples and that of video frames, which are referred to as media units (MUs), at the application layer. The AP then gives additional TXOP duration in the SI to stations which had audio or video MAC protocol data units (MPDUs) in their source buffers at the end of the previous TXOP. In addition, utilizing video frame information from the application layer, we propose video frame skipping at the MAC-level of a source station. If a station fails to transmit a video MPDU, it drops all the following video MPDUs in the source buffer until the next intra-coded frame comes to the head of the buffer. We compare the reference scheduler (TGe scheme), the proposed packet scheduling scheme with and without the video frame skipping at the source in terms of application-level QoS and QoE. We discuss the effectiveness of the proposed packet scheduling scheme from a viewpoint of QoE as well as QoS. Numerical results reveal that the proposed packet scheduling scheme can achieve higher quality than the TGe scheme under lossy channel conditions. We also show that the proposed scheduling scheme can improve the QoS and QoE by using the video frame skipping at the source. Furthermore, we also examine the effect of SI on the QoS and QoE of the proposed packet scheduling scheme and obtain that the appropriate value of SI is equal to the inter-arrival time of video frame.