To see the other types of publications on this topic, follow the link: Mean square Canny error.
Dissertations / Theses on the topic 'Mean square Canny error'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Mean square Canny error.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Degtyarena, Anna Semenovna. "The window least mean square error algorithm." CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2385.
Full textAbstract:
In order to improve the performance of LMS (least mean square) algorithm by decreasing the amount of calculations this research proposes to make an update on each step only for those elements from the input data set, that fall within a small window W near the separating hyperplane surface. This work aims to describe in detail the results that can be achieved by using the proposed LMS with window learning algorithm in information systems that employ the methodology of neural network for the purposes of classification.
2
Cui, Xiangchen. "Mean-Square Error Bounds and Perfect Sampling for Conditional Coding." DigitalCommons@USU, 2000. https://digitalcommons.usu.edu/etd/7107.
Full textAbstract:
In this dissertation, new theoretical results are obtained for bounding convergence and mean-square error in conditional coding. Further new statistical methods for the practical application of conditional coding are developed.
Criteria for the uniform convergence are first examined. Conditional coding Markov chains are aperiodic, π-irreducible, and Harris recurrent. By applying the general theories of uniform ergodicity of Markov chains on genera l state space, one can conclude that conditional coding Markov cha ins are uniformly ergodic and further, theoretical convergence rates based on Doeblin's condition can be found.
Conditional coding Markov chains can be also viewed as having finite state space. This allows use of techniques to get bounds on the second largest eigenvalue which lead to bounds on convergence rate and the mean-square error of sample averages. The results are applied in two examples showing that these bounds are useful in practice.
Next some algorithms for perfect sampling in conditional coding are studied. An application of exact sampling to the independence sampler is shown to be equivalent to standard rejection sampling. In case of single-site updating, traditional perfect sampling is not directly applicable when the state space has large cardinality and is not stochastically ordered, so a new procedure is developed that gives perfect samples at a predetermined confidence interval.
In last chapter procedures and possibilities of applying conditional coding to mixture models are explored. Conditional coding can be used for analysis of a finite mixture model. This methodology is general and easy to use.
3
Fodor, Balázs [Verfasser]. "Contributions to Statistical Modeling for Minimum Mean Square Error Estimation in Speech Enhancement / Balázs Fodor." Aachen : Shaker, 2015. http://d-nb.info/1070151815/34.
Full text
4
Xing, Chengwen, and 邢成文. "Linear minimum mean-square-error transceiver design for amplify-and-forward multiple antenna relaying systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B44769738.
Full text
5
Nicolson, Aaron M. "Deep Learning for Minimum Mean-Square Error and Missing Data Approaches to Robust Speech Processing." Thesis, Griffith University, 2020. http://hdl.handle.net/10072/399974.
Full textAbstract:
Speech corrupted by background noise (or noisy speech) can cause misinterpretation and fatigue during phone and conference calls, and for hearing aid users. Noisy speech can also severely impact the performance of speech processing systems such as automatic speech recognition (ASR), automatic speaker verification (ASV), and automatic speaker identification (ASI) systems. Currently, deep learning approaches are employed in an end-to-end fashion to improve robustness. The target speech (or clean speech) is used as the training target or large noisy speech datasets are used to facilitate multi-condition training. In this dissertation, we propose competitive alternatives to the preceding approaches by updating two classic robust speech processing techniques using deep learning. The two techniques include minimum mean-square error (MMSE) and missing data approaches. An MMSE estimator aims to improve the perceived quality and intelligibility of noisy speech. This is accomplished by suppressing any background noise without distorting the speech. Prior to the introduction of deep learning, MMSE estimators were the standard speech enhancement approach. MMSE estimators require the accurate estimation of the a priori signal-to-noise ratio (SNR) to attain a high level of speech enhancement performance. However, current methods produce a priori SNR estimates with a large tracking delay and a considerable amount of bias. Hence, we propose a deep learning approach to a priori SNR estimation that is significantly more accurate than previous estimators, called Deep Xi. Through objective and subjective testing across multiple conditions, such as real-world non-stationary and coloured noise sources at multiple SNR levels, we show that Deep Xi allows MMSE estimators to produce the highest quality enhanced speech amongst all clean speech magnitude spectrum estimators. Missing data approaches improve robustness by performing inference only on noisy speech features that reliably represent clean speech. In particular, the marginalisation method was able to significantly increase the robustness of Gaussian mixture model (GMM)-based speech classification systems (e.g. GMM-based ASR, ASV, or ASI systems) in the early 2000s. However, deep neural networks (DNNs) used in current speech classification systems are non-probabilistic, a requirement for marginalisation. Hence, multi-condition training or noisy speech pre-processing is used to increase the robustness of DNN-based speech classification systems. Recently, sum-product networks (SPNs) were proposed, which are deep probabilistic graphical models that can perform the probabilistic queries required for missing data approaches. While available toolkits for SPNs are in their infancy, we show through an ASI task that SPNs using missing data approaches could be a strong alternative for robust speech processing in the future. This dissertation demonstrates that MMSE estimators and missing data approaches are still relevant approaches to robust speech processing when assisted by deep learning.Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Eng & Built Env
Science, Environment, Engineering and Technology
Full Text
6
Septarina, Septarina. "Micro-Simulation of the Roundabout at Idrottsparken Using Aimsun : A Case Study of Idrottsparken Roundabout in Norrköping, Sweden." Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-79964.
Full textAbstract:
Microscopic traffic simulation is useful tool in analysing traffic and estimating the capacity and level of service of road networks. In this thesis, the four legged Idrottsparken roundabout in the city of Norrkoping in Sweden is analysed by using the microscopic traffic simulation package AIMSUN. For this purpose, data regarding traffic flow counts, travel times and queue lengths were collected for three consecutive weekdays during both the morning and afternoon peak periods. The data were then used in model building for simulation of traffic of the roundabout. The Root Mean Square Error (RMSE) method is used to get the optimal parameter value between queue length and travel time data and validation of travel time data are carried out to obtain the basic model which represents the existing condition of the system. Afterward, the results of the new models were evaluated and compared to the results of a SUMO model for the same scenario model. Based on calibrated and validated model, three alternative scenarios were simulated and analysed to improve efficiency of traffic network in the roundabout. The three scenarios includes: (1) add one free right turn in the north and east sections; (2) add one free right turn in the east and south sections; and (3) addition of one lane in roundabout. The analysis of these scenarios shows that the first and second scenario are only able to reduce the queue length and travel time in two or three legs, while the third scenario is not able to improve the performance of the roundabout. In this research, it can be concluded that the first scenario is considered as the best scenario compared to the second scenario and the third scenario. The comparison between AIMSUN and SUMO for the same scenario shows that the results have no significance differences. In calibration process, to get the optimal parameter values between the model measurements and the field measurements, both of AIMSUN and SUMO uses two significantly influencing parametersfor queue and travel time. AIMSUN package uses parameter of driver reaction time and the maximum acceleration, while SUMO package uses parameter of driver imperfection and also the driver rection time.
7
Nassr, Husam, and Kurt Kosbar. "PERFORMANCE EVALUATION FOR DECISION-FEEDBACK EQUALIZER WITH PARAMETER SELECTION ON UNDERWATER ACOUSTIC COMMUNICATION." International Foundation for Telemetering, 2017. http://hdl.handle.net/10150/626999.
Full textAbstract:
This paper investigates the effect of parameter selection for the decision feedback equalization (DFE) on communication performance through a dispersive underwater acoustic wireless channel (UAWC). A DFE based on minimum mean-square error (MMSE-DFE) criterion has been employed in the implementation for evaluation purposes. The output from the MMSE-DFE is input to the decoder to estimate the transmitted bit sequence. The main goal of this experimental simulation is to determine the best selection, such that the reduction in the computational overload is achieved without altering the performance of the system, where the computational complexity can be reduced by selecting an equalizer with a proper length. The system performance is tested for BPSK, QPSK, 8PSK and 16QAM modulation and a simulation for the system is carried out for Proakis channel A and real underwater wireless acoustic channel estimated during SPACE08 measurements to verify the selection.
8
Ding, Minhua. "Multiple-input multiple-output wireless system designs with imperfect channel knowledge." Thesis, Kingston, Ont. : [s.n.], 2008. http://hdl.handle.net/1974/1335.
Full text
9
Thompson, Grant. "Effects of DEM resolution on GIS-based solar radiation model output: A comparison with the National Solar Radiation Database." University of Cincinnati / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1258663688.
Full text
10
Kulkarni, Aditya. "Performance Analysis of Zero Forcing and Minimum Mean Square Error Equalizers on Multiple Input Multiple Output System on a Spinning Vehicle." International Foundation for Telemetering, 2014. http://hdl.handle.net/10150/577482.
Full textAbstract:
ITC/USA 2014 Conference Proceedings / The Fiftieth Annual International Telemetering Conference and Technical Exhibition / October 20-23, 2014 / Town and Country Resort & Convention Center, San Diego, CAChannel equalizers based on minimum mean square error (MMSE) and zero forcing (ZF) criteria have been formulated for a general scalable multiple input multiple output (MIMO) system and implemented for a 2x2 MIMO system with spatial multiplexing (SM) for Rayleigh channel associated with additive white Gaussian noise. A model to emulate transmitters and receivers on a spinning vehicle has been developed. A transceiver based on the BLAST architecture is developed in this work. A mathematical framework to explain the behavior of the ZF and MMSE equalizers is formulated. The performance of the equalizers has been validated for a case with one of the communication entities being a spinning aero vehicle. Performance analysis with respect to variation of angular separation between the antennas and relative antenna gain for each case is presented. Based on the simulation results a setup with optimal design parameters for placement of antennas, choice of the equalizers and transmit power is proposed.
11
Leksono, Catur Yudo, and Tina Andriyana. "Roundabout Microsimulation using SUMO : A Case Study in Idrottsparken RoundaboutNorrkӧping, Sweden." Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-79771.
Full textAbstract:
Idrottsparken roundabout in Norrkoping is located in the more dense part of the city.Congestion occurs in peak hours causing queue and extended travel time. This thesis aims to provide alternative model to reduce queue and travel time. Types ofobservation data are flow, length of queue, and travel time that are observed during peakhours in the morning and afternoon. Calibration process is done by minimising root meansquare error of queue, travel time, and combination both of them between observation andcalibrated model. SUMO version 0.14.0 is used to perform the microsimulation. There are two proposed alternatives, namely Scenario 1: the additional lane for right turnfrom East leg to North and from North leg to West and Scenario 2: restriction of heavy goodsvehicles passing Kungsgatan which is located in Northern leg of Idrottsparken roundaboutduring peak hours. For Scenario 1, the results from SUMO will be compared with AIMSUNin terms of queue and travel time. The result of microsimulation shows that parameters that have big influence in the calibrationprocess for SUMO are driver imperfection and driver’s reaction time, while for AIMSUN isdriver’s reaction time and maximum acceleration. From analysis found that the model of thecurrent situation at Idrottsparken can be represented by model simulation which usingcombination between root mean square error of queue and travel time in calibration andvalidation process. Moreover, scenario 2 is the best alternative for SUMO because itproduces the decrease of queue and travel time almost in all legs at morning and afternoonpeak hour without accompanied by increase significant value of them in the other legs. Thecomparison between SUMO and AIMSUN shows that, in general, the AIMSUN has higherchanges value in terms of queue and travel time due to the limited precision in SUMO forroundabout modelling.
12
Williams, Ian E. "Channel Equalization and Spatial Diversity for Aeronautical Telemetry Applications." International Foundation for Telemetering, 2010. http://hdl.handle.net/10150/605946.
Full textAbstract:
ITC/USA 2010 Conference Proceedings / The Forty-Sixth Annual International Telemetering Conference and Technical Exhibition / October 25-28, 2010 / Town and Country Resort & Convention Center, San Diego, CaliforniaThis work explores aeronautical telemetry communication performance with the SOQPSK- TG ARTM waveforms when frequency-selective multipath corrupts received information symbols. A multi-antenna equalization scheme is presented where each antenna's unique multipath channel is equalized using a pilot-aided optimal linear minimum mean-square error filter. Following independent channel equalization, a maximal ratio combining technique is used to generate a single receiver output for detection. This multi-antenna equalization process is shown to improve detection performance over maximal ratio combining alone.
13
Alexandridis, Roxana Antoanela. "Minimum disparity inference for discrete ranked set sampling data." Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1126033164.
Full textAbstract:
Thesis (Ph. D.)--Ohio State University, 2005.Title from first page of PDF file. Document formatted into pages; contains xi, 124 p.; also includes graphics. Includes bibliographical references (p. 121-124). Available online via OhioLINK's ETD Center
14
DeNooyer, Eric-Jan D. "Statistical Idealities and Expected Realities in the Wavelet Techniques Used for Denoising." Scholar Commons, 2010. http://scholarcommons.usf.edu/etd/3929.
Full textAbstract:
In the field of signal processing, one of the underlying enemies in obtaining a good quality signal is noise. The most common examples of signals that can be corrupted by noise are images and audio signals. Since the early 1980's, a time when wavelet transformations became a modernly defined tool, statistical techniques have been incorporated into processes that use wavelets with the goal of maximizing signal-to-noise ratios. We provide a brief history of wavelet theory, going back to Alfréd Haar's 1909 dissertation on orthogonal functions, as well as its important relationship to the earlier work of Joseph Fourier (circa 1801), which brought about that famous mathematical transformation, the Fourier series. We demonstrate how wavelet theory can be used to reconstruct an analyzed function, ergo, that it can be used to analyze and reconstruct images and audio signals as well. Then, in order to ground the understanding of the application of wavelets to the science of denoising, we discuss some important concepts from statistics. From all of these, we introduce the subject of wavelet shrinkage, a technique that combines wavelets and statistics into a "thresholding" scheme that effectively reduces noise without doing too much damage to the desired signal. Subsequently, we discuss how the effectiveness of these techniques are measured, both in the ideal sense and in the expected sense. We then look at an illustrative example in the application of one technique. Finally, we analyze this example more generally, in accordance with the underlying theory, and make some conclusions as to when wavelets are an effective technique in increasing a signal-to-noise ratio.
15
Gagakuma, Edem Coffie. "Multipath Channel Considerations in Aeronautical Telemetry." BYU ScholarsArchive, 2017. https://scholarsarchive.byu.edu/etd/6529.
Full textAbstract:
This thesis describes the use of scattering functions to characterize time-varying multipath radio channels. Channel Impulse responses were measured at Edwards Air Force Base (EAFB) and scattering functions generated from the impulse response data. From the scattering functions we compute the corresponding Doppler power spectrum and multipath intensity profile. These functions completely characterize the signal delay and the time varying nature of the channel in question and are used by systems engineers to design reliable communications links. We observe from our results that flight paths with ample reflectors exhibit significant multipath events. We also examine the bit error rate (BER) performance of a reduced-complexity equalizer for a truncated version of the pulse amplitude modulation (PAM) representation of SOQPSK-TG in a multipath channel. Since this reduced-complexity equalizer is based on the maximum likelihood (ML) principle, we expect it to perform optimally than any of the filter-based equalizers used in estimating received SOQPSK-TG symbols. As such we present a comparison between this ML detector and a minimum mean square error (MMSE) equalizer for the same example channel. The example channel used was motivated by the statistical channel characterizations described in thisthesis. Our analysis shows that the ML equalizer outperforms the MMSE equalizer in estimating received SOQPSK-TG symbols.
16
Savaux, Vincent. "Contribution to multipath channel estimation in an OFDM modulation context." Phd thesis, Supélec, 2013. http://tel.archives-ouvertes.fr/tel-00988283.
Full textAbstract:
In wireless communications systems, the transmission channel between the transmitter and the receiver antennas is one of the main sources of disruption for the signal. The multicarrier modulations, such as the orthogonal frequency division multiplexing (OFDM), are very robust against the multipath effect, and allow to recover the transmitted signal with a low error rate, when they are combined with a channel encoding. The channel estimation then plays a key role in the performance of the communications systems. In this PhD thesis, we study techniques based on least square (LS) and minimum mean square error (MMSE) estimators. The MMSE is optimal, but is much more complex than LS, and requires the a priori knowledge of the second order moment of the channel and the noise. In this presentation, two methods that allow to reach a performance close to the one of LMMSE while getting around its drawback are investigated. In another way, a third part of the presentation investigates the errors of estimation due to the interpolations.
17
Enqvist, Martin. "Linear Models of Nonlinear Systems." Doctoral thesis, Linköping : Linköpings universitet, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5330.
Full text
18
Behrle, Charles D. "Computer simulation studies of multiple broadband target localization via frequency domain beamforming for planar arrays." Thesis, Monterey, California. Naval Postgraduate School, 1988. http://hdl.handle.net/10945/22976.
Full textAbstract:
Approved for public release; distribution is unlimitedComputer simulation studies of a frequency domain adaptive beamforming algorithm are presented. These simulation studies were conducted to determine the multiple broadband target localization capability and the full angular coverage capability of the algorithm. The algorithm was evaluated at several signal-to-noise ratios with varying sampling rates. The number of iterations that the adaptive algorithm took to reach a minimum estimation error was determined. Results of the simulation studies indicate that the algorithm can localize multiple broadband targets and has full angular coverage capability.
http://archive.org/details/computersimulati00behr
Lieutenant, United States Navy
19
Syntetos, Argyrios. "Forecasting of intermittent demand." Thesis, Online version, 2001. http://bibpurl.oclc.org/web/26215.
Full text
20
Drvoštěp, Tomáš. "Ekonomie vychýleného odhadu." Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-193409.
Full textAbstract:
This thesis investigates optimality of heuristic forecasting. According to Goldstein a Gigerenzer (2009), heuristics can be viewed as predictive models, whose simplicity is exploiting the bias-variance trade-off. Economic agents learning in the context of rational expectations (Marcet a Sargent 1989) employ, on the contrary, complex models of the whole economy. Both of these approaches can be perceived as an optimal response complexity of the prediction task and availability of observations. This work introduces a straightforward extension to the standard model of decision making under uncertainty, where agents utility depends on accuracy of their predictions and where model complexity is moderated by regularization parameter. Results of Monte Carlo simulations reveal that in complicated environments, where few observations are at disposal, it is beneficial to construct simple models resembling heuristics. Unbiased models are preferred in more convenient conditions.
21
Yapici, Yavuz. "A Bidirectional Lms Algorithm For Estimation Of Fast Time-varying Channels." Phd thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613220/index.pdf.
Full textAbstract:
Effort to estimate unknown time-varying channels as a part of high-speed mobile communication systems is of interest especially for next-generation wireless systems. The high computational complexity of the optimal Wiener estimator usually makes its use impractical in fast time-varying channels. As a powerful candidate, the adaptive least mean squares (LMS) algorithm offers a computationally efficient solution with its simple first-order weight-vector update equation. However, the performance of the LMS algorithm deteriorates in time-varying channels as a result of the eigenvalue disparity, i.e., spread, of the input correlation matrix in such chan nels. In this work, we incorporate the L MS algorithm into the well-known bidirectional processing idea to produce an extension called the bidirectional LMS. This algorithm is shown to be robust to the adverse effects of time-varying channels such as large eigenvalue spread. The associated tracking performance is observed to be very close to that of the optimal Wiener filter in many cases and the bidirectional LMS algorithm is therefore referred to as near-optimal. The computational complexity is observed to increase by the bidirectional employment of the LMS algorithm, but nevertheless is significantly lower than that of the optimal Wiener filter. The tracking behavior of the bidirectional LMS algorithm is also analyzed and eventually a steady-state step-size dependent mean square error (MSE) expression is derived for single antenna flat-fading channels with various correlation properties. The aforementioned analysis is then generalized to include single-antenna frequency-selective channels where the so-called ind ependence assumption is no more applicable due to the channel memory at hand, and then to multi-antenna flat-fading channels. The optimal selection of the step-size values is also presented using the results of the MSE analysis. The numerical evaluations show a very good match between the theoretical and the experimental results under various scenarios. The tracking analysis of the bidirectional LMS algorithm is believed to be novel in the sense that although there are several works in the literature on the bidirectional estimation, none of them provides a theoretical analysis on the underlying estimators. An iterative channel estimation scheme is also presented as a more realistic application for each of the estimation algorithms and the channel models under consideration. As a result, the bidirectional LMS algorithm is observed to be very successful for this real-life application with its increased but still practical level of complexity, the near-optimal tracking performa nce and robustness to the imperfect initialization.
22
Vavruška, Marek. "Realised stochastic volatility in practice." Master's thesis, Vysoká škola ekonomická v Praze, 2012. http://www.nusl.cz/ntk/nusl-165381.
Full textAbstract:
Realised Stochastic Volatility model of Koopman and Scharth (2011) is applied to the five stocks listed on NYSE in this thesis. Aim of this thesis is to investigate the effect of speeding up the trade data processing by skipping the cleaning rule requiring the quote data. The framework of the Realised Stochastic Volatility model allows the realised measures to be biased estimates of the integrated volatility, which further supports this approach. The number of errors in recorded trades has decreased significantly during the past years. Different sample lengths were used to construct one day-ahead forecasts of realised measures to examine the forecast precision sensitivity to the rolling window length. Use of the longest window length does not lead to the lowest mean square error. The dominance of the Realised Stochastic Volatility model in terms of the lowest mean square errors of one day-ahead out-of-sample forecasts has been confirmed.
23
Chitte, Sree Divya. "Source localization from received signal strength under lognormal shadowing." Thesis, University of Iowa, 2010. https://ir.uiowa.edu/etd/477.
Full textAbstract:
This thesis considers statistical issues in source localization from the received signal strength (RSS) measurements at sensor locations, under the practical assumption of log-normal shadowing. Distance information of source from sensor locations can be estimated from RSS measurements and many algorithms directly use powers of distances to localize the source, even though distance measurements are not directly available. The first part of the thesis considers the statistical analysis of distance estimation from RSS measurments. We show that the underlying problem is inefficient and there is only one unbiased estimator for this problem and its mean square error (MSE) grows exponentially with noise power. Later, we provide the linear minimum mean square error (MMSE) estimator whose bias and MSE are bounded in noise power. The second part of the thesis establishes an isomorphism between estimates of differences between squares of distances and the source location. This is used to completely characterize the class of unbiased estimates of the source location and to show that their MSEs grow exponentially with noise powers. Later, we propose an estimate based on the linear MMSE estimate of distances that has error variance and bias that is bounded in the noise variance.
24
Jones, Haley M., and Haley Jones@anu edu au. "On multipath spatial diversity in wireless multiuser communications." The Australian National University. Research School of Information Sciences and Engineering, 2001. http://thesis.anu.edu.au./public/adt-ANU20050202.152811.
Full textAbstract:
The study of the spatial aspects of multipath in wireless communications environments
is an increasingly important addition to the study of the temporal aspects
in the search for ways to increase the utilization of the available wireless channel
capacity. Traditionally, multipath has been viewed as an encumbrance in wireless
communications, two of the major impairments being signal fading and intersymbol
interference. However, recently the potential advantages of the diversity offered by
multipath rich environments in multiuser communications have been recognised.
Space time coding, for example, is a recent technique which relies on a rich scattering
environment to create many practically uncorrelated signal transmission
channels. Most often, statistical models have been used to describe the multipath
environments in such applications. This approach has met with reasonable success
but is limited when the statistical nature of a field is not easily determined or is
not readily described by a known distribution.¶
Our primary aim in this thesis is to probe further into the nature of multipath
environments in order to gain a greater understanding of their characteristics and
diversity potential. We highlight the shortcomings of beamforming in a multipath
multiuser access environment. We show that the ability of a beamformer to resolve
two or more signals in angle directly limits its achievable capacity.¶
We test the probity of multipath as a source of spatial diversity, the limiting
case of which is co-located users. We introduce the concept of separability to define
the fundamental limits of a receiver to extract the signal of a desired user from
interfering users signals and noise. We consider the separability performances of
the minimum mean square error (MMSE), decorrelating (DEC) and matched filter
(MF) detectors as we bring the positions of a desired and an interfering user closer
together. We show that both the MMSE and DEC detectors are able to achieve
acceptable levels of separability with the users as close as λ/10.¶
In seeking a better understanding of the nature of multipath fields themselves,
we take two approaches. In the first we take a path oriented approach. The
effects on the variation of the field power of the relative values of parameters such
as amplitude and propagation direction are considered for a two path field. The
results are applied to a theoretical analysis of the behaviour of linear detectors
in multipath fields. This approach is insightful for fields with small numbers of
multipaths, but quickly becomes mathematically complex.¶
In a more general approach, we take a field oriented view, seeking to quantify
the complexity of arbitrary fields. We find that a multipath field has an intrinsic
dimensionality of (πe)R/λ≈8.54R/λ, for a field in a two dimensional circular region, increasing only linearly with the radius R of the region. This result implies that there is no such thing as an arbitrarily complicated multipath field. That is, a field generated by any number of nearfield and farfield, specular and diffuse
multipath reflections is no more complicated than a field generated by a limited
number of plane waves. As such, there are limits on how rich multipath can
be. This result has significant implications including means: i) to determine a
parsimonious parameterization for arbitrary multipath fields and ii) of synthesizing
arbitrary multipath fields with arbitrarily located nearfield or farfield, spatially
discrete or continuous sources. The theoretical results are corroborated by examples
of multipath field analysis and synthesis.
25
Hsiao, Wen-Hsin. "Aspects of Fourier imaging." Thesis, University of Canterbury. Electrical and Computer Engineering, 2008. http://hdl.handle.net/10092/1245.
Full textAbstract:
A number of topics related to Fourier imaging are investigated. Relationships between the magnitude of errors in the amplitude and phase of the Fourier transform of images and the mean square error in reconstructed images are derived. The differing effects of amplitude and phase errors are evaluated, and "equivalent" amplitude and phase errors are derived. A model of the probability density function of the Fourier amplitudes of images is derived. The fundamental basis of phase dominance is studied and quantitated. Inconsistencies in published counter-examples of phase dominance are highlighted. The key characteristics of natural images that lead to their observed power spectral behaviour with spatial frequency are determined.
26
Zhao, Zhanlue. "Performance Appraisal of Estimation Algorithms and Application of Estimation Algorithms to Target Tracking." ScholarWorks@UNO, 2006. http://scholarworks.uno.edu/td/394.
Full textAbstract:
This dissertation consists of two parts. The first part deals with the performance appraisal of estimation algorithms. The second part focuses on the application of estimation algorithms to target tracking. Performance appraisal is crucial for understanding, developing and comparing various estimation algorithms. In particular, with the evolvement of estimation theory and the increase of problem complexity, performance appraisal is getting more and more challenging for engineers to make comprehensive conclusions. However, the existing theoretical results are inadequate for practical reference. The first part of this dissertation is dedicated to performance measures which include local performance measures, global performance measures and model distortion measure. The second part focuses on application of the recursive best linear unbiased estimation (BLUE) or lineae minimum mean square error (LMMSE) estimation to nonlinear measurement problem in target tracking. Kalman filter has been the dominant basis for dynamic state filtering for several decades. Beyond Kalman filter, a more fundamental basis for the recursive best linear unbiased filtering has been thoroughly investigated in a series of papers by Dr. X. Rong Li. Based on the so-called quasirecursive best linear unbiased filtering technique, the constraints of the Kalman filter Linear-Gaussian assumptions can be relaxed such that a general linear filtering technique for nonlinear systems can be achieved. An approximate optimal BLUE filter is implemented for nonlinear measurements in target tracking which outperforms the existing method significantly in terms of accuracy, credibility and robustness.
27
Liu, Yu. "Estimation, Decision and Applications to Target Tracking." ScholarWorks@UNO, 2013. http://scholarworks.uno.edu/td/1758.
Full textAbstract:
This dissertation mainly consists of three parts. The first part proposes generalized linear minimum mean-square error (GLMMSE) estimation for nonlinear point estimation. The second part proposes a recursive joint decision and estimation (RJDE) algorithm for joint decision and estimation (JDE). The third part analyzes the performance of sequential probability ratio test (SPRT) when the log-likelihood ratios (LLR) are independent but not identically distributed.
The linear minimum mean-square error (LMMSE) estimation plays an important role in nonlinear estimation. It searches for the best estimator in the set of all estimators that are linear in the measurement. A GLMMSE estimation framework is proposed in this disser- tation. It employs a vector-valued measurement transform function (MTF) and finds the best estimator among all estimators that are linear in MTF. Several design guidelines for the MTF based on a numerical example were provided.
A RJDE algorithm based on a generalized Bayes risk is proposed in this dissertation for dynamic JDE problems. It is computationally efficient for dynamic problems where data are made available sequentially. Further, since existing performance measures for estimation or decision are effective to evaluate JDE algorithms, a joint performance measure is proposed for JDE algorithms for dynamic problems. The RJDE algorithm is demonstrated by applications to joint tracking and classification as well as joint tracking and detection in target tracking.
The characteristics and performance of SPRT are characterized by two important functions—operating characteristic (OC) and average sample number (ASN). These two functions have been studied extensively under the assumption of independent and identically distributed (i.i.d.) LLR, which is too stringent for many applications. This dissertation relaxes the requirement of identical distribution. Two inductive equations governing the OC and ASN are developed. Unfortunately, they have non-unique solutions in the general case. They do have unique solutions in two special cases: (a) the LLR sequence converges in distributions and (b) the LLR sequence has periodic distributions. Further, the analysis can be readily extended to evaluate the performance of the truncated SPRT and the cumulative sum test.
28
Stoorhöök, Li, and Sara Artursson. "Hur påverkar avrundningar tillförlitligheten hos parameterskattningar i en linjär blandad modell?" Thesis, Uppsala universitet, Statistiska institutionen, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-279039.
Full textAbstract:
Tidigare studier visar på att blodtrycket hos gravida sjunker under andra trimestern och sedanökar i ett senare skede av graviditeten. Högt blodtryck hos gravida kan medföra hälsorisker, vilket gör mätningar av blodtryck relevanta. Dock uppstår det osäkerhet då olika personer inom vården hanterar blodtrycksmätningarna på olika sätt. Delar av vårdpersonalen avrundarmätvärden och andra gör det inte, vilket kan leda till svårigheter att tolkablodtrycksutvecklingen. I uppsatsen behandlas ett dataset innehållandes blodtrycksvärden hos gravida genom att skatta nio olika linjära regressionsmodeller med blandade effekter. Därefter genomförs en simuleringsstudie med syfte att undersöka hur mätproblem orsakat av avrundningar påverkar parameterskattningar och modellval i en linjär blandad modell. Slutsatsen är att blodtrycksavrundningarna inte påverkar typ 1-felet men påverkar styrkan. Dock innebär inte detta något problem vid fortsatt analys av blodtrycksvärdena i det verkliga datasetet.
29
AraÃjo, Daniel Costa. "DetecÃÃo de Sinais m-QAM NÃo-Ortogonais." Universidade Federal do CearÃ, 2012. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8373.
Full textAbstract:
CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel SuperiorEste trabalho apresenta estudos sobre sistemas de comunicaÃÃo cujos sinais utilizados para a transmissÃo das informaÃÃes sÃo nÃo-ortogonais, superpostos em frequÃncia, e com espaÃamento entre portadoras menor do que a taxa de sÃmbolo. As pesquisas estÃo direcionadas na obtenÃÃo de estruturas de transmissor e receptor Ãtimos e sub-Ãtimos, na modelagem e anÃlise matemÃtica dos sistemas incluindo o canal, em propostas de estratÃgias para detecÃÃo de sÃmbolo, e na avaliaÃÃo de desempenho. SÃo propostas sete estratÃgias de recepÃÃo de N sinais m-QAM nÃo-ortogonais atravÃs do canal AWGN. Dentre as estratÃgias de detecÃÃo duas sÃo Ãtimas e as outras cinco sÃo subÃtimas. As duas estruturas de receptores Ãtimos apresentados neste trabalho sÃo: o receptor de mÃxima verossimilhanÃa (ML) clÃssico e o receptor de mÃxima verossimilhanÃa com base na decomposiÃÃo de Gram-Schmidt. Os receptores sub-Ãtimos desenvolvidos neste trabalho sÃo de dois tipos: receptores com equalizaÃÃo linear e receptores com equalizaÃÃo nÃo-linear. O primeiro tipo de receptor à desenvolvido com base nos critÃrios de erro quadrÃtico mÃdio mÃnimo (MMSE) e o de forÃagem a zero (ZF). à apresentado o desenvolvimento analÃtico do projeto de cada uma das arquiteturas de receptores lineares, assim como à determinado o erro dos estimadores. Os receptores com equalizaÃÃo nÃo-linear sÃo baseados no cancelamento de interferÃncia sucessiva (SIC). Neste trabalho, à proposta uma modificaÃÃo no algoritmo do SIC original, resultando em uma nova arquitetura de equalizaÃÃo. O desempenho dos receptores propostos à avaliado em diferentes condiÃÃes de nÃmero de portadoras e de grau de superposiÃÃo espectral atravÃs de simulaÃÃo computacional. Por fim, sÃo apresentados as conlusÃes e as perspectivas futuras de pesquisa.
This work presents studies on communication systems, whose signals used for transmission of information are non-orthogonal, overlapping in frequency and carrier spacing less than the rate of symbols. The research is aimed to obtain structures of transmitter, optimal and sub-optimal receivers using modeling and mathematical analysis of systems including the channel. Furthermore, propose strategies for symbol detection and performance evaluation. Seven strategies of reception to N signals m-QAM non-orthogonal through the AWGN channel. Among the strategies of detection two are optimal and the others five are suboptimal. The two optimal receivers structures presented in this paper are: the classical receiver maximum likelihood (ML) receiver and maximum likelihood based on the Gram-Schmidt decomposition. The suboptimal receivers in this work are of two types: receivers with linear and nonlinear equalization. The first type of receiver is developed based on the criteria of minimum mean square error (MMSE) and the zero forcing (ZF). It is presented the development of analytical design of each linear receiver architectures, as well as determined the error of the estimators. The receivers with nonlinear equalization are based on successive interference cancellation (SIC). In this paper, we propose a modification to the original algorithm of SIC, resulting in a new architecture of equalization. The performance of the proposed receivers is evaluated under different number of carriers and the degree of spectral overlap using computer simulation. Finally, we present the conclusions of this work and future prospects of the research.
30
Bernal, Regina Tomie Ivata. "Inquéritos por telefone: inferências válidas em regiões com baixa taxa de cobertura de linhas residenciais." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/6/6132/tde-09092011-120701/.
Full textAbstract:
Introdução: O inquérito por telefone, quando comparado ao inquérito domiciliar possui vários atrativos, em especial baixo custo operacional e rapidez do processo de divulgação de resultados. No entanto, a exclusão de domicílios sem telefone fixo, pode representar série questão de validade nas estimativas obtidas. Objetivo: Avaliar vícios potenciais nos resultados divulgados no Sistema de Vigilância de Fatores de Risco para Doenças Crônicas por Inquérito Telefônico (VIGITEL) em município de baixa cobertura de domicílios com telefone fixo. Métodos: A partir de resultados levantados pelo Inquérito Domiciliar realizado no município de Rio Branco-AC, com cobertura de 41 por cento dos domicílios com telefone fixo, tentou-se localizar vícios introduzidos nos resultados do Vigitel. Foi usado método alternativo de ponderação para diminuir o vício da estimativa do Vigitel. Resultados: O Vigitel subestima a maioria das prevalências estimadas. Os pesos de pós-estratificação eliminam parcialmente o vício, cuja origem é proveniente de baixa taxa de cobertura de domicílios com telefone fixo. Por outro lado, o uso desses pesos, quando não necessário, potencializou o vício das variáveis não associadas à posse de telefone fixo. Conclusões: Em municípios de baixa taxa de cobertura de domicílios com telefone fixo, torna-se necessária a implementação de novo método de ponderação e estratégia de seleção de variáveis externas para construção dos pesos de pós estratificação, que minimizem o vício nas estimativas das variáveis levantadasIntrodução: O inquérito por telefone, quando comparado ao inquérito domiciliar possui vários atrativos, em especial baixo custo operacional e rapidez do processo de divulgação de resultados. No entanto, a exclusão de domicílios sem telefone fixo, pode representar série questão de validade nas estimativas obtidas. Objetivo: Avaliar vícios potenciais nos resultados divulgados no Sistema de Vigilância de Fatores de Risco para Doenças Crônicas por Inquérito Telefônico (VIGITEL) em município de baixa cobertura de domicílios com telefone fixo. Métodos: A partir de resultados levantados pelo Inquérito Domiciliar realizado no município de Rio Branco-AC, com cobertura de 41 por cento dos domicílios com telefone fixo, tentou-se localizar vícios introduzidos nos resultados do Vigitel. Foi usado método alternativo de ponderação para diminuir o vício da estimativa do Vigitel. Resultados: O Vigitel subestima a maioria das prevalências estimadas. Os pesos de pós-estratificação eliminam parcialmente o vício, cuja origem é proveniente de baixa taxa de cobertura de domicílios com telefone fixo. Por outro lado, o uso desses pesos, quando não necessário, potencializou o vício das variáveis não associadas à posse de telefone fixo. Conclusões: Em municípios de baixa taxa de cobertura de domicílios com telefone fixo, torna-se necessária a implementação de novo método de ponderação e estratégia de seleção de variáveis externas para construção dos pesos de pós estratificação, que minimizem o vício nas estimativas das variáveis levantadas
31
Tua-Martinez, Carlos Gustavo. "Behavioral Model and Predistortion Algorithm to Mitigate Interpulse Instabilities Induced by Gallium Nitride Power Amplifiers in Multifunction Radars." Diss., Virginia Tech, 2017. http://hdl.handle.net/10919/74445.
Full textAbstract:
The incorporation of Gallium Nitride (GaN) Power Amplifiers (PAs) into future high power aperture radar systems is certain; however, the introduction of this technology into multifunction radar systems will present new challenges to radar engineers. This dissertation describes a broad investigation into amplitude and phase transients produced by GaN PAs when they are excited with multifunction radar waveforms. These transients are the result of self-heating electrothermal memory effects and are manifested as interpulse instabilities that can negatively impact the coherent processing of multiple pulses. A behavioral model based on a Foster network topology has been developed to replicate the measured amplitude and phase transients accurately. This model has been used to develop a digital predistortion technique that successfully mitigates the impact of the transients. The Moving Target Indicator (MTI) Improvement Factor and the Root Mean Square (RMS) Pulse-to-Pulse Stability are used as metrics to assess the impact of the transients on radar system performance and to test the effectiveness of a novel digital predistortion concept.Ph. D.
32
Thomas, Robin Rajan. "Optimisation of adaptive localisation techniques for cognitive radio." Diss., University of Pretoria, 2012. http://hdl.handle.net/2263/27076.
Full textAbstract:
Spectrum, environment and location awareness are key characteristics of cognitive radio (CR). Knowledge of a user’s location as well as the surrounding environment type may enhance various CR tasks, such as spectrum sensing, dynamic channel allocation and interference management. This dissertation deals with the optimisation of adaptive localisation techniques for CR. The first part entails the development and evaluation of an efficient bandwidth determination (BD) model, which is a key component of the cognitive positioning system. This bandwidth efficiency is achieved using the Cramer-Rao lower bound derivations for a single-input-multiple-output (SIMO) antenna scheme. The performances of the single-input-single-output (SISO) and SIMO BD models are compared using three different generalised environmental models, viz. rural, urban and suburban areas. In the case of all three scenarios, the results reveal a marked improvement in the bandwidth efficiency for a SIMO antenna positioning scheme, especially for the 1×3 urban case, where a 62% root mean square error (RMSE) improvement over the SISO system is observed. The second part of the dissertation involves the presentation of a multiband time-of arrival (TOA) positioning technique for CR. The RMSE positional accuracy is evaluated using a fixed and dynamic bandwidth availability model. In the case of the fixed bandwidth availability model, the multiband TOA positioning model is initially evaluated using the two-step maximum-likelihood (TSML) location estimation algorithm for a scenario where line-of-sight represents the dominant signal path. Thereafter, a more realistic dynamic bandwidth availability model has been proposed, which is based on data obtained from an ultra-high frequency spectrum occupancy measurement campaign. The RMSE performance is then verified using the non-linear least squares, linear least squares and TSML location estimation techniques, using five different bandwidths. The proposed multiband positioning model performs well in poor signal-to-noise ratio conditions (-10 dB to 0 dB) when compared to a single band TOA system. These results indicate the advantage of opportunistic TOA location estimation in a CR environment.Dissertation (MEng)--University of Pretoria, 2012.
Electrical, Electronic and Computer Engineering
unrestricted
33
Fuster, Criado Laura. "Linear and nonlinear room compensation of audio rendering systems." Doctoral thesis, Universitat Politècnica de València, 2016. http://hdl.handle.net/10251/59459.
Full textAbstract:
[EN] Common audio systems are designed with the intent of creating real and immersive scenarios that allow the user to experience a particular acoustic sensation that does not depend on the room he is perceiving the sound. However, acoustic devices and multichannel rendering systems working inside a room, can impair the global audio effect and thus the 3D spatial sound.
In order to preserve the spatial sound characteristics of multichannel rendering techniques, adaptive filtering schemes are presented in this dissertation to compensate these electroacoustic effects and to achieve the immersive sensation of the desired acoustic system. Adaptive filtering offers a solution to the room equalization problem that is doubly interesting. First of all, it iteratively solves the room inversion problem, which can become computationally complex to obtain when direct methods are used. Secondly, the use of adaptive filters allows to follow the time-varying room conditions.
In this regard, adaptive equalization (AE) filters try to cancel the echoes due to the room effects. In this work, we consider this problem and propose effective and robust linear schemes to solve this equalization problem by using adaptive filters. To do this, different adaptive filtering schemes are introduced in the AE context. These filtering schemes are based on three strategies previously introduced in the literature: the convex combination of filters, the biasing of the filter weights and the block-based filtering. More specifically, and motivated by the sparse nature of the acoustic impulse response and its corresponding optimal inverse filter, we introduce different adaptive equalization algorithms.
In addition, since audio immersive systems usually require the use of multiple transducers, the multichannel adaptive equalization problem should be also taken into account when new single-channel approaches are presented, in the sense that they can be straightforwardly extended to the multichannel case.
On the other hand, when dealing with audio devices, consideration must be given to the nonlinearities of the system in order to properly equalize the electroacoustic system. For that purpose, we propose a novel nonlinear filtered-x approach to compensate both room reverberation and nonlinear distortion with memory caused by the amplifier and loudspeaker devices.
Finally, it is important to validate the algorithms proposed in a real-time implementation. Thus, some initial research results demonstrate that an adaptive equalizer can be used to compensate room distortions.[ES] Los sistemas de audio actuales están diseñados con la idea de crear escenarios reales e inmersivos que permitan al usuario experimentar determinadas sensaciones acústicas que no dependan de la sala o situación donde se esté percibiendo el sonido. Sin embargo, los dispositivos acústicos y los sistemas multicanal funcionando dentro de salas, pueden perjudicar el efecto global sonoro y de esta forma, el sonido espacial 3D. Para poder preservar las características espaciales sonoras de los sistemas de reproducción multicanal, en esta tesis se presentan los esquemas de filtrado adaptativo para compensar dichos efectos electroacústicos y conseguir la sensación inmersiva del sistema sonoro deseado. El filtrado adaptativo ofrece una solución al problema de salas que es interesante por dos motivos. Por un lado, resuelve de forma iterativa el problema de inversión de salas, que puede llegar a ser computacionalmente costoso para los métodos de inversión directos existentes. Por otro lado, el uso de filtros adaptativos permite seguir las variaciones cambiantes de los efectos de la sala de escucha. A este respecto, los filtros de ecualización adaptativa (AE) intentan cancelar los ecos introducidos por la sala de escucha. En esta tesis se considera este problema y se proponen esquemas lineales efectivos y robustos para resolver el problema de ecualización mediante filtros adaptativos. Para conseguirlo, se introducen diferentes esquemas de filtrado adaptativo para AE. Estos esquemas de filtrado se basan en tres estrategias ya usadas en la literatura: la combinación convexa de filtros, el sesgado de los coeficientes del filtro y el filtrado basado en bloques. Más especificamente y motivado por la naturaleza dispersiva de las respuestas al impulso acústicas y de sus correspondientes filtros inversos óptimos, se presentan diversos algoritmos adaptativos de ecualización específicos. Además, ya que los sistemas de audio inmersivos requieren usar normalmente múltiples trasductores, se debe considerar también el problema de ecualización multicanal adaptativa cuando se diseñan nuevas estrategias de filtrado adaptativo para sistemas monocanal, ya que éstas deben ser fácilmente extrapolables al caso multicanal. Por otro lado, cuando se utilizan dispositivos acústicos, se debe considerar la existencia de no linearidades en el sistema elactroacústico, para poder ecualizarlo correctamente. Por este motivo, se propone un nuevo modelo no lineal de filtrado-x que compense a la vez la reverberación introducida por la sala y la distorsión no lineal con memoria provocada por el amplificador y el altavoz. Por último, es importante validar los algoritmos propuestos mediante implementaciones en tiempo real, para asegurarnos que pueden realizarse. Para ello, se presentan algunos resultados experimentales iniciales que muestran la idoneidad de la ecualización adaptativa en problemas de compensación de salas.
[CAT] Els sistemes d'àudio actuals es dissenyen amb l'objectiu de crear ambients reals i immersius que permeten a l'usuari experimentar una sensació acústica particular que no depèn de la sala on està percebent el so. No obstant això, els dispositius acústics i els sistemes de renderització multicanal treballant dins d'una sala poden arribar a modificar l'efecte global de l'àudio i per tant, l'efecte 3D del so a l'espai. Amb l'objectiu de conservar les característiques espacials del so obtingut amb tècniques de renderització multicanal, aquesta tesi doctoral presenta esquemes de filtrat adaptatiu per a compensar aquests efectes electroacústics i aconseguir una sensació immersiva del sistema acústic desitjat. El filtrat adaptatiu presenta una solució al problema d'equalització de sales que es interessant baix dos punts de vista. Per una banda, el filtrat adaptatiu resol de forma iterativa el problema inversió de sales, que pot arribar a ser molt complexe computacionalment quan s'utilitzen mètodes directes. Per altra banda, l'ús de filtres adaptatius permet fer un seguiment de les condicions canviants de la sala amb el temps. Més concretament, els filtres d'equalització adaptatius (EA) intenten cancel·lar els ecos produïts per la sala. A aquesta tesi, considerem aquest problema i proposem esquemes lineals efectius i robustos per a resoldre aquest problema d'equalització mitjançant filtres adaptatius. Per aconseguir-ho, diferent esquemes de filtrat adaptatiu es presenten dins del context del problema d'EA. Aquests esquemes de filtrat es basen en tres estratègies ja presentades a l'estat de l'art: la combinació convexa de filtres, el sesgat dels pesos del filtre i el filtrat basat en blocs. Més concretament, i motivat per la naturalesa dispersa de la resposta a l'impuls acústica i el corresponent filtre òptim invers, presentem diferents algorismes d'equalització adaptativa. A més a més, com que els sistemes d'àudio immersiu normalment requereixen l'ús de múltiples transductors, cal considerar també el problema d'equalització adaptativa multicanal quan es presenten noves solucions de canal simple, ja que aquestes s'han de poder estendre fàcilment al cas multicanal. Un altre aspecte a considerar quan es treballa amb dispositius d'àudio és el de les no linealitats del sistema a l'hora d'equalitzar correctament el sistema electroacústic. Amb aquest objectiu, a aquesta tesi es proposa una nova tècnica basada en filtrat-x no lineal, per a compensar tant la reverberació de la sala com la distorsió no lineal amb memòria introduïda per l'amplificador i els altaveus. Per últim, és important validar la implementació en temps real dels algorismes proposats. Amb aquest objectiu, alguns resultats inicials demostren la idoneïtat de l'equalització adaptativa en problemes de compensació de sales.
Fuster Criado, L. (2015). Linear and nonlinear room compensation of audio rendering systems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/59459
TESIS
34
Palaj, Lukáš. "Aplikace lokálních aproximátorů pro řízení reálného mechatronického systému." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2011. http://www.nusl.cz/ntk/nusl-229786.
Full textAbstract:
Cieľom práce je aplikácia lokálnych aproximátorov pre riadenie reálnych mechatronických sústav pomocou metódy dopredného riadenia predstavujúcej zaujímavú alternatívu k metódam využívajúcim globálne aproximátory. Po ukážkových príkladoch funkcie lokálnych aproximátorov bol navrhnutý algoritmus implementovaný pre riadenie dvoch sústav, elektronickej škrtiacej klapky a výukového modelu magnetickej levitácie, predstavujúcich vysoko nelineárne a nestabilné sústavy. Skúmali sme, či riadiaci algoritmus bude mať pozitívny vplyv na presnosť regulácie, ďalej bola skúmaná jeho schopnosť prispôsobiť sa zmene parametrov sústavy a tiež prípadná možnosť jeho implementácie pre mikrokontrolér znížením vzorkovacej frekvencie. Výsledky ukázali, že riadenie založené na lokálnych modeloch zlepšilo riadenie v porovnaní s jednoduchým PID regulátorom a že má schopnosť adaptability. Veľmi výhodné sa zdá byť jeho použitie pre zariadenia umožnujúce vzorkovaciu frekvenciu do 1 kHz.
35
Glickman, Mark. "Disturbance monitoring in distributed power systems." Thesis, Queensland University of Technology, 2007. https://eprints.qut.edu.au/16497/1/Mark_Glickman_Thesis.pdf.
Full textAbstract:
Power system generators are interconnected in a distributed network to allow sharing of power. If one of the generators cannot meet the power demand, spare power is diverted from neighbouring generators. However, this approach also allows for propagation of electric disturbances. An oscillation arising from a disturbance at a given generator site will affect the normal operation of neighbouring generators and might cause them to fail. Hours of production time will be lost in the time it takes to restart the power plant. If the disturbance is detected early, appropriate control measures can be applied to ensure system stability. The aim of this study is to improve existing algorithms that estimate the oscillation parameters from acquired generator data to detect potentially dangerous power system disturbances.
When disturbances occur in power systems (due to load changes or faults), damped oscillations (or "modes") are created. Modes which are heavily damped die out quickly and pose no threat to system stability. Lightly damped modes, by contrast, die out slowly and are more problematic. Of more concern still are "negatively damped" modes which grow exponentially with time and can ultimately cause the power system to fail. Widespread blackouts are then possible. To avert power system failures it is necessary to monitor the damping of the oscillating modes. This thesis proposes a number of damping estimation algorithms for this task. If the damping is found to be very small or even negative, then additional damping needs to be introduced via appropriate control strategies.
This thesis presents a number of new algorithms for estimating the damping of modal oscillations in power systems. The first of these algorithms uses multiple orthogonal sliding windows along with least-squares techniques to estimate the modal damping. This algorithm produces results which are superior to those of earlier sliding window algorithms (that use only one pair of sliding windows to estimate the damping). The second algorithm uses a different modification of the standard sliding window damping estimation algorithm - the algorithm exploits the fact that the Signal to Noise Ratio (SNR) within the Fourier transform of practical power system signals is typically constant across a wide frequency range. Accordingly, damping estimates are obtained at a range of frequencies and then averaged. The third algorithm applied to power system analysis is based on optimal estimation theory. It is computationally efficient and gives optimal accuracy, at least for modes which are well separated in frequency.
36
Glickman, Mark. "Disturbance monitoring in distributed power systems." Queensland University of Technology, 2007. http://eprints.qut.edu.au/16497/.
Full textAbstract:
Power system generators are interconnected in a distributed network to allow sharing of power. If one of the generators cannot meet the power demand, spare power is diverted from neighbouring generators. However, this approach also allows for propagation of electric disturbances. An oscillation arising from a disturbance at a given generator site will affect the normal operation of neighbouring generators and might cause them to fail. Hours of production time will be lost in the time it takes to restart the power plant. If the disturbance is detected early, appropriate control measures can be applied to ensure system stability. The aim of this study is to improve existing algorithms that estimate the oscillation parameters from acquired generator data to detect potentially dangerous power system disturbances. When disturbances occur in power systems (due to load changes or faults), damped oscillations (or "modes") are created. Modes which are heavily damped die out quickly and pose no threat to system stability. Lightly damped modes, by contrast, die out slowly and are more problematic. Of more concern still are "negatively damped" modes which grow exponentially with time and can ultimately cause the power system to fail. Widespread blackouts are then possible. To avert power system failures it is necessary to monitor the damping of the oscillating modes. This thesis proposes a number of damping estimation algorithms for this task. If the damping is found to be very small or even negative, then additional damping needs to be introduced via appropriate control strategies. This thesis presents a number of new algorithms for estimating the damping of modal oscillations in power systems. The first of these algorithms uses multiple orthogonal sliding windows along with least-squares techniques to estimate the modal damping. This algorithm produces results which are superior to those of earlier sliding window algorithms (that use only one pair of sliding windows to estimate the damping). The second algorithm uses a different modification of the standard sliding window damping estimation algorithm - the algorithm exploits the fact that the Signal to Noise Ratio (SNR) within the Fourier transform of practical power system signals is typically constant across a wide frequency range. Accordingly, damping estimates are obtained at a range of frequencies and then averaged. The third algorithm applied to power system analysis is based on optimal estimation theory. It is computationally efficient and gives optimal accuracy, at least for modes which are well separated in frequency.
37
Ramalho, Guilherme Matiussi. "Uma abordagem estatística para o modelo do preço spot da energia elétrica no submercado sudeste/centro-oeste brasileiro." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/3/3139/tde-26122014-145848/.
Full textAbstract:
O objetivo deste trabalho e o desenvolvimento de uma ferramenta estatistica que sirva de base para o estudo do preco spot da energia eletrica do subsistema Sudeste/Centro-Oeste do Sistema Interligado Nacional, utilizando a estimacao por regressao linear e teste de razao de verossimilhanca como instrumentos para desenvolvimento e avaliacao dos modelos. Na analise dos resultados estatsticos descritivos dos modelos, diferentemente do que e observado na literatura, a primeira conclusao e a verificacao de que as variaveis sazonais, quando analisadas isoladamente, apresentam resultados pouco aderentes ao preco spot PLD. Apos a analise da componente sazonal e verificada a influencia da energia fornecida e a energia demandada como variaveis de entrada, com o qual conclui-se que especificamente a energia armazenada e producao de energia termeletrica sao as variaveis que mais influenciam os precos spot no subsistema estudado. Entre os modelos testados, o que particularmente ofereceu os melhores resultados foi um modelo misto criado a partir da escolha das melhores variaveis de entrada dos modelos testados preliminarmente, alcancando um coeficiente de determinacao R2 de 0.825, resultado esse que pode ser considerado aderente ao preco spot. No ultimo capitulo e apresentada uma introducao ao modelo de predicao do preco spot, possibilitando dessa forma a analise do comportamento do preco a partir da alteracao das variaveis de entrada.The objective of this work is the development of a statistical method to study the spot prices of the electrical energy of the Southeast/Middle-West (SE-CO) subsystem of the The Brazilian National Connected System, using the Least Squares Estimation and Likelihood Ratio Test as tools to perform and evaluate the models. Verifying the descriptive statistical results of the models, differently from what is observed in the literature, the first observation is that the seasonal component, when analyzed alone, presented results loosely adherent to the spot price PLD. It is then evaluated the influence of the energy supply and the energy demand as input variables, verifying that specifically the stored water and the thermoelectric power production are the variables that the most influence the spot prices in the studied subsystem. Among the models, the one that offered the best result was a mixed model created from the selection of the best input variables of the preliminarily tested models, achieving a coeficient of determination R2 of 0.825, a result that can be considered adherent to the spot price. At the last part of the work It is presented an introduction to the spot price prediction model, allowing the analysis of the price behavior by the changing of the input variables.
38
Tran, Nguyen Duy. "Performance bounds in terms of estimation and resolution and applications in array processing." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2012. http://tel.archives-ouvertes.fr/tel-00777503.
Full textAbstract:
This manuscript concerns the performance analysis in signal processing and consists into two parts : First, we study the lower bounds in characterizing and predicting the estimation performance in terms of mean square error (MSE). The lower bounds on the MSE give the minimum variance that an estimator can expect to achieve and it can be divided into two categories depending on the parameter assumption: the so-called deterministic bounds dealing with the deterministic unknown parameters, and the so-called Bayesian bounds dealing with the random unknown parameter. Particularly, we derive the closed-form expressions of the lower bounds for two applications in two different fields: (i) The first one is the target localization using the multiple-input multiple-output (MIMO) radar in which we derive the lower bounds in the contexts with and without modeling errors, respectively. (ii) The other one is the pulse phase estimation of X-ray pulsars which is a potential solution for autonomous deep space navigation. In this application, we show the potential universality of lower bounds to tackle problems with parameterized probability density function (pdf) different from classical Gaussian pdf since in X-ray pulse phase estimation, observations are modeled with a Poisson distribution. Second, we study the statistical resolution limit (SRL) which is the minimal distance in terms of the parameter of interest between two signals allowing to correctly separate/estimate the parameters of interest. More precisely, we derive the SRL in two contexts: array processing and MIMO radar by using two approaches based on the estimation theory and information theory. We also present in this thesis the usefulness of SRL in optimizing the array system.
39
Pippig, Michael. "Massively Parallel, Fast Fourier Transforms and Particle-Mesh Methods." Doctoral thesis, Universitätsbibliothek Chemnitz, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-197359.
Full textAbstract:
The present thesis provides a modularized view on the structure of fast numerical methods for computing Coulomb interactions between charged particles in three-dimensional space. Thereby, the common structure is given in terms of three self-contained algorithmic frameworks that are built on top of each other, namely fast Fourier transform (FFT), nonequispaced fast Fourier transform (NFFT) and NFFT based particle-mesh methods (P²NFFT). For each of these frameworks algorithmic enhancement and parallel implementations are presented with special emphasis on scalability up to hundreds of thousands of parallel processes. In the context of FFT massively parallel algorithms are composed from hardware adaptive low level modules provided by the FFTW software library. The new algorithmic NFFT concepts include pruned NFFT, interlacing, analytic differentiation, and optimized deconvolution in Fourier space with respect to a mean square aliasing error. Enabled by these generalized concepts it is shown that NFFT provides a unified access to particle-mesh methods. Especially, mixed-periodic boundary conditions are handled in a consistent way and interlacing can be incorporated more efficiently. Heuristic approaches for parameter tuning are presented on the basis of thorough error estimatesDie vorliegende Dissertation beschreibt einen modularisierten Blick auf die Struktur schneller numerischer Methoden für die Berechnung der Coulomb-Wechselwirkungen zwischen Ladungen im dreidimensionalen Raum. Die gemeinsame Struktur ist geprägt durch drei selbstständige und auf einander aufbauenden Algorithmen, nämlich der schnellen Fourier-Transformation (FFT), der nicht äquidistanten schnellen Fourier-Transformation (NFFT) und der NFFT-basierten Teilchen-Gitter-Methode (P²NFFT). Für jeden dieser Algorithmen werden Verbesserungen und parallele Implementierungen vorgestellt mit besonderem Augenmerk auf massiv paralleler Skalierbarkeit. Im Kontext der FFT werden parallele Algorithmen aus den Hardware adaptiven Modulen der FFTW Softwarebibliothek zusammengesetzt. Die neuen NFFT-Konzepte beinhalten abgeschnittene NFFT, Versatz, analytische Differentiation und optimierte Entfaltung im Fourier-Raum bezüglich des mittleren quadratischen Aliasfehlers. Mit Hilfe dieser Verallgemeinerungen bietet die NFFT einen vereinheitlichten Zugang zu Teilchen-Gitter-Methoden. Insbesondere gemischt periodische Randbedingungen werden einheitlich behandelt und Versatz wird effizienter umgesetzt. Heuristiken für die Parameterwahl werden auf Basis sorgfältiger Fehlerabschätzungen angegeben
40
Vu, Dinh Thang. "Outils statistiques pour le positionnement optimal de capteurs dans le contexte de la localisation de sources." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00638778.
Full textAbstract:
Cette thèse porte sur l'étude du positionnement optimale des réseaux de capteurs pour la localisation de sources. Nous avons étudié deux approches: l'approche basée sur les performances de l'estimation en termes d'erreur quadratique moyenne et l'approche basée sur le seuil statistique de résolution (SSR).Pour le première approche, nous avons considéré les bornes inférieures de l'erreur quadratique moyenne qui sont utilisés généralement pour évaluer la performance d'estimation indépendamment du type d'estimateur considéré. Nous avons étudié deux types de bornes: la borne Cramér-Rao (BCR) pour le modèle où les paramètres sont supposés déterministes et la borne Weiss-Weinstein (BWW) pour le modèle où les paramètres sont supposés aléatoires. Nous avons dérivé les expressions analytiques de ces bornes pour développer des outils statistiques afin d'optimiser la géométrie des réseaux de capteurs. Par rapport à la BCR, la borne BWW peut capturer le décrochement de l'EQM des estimateurs dans la zone non-asymptotique. De plus, les expressions analytiques de la BWW pour un modèle Gaussien général à moyenne paramétré ou à covariance matrice paramétré sont donnés explicitement. Basé sur ces expressions analytiques, nous avons étudié l'impact de la géométrie des réseaux de capteurs sur les performances d'estimation en utilisant les réseaux de capteurs 3D et 2D pour deux modèles des observations concernant les signaux sources: (i) le modèle déterministe et (ii) le modèle stochastique. Nous en avons ensuite déduit des conditions concernant les propriétés d'isotropie et de découplage.Pour la deuxième approche, nous avons considéré le seuil statistique de résolution qui caractérise la séparation minimale entre les deux sources. Dans cette thèse, nous avons étudié le SSR pour le contexte Bayésien moins étudié dans la littérature. Nous avons introduit un modèle des observations linéarisé basé sur le critère de probabilité d'erreur minimale. Ensuite, nous avons présenté deux approches Bayésiennes pour le SSR, l'une basée sur la théorie de l'information et l'autre basée sur la théorie de la détection. Ces approches pourront être utilisée pour améliorer la capacité de résolution des systèmes.
41
Pippig, Michael. "Massively Parallel, Fast Fourier Transforms and Particle-Mesh Methods: Massiv parallele schnelle Fourier-Transformationen und Teilchen-Gitter-Methoden." Doctoral thesis, Universitätsverlag der Technischen Universität Chemnitz, 2015. https://monarch.qucosa.de/id/qucosa%3A20398.
Full textAbstract:
The present thesis provides a modularized view on the structure of fast numerical methods for computing Coulomb interactions between charged particles in three-dimensional space. Thereby, the common structure is given in terms of three self-contained algorithmic frameworks that are built on top of each other, namely fast Fourier transform (FFT), nonequispaced fast Fourier transform (NFFT) and NFFT based particle-mesh methods (P²NFFT). For each of these frameworks algorithmic enhancement and parallel implementations are presented with special emphasis on scalability up to hundreds of thousands of parallel processes.
In the context of FFT massively parallel algorithms are composed from hardware adaptive low level modules provided by the FFTW software library. The new algorithmic NFFT concepts include pruned NFFT, interlacing, analytic differentiation, and optimized deconvolution in Fourier space with respect to a mean square aliasing error. Enabled by these generalized concepts it is shown that NFFT provides a unified access to particle-mesh methods. Especially, mixed-periodic boundary conditions are handled in a consistent way and interlacing can be incorporated more efficiently. Heuristic approaches for parameter tuning are presented on the basis of thorough error estimates.Die vorliegende Dissertation beschreibt einen modularisierten Blick auf die Struktur schneller numerischer Methoden für die Berechnung der Coulomb-Wechselwirkungen zwischen Ladungen im dreidimensionalen Raum. Die gemeinsame Struktur ist geprägt durch drei selbstständige und auf einander aufbauenden Algorithmen, nämlich der schnellen Fourier-Transformation (FFT), der nicht äquidistanten schnellen Fourier-Transformation (NFFT) und der NFFT-basierten Teilchen-Gitter-Methode (P²NFFT). Für jeden dieser Algorithmen werden Verbesserungen und parallele Implementierungen vorgestellt mit besonderem Augenmerk auf massiv paralleler Skalierbarkeit. Im Kontext der FFT werden parallele Algorithmen aus den Hardware adaptiven Modulen der FFTW Softwarebibliothek zusammengesetzt. Die neuen NFFT-Konzepte beinhalten abgeschnittene NFFT, Versatz, analytische Differentiation und optimierte Entfaltung im Fourier-Raum bezüglich des mittleren quadratischen Aliasfehlers. Mit Hilfe dieser Verallgemeinerungen bietet die NFFT einen vereinheitlichten Zugang zu Teilchen-Gitter-Methoden. Insbesondere gemischt periodische Randbedingungen werden einheitlich behandelt und Versatz wird effizienter umgesetzt. Heuristiken für die Parameterwahl werden auf Basis sorgfältiger Fehlerabschätzungen angegeben.
42
Farquharson, Maree Louise. "Estimating the parameters of polynomial phase signals." Thesis, Queensland University of Technology, 2006. https://eprints.qut.edu.au/16312/1/Maree_Farquharson_Thesis.pdf.
Full textAbstract:
Nonstationary signals are common in many environments such as radar, sonar, bioengineering and power systems. The nonstationary nature of the signals found in these environments means that classicalspectralanalysis techniques are notappropriate for estimating the parameters of these signals. Therefore it is important to develop techniques that can accommodate nonstationary signals. This thesis seeks to achieve this by firstly, modelling each component of the signal as having a polynomial phase and by secondly, developing techniques for estimating the parameters of these components.
Several approaches can be used for estimating the parameters of polynomial phase signals, eachwithvarying degrees ofsuccess.Criteria to consider in potential estimation algorithms are
(i) the signal-to-noise (SNR) ratio threshold of the algorithm, (ii) the amount of computation required for running the algorithm, and (iii) the closeness of the resulting estimates' mean-square errors to the minimum theoretical bound. These criteria will be used to compare the new techniques developed in this thesis with existing techniques.
The literature on polynomial phase signal estimation highlights the recurring trade-off between the accuracy of the estimates and the amount of computation required. For example, the Maximum Likelihood (ML) method provides near-optimal estimates above threshold, but also incurs a heavy computational cost for higher order phase signals. On the other hand, multi-linear techniques such as the high-order ambiguity function (HAF) method require little computation, but have a significantly higher SNR threshold than the ML method.
Of the existing techniques, the cubic phase (CP) function method is a promising technique because it provides an attractive SNR threshold and computational complexity trade-off. For this reason, the analysis techniques developed in this thesis will be derived from the CP function.
A limitation of the CP function is its inability to accurately process phase orders greater than three. Therefore, the first novel contribution to this thesis develops a broadened class of discrete-time higher order phase (HP)functions to address this limitation.This broadened class is achieved by providing a multi-linear extension of the CP function. Monte Carlo simulations are performed to demonstrate the statistical advantage of the HP functions compared to the HAFs. A first order statistical analysis of the HP functions is presented. This analysis verifies the simulation results.
The next novel contribution is a technique called the lower SNR cubic phase function (LCPF)method. It is an extension of the CP function, with the extension enabling performance at lower signal-to-noise ratios (SNRs). The improvement of the SNR threshold's performance is achieved by coherently integrating the CP function over a compact interval in the two-dimensional CP function space. The computation of the new algorithm is quite moderate, especially when compared to the ML method. Above threshold, the LCPF method's parameter estimates are asymptotically efficient. Monte Carlo simulation results are presented and a threshold analysis of the algorithm closely predicts the thresholds observed in these results.
The next original contribution to this research involves extending the LCPF method so that it is able to process multicomponent cubic phase signals and higher order phase signals. The LCPF method is extended to higher orders by applying a windowing technique as opposed to adjusting the order of the kernel as implemented in the HP function method. To demonstrate the extension of the LCPF method for processing higher order phase signals and multicomponent cubic phase signals, some Monte Carlo simulations are presented.
Finally, these estimation techniques are applied to real-worldscenarios in the fields of Power Systems Analysis, Neuroethology and Speech Analysis.
43
Farquharson, Maree Louise. "Estimating the parameters of polynomial phase signals." Queensland University of Technology, 2006. http://eprints.qut.edu.au/16312/.
Full textAbstract:
Nonstationary signals are common in many environments such as radar, sonar, bioengineering and power systems. The nonstationary nature of the signals found in these environments means that classicalspectralanalysis techniques are notappropriate for estimating the parameters of these signals. Therefore it is important to develop techniques that can accommodate nonstationary signals. This thesis seeks to achieve this by firstly, modelling each component of the signal as having a polynomial phase and by secondly, developing techniques for estimating the parameters of these components. Several approaches can be used for estimating the parameters of polynomial phase signals, eachwithvarying degrees ofsuccess.Criteria to consider in potential estimation algorithms are (i) the signal-to-noise (SNR) ratio threshold of the algorithm, (ii) the amount of computation required for running the algorithm, and (iii) the closeness of the resulting estimates' mean-square errors to the minimum theoretical bound. These criteria will be used to compare the new techniques developed in this thesis with existing techniques. The literature on polynomial phase signal estimation highlights the recurring trade-off between the accuracy of the estimates and the amount of computation required. For example, the Maximum Likelihood (ML) method provides near-optimal estimates above threshold, but also incurs a heavy computational cost for higher order phase signals. On the other hand, multi-linear techniques such as the high-order ambiguity function (HAF) method require little computation, but have a significantly higher SNR threshold than the ML method. Of the existing techniques, the cubic phase (CP) function method is a promising technique because it provides an attractive SNR threshold and computational complexity trade-off. For this reason, the analysis techniques developed in this thesis will be derived from the CP function. A limitation of the CP function is its inability to accurately process phase orders greater than three. Therefore, the first novel contribution to this thesis develops a broadened class of discrete-time higher order phase (HP)functions to address this limitation.This broadened class is achieved by providing a multi-linear extension of the CP function. Monte Carlo simulations are performed to demonstrate the statistical advantage of the HP functions compared to the HAFs. A first order statistical analysis of the HP functions is presented. This analysis verifies the simulation results. The next novel contribution is a technique called the lower SNR cubic phase function (LCPF)method. It is an extension of the CP function, with the extension enabling performance at lower signal-to-noise ratios (SNRs). The improvement of the SNR threshold's performance is achieved by coherently integrating the CP function over a compact interval in the two-dimensional CP function space. The computation of the new algorithm is quite moderate, especially when compared to the ML method. Above threshold, the LCPF method's parameter estimates are asymptotically efficient. Monte Carlo simulation results are presented and a threshold analysis of the algorithm closely predicts the thresholds observed in these results. The next original contribution to this research involves extending the LCPF method so that it is able to process multicomponent cubic phase signals and higher order phase signals. The LCPF method is extended to higher orders by applying a windowing technique as opposed to adjusting the order of the kernel as implemented in the HP function method. To demonstrate the extension of the LCPF method for processing higher order phase signals and multicomponent cubic phase signals, some Monte Carlo simulations are presented. Finally, these estimation techniques are applied to real-worldscenarios in the fields of Power Systems Analysis, Neuroethology and Speech Analysis.
44
Kahaei, Mohammad Hossein. "Performance analysis of adaptive lattice filters for FM signals and alpha-stable processes." Thesis, Queensland University of Technology, 1998. https://eprints.qut.edu.au/36044/7/36044_Digitised_Thesis.pdf.
Full textAbstract:
The performance of an adaptive filter may be studied through the behaviour
of the optimal and adaptive coefficients in a given environment. This thesis
investigates the performance of finite impulse response adaptive lattice filters for
two classes of input signals: (a) frequency modulated signals with polynomial
phases of order p in complex Gaussian white noise (as nonstationary signals),
and (b) the impulsive autoregressive processes with alpha-stable distributions (as
non-Gaussian signals).
Initially, an overview is given for linear prediction and adaptive filtering. The
convergence and tracking properties of the stochastic gradient algorithms are discussed
for stationary and nonstationary input signals. It is explained that the
stochastic gradient lattice algorithm has many advantages over the least-mean
square algorithm. Some of these advantages are having a modular structure,
easy-guaranteed stability, less sensitivity to the eigenvalue spread of the input autocorrelation
matrix, and easy quantization of filter coefficients (normally called
reflection coefficients).
We then characterize the performance of the stochastic gradient lattice algorithm
for the frequency modulated signals through the optimal and adaptive
lattice reflection coefficients. This is a difficult task due to the nonlinear dependence
of the adaptive reflection coefficients on the preceding stages and the input
signal. To ease the derivations, we assume that reflection coefficients of each
stage are independent of the inputs to that stage. Then the optimal lattice filter
is derived for the frequency modulated signals. This is performed by computing
the optimal values of residual errors, reflection coefficients, and recovery errors.
Next, we show the tracking behaviour of adaptive reflection coefficients for
frequency modulated signals. This is carried out by computing the tracking model
of these coefficients for the stochastic gradient lattice algorithm in average. The
second-order convergence of the adaptive coefficients is investigated by modeling
the theoretical asymptotic variance of the gradient noise at each stage. The
accuracy of the analytical results is verified by computer simulations.
Using the previous analytical results, we show a new property, the polynomial
order reducing property of adaptive lattice filters. This property may be used to
reduce the order of the polynomial phase of input frequency modulated signals.
Considering two examples, we show how this property may be used in processing
frequency modulated signals. In the first example, a detection procedure in carried
out on a frequency modulated signal with a second-order polynomial phase
in complex Gaussian white noise. We showed that using this technique a better
probability of detection is obtained for the reduced-order phase signals compared
to that of the traditional energy detector. Also, it is empirically shown that
the distribution of the gradient noise in the first adaptive reflection coefficients
approximates the Gaussian law. In the second example, the instantaneous frequency
of the same observed signal is estimated. We show that by using this
technique a lower mean square error is achieved for the estimated frequencies at
high signal-to-noise ratios in comparison to that of the adaptive line enhancer.
The performance of adaptive lattice filters is then investigated for the second
type of input signals, i.e., impulsive autoregressive processes with alpha-stable
distributions . The concept of alpha-stable distributions is first introduced. We
discuss that the stochastic gradient algorithm which performs desirable results
for finite variance input signals (like frequency modulated signals in noise) does
not perform a fast convergence for infinite variance stable processes (due to using
the minimum mean-square error criterion). To deal with such problems, the
concept of minimum dispersion criterion, fractional lower order moments, and
recently-developed algorithms for stable processes are introduced.
We then study the possibility of using the lattice structure for impulsive stable
processes. Accordingly, two new algorithms including the least-mean P-norm
lattice algorithm and its normalized version are proposed for lattice filters based
on the fractional lower order moments. Simulation results show that using the
proposed algorithms, faster convergence speeds are achieved for parameters estimation
of autoregressive stable processes with low to moderate degrees of impulsiveness
in comparison to many other algorithms. Also, we discuss the effect of
impulsiveness of stable processes on generating some misalignment between the
estimated parameters and the true values. Due to the infinite variance of stable
processes, the performance of the proposed algorithms is only investigated using
extensive computer simulations.
45
Elamine, Abdallah Bacar. "Régression non-paramétrique pour variables fonctionnelles." Thesis, Montpellier 2, 2010. http://www.theses.fr/2010MON20017.
Full textAbstract:
Cette thèse se décompose en quatre parties auxquelles s'ajoute une présentation. Dans un premier temps, on expose les outils mathématiques essentiels à la compréhension des prochains chapitres. Dans un deuxième temps, on s'intéresse à la régression non paramétrique locale pour des données fonctionnelles appartenant à un espace de Hilbert. On propose, tout d'abord, un estimateur de l'opérateur de régression. La construction de cet estimateur est liée à la résolution d'un problème inverse linéaire. On établit des bornes de l'erreur quadratique moyenne (EQM) de l'estimateur de l'opérateur de régression en utilisant une décomposition classique. Cette EQM dépend de la fonction de petite boule de probabilité du régresseur au sujet de laquelle des hypothèses de type Gamma-variation sont posées. Dans le chapitre suivant, on reprend le travail élaboré dans le précédent chapitre en se plaçant dans le cadre de données fonctionnelles appartenant à un espace semi-normé. On établit des bornes de l'EQM de l'estimateur de l'opérateur de régression. Cette EQM peut être vue comme une fonction de la fonction de petite boule de probabilité. Dans le dernier chapitre, on s'intéresse à l'estimation de la fonction auxiliaire associée à la fonction de petite boule de probabilité. D'abord, on propose un estimateur de cette fonction auxiliare. Ensuite, on établit la convergence en moyenne quadratique et la normalité asymptotique de cet estimateur. Enfin, par des simulations, on étudie le comportement de de cet estimateur au voisinage de zéroThis thesis is divided in four sections with an additionnal presentation. In the first section, We expose the essential mathematics skills for the comprehension of the next sections. In the second section, we adress the problem of local non parametric with functional inputs. First, we propose an estimator of the unknown regression function. The construction of this estimator is related to the resolution of a linear inverse problem. Using a classical method of decomposition, we establish a bound for the mean square error (MSE). This bound depends on the small ball probability of the regressor which is assumed to belong to the class of Gamma varying functions. In the third section, we take again the work done in the preceding section by being situated in the frame of data belonging to a semi-normed space with infinite dimension. We establish bound for the MSE of the regression operator. This MSE can be seen as a function of the small ball probability function. In the last section, we interest to the estimation of the auxiliary function. Then, we establish the convergence in mean square and the asymptotic normality of the estimator. At last, by simulations, we study the bahavour of this estimator in a neighborhood of zero
46
Ren, Chengfang. "Caractérisation des performances minimales d'estimation pour des modèles d'observations non-standards." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112167/document.
Full textAbstract:
Dans le contexte de l'estimation paramétrique, les performances d'un estimateur peuvent être caractérisées, entre autre, par son erreur quadratique moyenne (EQM) et sa résolution limite. La première quantifie la précision des valeurs estimées et la seconde définit la capacité de l'estimateur à séparer plusieurs paramètres. Cette thèse s'intéresse d'abord à la prédiction de l'EQM "optimale" à l'aide des bornes inférieures pour des problèmes d'estimation simultanée de paramètres aléatoires et non-aléatoires (estimation hybride), puis à l'extension des bornes de Cramér-Rao pour des modèles d'observation moins standards. Enfin, la caractérisation des estimateurs en termes de résolution limite est également étudiée. Ce manuscrit est donc divisé en trois parties :Premièrement, nous complétons les résultats de littérature sur les bornes hybrides en utilisant deux bornes bayésiennes : la borne de Weiss-Weinstein et une forme particulière de la famille de bornes de Ziv-Zakaï. Nous montrons que ces bornes "étendues" sont plus précises pour la prédiction de l'EQM optimale par rapport à celles existantes dans la littérature.Deuxièmement, nous proposons des bornes de type Cramér-Rao pour des contextes d'estimation moins usuels, c'est-à-dire : (i) Lorsque les paramètres non-aléatoires sont soumis à des contraintes d'égalité linéaires ou non-linéaires (estimation sous contraintes). (ii) Pour des problèmes de filtrage à temps discret où l'évolution des états (paramètres) est régit par une chaîne de Markov. (iii) Lorsque la loi des observations est différente de la distribution réelle des données.Enfin, nous étudions la résolution et la précision des estimateurs en proposant un critère basé directement sur la distribution des estimées. Cette approche est une extension des travaux de Oh et Kashyap et de Clark pour des problèmes d'estimation de paramètres multidimensionnelsIn the parametric estimation context, estimators performances can be characterized, inter alia, by the mean square error and the resolution limit. The first quantities the accuracy of estimated values and the second defines the ability of the estimator to allow a correct resolvability. This thesis deals first with the prediction the "optimal" MSE by using lower bounds in the hybrid estimation context (i.e. when the parameter vector contains both random and non-random parameters), second with the extension of Cramér-Rao bounds for non-standard estimation problems and finally to the characterization of estimators resolution. This manuscript is then divided into three parts :First, we fill some lacks of hybrid lower bound on the MSE by using two existing Bayesian lower bounds: the Weiss-Weinstein bound and a particular form of Ziv-Zakai family lower bounds. We show that these extended lower bounds are tighter than the existing hybrid lower bounds in order to predict the optimal MSE.Second, we extend Cramer-Rao lower bounds for uncommon estimation contexts. Precisely: (i) Where the non-random parameters are subject to equality constraints (linear or nonlinear). (ii) For discrete-time filtering problems when the evolution of states are defined by a Markov chain. (iii) When the observation model differs to the real data distribution.Finally, we study the resolution of the estimators when their probability distributions are known. This approach is an extension of the work of Oh and Kashyap and the work of Clark to multi-dimensional parameters estimation problems
47
Barkat, Braham. "Design, estimation and performance of time-frequency distributions." Thesis, Queensland University of Technology, 2000.
Find full text
48
El, Korso Mohammed Nabil. "Analyse de performances en traitement d'antenne : bornes inférieures de l'erreur quadratique moyenne et seuil de résolution limite." Thesis, Paris 11, 2011. http://www.theses.fr/2011PA112074/document.
Full textAbstract:
Ce manuscrit est dédié à l’analyse de performances en traitement d’antenne pour l’estimation des paramètres d’intérêt à l’aide d’un réseau de capteurs. Il est divisé en deux parties :– Tout d’abord, nous présentons l’étude de certaines bornes inférieures de l’erreur quadratique moyenne liées à la localisation de sources dans le contexte champ proche. Nous utilisons la borne de Cramér-Rao pour l’étude de la zone asymptotique (notamment en terme de rapport signal à bruit avec un nombre fini d’observations). Puis, nous étudions d’autres bornes inférieures de l’erreur quadratique moyenne qui permettent de prévoir le phénomène de décrochement de l’erreur quadratique moyenne des estimateurs (on cite, par exemple, la borne de McAulay-Seidman, la borne de Hammersley-Chapman-Robbins et la borne de Fourier Cramér-Rao).– Deuxièmement, nous nous concentrons sur le concept du seuil statistique de résolution limite, c’est-à-dire, la distance minimale entre deux signaux noyés dans un bruit additif qui permet une ”correcte” estimation des paramètres. Nous présentons quelques applications bien connues en traitement d’antenne avant d’étendre les concepts existants au cas de signaux multidimensionnels. Par la suite, nous étudions la validité de notre extension en utilisant un test d’hypothèses binaire. Enfin, nous appliquons notre extension à certains modèles d’observation multidimensionnelsThis manuscript concerns the performance analysis in array signal processing. It can bedivided into two parts :- First, we present the study of some lower bounds on the mean square error related to the source localization in the near eld context. Using the Cramér-Rao bound, we investigate the mean square error of the maximum likelihood estimator w.r.t. the direction of arrivals in the so-called asymptotic area (i.e., for a high signal to noise ratio with a nite number of observations.) Then, using other bounds than the Cramér-Rao bound, we predict the threshold phenomena.- Secondly, we focus on the concept of the statistical resolution limit (i.e., the minimum distance between two closely spaced signals embedded in an additive noise that allows a correct resolvability/parameter estimation.) We de ne and derive the statistical resolution limit using the Cramér-Rao bound and the hypothesis test approaches for the mono-dimensional case. Then, we extend this concept to the multidimensional case. Finally, a generalized likelihood ratio test based framework for the multidimensional statistical resolution limit is given to assess the validity of the proposed extension
49
Šimoník, Petr. "Měřič odstupu signálu od šumu obrazových signálů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217681.
Full textAbstract:
The diplomma thesis is dealing with possibilities of Signal to noise ratio measurement by method, which is based on direct measurement. It is chosen the most suitable method – signal and noise separation to two different parallel signal branches, where is measured signal strength in one branch and root mean square value in the other. The thesis is consisted of a concept of detail block scheme of Signal to noise ratio meter, which was designed in terms of theoretical knowledge. Particular functional blocks were circuit-designed, the active and passive parts were chosen and their function were described. There were made simulation and displayed input and output time flows. There is designed the whole connection of engineered Signal to noise ratio meter in the last part of my thesis. The double-sided board of printed circuit is contained too. It was created simple programme for supervisor micro-processor. Thereby were constructed complete bases for realization.
50
Hussain, Zahir M. "Adaptive instantaneous frequency estimation: Techniques and algorithms." Thesis, Queensland University of Technology, 2002. https://eprints.qut.edu.au/36137/7/36137_Digitised%20Thesis.pdf.
Full textAbstract:
This thesis deals with the problem of the instantaneous frequency (IF) estimation of sinusoidal signals. This topic plays significant role in signal processing and communications.
Depending on the type of the signal, two major approaches are considered. For IF estimation of single-tone or digitally-modulated sinusoidal signals (like frequency shift keying signals) the approach of digital phase-locked loops (DPLLs) is considered, and this is Part-I of this thesis. For FM signals the approach of time-frequency analysis is considered, and this is Part-II of the thesis.
In part-I we have utilized sinusoidal DPLLs with non-uniform sampling scheme as this type is widely used in communication systems. The digital tanlock loop (DTL) has introduced significant advantages over other existing DPLLs. In the last 10 years many efforts have been made to improve DTL performance. However, this loop and all of its modifications utilizes Hilbert transformer (HT) to produce a signal-independent 90-degree phase-shifted version of the input signal. Hilbert transformer can be realized approximately using a finite impulse response (FIR) digital filter. This realization introduces further complexity in the loop in addition to approximations and frequency limitations on the input signal. We have tried to avoid practical difficulties associated with the conventional tanlock scheme while keeping its advantages. A time-delay is utilized in the tanlock scheme of DTL to produce a signal-dependent phase shift. This gave rise to the time-delay digital tanlock loop (TDTL). Fixed point theorems are used to analyze the behavior of the new loop. As such TDTL combines the two major approaches in DPLLs: the non-linear approach of sinusoidal DPLL based on fixed point analysis, and the linear tanlock approach based on the arctan phase detection. TDTL preserves the main advantages of the DTL despite its reduced structure. An application of TDTL in FSK demodulation is also considered. This idea of replacing HT by a time-delay may be of interest in other signal processing systems. Hence we have analyzed and compared the behaviors of the HT and the time-delay in the presence of additive Gaussian noise.
Based on the above analysis, the behavior of the first and second-order TDTLs has been analyzed in additive Gaussian noise.
Since DPLLs need time for locking, they are normally not efficient in tracking the continuously changing frequencies of non-stationary signals, i.e. signals with time-varying spectra. Nonstationary signals are of importance in synthetic and real life applications. An example is the frequency-modulated (FM) signals widely used in communication systems. Part-II of this thesis is dedicated for the IF estimation of non-stationary signals. For such signals the classical spectral techniques break down, due to the time-varying nature of their spectra, and more advanced techniques should be utilized.
For the purpose of instantaneous frequency estimation of non-stationary signals there are two major approaches: parametric and non-parametric. We chose the non-parametric approach which is based on time-frequency analysis. This approach is computationally less expensive and more effective in dealing with multicomponent signals, which are the main aim of this part of the thesis.
A time-frequency distribution (TFD) of a signal is a two-dimensional transformation of the signal to the time-frequency domain. Multicomponent signals can be identified by multiple energy peaks in the time-frequency domain. Many real life and synthetic signals are of multicomponent nature and there is little in the literature concerning IF estimation of such signals. This is why we have concentrated on multicomponent signals in Part-H.
An adaptive algorithm for IF estimation using the quadratic time-frequency distributions has been analyzed. A class of time-frequency distributions that are more suitable for this purpose has been proposed. The kernels of this class are time-only or one-dimensional, rather than the time-lag (two-dimensional) kernels. Hence this class has been named as the T -class. If the parameters of these TFDs are properly chosen, they are more efficient than the existing fixed-kernel TFDs in terms of resolution (energy concentration around the IF) and artifacts reduction. The T-distributions has been used in the IF adaptive algorithm and proved to be efficient in tracking rapidly changing frequencies. They also enables direct amplitude estimation for the components of a multicomponent