Search

The paper presents a practical approach for measuring the linewidth enhancement factor α of semiconductor lasers and the optical feedback level factor C in a semiconductor laser with an external cavity. The proposed approach is based on the analysis of the signals observed in an optical feedback self-mixing interferometric system. The parameters a and C are estimated using a gradient-based optimization algorithm that achieves best data-to-theoretical model match. The effectiveness and accuracy of the method has been confirmed and tested by computer simulations and experiments, which show that the proposed approach is able to estimate α and C with an accuracy of 6.7% and 4.63%, respectively. [ABSTRACT FROM AUTHOR]

This paper examines the performance of the adaptive array antennas used in digital handset systems by studying the minimum mean square error (MMSE) algorithm at 2 GHz. The array is comprised of multiple quarter-wavelength monopole antennas and planar inverted-F antennas (PIFAs). By calculating the spatial correlation between two different directions, we describe how significant enhancement in the capability of reducing interference signals can be achieved, even when the handset is being held in the vicinity of a human operator in the talking position. Secondly, a computer simulation has been carried out under a flat Rayleigh fading environment with multiple cochannel interference signals, in which the average bit error rate (BER) of the handset adaptive array antenna has been characterized for the coherent detection of phase-shift keyed (PSK) signals. The performance of the handset adaptive array is compared to that of an adaptive array comprising plural parallel half-wavelength dipole antennas that are one half-wavelength apart. The performance was also evaluated with regard to the distance between the handset and the human head for different unequal median values and fading correlations of the received signals. The study has revealed that the adaptive array under consideration has substantial potential, not only to reduce the relative power of interference signals, but also to combat multipath fading of the desired signal by using the spatial diversity function of the MMSE, even in close proximity to a human operator. [ABSTRACT FROM AUTHOR]

This paper proposes a novel algorithm to jointly determine the structure and the parameters of a posteriori probability model based on neural networks (NNs). It makes use of well-known ideas of pruning, splitting, and merging neural components and takes advantage of the probabilistic interpretation of these components. The algorithm, so called a posteriori probability model selection (PPMS), is applied to an NN architecture called the generalized softmax perceptron (GSP) whose outputs can be understood as probabilities although results shown can be extended to more general network architectures. Learning rules are derived from the application of the expectation-maximization algorithm to the GSP-PPMS structure. Simulation results show the advantages of the proposed algorithm with respect to other schemes. [ABSTRACT FROM AUTHOR]

This paper presents a reduced-complexity soft-input soft-output detection scheme, called iterative tree search detection for multiple-input multiple-output wireless communication systems employing turbo processing at the receiver. In this scheme, a reduced search space is selected with the aid of the M-algorithm, and QAM signal constellations with block partitionable labels are independent of the modulation order, as well as asymptotically linear in the number of transmit antennas. Results from computer simulations are presented which demonstrate the capability of the scheme to approach optimal performance at considerable reduced complexity. [ABSTRACT FROM AUTHOR]

In this paper, based on the application of the sum-product (SP) algorithm to factor graphs (FGs) representing the joint a posteriori probability (APP) of the transmitted symbols, we propose new iterative soft-input soft-output (SISO) detection schemes for intersymbol interference (ISI) channels. We have verified by computer simulations that the SP algorithm converges to a good approximation of the exact marginal APPs of the transmitted symbols if the FG has girth at least 6. For ISI channels whose corresponding FG has girth 4, the application of a stretching technique allows us to obtain an equivalent girth-6 graph. For sparse 151 channels, the proposed algorithms have advantages in terms of complexity over optimal detection schemes based on the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. They also allow a parallel implementation of the receiver and the possibility of a more efficient complexity reduction. The application to joint detection and decoding of low-density parity-check (LDPC) codes is also considered and results are shown for some partial-response magnetic channels. Also in these cases, we show that the proposed algorithms have a limited performance loss with respect to that can be obtained when the optimal "serial" BCJR algorithm is used for detection. Therefore, for their parallel implementation, they represent a favorable alternative to the modified "parallel" BCJR algorithm proposed in the literature for the application to magnetic channels. [ABSTRACT FROM AUTHOR]

A new adaptive critic autopilot design for bank-to. turn missiles is presented. In this paper, the architecture of adaptive critic learning scheme contains a fuzzy-basis-function-network based associative search element (ASE), which is employed to approximate nonlinear and complex functions of bank-to-turn missiles, and an adaptive critic element (ACE) generating the reinforcement signal to tune the associative search element. In the design of the adaptive critic autopilot, the control law receives signals from a fixed gain controller, an ASE and an adaptive robust element, which can eliminate approximation errors and disturbances. Traditional adaptive critic reinforcement learning is the problem faced by an agent that must learn behavior through trial-and-error interactions with a dynamic environment, however, the proposed tuning algorithm can significantly shorten the learning time by on-line tuning all parameters of fuzzy basis functions and weights of ASE and ACE. Moreover, the weight updating law derived from the Lyapunov stability theory is capable of guaranteeing both tracking performance and stability. Computer simulation results confirm the effectiveness of the proposed adaptive critic autopilot. [ABSTRACT FROM AUTHOR]

