Takefumi YOSHIKAWA Yoshihide KOMATSU Tsuyoshi EBUCHI Takashi HIRATA
A transceiver macro for high-speed data transmission via cable in vehicles is proposed. The transceiver uses ac coupling and bi-directional interface topology for protecting LSIs against unexpected short of cable and harness/chassis and has a spread-spectrum-clocking (SSC) generator that reduces noise due to electromagnetic interference. A driver current control has been used for fast switching of data direction on ac-coupled interfaces. An adaptive bandwidth control has been used in a Δ ∑ PLL to improve SCC significantly. A test chip has been fabricated and shows stable and bi-directional data communication with data rate of 162 to 972 Mbps through 20-m cable. Thanks to an optimum calibration of the SSC-PLL bandwidth, it reduces peak power at 33 kHz by -23 dB and provides 2% modulation at a data rate of 810 Mbps.
Tran Nguyen TRUNG Hideo KAMADA Kazuhiko KINOSHITA Nariyoshi YAMAI Tetsuya TAKINE Koso MURAKAMI
As one of the technologies for the retrieval of desired contents over large-scale networks, multi-agent systems are receiving much attention. Since there are too many contents on the network to search them all exhaustively, some applications on multi-agent systems have time constraints, that is, they must obtain a result by a given deadline. To find better results for such applications, it is important for the agents to complete their tasks on as many nodes as possible by the deadline. However, most existing agent systems using round robin scheduling disciplines do not take time constraints into account. Therefore, agents are likely to miss their deadlines on many nodes. In this paper, we propose an efficient agent-dispatching method for time-constrained applications. This method decides creation and migration of a clone agent according to the estimated value of the number of agents that would have completed their tasks by the deadline. The results of our performance evaluation show that the proposed method increases the number of agents that complete their tasks.
Often, the major requisites of short-range communication systems are low power consumption and low cost, rather than high data-transmission speeds. This paper proposes low-cost and extremely low-power radio communication devices that use a basic one-chip microcomputer for short-range transmission and reception. In the proposed transmitter, a rectangular wave is generated at external I/O ports as carrier by the basic one-chip microcomputer and is then filtered and radiated by an antenna circuit. In the proposed receiver, the received signal is detected by a radio IC and is subsequently digitally processed by a microcomputer with a built-in A/D converter. The proposed transmitter and receiver are demonstrated, and the system performance is experimentally evaluated.
Autonomous Decentralized System (ADS) has been making progress in these 31 years since it was proposed in 1977. During these long years in the rapidly advancing computer and communication technologies, the ADS concept has not been changed but its technologies have been growing in accordance with the change and diversity of the social, economical and personal requirements and through the globalization of the market and the restructuring organizations. The ADS technologies are systematized to cover all processes of system design, operation, maintenance and modification. This paper reviews the work done in fields of ADS in past 31 years from not only technological perspectives, but it also encompasses users requirements and value, system design, industrial activity, academic activity and standardization [1]-[26]. Moreover the new directions of the ADS are suggested.
Modern microprocessors achieve high application performance at the acceptable level of power dissipation. In terms of power to performance trade-off, the instruction window is particularly important. This is because enlarging the window size achieves high performance but naive scaling of the conventional instruction window can severely increase the complexity and power consumption. In this paper, we propose low-power instruction window techniques for contemporary microprocessors. First, the small reorder buffer (SROB) reduces power dissipation by deferred allocation and early release. The deferred allocation delays the SROB allocation of instructions until their all data dependencies are resolved. Then, the instructions are executed in program order and they are released faster from the SROB. This results in higher resource utilization and low power consumption. Second, we replace a conventional issue queue by a direct lookup table (DLT) with an efficient tag translation technique. The translation scheme resolves the instruction dependency, especially for the case of one producer to multiple consumers. The efficiency of the translation scheme stems from the fact that the vast majority of instruction dependency exists within a basic block. Experimental results show that our proposed design reduces the power consumption significantly for SPEC2000 benchmarks.
Vinh TRAN QUANG Takumi MIYOSHI
Wireless sensor network (WSN) is a promising approach for a variety of applications. Routing protocol for WSNs is very challenging because it should be simple, scalable, energy-efficient, and robust to deal with a very large number of nodes, and also self-configurable to node failures and changes of the network topology dynamically. Recently, many researchers have focused on developing hierarchical protocols for WSNs. However, most protocols in the literatures cannot scale well to large sensor networks and difficult to apply in the real applications. In this paper, we propose a novel adaptive routing protocol for WSNs called ARPEES. The main design features of the proposed method are: energy efficiency, dynamic event clustering, and multi-hop relay considering the trade-off relationship between the residual energy available of relay nodes and distance from the relay node to the base station. With a distributed and light overhead traffic approach, we spread energy consumption required for aggregating data and relaying them to different sensor nodes to prolong the lifetime of the whole network. In this method, we consider energy and distance as the parameters in the proposed function to select relay nodes and finally select the optimal path among cluster heads, relay nodes and the base station. The simulation results show that our routing protocol achieves better performance than other previous routing protocols.
Masayoshi ODA Yoshihiro YAMAGAMI Junji KAWATA Yoshifumi NISHIO Akio USHIDA
We propose here a fully Spice-oriented design algorithm of op-amps for attaining the maximum gains under low power consumptions and assigned slew-rates. Our optimization algorithm is based on a well-known steepest descent method combining with nonlinear programming. The algorithm is realized by equivalent RC circuits with ABMs (analog behavior models) of Spice. The gradient direction is decided by the analysis of sensitivity circuits. The optimum parameters can be found at the equilibrium point in the transient response of the RC circuit. Although the optimization time is much faster than the other design tools, the results might be rough because of the simple transistor models. If much better parameter values are required, they can be improved with Spice simulator and/or other tools.
We point out that the interval algorithm can be expressed in the form of a shift on the sequence space. Then we clarify that, by using a Bernoulli process, the interval algorithm can generate only a block of Markov chains or a sequence of independent blocks of Markov chains but not a stationary Markov process. By virtue of the finitary coding constructed by Hamachi and Keane, we obtain the procedure, called the finitary interval algorithm, to generate a Markov process by using the interval algorithm. The finitary interval algorithm also gives maps, defined almost everywhere, which transform a Markov measure to a Bernoulli measure.
Keat Beng TOH Shin'ichi TACHIKAWA
This paper proposes a combination of novel Received Response (RR) sequence at the transmitter and Matched Filter-Equalizer-RAKE (MF-EQZ-RAKE) combining scheme receiver system for Direct Sequence-Ultra Wideband (DS-UWB) multipath channel model. When binary code sequence such as M sequence is used, there is a possibility of generating extra Inter-Symbol Interference (ISI) in the UWB system. Therefore, it is quite a challenging task to collect the energy efficiently although RAKE reception method is applied at the receiver. The main purpose of the proposed system is to overcome the performance degradation for UWB transmission due to the occurrence of Inter-Symbol Interference (ISI) during high speed transmission of ultra short pulses in a multipath channel. The proposed system improves the system performance by improving the RAKE reception performance using RR sequence and suppressing the ISI effect with the equalizer. Simulation results verify that significant improvement can be obtained by the proposed system especially in UWB multipath channel models such as channel CM4 that suffered severe ISI effect.
In this paper we compare various parallel preconditioners such as Point-SSOR (Symmetric Successive OverRelaxation), ILU(0) (Incomplete LU) in the Wavefront ordering, ILU(0) in the Multi-color ordering, Multi-Color Block SOR (Successive OverRelaxation), SPAI (SParse Approximate Inverse) and pARMS (Parallel Algebraic Recursive Multilevel Solver) for solving large sparse linear systems arising from two-dimensional PDE (Partial Differential Equation)s on structured grids. Point-SSOR is well-known, and ILU(0) is one of the most popular preconditioner, but it is inherently serial. ILU(0) in the Wavefront ordering maximizes the parallelism in the natural order, but the lengths of the wavefronts are often nonuniform. ILU(0) in the Multi-color ordering is a simple way of achieving a parallelism of the order N, where N is the order of the matrix, but its convergence rate often deteriorates as compared to that of natural ordering. We have chosen the Multi-Color Block SOR preconditioner combined with direct sparse matrix solver, since for the Laplacian matrix the SOR method is known to have a nondeteriorating rate of convergence when used with the Multi-Color ordering. By using block version we expect to minimize the interprocessor communications. SPAI computes the sparse approximate inverse directly by least squares method. Finally, ARMS is a preconditioner recursively exploiting the concept of independent sets and pARMS is the parallel version of ARMS. Experiments were conducted for the Finite Difference and Finite Element discretizations of five two-dimensional PDEs with large meshsizes up to a million on an IBM p595 machine with distributed memory. Our matrices are real positive, i.e., their real parts of the eigenvalues are positive. We have used GMRES(m) as our outer iterative method, so that the convergence of GMRES(m) for our test matrices are mathematically guaranteed. Interprocessor communications were done using MPI (Message Passing Interface) primitives. The results show that in general ILU(0) in the Multi-Color ordering and ILU(0) in the Wavefront ordering outperform the other methods but for symmetric and nearly symmetric 5-point matrices Multi-Color Block SOR gives the best performance, except for a few cases with a small number of processors.
The steady approach of advanced nations toward realization of ubiquitous computing societies has given birth to rapidly growing demands for new-generation distributed computing (DC) applications. Consequently, economic and reliable construction of new-generation DC applications is currently a major issue faced by the software technology research community. What is needed is a new-generation DC software engineering technology which is at least multiple times more effective in constructing new-generation DC applications than the currently practiced technologies are. In particular, this author believes that a new-generation building-block (BB), which is much more advanced than the current-generation DC object that is a small extension of the object model embedded in languages C++, Java, and C#, is needed. Such a BB should enable systematic and economic construction of DC applications that are capable of taking critical actions with 100-microsecond-level or even 10-microsecond-level timing accuracy, fault tolerance, and security enforcement while being easily expandable and taking advantage of all sorts of network connectivity. Some directions considered worth pursuing for finding such BBs are discussed.
Yusuke UCHIDA Sei SUNAHARA Eisaburo ITAKURA Hiroyuki MASUYAMA Shoji KASAHARA Yutaka TAKAHASHI
Hybrid FEC/ARQ, which is a mixture of forward error correction (FEC) and automatic repeat request (ARQ), is a well-known technique aiming for packet-loss recovery to guarantee quality of service (QoS) for real-time communications. In this paper, focusing on layered video transmission over wireless network environment, we propose a proactive retransmission scheme for hybrid FEC/ARQ. In the proposed scheme, a receiver host periodically sends probe packets to a sender host in order to check wireless channel state. If the sender host does not receive any probe packet during a pre-specified interval, it regards the wireless channel as being in burst loss state, and it proactively retransmits packets expected to be lost during the burst loss period. The buffer management associated with layered video coding is also taken into consideration. The performance of the proposed scheme is investigated by simulation. Numerical examples show that the proposed scheme transmits packets of the base layer more successfully than the conventional FEC/ARQ.
Toshiya NAKAJIMA Tetsuya IZU Tsuyoshi TAKAGI
The ηT pairing for supersingular elliptic curves over GF(3m) has been paid attention because of its computational efficiency. Since most computation parts of the ηT pairing are GF(3m) multiplications, it is important to improve the speed of the multiplication when implementing the ηT pairing. In this paper we investigate software implementation of GF(3m) multiplication and propose using irreducible trinomials xm+axk+b over GF(3) such that k is a multiple of w, where w is the bit length of the word of targeted CPU. We call the trinomials "reduction optimal trinomials (ROTs)." ROTs actually exist for several m's and for typical values of w = 16 and 32. We list them for extension degrees m = 97, 167, 193, 239, 317, and 487. These m's are derived from security considerations. Using ROTs, we are able to implement efficient modulo operations (reductions) for GF(3m) multiplication compared with cases in which other types of irreducible trinomials are used (e.g., trinomials with a minimum k for each m). The reason for this is that for cases using ROTs, the number of shift operations on multiple precision data is reduced to less than half compared with cases using other trinomials. Our implementation results show that programs of reduction specialized for ROTs are 20-30% faster on 32-bit CPU and approximately 40% faster on 16-bit CPU compared with programs using irreducible trinomials with general k.
Myoung-Won LEE Cheol MUN Dong-Hee KIM Jong-Gwan YOOK
In this letter, a codebook based multiuser MIMO precoding scheme is proposed for a space-division multiple access (SDMA) system with limited feedback. Focusing on the case of SDMA systems with two transmit antennas, a precoder codebook design is proposed based on the idea that a precoder inducing larger fluctuations in the signal to interference and noise ratio (SINR) at each link can lead to a larger gain in terms of multiuser diversity. It is shown that the proposed multiuser MIMO precoding outperforms existing multiuser MIMO techniques in terms of the average system throughput.
Akitoshi SHIMURA Takeiki AIZONO Masashi HIRAIWA Shigeki SUGANO
A QoS management technique based on an autonomous decentralized mobility system, which is an autonomous decentralized system enhanced to provide mobile stations with information about urgent roadway situations, is proposed in this paper. This technique enables urgent messages to be flexibly and quickly transmitted to mobile stations by multiple decentralized base stations using dedicated short range communication. It also supports the easy addition of additional base stations. Each station autonomously creates information-delivery communities based on the urgency of the messages it receives through the roadside network and the distances between the senders and receivers. Each station dynamically determines the urgency of messages according to the message content and the speed of the mobile stations. Evaluation of this technique applied to the Smart Gateway system, which provides driving-assistance services to mobile stations through dedicated short-range communication, demonstrated its effectiveness and that it is suitable for actual systems.
Young-Sang KIM Yunjae SUH Hong-June PARK Jae-Yoon SIM
Two phase detectors (PD) are proposed to minimize the phase offset and deadzone when used in DLL or PLL. With the shortest symmetrical racing paths from both inputs, the binary PD achieves fast latch operation and theoretical elimination of the setup time. In contrast to the conventional PDs whose offsets are around 10 ps with large sensitivity to sizing, the proposed binary PD shows an offset of less than 1 ps with a reduction of 30-percent delay time. The proposed latch-type binary phase detection is also expanded to form a linear PD by the addition of a reset-generating circuit.
Hafiz Farooq AHMAD Hiroki SUGURI Muhammad Qaisar CHOUDHARY Ammar HASSAN Ali LIAQAT Muhammad Umer KHAN
Wireless technology has become widely popular and an important means of communication. A key issue in delivering wireless services is the problem of congestion which has an adverse impact on the Quality of Service (QoS), especially timeliness. Although a lot of work has been done in the context of RRM (Radio Resource Management), the deliverance of quality service to the end user still remains a challenge. Therefore there is need for a system that provides real-time services to the users through high assurance. We propose an intelligent agent-based approach to guarantee a predefined Service Level Agreement (SLA) with heterogeneous user requirements for appropriate bandwidth allocation in QoS sensitive cellular networks. The proposed system architecture exploits Case Based Reasoning (CBR) technique to handle RRM process of congestion management. The system accomplishes predefined SLA through the use of Retrieval and Adaptation Algorithm based on CBR case library. The proposed intelligent agent architecture gives autonomy to Radio Network Controller (RNC) or Base Station (BS) in accepting, rejecting or buffering a connection request to manage system bandwidth. Instead of simply blocking the connection request as congestion hits the system, different buffering durations are allocated to diverse classes of users based on their SLA. This increases the opportunity of connection establishment and reduces the call blocking rate extensively in changing environment. We carry out simulation of the proposed system that verifies efficient performance for congestion handling. The results also show built-in dynamism of our system to cater for variety of SLA requirements.
We consider a problem of global asymptotic stabilization of a class of nonlinear systems that have the unknown linear growth rate. While the existing results only deal with one specified form of nonlinear systems, our proposed method includes both forms of triangular and feedforward nonlinear systems in a unified framework. The proposed controller has a dynamic gain mechanism which is selectively engaged based on the given nonlinear form. Then, the dynamic gain is adaptively tuned depending on the unknown linear growth rate.
This paper presents analysis and identification method of Wiener-Hammerstein system to characterize a nonlinear RF transmitter in fundamental frequency zone. A two-tone signal is used to analyze and identify a Wiener-Hammerstein model. A RF signal is converted to baseband-equivalent complex signal, and Wiener-Hammerstein model is considered to have a baseband equivalent complex polynomial and linear filters. For a two-tone input signal, closed form descriptions of the output signal in the time domain and frequency domain are developed using a newly suggested nonlinearly modulated two-tone phasors (NMTP). The relationship between frequency terms of input and output signals in RF transmitters are represented with linear matrix-vector equation based on NMTP analysis. An advantage of the proposed method is its simplicity using closed form analysis and linear approximation. In addition, we can model a wideband system with relatively narrowband measurements by sweeping two-tone signal. The prediction of spectral regrowth and the predistortion performance for WiBro 1FA signal demonstrate the validity of the proposed approach in identifying the nonlinear RF transmitters.
Shigeyuki MITSUI Katsumi SAKATA Hiroya NOBORI Setsuko KOMATSU
Clustering is indispensable to obtain a general view of series data from a number of data such as gene expression profiles. We propose a novel metric for clustering. The proposed metric automatically normalizes data to minimize a logarithmic scale distance between the data series.