1,720,955 research outputs found
Recursive algorithms for digital communications using the discrete wavelet transform.
No full textThe goal in digital communications is to efficiently and reliably transmit digital information through a channel. In order to optimally decode the transmitted symbols, it is often necessary to have good estimates of the channel parameters. In this thesis a class of recursive algorithms which perform joint Maximum Likelihood (ML) estimation of the channel parameters and the symbol sequence is developed. The channel parameters are assumed to consist of an unknown fixed complex gain (amplitude and phase), and time delay. The digital information is transmitted using binary or M-ary phase modulation and received in the presence of an additive white Gaussian noise. The algorithms presented in this work are based on a decomposition with respect to an orthonormal wavelet basis. This is motivated by the fact that the wavelet decomposition retains all the information in the observation, while facilitating processing by a recursive algorithm. In addition, the localization properties of the wavelet basis enable local updates of the symbol parameters. This results in an efficient digital algorithm with low complexity and small delay. In particular, the algorithm has a complexity per iteration that is quadratic in the number of users when applied in a multiuser system, while the optimal receiver which uses the matched filter outputs as a sufficient statistic has an exponential complexity in the number of users. The class of algorithms studied in this thesis applies to both single user and multiuser systems. First, a coordinate ascent algorithm for a single user system is developed. While the direct maximization of the likelihood function is analytically intractable, the recursive algorithm has simple updates which involve polynomial rooting for time delay estimation, discrete search for symbol estimation, and an analytical solution for gain estimation. The algorithm uses a look-up table for retrieving Fourier series coefficients of the transmitted pulse shape decomposition with respect to the wavelet basis. Simulations show fast convergence and attainment of estimation bounds. Next, the algorithm is extended to the multiuser case. Two versions have been developed: one using grouped coordinate ascent, and the other using the EM algorithm. Simulation results for a two-user system are shown. In addition, the problem of initializing the algorithm is addressed. Finally, an analysis of the single user algorithm is performed under some reasonable assumptions. It is shown that the algorithm has a fixed point at the true gain and time delay parameters in the limit of a large observation time.PhDApplied SciencesElectrical engineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/130118/2/9712083.pd
Feasibility study of parameter estimation of random sampling jitter using the bispectrum
Get PDFAn actual sampling process can be modeled as a random process, which consists of the regular (uniform) deterministic sampling process plus an error in the sampling times which constitutes a zero-mean noise (the jitter). In this paper we discuss the problem of estimating the jitter process. By assuming that the jitter process is an i.i.d. one, with standard deviation that is small compared to the regular sampling time, we show that the variance of the jitter process can be estimated from the n th order spectrum of the sampled data, n =2, 3, i.e., the jitter variance can be extracted from the 2nd-order spectrum or the 3rd-order spectrum (the bispectrum) of the sampled data, provided the continuous signal spectrum is known. However when the signal skewness exceeds a certain level, the potential performance of the bispectrum-based estimation is better than that of the spectrum-based estimation. Moreover, the former can also provide jitter variance estimates when the continuous signal spectrum is unknown while the latter cannot. This suggests that the bispectrum of the sampled data is potentially better for estimating any parameter of the sampling jitter process, once the signal skewness is sufficiently large.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/43577/1/34_2005_Article_BF01183740.pd
A suboptimal estimator of the sampling jitter variance using the bispectrum
Get PDFWe consider the problem of estimating parameters of an irregular sampling process defined as a uniform sampling process in which the deviations from the nominal sampling times constitute a random IID process (jitter). Emphasis is placed on estimating the variance of the jitter, based on observation of samples taken from a continuous band-limited third-order stationary process. We derive an estimation procedure which uses the bispectrum estimates of a process with a priori known bispectrum. Derivation of the generalized likelihood ratio in the bispectral domain, leads to a statistic with which a bispectrum-based maximum likelihood estimation can be done. We propose a suboptimal estimator, and show that it is asymptotically unbiased and consistent. The dependence of the estimator's performance on the data length and the skewness is studied for a specific example. The estimator's variance is compared to the bispectrum-based Cramer-Rao bound (BCRB), and is shown to approach it for sufficiently large data length or skewness. Computer simulations verify the effectiveness of the proposed estimation method for small jitter.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/31464/1/0000386.pd
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Get PDFWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
koamabayili/VECTRON-author-checklist: VECTRON author checklist
No full textWe have done our best to complete the author checklist relating to the use of animals in the hut study. Note that the objective for the hut study was to evaluate the IRS treatment applications for residual efficacy against Anopheles mosquitoes, including the local An. coluzzii mosquito population. Cows were only used to attract mosquitoes into the huts and no tests were carried out directly on the cows. The author checklist is intended for use with studies where experiments are carried out on animals, which is why we have had such difficulty in completing this for the hut study, as many of the questions do not relate to how the cows were used
- …