The digital algorithms presently available for on-line monitoring of metal oxide surge arrester (MOA) are normally based on a simplified equivalent model consisting of a capacitor and a nonlinear resistor in parallel, which however in applications poses some deficiency compared with experimental results, leading to a certain phase discrepancy between the line voltage and the resistive branch current, due to a capacitive effect in the branch. This paper develops a new digital algorithm based on an accurate model of metal oxide surge arrester, in which base-frequency approximating method and iterating scheme are combined in use. Computer simulations are carried out to validate the new approach, showing the digital algorithm gives an application accuracy of less than 1% even with harmonised power source and different levels of background noises while within 10% of the measured sum leakage current. [ABSTRACT FROM PUBLISHER]

Dynamic power management aims at extending battery life by switching devices to lower-power modes when there is a reduced demand for service. Static power management strategies can lead to poor performance or unnecessary power consumption when there are wide variations in the rate of requests for service. This paper presents a hierarchical scheme for adaptive dynamic power management (DPM) under nonstationary service requests. As the main theoretical contribution, we model the nonstationary request process as a Markov-modulated process with a collection of modes, each corresponding to a particular stationary request process. Optimal DPM policies are precalculated offline for selected modes using standard algorithms available for stationary Markov decision processes (MDPs). The power manager then switches online among these policies to accommodate the stochastic mode-switching request dynamics using an adaptive algorithm to determine the optimal switching rule based on the observed sample path. As a target application, we present simulations of hierarchical DPM for hard disk drives where the read/write request arrivals are modeled as a Markov-modulated Poisson process. Simulation results show that the power consumption of our approach under highly nonstationary request arrivals is less than that of a previously proposed heuristic approach and is even comparable to that of the optimal policy under stationary Poisson request process with the same arrival rate as the average arrival rate of the nonstationary request process. [ABSTRACT FROM AUTHOR]

This paper quantifies the adaptive performance of a blind adaptive multiuser detector (MUD) based on the linearly constrained constant modulus algorithm (LCCMA) in both a stationary and nonstationary channel. A framework is developed to apply the feedback analysis method to analyzing adaptive MUD schemes. A closed-form expression for the excess mean square error (EMSE) of LCCMA blind adaptive MUD in a CDMA communications system is derived for both of the steady-state and tracking cases. The effects of additive noise and multiple access interference are considered. A transient analysis is performed that predicts the learning curve of the adaptive filter. Computer simulation is used to verify the accuracy of the analysis. [ABSTRACT FROM AUTHOR]

In this paper, we propose a unified approach for video summarization based on the analysis of video structures, and video highlights. Two major components in our approach are scene modeling and highlight detection. Scene modeling Is achieved by normalized cut algorithm and temporal graph analysis, while high-light detection is accomplished by motion attention modeling. In our proposed approach, a video is represented as a complete undirected graph and the normalized cut algorithm is carried out to globally and optimally partition the graph into video clusters. The resulting clusters form a directed temporal graph and a Shortest path algorithm is proposed to efficiently detect video scenes. The attention values are then computed and attached to the scenes, clusters, shots, and subshots in a temporal graph. As a result, the temporal graph can inherently describe the evolution and perceptual importance of a video. In our application, video summaries that emphasize both content balance and perceptual quality can be generated directly from a temporal graph that embeds both the structure and attention information. [ABSTRACT FROM AUTHOR]

An unbiased, maximum-likelihood (ML), channel parameter-estimation algorithm for direct-sequence spread-spectrum systems with strong interference is discussed in this paper. The algorithm includes correcting terms to the extended Kalman filter (EKF) based on the gradient of the negative log-likelihood function of the Output of a conventional matched filter. By an asymptotic analysis, the algorithm is shown to determine the actual parameters. A complete implementation of the algorithm is given, and its transient behavior is examined by computer simulations. Results show the ML algorithm, albeit optimal in the sense of unbiased parameter estimation, is less robust than the modified EKF described in the first reference. [ABSTRACT FROM AUTHOR]

