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.
Hirotoshi HONMA Shigeru MASUYAMA
Given a simple graph G with n vertices, m edges and k connected components. The spanning forest problem is to find a spanning tree for each connected component of G. This problem has applications to the electrical power demand problem, computer network design, circuit analysis, etc. An optimal parallel algorithm for finding a spanning tree on the trapezoid graph is given by Bera et al., it takes O(log n) time with O(n/log n) processors on the EREW (Exclusive-Read Exclusive-Write) PRAM. Bera et al.'s algorithm is very simple and elegant. Moreover, it can correctly construct a spanning tree when the graph is connected. However, their algorithm can not accept a disconnected graph as an input. Applying their algorithm to a disconnected graph, Concurrent-Write occurs once for each connected component, thus this can not be achieved on EREW PRAM. In this paper we present an O(log n) time parallel algorithm with O(n/log n) processors for constructing a spanning forest on trapezoid graph G on EREW PRAM even if G is a disconnected graph.
Xin XIAO Yuanchun SHI Yun TANG Nan ZHANG
During recent years, there has been a rapid growth in deployment of gossip-based protocol in many multicast applications. In a typical gossip-based protocol, each node acts as dual roles of receiver and sender, independently exchanging data with its neighbors to facilitate scalability and resilience. However, most of previous work in this literature seldom considered cheating issue of end users, which is also very important in face of the fact that the mutual cooperation inherently determines overall system performance. In this paper, we investigate the dishonest behaviors in decentralized gossip-based protocol through extensive experimental study. Our original contributions come in two-fold: In the first part of cheating study, we analytically discuss two typical cheating strategies, that is, intentionally increasing subscription requests and untruthfully calculating forwarding probability, and further evaluate their negative impacts. The results indicate that more attention should be paid to defending cheating behaviors in gossip-based protocol. In the second part of anti-cheating study, we propose a receiver-driven measurement mechanism, which evaluates individual forwarding traffic from the perspective of receivers and thus identifies cheating nodes with high incoming/outgoing ratio. Furthermore, we extend our mechanism by introducing reliable factor to further improve its accuracy. The experiments under various conditions show that it performs quite well in case of serious cheating and achieves considerable performance in other cases.
Chisa TAKANO Keita SUGIYAMA Masaki AIDA
We have previously proposed a diffusion-type flow control mechanism as a solution for severely time-sensitive flow control required for high-speed networks. In this mechanism, each node in a network manages its local traffic flow using the basis of only the local information directly available to it, by using predetermined rules. In addition, the implementation of decision-making at each node can lead to optimal performance for the whole network. Our previous studies show that our flow control mechanism with certain parameter settings works well in high-speed networks. However, to apply this mechanism to actual networks, it is necessary to clarify how to design a parameter in our control mechanism. In this paper, we investigate the range of the parameter and derive its optimal value enabling the diffusion-type flow control to work effectively.
Haruki NISHIMURA Mamiko INAMORI Yukitoshi SANADA
Through fractional sampling, it is possible to separate multipath components and achieve diversity gain. However, power consumption grows as the sampling rate increases. This paper proposes a novel scheme for OFDM systems that selects the sampling rate according to the channel's frequency response. Numerical results through computer simulation show that the proposed sampling rate selection scheme reduces power consumption by reducing oversampling ratio when delay spread is small.
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 developed a method for extracting feature patterns from multivariate data using a network of coupled phase oscillators subject to an analogue of the Kuramoto model for collective synchronization. Our method may be called data synchronization. We applied data synchronization to the care-needs-certification data, provided by Otsu City as a historical old city near Kyoto City, in the Japanese public long-term care insurance program to find the trend of the major patterns of the aging process for elderly people needing nursing care.
Takashi IMAMICHI Hiroshi NAGAMOCHI
In this paper, we consider a collision detection problem of spheres which asks to detect all pairs of colliding spheres in a set of n spheres located in d-dimensional space. We propose a collision detection algorithm for spheres based on slab partitioning technique and a plane sweep method. We derive a theoretical upper bound on the time complexity of the algorithm. Our bound tells that if both the dimension and the maximum ratio of radii of two spheres are bounded, then our algorithm runs in O(n log n + K) time with O(n + K) space, where K denotes the number of pairs of colliding spheres.
Hsin-Hung OU Bin-Da LIU Soon-Jyh CHANG
This paper proposes a low-voltage high-speed sample-and-hold (S/H) structure with excellent power efficiency. Based on the switched-opamp technique, an inverse-flip-around architecture which maximizes the feedback factor is employed in the proposed S/H. A skew-insensitive double-sampling mechanism is presented to increase the throughput by a factor of two while eliminating the timing mismatch associated with double-sampling circuits. Furthermore, a dual-input dual-output opamp is proposed to incorporate double-sampling into the switched-opamp based S/H. This opamp also removes the memory effect in double-sampling circuitry and features fast turn-on time to improve the speed performance in switched-opamp circuits. Simulation results using a 0.13-µm CMOS process model demonstrates the proposed S/H circuit has a total-harmonic-distortion of -67.3 dB up to 250 MSample/s and a 0.8 VPP input range at 0.8 V supply. The power consumption is 3.5 mW and the figure-of-merit is only 7.4 fJ/step.
This letter proposes a simple iterative decoding algorithm for the concatenation codes where the outer code is single-parity-check (SPC) code. The erroneous inner codewords are iteratively combined with maximum ratio combining (MRC) and then re-decoded. Compared with the conventional scheme where the RS outer code concatenation is algebraically decoded to recover the erasures, the proposed scheme has better performance due to MRC processing. On the other hand, the proposed scheme is less complex because the linear combination is simpler than algebraical decoding and the MRC gain can loose the requirement for inner decoder.
Cheolkyu SHIN Hyounkuk KIM Hyuncheol PARK
This letter proposes two efficient decision-feedback (DF) detection schemes for space-time block code (STBC) over time-selective fading channels. The existing DF detection causes error propagation when the first symbol is not detected correctly. However, the proposed detection schemes provide two candidates according to a channel gain or an average log-likelihood ratio (LLR) based selection rule and choose a better candidate for the first symbol. Simulation results show that the proposed detection schemes reduce error propagation and yield significant signal-to-noise ratio (SNR) gain with moderate complexity, compared to the existing DF detection scheme.
Youngjoo SUH Hoirin KIM Munchurl KIM
In this letter, we propose a new histogram equalization method to compensate for acoustic mismatches mainly caused by corruption of additive noise and channel distortion in speech recognition. The proposed method employs an improved test cumulative distribution function (CDF) by more accurately smoothing the conventional order statistics-based test CDF with the use of window functions for robust feature compensation. Experiments on the AURORA 2 framework confirmed that the proposed method is effective in compensating speech recognition features by reducing the averaged relative error by 13.12% over the order statistics-based conventional histogram equalization method and by 58.02% over the mel-cepstral-based features for the three test sets.
Takumi NOMURA Hiromi UEDA Takashi KURIYAMA Toshinori TSUBOI Hiroyuki KASAI
We have already proposed a Gigabit Ethernet-Optical Switched Access Network (GE-OSAN) architecture that realizes longer transmission distances and achieves higher security than the conventional Passive Optical Network (PON). To confirm the technical feasibility of the architecture, we introduce here a GE-OSAN prototype system for downstream transmission. We present the Optical Switching Module (OSM), which uses (Pb,La)(Zr,Ti)O3 (PLZT) optical packet switches, and show that it realizes switching within 10 ns of the designed position in the Inter-Frame Gap (IFG). We also introduce an Optical Network Unit (ONU) with optical burst receiver that uses off-the-shelf commercial devices to reduce its cost; two types of an optical to electrical signal (O/E) converter are implemented for performance comparison. After testing both of them, we select the one that satisfies our acquisition time requirement of 64 ns.
Tran Thanh DAI Choong Seon HONG
Security for wireless sensor networks (WSNs) has become an increasingly serious concern due to the requirement level of applications and hostile deployment areas. To enable secure services, cryptographic keys must be agreed upon by communicating nodes. Unfortunately, due to resource constraints, the key agreement problem in wireless sensor networks has become quite complicated. To tackle this problem, many public-key unrelated proposals which are considered more reasonable in cost than public key based approaches have been proposed so far including random based key pre-distribution schemes. One prominent branch of these proposals is threshold random key pre-distribution schemes. However these schemes still introduce either communication overhead or both communication and computational overheads to resource constrained sensor nodes. Considering this issue, we propose an efficient ID-based threshold random key pre-distribution scheme that not only retains all the highly desirable properties of the schemes including high probability of establishing pairwise keys, tolerance of node compromise but also significantly reduces communication and computational costs of each node. The proposed scheme is validated by a thorough analysis in terms of network resiliency and related overheads. In addition, we also propose a supplementary method to significantly improve the security of pairwise keys established indirectly.
Kenji NAKANISHI Akihiro OTAKA Yoichi MAEDA
This paper describes international standardization activities on B-PON, GE-PON, and G-PON. This paper explains their distinctive technologies, and compares them from the technical view. This paper also mentions future PON standards which are discussed in some standardization bodies.
Wavelet tree based watermarking algorithms are using the wavelet coefficient energy difference for copyright protection and ownership verification. WTQ (Wavelet Tree Quantization) algorithm is the representative technique using energy difference for watermarking. According to the cryptanalysis on WTQ, the watermark embedded in the protected image can be removed successfully. In this paper, we present a novel differential energy watermarking algorithm based on the wavelet tree group modulation structure, i.e. WTGM (Wavelet Tree Group Modulation). The wavelet coefficients of host image are divided into disjoint super trees (each super tree containing two sub-super trees). The watermark is embedded in the relatively high-frequency components using the group strategy such that energies of sub-super trees are close. The employment of wavelet tree structure, sum-of-subsets and positive/negative modulation effectively improve the drawbacks of the WTQ scheme for its insecurity. The integration of the HVS (Human Visual System) for WTGM provides a better visual effect of the watermarked image. The experimental results demonstrate the effectiveness of our algorithm in terms of robustness and imperceptibility.
A neighbor-aided authentication watermarking based on a chaotic system with feedback is proposed in this paper. This algorithm can not only detect malicious manipulations but reveal block substitutions when the VQ attack occurs. An image is partitioned into non-overlapped blocks. The pixels in one block and its neighboring block are combined to produce an authentication watermark based on a chaotic system with feedback, which is sensitive to the initial value. The produced watermark is embedded into the current block. During detection, the detector extracts the watermark firstly, then generates a reference sequence and compares it with the extracted watermark to authenticate the integrity of the image and locate the tampered regions. Experimental results prove the effectiveness of our method.
Erlin ZENG Shihua ZHU Ming XU Zhenjie FENG
Recently, it has been shown in the literature that in a relaying network utilizing multiple relay precoding techniques, the signal-to-noise ratio (SNR) at each destination node will scale linearly with the number of relays K, which is referred to as the distributed array gain (DAG) K. In this paper, we focus on the performance of multiple relay precoding based on limited channel state information (CSI) feedback, which is different from the prior studies that assume perfect CSI at each of the relay nodes. Our analysis shows that the conventional limited feedback scheme fails to obtain the DAG K, which is a consequence of the phase ambiguity introduced by the channel quantization function. Based on the theoretical analysis, we propose a novel feedback and precoding procedure, and prove that the proposed procedure can obtain the DAG K with only one additional feedback bit for quantizing each relay-destination channel compared with the conventional scheme. Simulation results verify that with the proposed procedure, the SNR performance is effectively improved when the number of relays K is small, and scales linearly with K in relatively large K regime.
Youn-Soo KIM Eun Ju LEE Bong Soo KIM Hyung Seok KIM
ZigBee recently has been used a lot in wireless sensor networks because of its low power consumption and affordable chips. However, ZigBee's existing hierarchical routing algorithm has a disadvantage in that a node may communicate with a nearby node over several hops. In this letter we propose a Quasi-Hierarchical Routing (QHR) algorithm that can improve the ZigBee hierarchical routing method's inefficiency by using brief information on neighbors within radio range. The network simulation evaluates this QHR's performance by comparing it to other ZigBee routing schemes.
Broadband access network planning strategies with techno-economic calculations are important topics, when optimal broadband network deployments are considered. This paper analyzes optimal deployment combination of digital subscriber line technologies (xDSL) and fiber to the home technologies (FTTx), following different user bandwidth demand scenarios. For this reason, optimal placement of remote digital subscriber line multiplexer (RDSLAM) is examined. Furthermore, the article also discusses the economy of investments, depending on certain investment threshold and the reach of different xDSL technologies. Finally, the difference between broadband network deployment in a characteristic urban and rural area in Republic of Slovenia, in terms of required optical cable dig length per household is shown. A tree structure network model of a traditional copper access network is introduced. A dynamic programming logic, with recursion as a basis of a tree structure examination and evaluation of optimal network elements placement is used. The tree structure network model considers several real network parameters (e.g.: copper cable lengths, user coordinates, node coordinates). The main input for the optimization is a local loop distance between each user and a candidate node for RDSLAM placement. Modelling of copper access networks with a tree structure makes new extensions in planning optimization of broadband access networks. Optimization of network elements placement has direct influence on efficiency and profitability of broadband access telecommunication networks.