446 research outputs found
FDOA-based passive source localization: a geometric perspective
2018 Fall.Includes bibliographical references.We consider the problem of passively locating the source of a radio-frequency signal using observations by several sensors. Received signals can be compared to obtain time difference of arrival (TDOA) and frequency difference of arrival (FDOA) measurements. The geometric relationship satisfied by these measurements allow us to make inferences about the emitter's location. In this research, we choose to focus on the FDOA-based source localization problem. This problem has been less widely studied and is more difficult than solving for an emitter's location using TDOA measurements. When the FDOA-based source localization problem is formulated as a system of polynomials, the source's position is contained in the corresponding algebraic variety. This provides motivation for the use of methods from algebraic geometry, specifically numerical algebraic geometry (NAG), to solve for the emitter's location and gain insight into this system's interesting structure
A Global Approach for Solving Edge-Matching Puzzles
We consider apictorial edge-matching puzzles, in which the goal is to arrange
a collection of puzzle pieces with colored edges so that the colors match along
the edges of adjacent pieces. We devise an algebraic representation for this
problem and provide conditions under which it exactly characterizes a puzzle.
Using the new representation, we recast the combinatorial, discrete problem of
solving puzzles as a global, polynomial system of equations with continuous
variables. We further propose new algorithms for generating approximate
solutions to the continuous problem by solving a sequence of convex
relaxations
Local Message Passing on Frustrated Systems
Message passing on factor graphs is a powerful framework for probabilistic
inference, which finds important applications in various scientific domains.
The most wide-spread message passing scheme is the sum-product algorithm (SPA)
which gives exact results on trees but often fails on graphs with many small
cycles. We search for an alternative message passing algorithm that works
particularly well on such cyclic graphs. Therefore, we challenge the extrinsic
principle of the SPA, which loses its objective on graphs with cycles. We
further replace the local SPA message update rule at the factor nodes of the
underlying graph with a generic mapping, which is optimized in a data-driven
fashion. These modifications lead to a considerable improvement in performance
while preserving the simplicity of the SPA. We evaluate our method for two
classes of cyclic graphs: the 2x2 fully connected Ising grid and factor graphs
for symbol detection on linear communication channels with inter-symbol
interference. To enable the method for large graphs as they occur in practical
applications, we develop a novel loss function that is inspired by the Bethe
approximation from statistical physics and allows for training in an
unsupervised fashion.Comment: To appear at UAI 202
Recommended from our members
Hybrid Analog-Digital Co-Processing for Scientific Computation
In the past 10 years computer architecture research has moved to more heterogeneity and less adherence to conventional abstractions. Scientists and engineers hold an unshakable belief that computing holds keys to unlocking humanity's Grand Challenges. Acting on that belief they have looked deeper into computer architecture to find specialized support for their applications. Likewise, computer architects have looked deeper into circuits and devices in search of untapped performance and efficiency. The lines between computer architecture layers---applications, algorithms, architectures, microarchitectures, circuits and devices---have blurred. Against this backdrop, a menagerie of computer architectures are on the horizon, ones that forgo basic assumptions about computer hardware, and require new thinking of how such hardware supports problems and algorithms.
This thesis is about revisiting hybrid analog-digital computing in support of diverse modern workloads. Hybrid computing had extensive applications in early computing history, and has been revisited for small-scale applications in embedded systems. But architectural support for using hybrid computing in modern workloads, at scale and with high accuracy solutions, has been lacking.
I demonstrate solving a variety of scientific computing problems, including stochastic ODEs, partial differential equations, linear algebra, and nonlinear systems of equations, as case studies in hybrid computing. I solve these problems on a system of multiple prototype analog accelerator chips built by a team at Columbia University. On that team I made contributions toward programming the chips, building the digital interface, and validating the chips' functionality. The analog accelerator chip is intended for use in conjunction with a conventional digital host computer.
The appeal and motivation for using an analog accelerator is efficiency and performance, but it comes with limitations in accuracy and problem sizes that we have to work around.
The first problem is how to do problems in this unconventional computation model. Scientific computing phrases problems as differential equations and algebraic equations. Differential equations are a continuous view of the world, while algebraic equations are a discrete one. Prior work in analog computing mostly focused on differential equations; algebraic equations played a minor role in prior work in analog computing. The secret to using the analog accelerator to support modern workloads on conventional computers is that these two viewpoints are interchangeable. The algebraic equations that underlie most workloads can be solved as differential equations,
and differential equations are naturally solvable in the analog accelerator chip. A hybrid analog-digital computer architecture can focus on solving linear and nonlinear algebra problems to support many workloads.
The second problem is how to get accurate solutions using hybrid analog-digital computing. The reason that the analog computation model gives less accurate solutions is it gives up representing numbers as digital binary numbers, and instead uses the full range of analog voltage and current to represent real numbers. Prior work has established that encoding data in analog signals gives an energy efficiency advantage as long as the analog data precision is limited. While the analog accelerator alone may be useful for energy-constrained applications where inputs and outputs are imprecise, we are more interested in using analog in conjunction with digital for precise solutions. This thesis gives novel insight that the trick to do so is to solve nonlinear problems where low-precision guesses are useful for conventional digital algorithms.
The third problem is how to solve large problems using hybrid analog-digital computing. The reason the analog computation model can't handle large problems is it gives up step-by-step discrete-time operation, instead allowing variables to evolve smoothly in continuous time. To make that happen the analog accelerator works by chaining hardware for mathematical operations end-to-end. During computation analog data flows through the hardware with no overheads in control logic and memory accesses. The downside is then the needed hardware size grows alongside problem sizes. While scientific computing researchers have for a long time split large problems into smaller subproblems to fit in digital computer constraints, this thesis is a first attempt to consider these divide-and-conquer algorithms as an essential tool in using the analog model of computation.
As we enter the post-Moore’s law era of computing, unconventional architectures will offer specialized models of computation that uniquely support specific problem types. Two prominent examples are deep neural networks and quantum computers. Recent trends in computer science research show these unconventional architectures will soon have broad adoption. In this thesis I show another specialized, unconventional architecture is to use analog accelerators to solve problems in scientific computing. Computer architecture researchers will discover other important models of computation in the future. This thesis is an example of the discovery process, implementation, and evaluation of how an unconventional architecture supports specialized workloads
- …