Do-Gyun KIM Jae-Sung ROH Sung-Joon CHO Jung-Sun KIM
The objective of this paper is to evaluate the impacts of impulsive class-A noise, co-channel interference due to other piconet, Rician fading on the packet error rate (PER), and throughput performance in the Bluetooth scatternet. Simulation results illustrate the significant difference in performance between synchronous and asynchronous Bluetooth systems. The paper also provides the insights on how to design Bluetooth scatternet for minimal PER and maximum throughput performance.
Il-Young MOON Jae-Sung ROH Sung-Joon CHO
In this paper, we have analyzed transmission time for WAP (Wireless Application Protocol) over Bluetooth using a multi-slot segmentation scheme. In order for SAR to improve the transfer capability, the transmission of messages have been simulated using a fragmentation scheme that begins with the total package and incremental fragmentation for each layer using the WTP (Wireless Transaction Protocol) to define the resultant packet size and the level of fragmentation for each proceeding layer. The data is divided into individual packets at the baseband level. This scheme decreases transmission time of L2CAP (Logical Link Control And Adaptation Protocol) baseband packets by sending packets that span multiple slots. From the results, we were able to obtain packet transmission time and optimal WTP packet size for WAP over Bluetooth in a Rician fading channel.
This paper deals with a mathematical formulation of the scattering from a periodic surface with finite extent. In a previous paper the scattered wave was shown to be represented by an extended Floquet form by use of the periodic nature of the surface. This paper gives a new interpretation of the extended Floquet form, which is understood as a sum of diffraction beams with diffraction orders. Then, the power flow of each diffraction beam and the relative power of diffraction are introduced. Next, on the basis of a physical assumption such that the wave scattering takes place only from the corrugated part of the surface, the amplitude functions are represented by the sampling theorem with unknown sample sequence. From the Dirichlet boundary condition, an equation for the sample sequence is derived and solved numerically to calculate the scattering cross section and optical theorem. Discussions are given on a hypothesis such that the relative power of diffracted beam becomes almost independent of the width of surface corrugation.
Kwang-Deok SEO Kook-Yeol YOO Jae-Kyoon KIM
In this paper, we propose an efficient requantization method for INTRA-frames in MPEG-1/MPEG-4 transcoding. The quantizer for an MPEG-1 INTRA block usually uses a quantization weighting matrix, while the quantizer for an MPEG-4 simple profile does not. As a result, the quantization step sizes of the two quantizers may not be the same even for the same quantization parameter. Due to this mismatch in the quantization step size, a transcoded MPEG-4 sequence can suffer from serious quality degradation and the number of bits produced by transcoding increases from the original MPEG-1 video sequence. To solve these problems, an efficient method is proposed to identify a near-optimum reconstruction level in the transcoder. In addition, a Laplacian-model based PDF (probability distribution function) estimation for the original DCT coefficients from an input MPEG-1 bitstream is presented, which is required for the proposed requantization. Experimental results show that the proposed method provides a 0.3-0.7 dB improvement in the PSNR over the conventional method, even at a reduced bit-rate of 3-7%.
Toshimichi SAITO Fumitaka KOMATSU Hiroyuki TORIKAI
As two simple relaxation oscillators are coupled by periodical and instantaneous switching, the system exhibits rich superstable synchronous phenomena. In order to analyze the phenomena, we derive a hybrid return map of real and binary variables; and give theoretical results for (1) superstability of the synchronous phenomena and (2) period of the synchronous phenomena as a function of the parameters. Using a simple test circuit, typical phenomena are verified in the laboratory.
Seiji KAJIHARA Koji ISHIDA Kohei MIYASE
This paper presents a test vector modification method for reducing average power dissipation during test application for a full-scan circuit. The method first identifies a set of don't care (X) inputs of given test vectors, to which either logic value 0 or 1 can be assigned without losing fault coverage. Then, the method reassigns logic values to the X inputs so as to decrease switching activity of the circuit during scan shifting. Experimental results for benchmark circuits show the proposed method could decrease switching activity of a given test set to 45% of the original test sets in average.
Mitsugu IWAMOTO Hirosuke YAMAMOTO
In this paper, a method is proposed to construct an n-out-of-n visual secret sharing scheme for gray-scale images, for short an (n,n)-VSS-GS scheme, which is optimal in the sense of contrast and pixel expansion, i.e., resolution. It is shown that any (n,n)-VSS-GS scheme can be constructed based on the so-called polynomial representation of basis matrices treated in [15],[16]. Furthermore, it is proved that such construction can attain the optimal (n,n)-VSS-GS scheme.
We present an efficiency improvement on an existing unlinkable divisible e-cash system. In the based e-cash system, an e-coin can be divided to spent, and thus the exact payments are available. Furthermore, to protect customer's privacy, the system also satisfies the unlinkability in all the payments, which is not satisfied in other existing divisible e-cash systems. The unlinkability means the infeasibility of determining whether two payments are made by the same customer. However, in the unlinkable divisible e-cash system, the payment protocol needs O(N) computations, and thus inefficient, where N indicates the divisibility precision. For example, in case of N=100,000, about 200,000 exponentiations are needed for the worst. We improve the payment protocol using the tree approach. In case of N=100,000, the protocol with our improvement needs only about 600 exponentiations for the worst. This good result can be obtained for other N which is more than about 100.
Seokjoo SHIN Jee Hwan AHN Kiseon KIM
In this paper, we investigate two packet scheduling schemes over the downlink of DS/CDMA systems to support packet data service. These schemes are the code division multiplexing (CDX)-based packet scheduling and the time division multiplexing (TDX)-based packet scheduling. To evaluate each scheme more effectively, we derive the throughput gain of the downlink as a performance measure based on the power constraint equation. In addition, the packet transmission delay of each scheme is derived and compared each other when the packet lengths of the concurrent data users are independently and identically distributed according to the exponential distribution. As the downlink capacity is quite related to the orthogonality factor, our analysis shows from the results that the throughput gain and the transmission delay are highly dependent on this factor. Furthermore, it is shown that the TDX scheduling scheme in CDMA downlink affords better performances than the CDX scheduling scheme, except when the orthogonality factor is around 1.
Akihito MORIMOTO Sadayuki ABETA Mamoru SAWAHASHI
This paper investigates the effect of fast cell selection (FCS) associated with fast packet scheduling methods and hybrid automatic repeat request (HARQ) with Chase combining, in which the optimum cell (or sector) transmitting a slot-assigned downlink shared channel (DSCH) is selected based on the received signal-to-interference power ratio (SIR), in high-speed downlink packet access (HSDPA). The Round robin (RR), Proportional fairness (PF) and Maximum carrier-to-interference power ratio (CIR) schedulers are used as the scheduling algorithm. The simulation results elucidate that although almost no additional diversity gain through FCS is obtained for the PF and Maximum CIR schedulers, the improvement in throughput by FCS coupled with the RR scheduler is achieved. Furthermore, we elucidate that the effect of FCS is small when only inter-sector FCS is performed; however, inter-cell FCS is effective in improving the radio link throughput for the access users with a lower received SIR near the cell edge. The radio link throughput at the cumulative distribution of 20% of soft handover users when both inter-sector and inter-cell FCS are performed is increased by approximately 20% and 60% for PF and RR schedulers, respectively, compared to that without FCS, i.e. with hard handover. We also show that when a traffic model such as the modified ETSI WWW browsing model is taken into account, the effect of FCS associated with the decreasing effect of fast packet scheduling is greater than that assuming continuous packet transmission. The user throughput at the cumulative distribution of 20% employing both inter-sector and inter-cell FCS is increased by approximately 60% compared to that without FCS.
In this paper, we focus on an image encryption scheme based on a truncated Baker transformation. The truncated Baker transformation globally preserves the original dynamics of Baker transformation but incorporates a random local rotation operator between two neighbor elements in the mapping domain in order to keep a finite precision. It generates binary sequences (the dynamics of elements) which have statistically good features on ergodicity, mixing and chaotic properties. The image encryption scheme extended from the truncated Baker transformation efficiently shuffles the input gray level image satisfying fundamental conditions on confusion and diffusion required for image encryption schemes. However, this scheme uses many binary sequences and thus needs to keep a large volume of secret keys. In order to solve this problem we introduce Peano space-filling curve in this scheme, which remarkably reduce the key size and mapping iterations without deteriorating good shuffling properties attained by this scheme.
Luigi AGAROSSI Sandro BELLINI Pierangelo MIGLIORATI
The starting point of this paper is the definition of a nonlinear model of the read out process in high density optical discs. Under high density condition, the signal read out is not a linear process, and suffers also from cross talk. To cope with these problems, the identification of a suitable nonlinear model is required. A physical model based on the optical scalar theory is used to identify the kernels of a nonlinear model based on the Volterra series. Both analysis and simulations show that a second order bidimensional model accurately describes the read out process. Once equipped with the Volterra channel model, we evaluate the performance of various nonlinear receivers. First we consider Nonlinear Adaptive Volterra Equalization (NAVE). Simulations show that the performance of classical structures for linear channels is significantly affected by the nonlinear response. The nonlinear NAVE receiver can achieve better performance than Maximum Likelihood Sequence Estimator (MLSE), with lower complexity. An innovative Nonlinear Maximum Likelihood Sequence Estimator (NMLSE), based on the combination of MLSE and nonlinear Inter-Symbol Interference (ISI) cancellation, is presented. NMLSE offers significant advantages with respect to traditional MLSE, and performs better than traditional equalization for nonlinear channels (like NAVE). Finally, the paper deals with cancellation of cross talk from adjacent tracks. We propose and analyze an adaptive nonlinear cross talk canceller based on a three spot detection system. For the sake of simplicity, all the performance comparisons presented in this paper are based on the assumption that noise is Additive, White, and Gaussian (AWGN model).
The radar cross section (RCS) of a dielectric-coated cylindrical cavity was measured and the measurements were compared with those calculated according to the iterative physical optics (IPO). The IPO analysis used the equivalent-impedance boundary condition (EIBC) based on transmission-line theory which takes into account the thickness of the coating. It was consequently found that this condition is much more effective than the ordinary-impedance boundary condition based on the intrinsic impedance of the material.
Hideto NISHIKADO Hiroyuki MURATA Motonori YAMAJI Hironori YAMAUCHI
A new blind restoration method applying Real-coded genetic algorithm (RcGA) will be proposed, and this method will be proven valid for the blurred image restoration with unidentified degradation in the experiments. In this restoration method, the degraded and blurred image is going to get restricted to the images possible to be expressed in the point spread function (PSF), then the restoration filter for this degraded image, which is also the 2-dimentional inverse filter, will be searched among several points applying RcGA. The method will enable to seek efficiently among vast solution space consists of numeral coefficient filters. And perceiving the essential features of the spectrum in the frequency space, an evaluation function will be proposed. Also, it will be proposed to apply the Rolling-ball transform succeeding an appropriate Gaussian degrade function against the dual degraded image with blur convoluting impulse noise. By above stated features of this restoration method, it will enable to restore the degraded image closer to the original within a practical processing time. Computer simulations verify this method for image restoration problem when the factors causing image distortions are not identified.
Bong Dae CHOI Dong Bi ZHU Chang Sun CHOI
We propose and analyze a new efficient handoff scheme called Splitted-Rating Channel Scheme in UMTS networks, and we analyze the call level performance of splitted-rating channel scheme and then packet level performance of downlink traffic at UMTS circuit-switched networks. In order to reduce the blocking probability of originating calls and the forced termination probability of handoff calls, a splitted-rating channel scheme is applied to the multimedia UMTS networks. This multimedia network supports two classes of calls; narrowband call requiring one channel and wideband call requiring multiple channels. The channels in service for wideband call are splitted its channels for lending to originating call and handoff call according to threshold control policy. By assuming that arrivals of narrowband calls and arrivals of wideband calls are Poisson, we model the number of narrowband calls and the number of wideband calls in the one cell by Level Dependent Quasi-Birth-Death (QBD) process and obtain their joint stationary distribution. For packet level analysis, we first describe the downlink traffic from the base station to a mobile terminal in UMTS networks, and calculate the mean packet delay of a connected wideband call by using QBD analysis. Numerical examples show that our splitted-rating channel scheme reduces the blocking probability of originating call and the forced termination probability of handoff call with a little degradation of packet delay.
Hiroki FURUYA Masaki FUKUSHIMA Hajime NAKAMURA Shinichi NOMOTO
This paper proposes an idea for modeling aggregated TCP/IP traffic arriving at a bottleneck link by focusing on its scaling behavior. Here, the aggregated TCP/IP traffic means the IP packet traffic from many TCP connections sharing the bottleneck link. The model is constructed based on the outcomes of our previous works investigating how the TCP/IP networking mechanism affects the self-similar scaling behavior of the aggregated TCP/IP traffic in a LAN/WAN environment. The proposed traffic model has been examined from the perspective of application to network performance estimation. The examinations have shown that it models the scaling behavior and queueing behavior of actual traffic, though it neglects the interaction among TCP connections that compete with each other for the single bottleneck link bandwidth.
The input queued (IQ) switching architecture is becoming an attractive alternative for high-speed switches owing to its scalability. In this paper, three new algorithms, referred to as the maximum credit first (MCF), enhanced MCF (EMCF), and iterative MCF (IMCF) algorithms, are introduced. Simulations show that both MCF and IMCF have similar performance as the Birkhoff-von Neumann decomposition (BVND) algorithm, which can provide cell delay bound and 100% throughput, with lower off-line computational and on-line memory complexity. Simulations also show the fairness of MCF is much better than that of BVND. Theoretic analysis shows that the EMCF algorithm has a better performance than MCF in terms of throughput and cell delay with the same complexity level as MCF. Simulation results indicate the EMCF algorithm has much lower average cell delay and delay variance as compared to the BVND algorithm.
Atsushi UCHIDA Koji TAKAHASHI Makito KAWANO Shigeru YOSHIMORI
We have demonstrated synchronization of chaos in a pair of one-way coupled Colpitts oscillators by both experiment and numerical simulation. We have investigated parameter regions for achieving chaos-synchronization when one of the internal parameters is mismatched between the master and slave oscillators, and clarify the tolerance of parameter regions for synchronization against parameter mismatching.
Caihua WANG Hideki TANAHASHI Hidekazu HIRAYU Yoshinori NIWA Kazuhiko YAMAMOTO
In this paper, we describe a novel technique to extract a polyhedral description from panoramic range data of a scene taken by a panoramic laser range finder. First, we introduce a reasonable noise model of the range data acquired with a laser radar range finder, and derive a simple and efficient approximate solution of the optimal fitting of a local plane in the range data under the assumed noise model. Then, we compute the local surface normals using the proposed method and extract stable planar regions from the range data by using both the distribution information of local surface normals and their spatial information in the range image. Finally, we describe a method which builds a polyhedral description of the scene using the extracted stable planar regions of the panoramic range data with 360 field of view in a polar coordinate system. Experimental results on complex real range data show the effectiveness of the proposed method.
Gian Marco BO Daniele D. CAVIGLIA Maurizio VALLE
In this paper we present the analog architecture and the implementation of an on-chip learning Multi Layer Perceptron network. The learning algorithm is based on Back Propagation but it exhibits increased capabilities due to local learning rate management. A prototype chip (SLANP, Self-Learning Neural Processor) has been designed and fabricated in a CMOS 0.7 µm minimum channel length technology. We report the experimental results that confirm the functionality of the chip and the soundness of the approach. The SLANP performance compare favourably with those reported in the literature.