Time delay estimation (TDE) lies at the heart of signal processing algorithms in a broad range of application areas, including communications, coherent imaging, speech processing, and acoustics. In medical ultrasound for example, TDE is used in blood flow estimation, tissue motion measurement, tissue elasticity estimation, phase aberration correction, and a number of other algorithms. Because of its central significance, TDE accuracy, precision, and computational cost are of critical importance. Furthermore, because TDE is typically performed au sampled signals—and delay estimates are usually desired over a continuous domain—time delay estimator performance should be considered in conjunction with associated interpolation. In this paper we present a new time-delay estimator that directly determines continuous time-delay estimates from sampled data. The technique forms a spline-based, piecewise continuous representation of the reference signal then solves for the minimum of the sum squared error between the reference and the delayed signals to determine their relative time delay. Computer simulation results clearly show that the proposed algorithm significantly outperforms other algorithms in terms of jitter and bias over a broad range of conditions. We also describe a modified version of the algorithm that includes companding with only a minor increase in computational cost. [ABSTRACT FROM AUTHOR]

Due to the use of variable length code (VLC), a single bit error in the discrete cosine transform (DCT)-based coded bit stream, such as 11.263, may propagate up to the end of the group of blocks (GOBs) or slice. In this paper, we propose an iterative error detection and correction algorithm for the slice mode of the H.263 bit stream. The visibly erroneous macroblocks (MBs) in the decoded frames are detected by checking a set of error detection conditions derived from the redundant information (such as neigh- boring MBs and inner-DC I block similarity measure) inherent within the frame. In each slice, the part of the bit stream before the first erroneous MB is decoded in the conventional manner. The remaining part after this MB is redecoded iteratively, skipping one bit at a time until a decodable subbit stream is found. In case an MB is nondecodable, it is replaced with gray level. Once all the slices are checked, the frame is reconstructed and again checked for erroneous MBs. This process is repeated until the decoder detects no more corrupted MB. The proposed step-by-step decoding technique limits the error into a few MBs only, which can easily be concealed by any error concealment technique. The simulation results demonstrate that our scheme can recover the corrupted frames under the bit error rates up to 1 % over binary symmetric channel (BSC), and improve the concealed picture quality by 4-6 dB over the conventional methods. [ABSTRACT FROM AUTHOR]

Coherent signals from distinct directions is a natural characterization of the multipath propagation effect. This paper addresses the problem of coherent/fully correlated Source localization using vector sensor arrays. The maximum likelihood (ML) and minimum-variance distortionless response (MVDR) estimators for source direction-of-arrival (DOA) and signal polarization parameters are derived. These estimators require no search over the polarization parameters. In addition, a novel method for "decorrelating" the incident signals is presented. This method is based on the polarization smoothing algorithm (PSA) and enables the use of eigenstructure-based techniques, which assume uncorrelated or partially correlated signals. The method is implemented as a preprocessing stage before applying eigen- structure-based techniques, such as MUSIC. Unlike other existing preprocessing techniques, such as spatial smoothing and forward-backward (FB) averaging, this method is not limited to any specific array geometry. The performance of the proposed NA preprocessing combined with MUSIC is evaluated and compared to the Cramér-Rao Bound (CRB) and the ML and MVDR estimators. Simulation results show that the MVDR and PSA-MUSIC asymptotically achieve the CRB for a scenario with two coherent sources with and without an uncorrelated interference source. A sensitivity study of NA-MUSIC to source polarization was also conducted via simulations. [ABSTRACT FROM AUTHOR]

Fast parasitic extraction is an integral part of high-speed microelectronic simulation at the package and on-chip level. Integral equation methods and related fast solvers for the iterative solution of the resulting dense matrix systems have enabled linear time complexity and memory usage. However, these methods tend to have large disparities between setup and matrix-vector product times that affect their efficiency when applied to multiple excitation problems, i.e., problems with a large number of nets. For example, FastCap, which is based on the fast multipole method, has a significantly faster setup time than the multilevel QR decomposition-based IES3, but relatively slow matrix-vector products. In this paper, we present a novel oct-tree-based QR compression technique for fast iterative solution. The regular cube structure of the fast multipole method and the QR compression scheme for interaction submatrices as in IES3 are combined to achieve a predetermined compressible matrix-block structure and, consequently, superior memory, setup, and solve time efficiencies. [ABSTRACT FROM AUTHOR]

This paper introduces a novel blind equalization algorithm for frequency-selective channels based on a Bayesian formulation of the problem and the sequential importance sampling (SIS) technique. SIS methods rely on building a Monte Carlo (MC) representation of the probability distribution of interest that consists of a set of samples (usually called particles) and associated weights computed recursively in time. We elaborate on this principle to derive blind sequential algorithms that perform maximum a posteriori (MAP) symbol detection without explicit estimation of the channel parameters. In particular, we start with a basic algorithm that only requires the a priori knowledge of the model order of the channel, but we subsequently relax this assumption and investigate novel procedures to handle model order uncertainty as well. The bit error rate (BER) performance of the proposed Bayesian equalizers is evaluated and compared with that of other equalizers through computer simulations. [ABSTRACT FROM AUTHOR]

