Digital Phase-Locked Loop Behavior with Clock and Sampler Quantization

This paper deals with the analysis of digital phase-locked loop (DPLL) models that take into account the discrete nature of the analog-to-digital converter (ADC) and the numerical controlled oscillator (NCO). The models are general enough to allow for different kinds of noise distributions and nonuniform qnantization. Weak assumptions on the nature of the loop parameters reduce the models to finite Markov chain problems. It is shown that the resulting probability transition matrices are "lumpable," which translates into convenient Computational savings. In this manner, an exact statistical analysis is possible not only for first-order but also for second-order loops. Numerical results give evidence that for appropriate ADC and NCO characteristics, few quantization levels are needed to match the performance of models that ignore qnantization. However, when the values of these characteristics are not proper, a substantial change in performance can occur. This change in the loop behavior cannot be analyzed or predicted by those models that neglect the quantization effects. It is also found that the use of a nonlinear ADC improves the loop behavior when the noise density distribution is heavy-tailed, e.g., atmospheric noise.     

A distributed routing algorithm for multihop packet radio networkswith uni- and bi-directional links

Multihop packet radio networks require routing algorithms which are distributed in nature and which have the ability to timely detect changes in the network topology. These changes are mostly changes in connectivity caused by link or node failures and by the relative motion of the nodes. This paper describes and analyzes an adaptive decentralized routing algorithm for packet radio networks. The network connectivity, as perceived by each node, is translated into a graph representation of the network. The proposed routing mechanism then uses a breadth-first search algorithm along the inbound links of such a graph. Unlike most of the algorithms found in the open literature the one proposed here can be used in networks having both uni- and bi-directional radio links. Examples are shown to illustrate the methodology     

A note on efficient SS/TDMA assignment algorithms

A time-slot assignment procedure using the maximum-weight matching algorithm is proposed and investigated. In contrast with previous methods, based on the maximum-cardinality matching, the proposed procedure allows the inclusion of known heuristics in a more direct manner. Computer simulation gives evidence of efficiency improvements by using this approach     

Enhancement of Event Related Potentials by Iterative Restoration Algorithms

An iterative procedure for the restoration of event related potentials (ERP) is proposed and implemented. The method makes use of assumed or measured statistical information about latency variations in the individual ERP components. The signal model used for the restoration algorithm consists of a time-varying linear distortion and a positivity/negativity constraint. Additional preprocessing in the form of low-pass filtering is needed in order to mitigate the effects of additive noise. Numerical results obtained with real data show clearly the presence of enhanced and regenerated components in the restored ERP's. The procedure is easy to implement which makes it convenient when compared to other proposed techniques for the restoration of ERP signals.