Young Min KI Dae Wook BYUN Dong Ku KIM
Simple-relay aided resource allocation (SRARA) schemes are incorporated with throughput guarantee scheduling (TGS) in IEEE 802.16 type time division duplex--orthogonal frequency division multiple access (TDD-OFDMA) downlink in order to enhance service coverage, where the amount of resources at each relay is limited due to either its available power which is much smaller than base station (BS) power or the required overhead. The performance of SRARA schemes is evaluated with both proportional fair (PF) and TGS schedulers at 64 kbps and 128 kbps user throughput requirements when total RS power is set to 500 mW or 1 W. For SRARA with RSs of relatively lower power (500 mW), schemes that put total power into only one subchannel offer larger coverage than when both subchnnels are used with equal power allocation, while the RS with evenly power-allocated two subchannels could provide larger coverage gain for a relatively higher power (1 W). Depending upon the target throughputs it is shown which of the relay scheme or scheduler design would play more important role in improving coverage. In a lower target (64 kbps), more improvement comes from relay scheme rather than scheduler design. For a relatively higher level (128 kbps), it comes from scheduler design rather than relay due to the fact that simple relay can't help using strictly limited amount of resources.
Sang-Hun YOON Daegun OH Jong-Wha CHONG Kyung-Kuk LEE
In this paper, we propose a new code set which has very low spectral peak to average ratio (SPAR) and good correlation properties for DS-UWB. The codes which have low SPAR are suitable for DS-UWB system which operates in UWB (3.110.4 GHz) because they can utilize more power than high SPAR codes can do. And, in order to reduce inter symbol interference (ISI) and inter piconet interferences, the codes which have good auto- and cross-correlation properties must be used. In this paper, we propose three items; (1) a new code generation method which can generate good SPAR and auto-correlation codes, (2) code selection criteria, and (3) a code set, which has been selected according to the proposed selection criteria. The proposed code set has SPAR reduced about 0.22 dB and GMF improved by 30% compared to the previous code set while it is maintaining almost same cross-correlation properties. Each code of the proposed code set, therefore, has gained 1.43 dB SIR on an average compared to that of the previous code set.
Apirada NAMSANG Thammarat MAJAENG Jaruek JANTREE Sarawuth CHAIMOOL Prayoot AKKARAEKTHALIN
New microstrip bandpass filters with extended stopband bandwidths are proposed by using new asymmetric stepped-impedance hairpin resonators (ASIHRs). The size of the proposed resonators has been reduced around 16%, comparing with the conventional stepped-impedance hairpin resonators (SIHRs) structure. The first bandpass filter is a combination of differ resonators with the same fundamental frequency but differ in harmonic frequencies, resulting in improved suppression spurious responses in stopbands. Furthermore, another bandpass filter uses the ASIHRs periodically loaded on a microstrip line to improve stopband characteristics. The proposed filters not only have compact size of resonators, but also provide improved upper stopband characteristics. The proposed filters provide 20 dB rejection levels in the stopband up to 6f0. The measured filters responses agree very well with the simulated expectations.
Hiroaki KOZAWA Kiyoharu HAMAGUCHI Toshinobu KASHIWABARA
For formal verification of large-scale digital circuits, a method using satisfiability checking of logic with equality and uninterpreted functions has been proposed. This logic, however, does not consider specific properties of functions or predicates at all, e.g. associative property of addition. In order to ease this problem, we introduce "equivalence constraint" that is a set of formulas representing the properties of functions and predicates, and check the satisfiability of formulas under the constraint. In this report, we show an algorithm for checking satisfiability with equivalence constraint and also experimental results.
Akira TANAKA Masaaki MIYAKOSHI
A parametric linear filter for a linear observation model usually requires a parameter selection process so that the filter achieves a better filtering performance. Generally, criteria for the parameter selection need not only the filtered solution but also the filter itself with each candidate of the parameter. Obtaining the filter usually costs a large amount of calculations. Thus, an efficient algorithm for the parameter selection is required. In this paper, we propose a fast parameter selection algorithm for linear parametric filters that utilizes a joint diagonalization of two non-negative definite Hermitian matrices.
In this paper, we describe a method of applying Collaborative Filtering with a Machine Learning technique to predict users' preferences for clothes on online shopping malls when user history is insufficient. In particular, we experiment with methods of predicting missing values, such as mean value, SVD, and support vector regression, to find the best method and to develop and utilize a unique feature vector model.
Yushi UNO Yoshinobu OTA Akio UEMICHI
The link structure of the Web is generally viewed as the webgraph. Web structure mining is a research area that mainly aims to find hidden communities by focusing on the webgraph, and communities or their cores are supposed to constitute dense subgraphs. Therefore, structure mining can actually be realized by enumerating such substructures, and Kleinberg's biclique model is well-known among them. In this paper, we examine some candidate substructures, including conventional bicliques, and attempt to find useful information from the real web data. Especially, we newly exploit isolated cliques for our experiments of structure mining. As a result, we discovered that isolated cliques that lie over multiple domains can stand for useful communities, which implies the validity of isolated clique as a candidate substructure for structure mining. On the other hand, we also observed that most of isolated cliques on the Web correspond to menu structures and are inherent in single domains, and that isolated cliques can be quite useful for detecting harmful link farms.
Embedded zero-tree coding in wavelet domain has drawn a lot of attention for image compression applications. Among noteworthy zero-tree algorithms is the set partitioning in hierarchical trees (SPIHT) algorithm. For images with textures, high frequency wavelet coefficients are likely to become significant after a few scan passes of SPIHT, and therefore the coding results are often insufficient. It is desirable that the low frequency and high frequency components of an image are coded using different strategies. In this paper, we propose a hybrid algorithm using the SPIHT and EBC (embedded block coding) to code low frequency and high frequency wavelet coefficients, respectively; the intermediate coding results of low frequency coefficients are used to facilitate the coding operation of high frequency coefficients. Experimental results show that the coding performance can be significantly improved by the hybrid SPIHT-EBC algorithm.
Yuko HARA Hiroyuki TOMIYAMA Shinya HONDA Hiroaki TAKADA Katsuya ISHII
This paper proposes a behavioral level partitioning method for efficient behavioral synthesis from a large sequential program consisting of a set of functions. Our method optimally determines functions to be inlined into the main module and the other functions to be synthesized into sub modules in such a way that the overall datapath is minimized while the complexity of individual modules is lower than a certain level. The partitioning problem is formulated as an integer programming problem. Experimental results show the effectiveness of the proposed method.
Kazunori KOBAYASHI Ken'ichi FURUYA Yoichi HANEDA Akitoshi KATAOKA
We previously proposed a method of sound source and microphone localization. The method estimates the locations of sound sources and microphones from only time differences of arrival between signals picked up by microphones even if all their locations are unknown. However, there is a problem that some estimation results converge to local minimum solutions because this method estimates locations iteratively and the error function has multiple minima. In this paper, we present a new iterative method to solve the local minimum problem. This method achieves accurate estimation by selecting effective initial locations from many random initial locations. The computer simulation and experimental results demonstrate that the presented method eliminates most local minimum solutions. Furthermore, the computational complexity of the presented method is similar to that of the previous method.
Sensor networks are often deployed in unattended environments, thus leaving these networks vulnerable to false data injection attacks in which an adversary injects forged reports into the network through compromised nodes, with the goal of deceiving the base station or depleting the resources of forwarding nodes. Several research solutions have been recently proposed to detect and drop such forged reports during the forwarding process. Each design can provide the equivalent resilience in terms of node compromising. However, their energy consumption characteristics differ from each other. Thus, employing only a single filtering scheme for a network is not a recommendable strategy in terms of energy saving. In this paper, we propose a fuzzy-based adaptive filtering scheme selection method for energy saving. A fuzzy rule-based system is exploited to choose one of three filtering schemes by considering the false traffic ratio, the security threshold value, distance, and the detection power of the filtering scheme. The adaptive selection of the filtering schemes can conserve energy, and guarantee sufficient resilience.
Hiroaki TANAKA Yoshinori TAKEUCHI Keishi SAKANUSHI Masaharu IMAI Hiroki TAGAWA Yutaka OTA Nobu MATSUMOTO
SIMD instructions are often implemented in modern multimedia oriented processors. Although SIMD instructions are useful for many digital signal processing applications, most compilers do not exploit SIMD instructions. The difficulty in the utilization of SIMD instructions stems from data parallelism in registers. In assembly code generation, the positions of data in registers must be noted. A technique of generating pack instructions which pack or reorder data in registers is essential for exploitation of SIMD instructions. This paper presents a code generation technique for SIMD instructions with pack instructions. SIMD instructions are generated by finding and grouping the same operations in programs. After the SIMD instruction generation, pack instructions are generated. In the pack instruction generation, Multi-valued Decision Diagram (MDD) is introduced to represent and to manipulate sets of packed data. Experimental results show that the proposed code generation technique can generate assembly code with SIMD and pack instructions performing repacking of 8 packed data in registers for a RISC processor with a dual-issue coprocessor which supports SIMD and pack instructions. The proposed method achieved speedup ratio up to about 8.5 by SIMD instructions and multiple-issue mechanism of the target processor.
Hyounkuk KIM Kihwan JEON Joonhyuk KANG Hyuncheol PARK
This letter presents a new vertical Bell Labs layered space-time (V-BLAST) transmission scheme for developing low-complexity tree searching in the QRD-M algorithm. In the new V-BLAST system, we assign modulation scheme in ascending order from top to bottom tree branches. The modulation set to be assigned is decided by two criteria: minimum performance loss and maximum complexity reduction. We also propose an open-loop power allocation algorithm to surmount the performance loss. Numerical results show that the proposed V-BLAST transmission approach can significantly reduce the computational loads of the QRD-M algorithm with a slight performance degradation.
Hoyoung CHOI Jinwoo CHOE Daehyoung HONG
In this letter, we propose an efficient scheme for combining scheduling and channel allocation functions in multi-channel systems such as an orthogonal frequency division multiple access (OFDMA). In our approach, the scheduling function is embedded in the channel allocation function in an implicit manner, and the implicit scheduler only translates quality-of-service (QoS) requirements into a set of constraints on channel allocation. The channel allocation problem is then formulated as a linear programming (LP) problem, and the optimal solution can be easily obtained through various LP algorithms. Through extensive numerical experiments, it is demonstrated that the proposed scheme can maximize the cell throughput under the given QoS requirements.
Xiaoling WU Jinsung CHO Brian J. D'AURIOL Sungyoung LEE Young-Koo LEE
Ubiquitous sensor networks (USNs) are comprised of energy constrained nodes. This limitation has led to the crucial need for energy-aware protocols to produce an efficient network. We propose a sleep scheduling scheme for balancing energy consumption rates in a single hop cluster based network using Analytical Hierarchy Process (AHP). We consider three factors contributing to the optimal nodes scheduling decision and they are the distance to cluster head (CH), residual energy, and sensing coverage overlapping, respectively. We also propose an integrated sleep scheduling and geographical multi-path routing scheme for USNs by AHP. The sleep scheduling is redesigned to adapt the multi-hop case. For the proposed routing protocol, the distance to the destination location, remaining battery capacity, and queue size of candidate sensor nodes in the local communication range are taken into consideration for next hop relay node selection. The proposed schemes are observed to improve network lifetime and conserve energy without compromising desired coverage. In the multi-hop case, it can further reduce the packet loss rate and link failure rate since the buffer capacity is considered.
Naoki KANAYAMA Shigenori UCHIYAMA
In 1995, Vanstone and Zuccherato proposed a novel method of generating RSA moduli having a predetermined set of bits which are the ASCII representation of user's identification information (i.e., name, email address, etc.). This could lead to a savings in bandwidth for data transmission and storage. In this paper, we apply this idea of Vanstone and Zuccherato for reducing the storage requirement of RSA public moduli to integer factoring based public-key schemes with their moduli of the form prq. More precisely, we explicitly propose two efficient methods for specifying high-order bits of prime factors of their public-keys. We also consider the security of the proposed methods.
In this paper, we address the issue of mobile positioning and tracking after measurements have been made on the distances and possibly directions between an MS (mobile station) and its nearby base stations (BS's). The measurements can come from the time of arrival (TOA), the time sum of arrival (TSOA), the time difference of arrival (TDOA), and the angle of arrival (AOA). They are in general corrupted with measurement noise and NLOS (non-line-of-sight) error. The NLOS error is the dominant factor that degrades the accuracy of mobile positioning. Assuming specific statistic models for the NLOS error, however, we propose a scheme that significantly reduces its effect. Regardless of which of the first three measurement types (i.e. TOA, TSOA, or TDOA) is used, the proposed scheme computes the MS location in a mathematically unified way. We also propose a method to identify the TOA measurements that are not or only slightly corrupted with NLOS errors. We call them nearly NLOS-error-free TOA measurements. From the signals associated with TOA measurements, AOA information can be obtained and used to aid the MS positioning. Finally, by combining the proposed MS positioning method with Kalman filtering, we propose a scheme to track the movement of the MS.
Soon LEE Seung-Mook BAEK Jung-Wook PARK Young-Hyun MOON
This paper presents a study to estimate the composition of an electric load, i.e. to determine the amount of each load class by the direct measurements of the total electric current waveform from instrument reading. Kalman filter algorithm is applied to estimate the electric load composition on a consumer side of a distributed power system. The electric load supplied from the different voltage level by using a non-ideal delta-wye transformer is also studied with consideration of the practical environment for a distributed power system.
Bakhtiar Affendi ROSDI Atsushi TAKAHASHI
A new algorithm is proposed to reduce the area of a pipelined circuit using a combination of multi-clock cycle paths, clock scheduling and delay balancing. The algorithm analyzes the circuit and replaces intermediate registers with delay elements under the condition that the circuit works correctly at given target clock-period range with the smaller area. Experiments with pipelined multipliers verify that the proposed algorithm can reduce the area of a pipelined circuit without degrading performance.
This paper addresses a new surface reconstruction scheme for approximating the isosurface from a set of tomographic cross sectional images. Differently from the novel Marching Cubes (MC) algorithm, our method does not extract the iso-density surface (isosurface) directly from the voxel data but calculates the iso-density point (isopoint) first. After building a coarse initial mesh approximating the ideal isosurface by the cell-boundary representation, it metamorphoses the mesh into the final isosurface by a relaxation scheme, called shrink-wrapping process. Compared with the MC algorithm, our method is robust and does not make any cracks on surface. Furthermore, since it is possible to utilize lots of additional isopoints during the surface reconstruction process by extending the adjacency definition, theoretically the resulting surface can be better in quality than the MC algorithm. According to experiments, it is proved to be very robust and efficient for isosurface reconstruction from cross sectional images.