In this paper, we are interested in estimating the power spectral density of a stationary random signal x(n) when the signal itself is not available but some low-resolution measurements derived from it are observed. We consider a model where x(n) is being measured using a set of linear multirate sensors. Each sensor outputs a measurement signal vi(n) whose sampling rate is only a fraction of the sampling rate assumed for the original signal. Based on this model, we pose the following problem: Given certain autocorrelation coefficients of the observable signals vi(n), estimate the power spectral density of the original signal x(n). It turns out that this problem is ill-posed. We suggest to resolve this issue by using the principle of maximum entropy (ME). We address technical difficulties associated with the ME solution and then devise a practical algorithm for its approximate computation. We demonstrate the viability of this algorithm through simulation examples. [ABSTRACT FROM AUTHOR]

This paper presents a stochastic analysis of the delayed least-mean-Square (DLMS) adaptive algorithm with leakage. This analysis is obtained taking into account that mismatches between the system delay and its estimate may occur. Such an approach is not considered in previous models. In addition, it is shown that the introduction of a leakage factor into the adaptive algorithm keeps the adaptive algorithm stable under an imperfect delay estimate condition. Recursive difference equations for the first and second moments of the adaptive filter weights are derived. An expression for the critical value of the step size is also determined. Results of Monte Carlo simulations present excellent agreement with the proposed model for both white and colored Gaussian inputs. [ABSTRACT FROM AUTHOR]

Discerning noise from signal is often required for a correct interpretation of a spectrum. This paper presents a method to automatically select the significant spectral components in spectra, measured with a spectrum analyzer. No prior knowledge about the measured signals is required, and only commercially available equipment is used. The detection algorithm is based on the relationship between the resolution bandwidth (RBW) and the noise level of the spectrum analyzer. It is divided in three steps. First, the spectrum is measured with a spectrum analyzer. Second, the same signal is measured a second time with a different RBW. Finally, from the division of both measurements, one can conclude at which frequencies a signal is present. A statistical framework for the algorithm will be derived. The method will be demonstrated on simulations and measurements. [ABSTRACT FROM AUTHOR]

Various control algorithms have been proposed for the speed-sensorless control of an induction motor. These sensorless algorithms are mainly based on the speed feedback with the flux and speed estimations. This paper proposes a new scheme for the speed-sensorless control of an induction motor. The proposed scheme is based on the current estimation without the flux and speed estimations, in which the controlled stator voltage is applied to the induction motor so that the difference between stator currents of the mathematical model and motor may be forced to decay to zero. The performance of the proposed scheme is verified through simulation and experiment. [ABSTRACT FROM AUTHOR]

To be clinically viable, a brain-machine interface (BMI) requires transcutaneous telemetry. Spike-based compression algorithms can be used to reduce the amount of telemetered data, but this type of system is subject to queuing-based transmission delays. This paper examines the relationships between the ratio of output to average input bandwidth of an implanted device and transmission latency and required queue depth. The examination was performed with a computer model designed to simulate the telemetry link. The input to the model was presorted spike data taken from a macaque monkey performing a motor task. The model shows that when the output bandwidth/average input bandwidth is in unity, significant transmission latencies occur. For a 32-neuron system, transmitting 50 bytes of data per spike and with an average neuron firing rate of 8.93 spikes/s, the average maximum delay was approximately 3.2 s. It sis not until the output bandwidth is four times the average input bandwidth that average maximum delays are reduced to less than 10 ms. A comparison of neuron firing rate and resulting latencies shows that high latencies result from neuron bursting. These results will impact the design of transcutaneous telemetry in a BMI. [ABSTRACT FROM AUTHOR]

Abstract-Subspace-based estimation of multiple real-valued sine wave frequencies is considered in this paper. A novel data covariance model is proposed. In the proposed model, the dimension of the signal subspace equals the number of frequencies present in the data, which is half of the signal. subspace dimension for the conventional model. Consequently, an ESPRIT-like algorithm using the proposed data model is presented. The proposed algorithm is then extended for the case of complex-valued sine waves. Performance analysis of the proposed algorithms are also carried out. The algorithms are tested in numerical simulations. When compared with ESPRIT, the newly proposed algorithm results in a significant reduction in computational burden without any compromise in the accuracy. [ABSTRACT FROM AUTHOR]

