A new simple recovery scheme for transient bit errors in the RAM of a ROM-based embedded system is presented, which exploits the information stored in the ROM. And a new scrubbing technique suitable to the proposed recovery scheme is also presented. With the proposed recovery scheme and scrubbing technique, the reliability of the RAM against transient bit errors can be improved remarkably with no additional extra memory and scrubbing overhead.
Hiroshi HASEGAWA Toshiyuki ONO Isao YAMADA Kohichi SAKANIWA
In this paper, we present a novel iterative MPEG super-resolution method based on an embedded constraint version of Adaptive projected subgradient method [Yamada & Ogura 2003]. We propose an efficient operator that approximates convex projection onto a set characterizing framewise quantization, whereas a conventional method can only handle a convex projection defined for each DCT coefficient of a frame. By using the operator, the proposed method generates a sequence that efficiently approaches to a solution of super-resolution problem defined in terms of quantization error of MPEG compression.
Jinsung OH Changhoon LEE Younam KIM
In this paper, we present a minimum-maximum exclusive weighted-mean filtering algorithm with adaptive window. Image pixels within the varying size of the window are ranked and classified as minimum-maximum and median levels, and then passed through the weighted-mean of median level and identity filters, respectively. The filtering window size is adaptively increasing according to noise ratio without noise measurement. Extensive simulations show that the proposed filter performs better than other median/rank-type filters in removing impulse noise of highly corrupted images.
A side-coupled microstrip open-loop resonator is presented for design of harmonic-suppressed bandpass filters with compact size. In geometry, the open-ended microstrip feed line is put in close proximity to the loop resonator at the opposite side of an opened-gap. In design, its length is properly lengthened to establish the orthogonal even- and odd-symmetrical current distributions along the two coupled strip conductors. It thus results in cancellation the 1st parasitic resonance. The two-stage open-loop filter is first constructed and its performance is studied under varied feed line lengths. Furthermore, a four-stage filter block is optimally designed at 2.52 GHz and its circuit sample is fabricated with the overall length less than 60% of one guided wavelength. The measured insertion loss at the 1st harmonic is higher than 30 dB, the stopband covers the range from 2.8 GHz to 7.0 GHz, and the dominant pass bandwidth is about 9.0%.
Unwanted electromagnetic emission occurs due to the common-mode current on the cables entering a PC's metal enclosure and can be treated as wire antennas passing through the apertures of the enclosure. To reduce the emission, a stack of metal rings is suggested to be placed around the cable and external to the aperture, adopting the concept of a Coaxial Band-Stop Filter, for the first time. The influence of this novel structure on the common-mode current is examined in the FDTD-method frame work.
Craig J. MITCHELL Giuseppe ABREU Ryuji KOHNO
In this paper we present a novel method for improving RAKE receiver reception in UWB systems. Due to the fact that practical pulses that can be produced for UWB-IR (Ultra Wideband-Impulse Radio) may occupy a longer time than the typical multipath resolution of the actual UWB channel, multiple channel components may arrive within this typical pulse width. Performance degradation may occur due to the resulting intrapulse (overlapping received pulses) interference. We here propose an adaptive, pilot aided RAKE receiver for UWB communications in the multipath environment. The proposed system estimates the actual received signal with intrapulse interference in each RAKE finger using projections onto a Hadamard-Hermite subspace. By exploiting the orthogonality of this subspace it is possible to decompose the received signal so as to better match the template waveform and reduce the effects of intrapulse interference. By using the projections onto this subspace, the dimension of the received signal is effectively increased allowing for adaptive correlator template outputs. RAKE receivers based on this proposal are designed which show significant performance improvement and require less fingers to achieve required performance than their conventional counterparts.
Ying LI Xudong GUO Xinmei WANG
Using several high rate recursive convolutional codes as the basic element and the trace criteria as the designing principle, a new kind of recursive space-time trellis code with more flexible and higher data rate is presented for the serially concatenated space-time code. When 2b-ary modulation and N transmit antennas are used, the data rate of the new code can be arranged from b bps/Hz to Nb-1bps/Hz by modifying the number of recursive convolutional codes and the data rate of each code.
Yong Ho KIM Tae Yong KIM Young Yong KIM
In this letter, we propose a novel approach for use in the analytical modeling of the overall performance of a Hybrid ARQ (type I and II) together with arbitrary channel model, based on Hidden Markov Model (HMM). Using the combined HMM model developed for involved ARQ protocols with the finite state channel model, such critical performance measure as throughput and delay can be derived in closed form. Analytical results are derived for Stop-and-Wait as well as Go-back-N type together with the type I and type II Hybrid ARQ scheme adopted. We compare the analytical results along with the simulation results in order to check the correctness our model, and show the efficiency of our approach by applying it to realistic environments such as the CDMA IS-95 system with its derived equations.
Hua-Yi LIN Yueh-Min HUANG Tzone-I WANG
Unlike traditional networks, the characteristics of mobile wireless devices that can dynamically form a network without any infrastructure and wired line mean that mobile ad hoc networks frequently display partition owing to node mobility or link failures. Consequently, an ad hoc network is difficult to provide on-line access to trusted authorities or centralized servers. Despite the existence of well-known security mechanisms, the absence of a stationary central authorization facility in an open and distributed communication environment is a major challenge. Consequently, applying traditional Public Key Infrastructure (PKI) security architecture to mobile ad hoc networks will create secure blind sides. Based on this perspective, this study proposes a novel scalable and robust cluster-organized key management scheme. Distribution of trust to an aggregation of cluster heads using a threshold scheme faculty provides mobile ad hoc networks with robust key management. Furthermore, the proposed approach provides Certificate Authority (CA) with a fault tolerance mechanism to prevent a single point of compromise or failure, and saves CA large repositories from maintaining member certificates, making the proposed approach more suitable for numerous mobile devices. Additionally, this study proposes a Cluster Secure Based Routing Protocol (CSBRP) to integrate into the key management to enhance non-repudiation of routing information and routing performances. Finally, this study introduces a mathematical model to demonstrate that the proposed cluster-based communication outperforms the node-based approach.
In delay fault BIST (Built-In-Self-Test), an adjacency test pattern generation scheme effectively generates robust test patterns. The traditional adjacency test pattern generation schemes use LFSR to generate first patterns, and thus they cannot generate test patterns for circuits with more than 30 inputs with high fault coverage in a practical amount of time. This paper proposes a deterministic delay fault BIST method using adjacency test pattern generation. The proposed scheme uses first patterns generated by a deterministic algorithm based on the analysis of independent partial circuits on the circuit under test. Experiments show that test patterns generated by the proposed method have both high fault coverage and short test length, resulting in a short test time.
Jae-Min LEE Soo Hee HAN Hong Seong PARK Wook Hyun KWON
In this paper, a refined analytic model is presented for the IEEE 802.11 distributed coordination function (DCF) in a time-varying channel environment. In the proposed model, the channel is modelled using a finite-state Markov (FSM) chain. The saturation throughput and average packet delay are analyzed from the proposed model. It is shown using OPNETTM and UltraSANTM simulations that the proposed model accurately predicts the performance of the IEEE 802.11 DCF.
This paper proposes a model for access control within object-oriented systems. The model is based on RBAC (role-based access control) and is called DRBAC (dynamic RBAC). Although RBAC is powerful in access control, the original design of RBAC required that user-role assignments and role-permission assignments should be handled statically (i.e., the assignments should be handled by human beings). Nevertheless, the following dynamic features are necessary in access control within a software system: (a) managing dynamic role switching, (b) avoiding Trojan horses, (c) managing role associations, and (d) handling dynamic role creation and deletion. DRBAC offers the dynamic features. This paper proposes DRBAC.
The resource allocation problem in multi-agent systems is one of the crucial problems hindering the development of multi-agent technologies. This study demonstrates that "time delay" functions as an effective factor in a resource allocation, contrasting to the conventional real-time oriented multi-agent paradigm by 1) introducing a "fickle" agent, whose own strategy fluctuates randomly, and 2) an agent repository mechanism. This study also demonstrates that in the resource allocation process, time delay induces dramatic changes in performance, the specific phenomenon is the so-called "phase transition phenomenon". This finding means emergence of the phase transition is cited as a major factor governing multi-agent system performance. This knowledge is of essential importance in the regulation in multi-agent performance.
Fast and simple algorithm of a parity checker for a large residue numbers is presented. A new set of RNS moduli with 2r-(2l1) form for fast modular multiplication is proposed. The proposed RNS moduli has a large dynamic range for a large RNS number. The parity of a residue number can be checked by the Chinese remainder theorem (CRT). A CRT-based parity checker is simply organized by the Montgomery reduction method (MRM), implemented by using multipliers and the carry-save adder array. We present a fast parity checker with minimal hardware processed in three clock cycles for 32-bit RNS modulus set.
Ultra Wideband (UWB) communication system utilizing impulse signals is attractive technique which can achieve high data rate with low complexity and low power consumption. In this impulse based UWB system, lots of different shaped pulses have been considered to represent more information bits per symbol. In order to detect these different shaped UWB signals at the receiver, the synthesized template generation method using several elementary waveforms is effective. In this paper we design and analyze this synthesized template waveform instead of the conventional matched filter technique. The synthesis of UWB template waveform can be achieved as combinations of orthogonalized elementary waveforms with Fourier coefficients. By adjusting the number of elementary waveforms and their coefficients, it is possible to detect several types of UWB signals. The orders of approximation corresponding to different number of elementary waveforms are analyzed and the bit error rate properties are then investigated in AWGN and multipath fading channels. In addition, the proposed system can capture more energy by adjusting its coefficients adaptively under the multipath environment and reduce the effect of Intra-Pulse Interference (IPI) which is occurred when the propagation channel is not separable, that is, multipath components spaced closer than the typical pulse width. We show the design of the adaptive template synthesis method and its performance compared with conventional Rake receiver.
Jaewon LEE Seong-Min HONG Hyunsoo YOON
The mobile agent paradigm is a promising technology to structure distributed applications. Since mobile agents physically move to a remote host that is under the control of a different principal, they need to be protected from this environment which is responsible for execution. In this paper, we provide a new cryptographic methodology of protecting mobile agents from unauthorized modification for the program code by malicious hosts.
YoungBae JANG SeungRyoul MAENG JungWan CHO
An active network has the advantage of being able to accept new protocols quickly and easily. The cluster-based active router can provide sufficient computing power for customized computations. In the router architecture, load balancing is achieved by the efficient distribution of packets. We present a packet distribution scheme according to estimated processing time.
Atsushi FUJIWARA Shinji TAKEDA Hitoshi YOSHINO Narumi UMEDA
A multihop connection scheme, where one or more mobile terminals relay transmission signals using the same access scheme between an end user terminal and its destination base station, is a promising approach to overcome reduction in cell size caused by high bit-rate data transmission. In a general radio communication system, the coverage area and system throughput are closely interrelated. In this paper, the performance of a multihop cellular network employing a CDMA access scheme, which is a promising candidate for beyond the third generation, is studied in terms of the coverage area and system throughput by conducting a link level simulation. The results show that a multihop connection expands the coverage area, especially in the case of light traffic, and also has an advantage in system throughput.
Wei CHEN Erry GUNAWAN Kah Chan TEH
Space-time array manifold model is usually used in a fast fading channel to estimate delay for the radio location. The existing additive white Gaussian noise (AWGN) estimation error model significantly overestimates the delay estimation. In this paper, we model the estimation error of the space-time array manifold channel impulse response (CIR) matrix as a correlated AWGN matrix and its performance is shown to be closer to the estimation error of practical systems than the existing model.
In contention-based wireless ad hoc networks, power control is an efficient way to improve the spatial reuse by allowing multiple pairs to communicate simultaneously. In this paper, we propose a game-theoretical approach for joint power and rate control in ad hoc networks, where the transmit rate of each link is maximized. Meanwhile we consider the transmit power as the cost, since higher power leads to higher interference and more energy consumption. In particular, we introduce a novel auction-like pricing algorithm in which the cost per unit power steps up until the network settles down at a Nash equilibrium, which is a feasible power and rate allocation, even when the Signal to Interference and Noise Ratio (SINR) requirements are initially infeasible. Numerical results show significant throughput improvement and energy consumption savings compared with the previously proposed algorithm that defers the link with minimum SINR.