A swing level controlled voltage-mode transmitter is proposed to support a stub series-terminated logic channel with center-tapped termination. This transmitter provides a swing level control to support the diagnostic mode and improve the signal integrity in the absence of the destination termination. By using the variable parallel termination, the proposed transmitter maintains the constant output impedance of the source termination while the swing level is controlled. Also, the series termination using an external resistor is used to reduce the impedance mismatch effect due to the parasitic components of the capacitor and inductor. To verify the proposed transmitter, the voltage-mode driver, which provides eight swing levels with the constant output impedance of about 50 Ω, was implemented using a 70 nm 1-poly 3-metal DRAM process with a 1.5 V supply. The jitter reduction of 54% was measured with the swing level controlled voltage-mode driver in the absence of the destination termination at 1.6-Gb/s.
Ki-Ho LEE Hyun-Ho CHOI Dong-Ho CHO
Hierarchical constellations offer a different property of robustness to the multiple bits that construct a symbol according to channel errors. We apply the characteristics of hierarchical constellations to a multi-user cellular system that has limited modulation levels, in order to improve cell capacity. We propose an adaptive resource allocation scheme based on the hierarchical constellation in which a symbol is shared by multiple users and each bit in a symbol is allocated adaptively according to the channel condition of each user. The numerical results show that the proposed resource allocation scheme provides mobile users with higher modulation levels so that the cell capacity is improved.
We propose a call admission control scheme in cellular and wireless local area networks (WLANs) integration: integrated service-based admission control with load-balancing capability (ISACL). The novel aspects of the ISACL scheme include that load transfer in the cellular/WLAN overlapping areas is allowed for the admission of originating data calls from the area with cellular access only and vertical handoff requests to the cellular network. Packet-level quality of service (QoS) constraints in the WLANs and other-cell interference in the code division multiple access (CDMA) cellular network are taken into account to derive the WLANs and cellular capacity. We model the integrated networks using a multi-dimensional Markov chain and the important performance measures are derived for effective optimization of the admission parameters. The analytical model is validated by a computer simulation. The variation of admission parameters with traffic load and the dependence of resource utilization on admission parameters are investigated. It is shown that optimal balancing of the traffic load between the cellular network and WLANs results in the maximum resource utilization. Numerical results demonstrate that substantial performance improvements can be achieved by applying the proposed ISACL scheme.
Traditional double auction protocols only concern the price information of participants without considering their QoS requirements, which makes them unsuitable for the service grid. In this paper we first introduce QoS information into double auction to present the QoS-enabled Double Auction Protocol (QDAP). QDAP tries to assign the asks which have the least candidate bids firstly to make more participants trade and provides QoS guarantee at the same time. Simulation experiments have been performed to compare QDAP with two traditional double auction protocols and the result shows that QDAP is more suitable for the service grid.
This paper focuses on the development of Cramer-Rao Bound (CRB) expressions for passive source location estimation in various Gaussian noise environments. The scenarios considered involve an unknown deterministic source signal with a short time duration, and additive general Gaussian noise. The mathematical derivation procedure presented is applicable to non-stationary Gaussian noise problems. Specifically, explicit closed-form CRB expressions are presented using the spectrum representation of the signal and noise for stationary Gaussian noise cases.
Dongwook CHOI Dongwoo LEE Jae Hong LEE
In this paper, we propose a new subcarrier allocation algorithm for a downlink OFDMA relay network with multicells. In the proposed algorithm, subcarriers are allocated to users and relays to maximize the overall sum of the achievable rate under fairness constraints. Simulation results show that the proposed algorithm achieves higher data rate than the static algorithm and reduces the outage probability compared to the static and greedy algorithms.
Shinpei HAYASHI Yasuyuki TSUDA Motoshi SAEKI
This paper proposes a technique for detecting the occurrences of refactoring from source code revisions. In a real software development process, a refactoring operation may sometimes be performed together with other modifications at the same revision. This means that detecting refactorings from the differences between two versions stored in a software version archive is not usually an easy process. In order to detect these impure refactorings, we model the detection within a graph search. Our technique considers a version of a program as a state and a refactoring as a transition between two states. It then searches for the path that approaches from the initial to the final state. To improve the efficiency of the search, we use the source code differences between the current and the final state for choosing the candidates of refactoring to be applied next and estimating the heuristic distance to the final state. Through case studies, we show that our approach is feasible to detect combinations of refactorings.
Junko SHIROGANE Takashi MORI Hajime IWATA Yoshiaki FUKAZAWA
Computers and software have become necessities in human society, and most people are required to be able to use them. However, software is not always accessible for users with special needs, and it is difficult to develop software accessible to such users. There are many guidelines and support tools for developing accessible websites. For software, however, such guidelines and support tools are few. In our research, to develop accessible software easily we propose a method of evaluating the accessibility of Graphical User Interface (GUI) software. This method involves analyzing GUI software source programs, assessing accessibility on the basis of accessibility guidelines, and presenting a list of unsatisfactory accessibility code and indicating how to modify it.
In most cases in wireless networks, a user has a two-way communication that consists of two sessions: uplink and downlink sessions, and its overall satisfaction to the communication depends on the quality of service of both sessions. However, in most previous approaches in wireless resource allocation, the satisfactions of a user for its uplink and downlink sessions are modeled separately and treated independently, which fails to accurately model user's overall satisfaction to its communication. Hence, in this paper we model user's overall satisfaction to its communication considering both its uplink and downlink sessions. To this end, we propose a novel concept for a utility function to model user's overall satisfaction to its communication, which is called a user-level utility function, considering user's satisfaction to uplink and downlink sessions jointly. To show the appropriateness of our approach, we apply our user-level utility functions to scheduling problems in TDMA wireless networks and show the performance improvement of our approach over the traditional approach that does not treat uplink and downlink sessions of a user jointly.
Abhishek ROY Navrati SAXENA Jitae SHIN
In this letter we propose a novel resource allocation and admission control strategy for OFDMA-based emerging LTE systems. Considering users' reneging and migration between service providers, we first prove that the optimal resource allocation problem, which maximizes the service provider's gross income is, NP-complete. Subsequently, we propose two different heuristics based on dynamic programming and greedy algorithms to get a near-optimal resource allocation and admission control strategy in computationally feasible time. Simulation results point out that the solutions offer increased gross income of the service provider, while offering low latency, adequate throughput and session acceptance.
Masayoshi SHIMAMURA Hiroyuki KOGA Takeshi IKENAGA Masato TSURU
Introducing adaptive online data compression at network-internal nodes is considered for alleviating traffic congestion on the network. In this paper, we assume that advanced relay nodes, which possess both a relay function (network resource) and a processing function (computational and storage resources), are placed inside the network, and we propose an adaptive online lossless packet compression scheme utilized at these nodes. This scheme selectively compresses a packet according to its waiting time in the queue during congestion. Through preliminary investigation using actual traffic datasets, we investigate the compression ratio and processing time of packet-by-packet compression in actual network environments. Then, by means of computer simulations, we show that the proposed scheme reduces the packet delay time and discard rate and investigate factors necessary in achieving efficient packet relay.
Seung-young PARK Hyun-hee LEE Kyung-goo JUNG
In this letter, we propose a distributed channel assignment where each basestation selects a set of channels shared by multiple users through time domain scheduling for best effort services. The proposed scheme distributedly assigns the channels considering a cochannel interference from neighboring basestations and its own traffic load condition. The computer simulation demonstrates that the proposed scheme appropriately assigns the channels to the basestations taking into account these requirements.
Abedelaziz MOHAISEN Nam-Su JHO Dowon HONG DaeHun NYANG
Privacy preserving association rule mining algorithms have been designed for discovering the relations between variables in data while maintaining the data privacy. In this article we revise one of the recently introduced schemes for association rule mining using fake transactions (fs). In particular, our analysis shows that the fs scheme has exhaustive storage and high computation requirements for guaranteeing a reasonable level of privacy. We introduce a realistic definition of privacy that benefits from the average case privacy and motivates the study of a weakness in the structure of fs by fake transactions filtering. In order to overcome this problem, we improve the fs scheme by presenting a hybrid scheme that considers both privacy and resources as two concurrent guidelines. Analytical and empirical results show the efficiency and applicability of our proposed scheme.
Chee-Hyun PARK Kwang-Seok HONG
Estimating a location of mobile phones or sound source is of considerable interest in wireless communications and signal processing. In this letter, we propose squared range weighted least squares (SRWLS) using the range estimate attained from the Taylor series-based maximum likelihood. The weight can be determined more accurately when using the proposed method, compared with the existing methods using the variance of noise. The simulation results show that the proposed method is superior to the existing methods in RMSE as the measurement noise amount of sensors increases.
Marja MATINMIKKO Tapio RAUMA Miia MUSTONEN Ilkka HARJULA Heli SARVANKO Aarne MAMMELA
This paper reviews applications of fuzzy logic to telecommunications and proposes a novel fuzzy combining scheme for cooperative spectrum sensing in cognitive radio systems. A summary of previous applications of fuzzy logic to telecommunications is given outlining also potential applications of fuzzy logic in future cognitive radio systems. In complex and dynamic operational environments, future cognitive radio systems will need sophisticated decision making and environment awareness techniques that are capable of handling multidimensional, conflicting and usually non-predictable decision making problems where optimal solutions can not be necessarily found. The results indicate that fuzzy logic can be used in cooperative spectrum sensing to provide additional flexibility to existing combining methods.
Traditional algorithms for dynamic OFDMA resource allocation have relatively deterministic system capacity and user fairness. Thus, in this letter, an efficient scheme is proposed to flexibly adjust quality-of-service for users, which is achieved by appropriately setting minimum data-rate of each user.
Ya-Shih HUANG Yu-Ju HONG Juinn-Dar HUANG
In deep-submicron technology, several state-of-the-art architectural synthesis flows have already adopted the distributed register architecture to cope with the increasing wire delay by allowing multicycle communication. In this article, we regard communication synthesis targeting a refined regular distributed register architecture, named RDR-GRS, as a problem of simultaneous data transfer routing and scheduling for global interconnect resource minimization. We also present an innovative algorithm with regard of both spatial and temporal perspectives. It features both a concentration-oriented path router gathering wire-sharable data transfers and a channel-based time scheduler resolving contentions for wires in a channel, which are in spatial and temporal domain, respectively. The experimental results show that the proposed algorithm can significantly outperform existing related works.
Soonchul PARK Sungho HWANG Ho-Shin CHO
In this paper, we propose a scheme of frequency sub-band allocation to obtain maximum throughput in an orthogonal frequency division multiple access (OFDMA) system where each user has a finite number of packets to transmit, which are generated from packet calls with arbitrary size and arbitrary arrival rate. The proposed scheme is evaluated in terms of throughput and user fairness in comparison with the proportional fairness (PF) scheme and the Greedy scheme under the finite queue length condition. Numerical results show that the proposed scheme is superior to the Greedy scheme in terms of both throughput and fairness for finite queue length.
Ryo NOMURA Toshiyasu MATSUSHIMA Shigeichi HIRASAWA
The joint source-channel coding problem is considered. The joint source-channel coding theorem reveals the existence of a code for the pair of the source and the channel under the condition that the error probability is smaller than or equal to ε asymptotically. The separation theorem guarantees that we can achieve the optimal coding performance by using the two-stage coding. In the case that ε = 0, Han showed the joint source-channel coding theorem and the separation theorem for general sources and channels. Furthermore the ε-coding theorem (0 ≤ ε <1) in the similar setting was studied. However, the separation theorem was not revealed since it is difficult in general. So we consider the separation theorem in this setting.
Chin-Sean SUM Mohammad Azizur RAHMAN Zhou LAN Ryuhei FUNADA Junyi WANG Tuncer BAYKAS Hiroshi HARADA Shuzo KATO
In this paper, throughput and error performance analysis is conducted on the proposed space-time resource management (STRM) scheme to realize a multi-Gbps millimeter-wave wireless personal area network (WPAN) system. The proposed STRM allows multiple peer-to-peer communication links to occupy the same time-division-multiple-access (TDMA) time slot, in contrary to the conventional TDMA system that allocates only one time slot to one communication link. Theoretical analysis is performed to investigate the achievable system throughput in the presence of co-channel interference (CCI) generated by communication links co-sharing the same time slot. To increase accuracy, the analysis results are validated by Monte Carlo simulations. Firstly, it is found that the upper bound of the achievable throughput increases linearly with the number of communication links sharing the same time slot. However, optimum throughput exists corresponding to the CCI present in the system. Secondly, by manipulating a parameter that controls the allowable CCI in the network, the system throughput can be optimized. Lastly, it is also found that in a millimeter-wave band system, a victim system with transmitter-receiver separation of 1-meter can achieve bit error rate (BER) of 10-6 provided that the interferer is at least 6-meters away.