In this paper, a new numerical algorithm for medium-voltage overhead lines, autoreclosure, is described. The subfunction of the autoreclosure scheme that would inhibit the first shot after detecting a solid fault (as compared with an arc fault) is evaluated and presented. It is based on one terminal data processing and it is derived in the time domain. In the algorithm the fault nature (arcing or arcless fault) is estimated using linear least error squares estimation technique. The arc, occurring on the fault point during arcing faults on overhead lines, is included in the problem consideration. In addition, by introducing the prefault load current in the existing model, better algorithm performance and a more reliable adaptive algorithm for autoreclosure are achieved. The algorithm is derived for the case of three-phase symmetrical fault. The results of the algorithm testing through computer simulation are presented. Particularly the algorithm sensitivity to arc elongation effects, supplying network parameters, and processing of the signals in the presence of harmonics are tested and analyzed. [ABSTRACT FROM AUTHOR]

In this paper a channel coding and modulation scheme for providing HDTV broadcasting services is presented, which adopts BICM structure as inner code in connection with 64QAM constellation and OFDM transmission. A new mapping method is designed to maximize the minimum Euclidean distance between signal points divided by feedback bits, thus an iterative algorithm between demodulator and decoder can be performed to acquire performance improvement. Analysis, simulation and laboratory test results have proved that the proposed system has good SNR performance in both AWGN and multipath channels. [ABSTRACT FROM AUTHOR]

Although patching has shown to be a simple and efficient technique for immediate media on-demand delivery, there is still much scope for further improvement compared with the lower bound of the server network-I/O bandwidth requirement. In this paper, a new technique of two-level patching scheme is proposed for the first time, in which patching channels are rearranged through merging and further patching. Simulation results show that the proposed two-level patching scheme outperforms the conventional patching technique by a significant margin. It even performs better than the dynamic skyscraper algorithm over a wide range of client request rates. Furthermore, it is reasonably competitive with hierarchical multicast stream merging (HMSM) at low to modest client request rates. Most importantly, the implementation complexity of our algorithm is much lower than the skyscraper and HMSM. [ABSTRACT FROM AUTHOR]

Resulting from Ph.D. research, a vehicle simulation program is proposed and continuously developed, which allows simulation of the behavior of electric, hybrid, fuel cell, and internal combustion vehicles while driving any reference cycle. The goal of the simulation program is to study power flows in the drivetrains of vehicles and the corresponding component losses, as well as to compare different drivetrain topologies. This comparison can be realized for energy consumption and emissions, as well as for performance (acceleration, range, maximum slope, etc.). The core of this program, consisting of a unique iteration algorithm, will be highlighted in this paper. This algorithm not only allows the calculation of the limits of vehicle acceleration in the function of drivetrain component characteristics, but at the same time is able to develop and evaluate the different power-management strategies of hybrid vehicles, combining combustion engines and electric motors. Furthermore, the comprehensive iteration algorithm is demonstrated to be very efficient in handling any type of working limit for aft components in different types of drivetrains, which results in an accurate and modular vehicle simulation program with high data flexibility. [ABSTRACT FROM AUTHOR]

This paper presents a framework which implements the common software functionalities. By using this framework, software designers focus on their activity on developing efficient data structures and algorithms. The logic programming introduced in this framework is an efficient technology for Object Constraint Language expressions. Errors made by the user when modeling a device are detected and prevented by the modeling guide. [ABSTRACT FROM AUTHOR]

We consider in this paper the possibility of using a low-density parity-check (LDPC) code as the complete error control system in a magnetic recording channel. We compare the performance of selected LDPC codes with two Reed-Solomon (RS) code schemes on an extended partial-response class 4 (EPR4) channel, with particular emphasis on their performance in noise bursts (induced by media defects or thermal asperities). We quantify the performance of LDPC codes in noise bursts via a maximum-burst-length parameter, and we present a simple algorithm for computing this parameter. We find some very promising initial results: the LDPC codes are very robust against large noise bursts (128 bits long or more), and are superior to the RS schemes examined in the measurable error rate region. The extent to which they are superior depends on the particular LDPC scheme involved, and the results provide motivation for further investigation in this area. [ABSTRACT FROM AUTHOR]

Independent component analysis is to extract independent signals from their linear mixtures without assuming prior knowledge of their mixing coefficients. As we know, a number of factors are likely to affect separation results in practical applications, such as the number of active sources, the distribution of source signals, and noise. The purpose of this paper to develop a general framework of blind separation from a practical point of view with special emphasis on the activation function adaptation. First, we propose the exponential generative model for probability density functions. A method of constructing an exponential generative model from the activation functions is discussed. Then, a Learning algorithm is derived to update the parameters in the exponential generative model. The learning algorithm for the activation function adaptation is consistent with the one for training the denting model. Stability analysis of the learning algorithm for the activation function is also discussed. Both theoretical analysis and simulations show that the proposed approach is universally convergent regardless of the distributions of sources. Finally, computer simulations are given to demonstrate the effectiveness and validity of the approach. [ABSTRACT FROM AUTHOR]

