Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 15 of 15 for “"M-algorithm."”.
-
Learning Algorithms for Mixtures of Linear Dynamical Systems: A Practical Approach
… work, we give the first implementation of an algorithm to learn a mixture of linear dynamical systems (LDS’s), and an analysis of algorithms to learn a single linear dynamical system. Following the work of Bakshi et al. ([1]), we implement a recent polynomial-time algorithm based on a tensor …
-
Blind CFO Estimation for Zero-Padded OFDM over Underwater Acoustic Channels
… the null subcarrier based method, the O-M algorithm, and the Y-G algorithm. Performances of these three methods are evaluated by extensive numerical simulations and by data sets collected from the Mobile Acoustic Communication Experiment conducted off the coast of Martha's Vineyard, MA, …
-
Algorithms for Derivative-Free Optimization
… Model and Search (M&S), a new local search algorithm for derivative-free optimization. M&S performs a local search from a given point. The search is guided by identifying descent directions from a quadratic model fitted around the best known point, while using information from other …
-
Feasibility Analysis and Optimal Design of the Acidizing of Coalbed Methane Wells
… Then a forward model and a parameters inversion algorithm are proposed to diagnose the plugging. The multisolution problem of parameters inversion is solved by the Gauss-Marquardt (G-M) algorithm based on the stochastic initial value and maximum probability. Combining this method with the present …
-
Scalable parallel simulation of small-scale structures in cold dark matter
… of the particle-particle/particle-mesh (P³M) algorithm for distributed memory clusters. The llp3m-hc code uses a hybrid method for both computation and domain decomposition. Long-range forces are computed using a Fourier transform gravity solver on a regular mesh; the mesh is distributed …
-
An architecture study of a Byzantine-resilient processor using authentication
… data between processors is built using the SM(m) algorithm from [LSP82] with improvements suggested in [Dol83]. A voting protocol responsible for generating a group consensus value guaranteed to be the same on all nonfaulty processors suggests exchanging unsigned messages and then using a full-set …
-
Hierarchical Bayesian approaches to seismic imaging and other geophysical inverse problems
… of the expectation-maximization (E-M) algorithm. We validate our methodology on synthetic datasets arising from 2-D models. The images we obtain after inferring the edge strengths exhibit the desired spatially-varying smoothness properties and yield sharper, more coherent reflectors. In …
-
Sphere detection and LDPC decoding algorithms and architectures for wireless systems
… and outer decoding. In this work we design algorithms and architectures for iterative wireless receivers with multiple antennas applied for both downlink and uplink scenarios. Our goal is to develop wireless receivers with implementable hardware cost and excellent error-rate performance …
-
Dynamic online resource allocation problems
… For homogeneous machines, we propose a Pairing-m algorithm, which is 2-competitive for even m and (2+2/m)-competitive for odd m. For heterogeneous machines, two classes of approximation algorithms, Cooperative Greedy algorithms and Prioritized Greedy algorithms, are compared using competitive …
-
Reduced Receivers for Faster-than-Nyquist Signaling and General Linear Channels
… within the white noise constraint. New M-BCJR algorithms for turbo equalization are proposed and compared to reduced-trellis VA and BCJR benchmarks based on an offset label idea. By adding a third low-complexity M-BCJR recursion, LLR quality is improved for practical values of M. M here …
-
Another Look at Stock Return Comovement: Some New Evidence and Test
The study of the comovement between asset returns reflects an ongoing effort by economists to understand investment risk in financial markets. Building on previous findings, in the current thesis I provide some new evidence on this topic with a focus on large-cap stocks and highlight an innovative …
-
Blind Acquisition of Short Burst with Per-Survivor Processing (PSP)
… estimation into the structure of the Viterbi Algorithm (VA). In the case of successful acquisition, the convergence rate of PSP is comparable to that of the pilot-aided RLS algorithm. However, the performance of PSP degrades when certain sequences are transmitted. In this thesis, the blind …
-
On the construction, dimensionality, and decoding of linear block code trellises
… reasonably compact trellises using the Viterbi algorithm. For general linear block codes we present simple methods for trellis construction that are based on the methods of Wolf and Massey. It is confirmed that the trellises so constructed are minimal, and an improvement of Muder's lower bound …
-
Digital communication receiver algorithms and architectures for reduced complexity and high throughput
In this dissertation, efficient receiver algorithms and architectures for digital communications are studied. As the demand for higher data communication rate increases, the dimension of communication systems is rapidly growing, thereby requiring computationally efficient detection and decoding …
-
Cooperation in Wireless Networks
… all pairs. We present an optimal polynomial time algorithm, called ORA, that solves this problem. A novel idea in this algorithm is a "linear marking" mechanism, which maintains linear complexity at each iteration. We offer a formal proof of optimality for ORA and use numerical results to …