Long ZHANG Zhiyong FENG Qixun ZHANG Lingwu YUAN Jia LIU
TV white space (TVWS) brings potential opportunities to relieve the growing spectrum scarcity. Therefore organizations like the FCC have suggested the co-channel deployment of cellular networks (CNs) on condition that a keep-out distance from the protected region of TV receivers is maintained. However the consequent CN interference has not been described. In addition, considering the wide range of TV coverage, it is also inefficient and wasteful not applying the vacant spectra for secondary user (SU) communication by opportunistic access inside the TV coverage zone. In this paper, we first investigate the aggregate interference from CNs outside the protected area to find out how the interference is generated, and then research the available spectrum resource distribution for SUs inside the TV coverage zone under aggregate interference constraints to utilize TVWS more efficiently. Specifically, we model CN in three aspects. A close-form interference probability distribution function (PDF) is proposed. Since the PDF is too complex to analyze, we approximate it as Gaussian and prove the accuracy of our approximation with Kolmogorov-Smirnov test. Then, available spectra maximization is formulated as an optimization problem under both TV and SU receiver outage probability constraints. We find that available spectra demonstrate a volcano-shaped geographical distribution and optimal network-status-aware SU transmit power exists to maximize the spectra. Our analysis reveals the characteristics of interference in TVWS and contributes to the utilization improvement of white space.
In this correspondence, a generic method of constructing optimal p2-ary low correlation zone sequence sets is proposed. Firstly p2-ary column sequence sets are constructed, then p2-ary LCZ sequence sets with parameters (pn-1, pm-1, (pn-1)/(pm-1),1) are constructed by using column sequences and interleaving technique. The resultant p2-ary LCZ sequence sets are optimal with respect to the Tang-Fan-Matsufuji bound.
Yun-Ki HAN Jae-Woo LEE Han-Sol LEE Woo-Jin SONG
We propose a novel bias-free adaptive beamformer employing an affine projection algorithm with the optimal regularization parameter. The generalized sidelobe canceller affine projection algorithm suffers from a bias of a weight vectors under the condition of no reference signals for output of an array in the beamforming application. First, we analyze the bias in the algorithm and prove that the bias can be eliminated through a large regularization parameter. However, this causes slow convergence at the initial state, so the regularization parameter should be controlled. Through the optimization of the regularization parameter, the proposed method achieves fast convergence without the bias at the steady-state. Experimental results show that the proposed beamformer not only removes the bias but also achieves both fast convergence and high steady-state output signal-to-interference-plus-noise ratio.
Password-based anonymous authentication schemes provide not only password-based authentication but also user anonymity. In [15], Yang et al., proposed a password-based anonymous authentication scheme (we call it YZWB10 scheme) using the password-protected credentials. This scheme has being standardized in ISO/IEC 20009-4 that was approved to proceed to the CD stage in the 49th ISO/IEC JTC 1/SC 27 Mexico meeting. In this paper, we analyze unlinkability of the YZWB10 scheme [15]. In particular, we show that a (malicious) server in the YZWB10 scheme can specify which user actually sent the login request to the server. Unlike Yang et al.,'s claim, the YZWB10 scheme [15] does not provide unlinkability against server.
Hiroshi FUJIWARA Takuya NAKAMURA Toshihiro FUJITO
A binary tree is regarded as a prefix-free binary code, in which the weighted sum of the lengths of root-leaf paths is equal to the expected codeword length. Huffman's algorithm computes an optimal tree in O(n log n) time, where n is the number of leaves. The problem was later generalized by allowing each leaf to have its own function of its depth and setting the sum of the function values as the objective function. The generalized problem was proved to be NP-hard. In this paper we study the case where every function is a unit step function, that is, a function that takes a lower constant value if the depth does not exceed a threshold, and a higher constant value otherwise. We show that for this case, the problem can be solved in O(n log n) time, by reducing it to the Coin Collector's problem.
Since the conventional cascade controller for electric motor drives requires accurate information about the system parameters and load conditions to achieve a desired performance, this paper presents a new practical control structure to improve the robust performance against parameter uncertainties. Two first-order disturbance observers (DOB) are incorporated with the cascade structure, to preserve the nominal performance. The analysis of the robust performance of the DOB is presented by using the singular perturbation theory. Simulation results suggest that the proposed controller can be used effectively as an additional compensator to the conventional cascade scheme.
Hung V. LE Capsoni CARLO Nebuloni ROBERTO Luini LORENZO Takuichi HIRANO Toru TANIGUCHI Jiro HIROKAWA Makoto ANDO
Dense millimeter-wave networks are a promising candidate for next-generation cellular systems enabling multiple gigabit-per-second data rates. A major disadvantage of millimeter-wave systems is signal disruption by rain, and here we propose a novel method for rain sensing using dual-frequency measurements at 25 and 38GHz from a small-scale Tokyo Institute of Technology (Tokyo Tech) millimeter-wave network. A real-time algorithm is developed for estimating the rain rate from attenuation using both ITU-R relationships and new coefficients that consider the effects of the rain Drop Size Distribution (DSD). The suggested procedure is tested on measured data, and its performance is evaluated. The results show that the proposed algorithm yields estimates that agree very well with rain gauge data.
In cognitive radio (CR), superposition cooperative spectrum sensing (SPCSS) is able to offer a much improved sensing reliability compared to individual sensing. Because of the differences in sensing channel condition, the reporting order for each cognitive radio user (CU) will highly affect the sensing performance of the network. In this paper, we propose an algorithm to assign the best reporting order to each CU in order to maximize sensing performance under SPCSS. The numerical results show that the proposed scheme can obtain the same performance as the optimal scheme.
Joon-young JUNG Dong-oh KANG Jang-ho CHOI Changseok BAE Dae-young KIM
In this paper, we propose an error-correction low-pass filter (EC-LPF) algorithm for estimating the wireless distance between devices. To measure this distance, the received signal strength indication (RSSI) is a popularly used method because the RSSI of a wireless signal, such as Wi-Fi and Bluetooth, can be measured easily without the need for additional hardware. However, estimating the wireless distance using an RSSI is known to be difficult owing to the occurrence of inaccuracies. To examine the inaccuracy characteristics of Bluetooth RSSI, we conduct a preliminary test to discover the relationship between the actual distance and Bluetooth RSSI under several different environments. The test results verify that the main reason for inaccuracy is the existence of measurement errors in the raw Bluetooth RSSI data. In this paper, the EC-LPF algorithm is proposed to reduce measurement errors by alleviating fluctuations in a Bluetooth signal with responsiveness for real-time applications. To evaluate the effectiveness of the EC-LPF algorithm, distance accuracies of different filtering algorithms are compared, namely, a low-pass filer (LPF), a Kalman filter, a particle filter, and the EC-LPF algorithm under two different environments: an electromagnetic compatibility (EMC) chamber and an indoor hall. The EC-LPF algorithm achieves the best performance in both environments in terms of the coefficient of determination, standard deviation, measurement range, and response time. In addition, we also implemented a meeting room application to verify the feasibility of the EC-LPF algorithm. The results prove that the EC-LPF algorithm distinguishes the inside and outside areas of a meeting room without error.
Tatsuhiko HATANAKA Takehiro ITO Xiao ZHOU
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a list coloring, given a list of allowed colors for each vertex. This problem is known to be PSPACE-complete for bipartite planar graphs. In this paper, we first show that the problem remains PSPACE-complete even for bipartite series-parallel graphs, which form a proper subclass of bipartite planar graphs. We note that our reduction indeed shows the PSPACE-completeness for graphs with pathwidth two, and it can be extended for threshold graphs. In contrast, we give a polynomial-time algorithm to solve the problem for graphs with pathwidth one. Thus, this paper gives sharp analyses of the problem with respect to pathwidth.
Yanzhao MA Shaoxi WANG Shengbing ZHANG Xiaoya FAN Ran ZHENG
A current mode buck/boost DC-DC converter with automatic mode transition is presented in this paper. At heavy load, a control scheme adaptively changes operation mode between peak and valley current modes to achieve high efficiency, small output voltage ripple, and fast transient response. The switching loss is reduced by operating in pure modes, and the conduction loss is reduced by decreasing the average inductor current in transition modes. At light load, the equivalent switching frequency is decreased to reduce the switching loss. An automatic mode transition between heavy load PWM mode and light load PFM mode is achieved by introducing an average load current sensing method. The converter has been implemented with a standard 0.5,$mu$m CMOS process. The output voltage ripple is less than 10,mV in all modes, and the peak efficiency is 95%.
Ki-Ro KIM Dong-Hyun HA Hyoung-Kyu SONG
Generally, in order to extend the cell coverage of a mobile station, relay stations are used at a cell edge in a cellular system. But, received signals in a relay station of a cell edge have a large error because a neighboring cell transmits the signals for other users. Since the transmitted signals for other users are interference for received signals in the relay station of the cell edge, the relay station has a negative effect on the bit error ratio performance. The cell coverage can not be extended stably. In order to expand the cell coverage stably, the inter-cell interference has to cancel. Thus, in this paper, the technique that the inter-cell interference (ICI) is canceled by cooperative relays is proposed. Also, diversity gain is obtained by cooperative relays.
Fábio S. MONTEIRO Denise H. GOYA Routo TERADA
The MQ problem, which consists of solving a system of multivariate quadratic polynomials over a finite field, has attracted the attention of researchers for the development of public-key cryptosystems because (1) it is NP-complete, (2) there is no known polynomial-time algorithm for its solution, even in the quantum computational model, and (3) it enables cryptographic primitives of practical interest. In 2011, Sakumoto, Shirai and Hiwatari presented two new zero-knowledge identification protocols based exclusively on the MQ problem. The 3-pass identification protocol of Sakumoto et al. has impersonation probability 2/3. In this paper, we propose an improvement that reduces the impersonation probability to 1/2. The result is a protocol that reduces the total computation time, the total communication needed and requires a smaller number of rounds for the same security level. We also present a new extension that achieves an additional communication reduction with the use of some smaller hash commitments, but maintaining the same security level.
Kento NISHII Yosuke TANIGAWA Hideki TODE
What should be the ultimate form of the cloud computing environment? The solution should have two important features; “Fine-Granularity” and “Participation.” To realize an attractive and feasible solution with these features, we propose a “participating fine-grained cloud computing platform” that a large number of personal or small-company resource suppliers participate in, configure and provide cloud computing on. This enables users to be supplied with smaller units of resources such as computing, memory, content, and applications, in comparison with the traditional Infrastructure as a Service (IaaS). Furthermore, to search for nearby resources efficiently among the many available on the platform, we also propose Resource Breadcrumbs (RBC) as a key technology of our proposed platform to provide in-network guidance capability autonomously for users' queries. RBC allows supplier-nodes to distribute guidance information directed to themselves with dedicated control messages; in addition, the information can be logged along the trail of message from supplier to user. With this distributed information, users can to autonomously locate nearby resources. Distributed management also reduces computational load on the central database and enables a participating fine-grained cloud platform at lower cost.
Parinya CHALERMSOOK Hiroshi IMAI Vorapong SUPPAKITPAISARN
In this letter, we derive two lower bounds for the number of terms in a double-base number system (DBNS), when the digit set is {1}. For a positive integer n, we show that the number of terms obtained from the greedy algorithm proposed by Dimitrov, Imbert, and Mishra [1] is $Thetaleft(rac{log n}{log log n} ight)$. Also, we show that the number of terms in the shortest double-base chain is Θ(log n).
Nguyen Ngoc BINH Pham Van HUONG Bui Ngoc HAI
Optimizing embedded software is a problem having scientific and practical signification. Optimizing embedded software can be done in different phases of the software life cycle under different optimal conditions. Most studies of embedded software optimization are done in forward engineering and these studies have not given an overall model for the optimization problem of embedded software in both forward engineering and reverse engineering. Therefore, in this paper, we propose a new approach to embedded software optimization based on reverse engineering. First, we construct an overall model for the embedded software optimization in both forward engineering and reverse engineering and present a process of embedded software optimization in reverse engineering. The main idea of this approach is that decompiling executable code to source code, converting the source code to models and optimizing embedded software under different levels such as source code and model. Then, the optimal source code is recompiled. To develop this approach, we present two optimization techniques such as optimizing power consumption of assembly programs based on instruction schedule and optimizing performance based on alternating equivalent expressions.
Tomomi ENDOU Shunta SAKAI Takeo FUJII
Recently, the growing concepts that information communication technologies apply to social infrastructures have caused deep interests with wireless sensor networks (WSNs). WSNs can be used for various application areas such as home, health, factory and so on. For the different application areas, there are different technical issues (e.g., security, reliability, real time gathering, long life time, scalability). Efficient information gathering can be potentially obtained if we take a suitable information gathering method with considering the requirements of each WSN application. Thus, we have not persisted all information gathering perfectly and have proposed one of simple information gathering methods in response to the requirements of WSN applications in this paper. In the proposed method, the information is converted to physical-layer parameters of wireless communications, such as frequency and time. Also, simulations are performed to validate the effectiveness of the proposed method in real time gathering and estimating with high precision.
Dieu-Huong VU Yuki CHIBA Kenro YATAKE Toshiaki AOKI
Verification of a design with respect to its requirement specification is important to prevent errors before constructing an actual implementation. The existing works focus on verifications where the specifications are described using temporal logics or using the same languages as that used to describe the designs. Our work considers cases where the specifications and the designs are described using different languages. To verify such cases, we propose a framework to check if a design conforms to its specification based on their simulation relation. Specifically, we define the semantics of the specifications and the designs commonly as labelled transition systems (LTSs). We appreciate LTSs since they could interpret information about the system and actions that the system may perform as well as the effect of these actions. Then, we check whether a design conforms to its specification based on the simulation relation of their LTS. In this paper, we present our framework for the verification of reactive systems, and we present the case where the specifications and the designs are described in Event-B and Promela/Spin, respectively. We also present two case studies with the results of several experiments to illustrate the applicability of our framework on practical systems.
Hiroshi IMAI Vorapong SUPPAKITPAISARN
In this paper, we improve a width-3 joint sparse form proposed by Okeya, Katoh, and Nogami. After the improvement, the representation can attain an asymtotically optimal complexity found in our previous work. Although claimed as optimal by the authors, the average computation time of multi-scalar multiplication obtained by the representation is 563/1574n+o(n)≈0.3577n+o(n). That number is larger than the optimal complexity 281/786n+o(n)≈0.3575n+o(n) found in our previous work. To optimize the width-3 joint sparse form, we add more cases to the representation. After the addition, we can show that the complexity is updated to 281/786n+o(n)≈0.3575n+o(n), which implies that the modified representation is asymptotically optimal. Compared to our optimal algorithm in the previous work, the modified width-3 joint sparse form uses less dynamic memory, but it consumes more static memory.
The mappings from independent binary variables to quadrature amplitude modulation (QAM) symbols are developed. Based the proposed mappings and the existing binary mutually uncorrelated complementary sequence sets (MUCSSs), a construction producing QAM periodic complementary sequence sets (PCSSs) is presented. The resultant QAM PCSSs have the same numbers and periods of sub-sequences as the binary MUCSSs employed, and the family size of new sequence sets is increased with exponent of periods of sub-sequences. The proposed QAM PCSSs can be applied to CDMA or OFDM communication systems so as to suppress multiple access interference (MAI) or to reduce peak-to-mean envelope power ratio (PMEPR), respectively.