This paper proposes a two-phase hybrid algorithm for optimal placement of radioports. The placement strategy minimizes the dynamic range of the channel, and thus reduces the peak transmit power needed by a wireless handset. The performance of the proposed algorithm is compared with that of an exhaustive search, as well as with that of a simplex algorithm. Simulation results show that the two-phase hybrid algorithm, although suboptimal, outperforms the simplex algorithm with only a modest increase in computation time. It has the added advantage of being quite insensitive to the seed solution. [ABSTRACT FROM AUTHOR]

In this paper, a novel feedback frequency synchronizer for orthogonal frequency-division multiplexing signals transmitted over multiparty fading channels is described. Its derivation is based on maximum-likelihood estimation techniques and assumes an approximate statistical knowledge of the communication channel. The performance of the proposed algorithm is assessed by computer simulation, and is compared with that provided by other synchronization algorithms and with Cramer-Rao bounds. [ABSTRACT FROM AUTHOR]

Given a test set for stuck-at faults of a combinational circuit or a full-scan sequential circuit, some of the primary input values may be changed to the opposite logic values without losing fault coverage. We can regard such input values as don't care (X). In this paper, we propose a method for identifying the X inputs of test vectors in a given test set. While there are many combinations of X inputs in the test set generally, the proposed method finds one including as many X inputs as possible, by using fault simulation and procedures similar to implication and justification of automatic test pattern generation (ATPG) algorithms. Experimental results for ISCAS benchmark circuits show that approximately 69% of the inputs of uncompacted test sets could be X on the average. Even for highly compacted test sets, the method found that approximately 48% of Inputs are X. [ABSTRACT FROM AUTHOR]

Conventional fault simulation techniques for field programmable gate arrays (FPGAs) are very complicated and time consuming. The alternative, FPGA fault emulation technique, is incomplete and can be used only after the FPGA chip is manufactured. In this paper, we present efficient algorithms for computing the fault coverage of a given FPGA test configuration. The faults considered are opens and shorts in FPGA interconnects. The presented technique is able to report all detectable and undetectable faults and, compared with conventional methods, is orders of magnitude faster. [ABSTRACT FROM AUTHOR]

We present a novel bandwidth broker architecture for scalable support of guaranteed services that decouples the QoS control plane from the packet forwarding plane. More specifically, under this architecture, core routers do not maintain any QoS reservation states, whether per-flow or aggregate. Instead, the QoS reservation states are stored at and managed by a bandwidth broker. There are several advantages of such a bandwidth broker architecture. Among others, it avoids the problem of inconsistent QoS states faced by the conventional hop-by-hop, distributed admission control approach. Furthermore, it allows us to design efficient admission control algorithms without incurring any overhead at core routers. The proposed bandwidth broker architecture is designed based on a core stateless virtual time reference system developed recently. This virtual time reference system provides a unifying framework to characterize, in terms of their abilities to support delay guarantees, both the per-hop behaviors of core routers and the end-to-end properties of their concatenation. In this paper, we focus on the design of efficient admission control algorithms under the proposed bandwidth broker architecture. We consider both per-flow end-to-end guaranteed delay services and class-based guaranteed delay services with flow aggregation. Using our bandwidth broker architecture, we demonstrate how admission control can be done on a per domain basis instead of on a "hop-by-hop" basis. Such an approach may significantly reduce the complexity of the admission control algorithms. In designing class-based admission control algorithms, we investigate the problem of dynamic flow aggregation in providing guaranteed delay services and devise a new apparatus to effectively circumvent this problem. We conduct detailed analyses to provide theoretical underpinning for our schemes as well as to establish their correctness. Simulations are also performed to demonstrate the efficacy of our schemes. [ABSTRACT FROM AUTHOR]

This paper proposes a new method for contention resolution in random-access wireless networks. Using orthogonal complementary codes to design access-request packets, users can reserve channel access successfully, even in severe contentions. Collisions among access-request packets can be resolved and exploited, whereas collisions among data packets are avoided. System throughput and delay performance can be enhanced, because random-access contention becomes transparent. Specifically, system throughput approaches the offered load up to the maximum value one with improved average packet delay performance. A joint layer design approach is proposed with both the physical layer signal-detection algorithm and the medium access-control layer random-access protocol. The performance is analyzed with the consideration of signal detection errors. Simulations are performed to demonstrate its superior performance. [ABSTRACT FROM AUTHOR]

In this paper, the use of a crossed-dipole array is proposed in joint space-time channel estimation for asynchronous multipath direct sequence code division multiple access (DS-CDMA) systems. The polarization diversity offered by such an array, unlike linearly polarized arrays, is able to detect and estimate any arbitrary completely polarized signal path. By utilizing the polarization information inherent in the received signal to construct the polar-spatio-temporal array (polar-STAR) manifold vector, the accuracy and resolution of the polar-STAR parameters' estimation are significantly improved, and its signal detection capability is enhanced. To alleviate the need for a multidimensional search in the polarization space, a computationally efficient joint polarization-angle-delay channel parameter estimation algorithm is proposed for a "desired user" that operates in an asynchronous multiuser and multipath environment. The proposed algorithm, which can be seen as an application of MUSIC-type techniques, is based on combining a two-dimensional STAR-Subspace type technique with a set of analytical equations and is supported by representative examples and computer simulation studies. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel postprocessing technique based on the theory of the projection onto convex sets (POCS) in order to reduce the blocking artifacts in digital high definition television (HDTV) images. By detecting and eliminating the undesired high-frequency components, mainly caused by blocking artifacts, we propose a new smoothness constraint set (SCS) and its projection operator in the DCT domain. In addition, we propose an improved quantization constraint set (QCS) using the correlation of DCT coefficients between adjacent blocks. In the proposed technique, the range of the QCS is efficiently reduced as close to the original DCT coefficient as possible to yield better performance of the projection onto the QCS. Computer simulation results indicate that the proposed schemes perform better than conventional algorithms. Furthermore, we introduce a fast implementation method of the proposed algorithm. The conventional POCS-based postprocessing techniques require the forward/inverse discrete cosine transform (DCT/IDCT) operations with a heavy computational burden. To reduce the computational complexity we introduce a fast implementation method of the proposed algorithm that does not perform DCT/IDCT operations. Estimates of computation savings vary between 41% and 64% depending on the task. [ABSTRACT FROM AUTHOR]

In this paper, we propose a power-efficient and QoS (Quality of Service) -aware MAC (Medium Access Control) scheduling algorithm for Bluetooth scatternet. If the inter-piconet scheduler in a bridge node between piconets operates simply by the Round Robin (RR) policy, a number of time slots may be wasted due to the guard time for piconet switching and the exchange of POLL-NULL packets. To overcome the link wastage problem in Bluetooth scatternet scheduling, several algorithms have recently been proposed. Although they can provide all of the links of a bridge node with fair service opportunities, they may cause waste of wireless resources since different Bluetooth devices may have various traffic characteristics. In addition, since Bluetooth devices are often required to operate under limited battery capacity, the number of unnecessary piconet switching has to be minimized for the power-efficient operation of a Bluetooth scatternet. Therefore, we propose a mechanism to support the power-efficient operation of a Bluetooth scatternet while guaranteeing various QoS requirements of Bluetooth devices. The proposed algorithm is compliant with the current Bluetooth specification, and we demonstrate its improved performance via simulations. [ABSTRACT FROM AUTHOR]

In this paper, a technique based on the auto correlation Junction is proposed to estimate the Doppler spread in Rayleigh fading channels for mobile OFDM systems. It is simply implemented with the cyclic structure of OFDM symbols, and any other additive data and pilots need not to be inserted into the common OFDM symbols. This algorithm can be applied directly to the OFDM system with transmit diversity (TD) and to MIMO OFDM systems. Computer simulation results are included to support our developments in the terms of mean estimation value and mean square error. [ABSTRACT FROM AUTHOR]

In this paper, a new improved recursive Newton-type algorithm suitable for various measurement applications in electric power systems is presented. It is used for the power system frequency and spectra estimation. The recursive algorithm form is improved with a strategy of sequential tuning of the forgetting factor. By this, the algorithm convergence and accuracy are significantly improved. To show the main algorithm features, the results of computer simulation, laboratory testing (load rejection and unsuccessful synchronization tests) and field data processing are given. [ABSTRACT FROM AUTHOR]

This paper describes a timed, multithreaded object modeling notation for specifying real-time, concurrent, and reactive Systems. The notation Timed Communicating Object Z (TCOZ) builds on Object Z's strengths in modeling complex data and algorithms, and on Timed CSP's strengths in modeling process control and real-time interactions. TCOZ is novel in that it includes timing primitives, properly separates process control and data/algorithm issues and supports the modeling of true multithreaded concurrency. TCOZ is particularly well-suited for specifying complex systems whose components have their own thread of control. The expressiveness of the notation is demonstrated by a case study in specifying a multilift system that operates in real-time. [ABSTRACT FROM AUTHOR]

The identification of model parameters of a highs density recording channel is usually difficult and complicated. In this paper, we successfully apply the alternating coordinates minimization (ACM) algorithm for estimating parameters of a partial erasure plus transition shift model (PETSM). The resulting algorithm turns out to iteratively solve two least square problems and is guaranteed to converge. Furthermore, the obtained model for a nonlinear partial response channel is more accurate than conventional models such that the maximum likelihood (ML) detector has better bit error rate (BER) performance without increasing its realization complexity. Computer simulations show that the ACM algorithm can accurately estimate the model parameters and the BER for the detector is significantly improved especially when the transition shift parameter is large. [ABSTRACT FROM AUTHOR]

The robust reception of network parameters is a very important issue for the successful deployment of mobile infotainment services, particularly in fast-moving environments. An infrastructure broadcasts service access-related messages to consumer devices. These access messages critically affect the connectivity between the consumer devices and service providers. This paper proposes an algorithm to increase the connectivity by collaborating consumer devices to share access information messages. The consumer device that receives the access message retransmits the message by attached it to its beacon message. This is performed only when there are neighboring consumer devices that did not receive the message. This paper also proposes an extended beacon message for this purpose. The proposed algorithm was evaluated with computer simulations. [ABSTRACT FROM PUBLISHER]

Wireless sensor networks have been considered as a promising tool for many location-dependent applications. In such deployments, the requirement of low system cost prohibits many range-based methods for sensor node localization; on the other hand, range-free approaches depending only on radio connectivity may underutilize the proximity information embedded in neighborhood sensing. In response to these limitations, this paper introduces a proximity metric called RSD to capture the distance relationships among 1-hop neighboring nodes in a range-free manner. With little overhead, RSD can be conveniently applied as a transparent supporting layer for state-of-the-art connectivity-based localization solutions to achieve better accuracy. We implemented RSD with three well-known algorithms and evaluated using two outdoor test beds: an 850-foot-long linear network with 54 MICAz motes, and a regular 2D network covering an area of 10,000 square feet with 49 motes. Results show that our design helps eliminate estimation ambiguity with a subhop resolution, and reduces localization errors by as much as 35 percent. In addition, simulations confirm its effectiveness for large-scale networks and reveal an interesting feature of robustness under unevenly distributed radio path loss. [ABSTRACT FROM AUTHOR]

Several models of user churn, resilience, and link lifetime have recently appeared in the literature [13], [14], [36], [37]; however, these results do not directly apply to classical Distributed Hash Tables (DHTs) in which neighbor replacement occurs not only when current users die, but also when new users arrive into the system, and where replacement choices are often restricted to the successor of the failed zone in the DHT space. To understand neighbor churn in such networks, which we call switching DHTs, this paper proposes a simple, yet accurate, model for capturing link dynamics in structured P2P systems and obtains the distribution of link lifetimes for fairly generic DHTs. Similar to [9], our results show that deterministic networks (e.g., Chord [30], CAN [25]) unfortunately do not extract much benefit from heavy-tailed user lifetimes since link durations are dominated by small remaining lifetimes of newly arriving users that replace the more reliable existing neighbors. We also examine link lifetimes in randomized DHTs equipped with multiple choices for each link and show that selecting the best neighbor in these scenarios is rather complicated as it depends on the desired load balancing, link resilience, and overhead. We offer insight into the various selection algorithms, their performance, and possibilities for improvement. [ABSTRACT FROM AUTHOR]

In the age of cloud, Grid, P2P, and volunteer distributed computing, large-scale systems with tens of thousands of unreliable hosts are increasingly common. Invariably, these systems are composed of heterogeneous hosts whose individual availability often exhibit different statistical properties (for example stationary versus nonstationary behavior) and fit different models (for example exponential, Weibull, or Pareto probability distributions). In this paper, we describe an effective method for discovering subsets of hosts whose availability have similar statistical properties and can be modeled with similar probability distributions. We apply this method with about 230,000 host availability traces obtained from a real Internet-distributed system, namely SETI@home. We find that about 21 percent of hosts exhibit availability, that is, a truly random process, and that these hosts can often be modeled accurately with a few distinct distributions from different families. We show that our models are useful and accurate in the context of a scheduling problem that deals with resource brokering. We believe that these methods and models are critical for the design of stochastic scheduling algorithms across large systems where host availability is uncertain. [ABSTRACT FROM AUTHOR]

This paper presents a novel parametric representation for bidirectional texture functions. Our method mainly relies on two original techniques, namely, multivariate spherical radial basis functions (SRBFs) and optimized parameterization. First, since the surface appearance of a real-world object is frequently a mixed effect of different physical factors, the proposed sum-of-products model based on multivariate SRBFs especially provides an intrinsic and efficient representation for heterogenous materials. Second, optimized parameterization particularly aims at overcoming the major disadvantage of traditional fixed parameterization. By using a parametric model to account for variable transformations, the parameterization process can be tightly integrated with multivariate SRBFs into a unified framework. Finally, a hierarchical fitting algorithm for bidirectional texture functions is developed to exploit spatial coherence and reduce computational cost. Our experimental results further reveal that the proposed representation can easily achieve high-quality approximation and real-time rendering performance. [ABSTRACT FROM AUTHOR]