4,378 research outputs found
Deterministic Construction of Binary, Bipolar and Ternary Compressed Sensing Matrices
In this paper we establish the connection between the Orthogonal Optical
Codes (OOC) and binary compressed sensing matrices. We also introduce
deterministic bipolar RIP fulfilling matrices of order
such that . The columns of these matrices are binary BCH code vectors where the
zeros are replaced by -1. Since the RIP is established by means of coherence,
the simple greedy algorithms such as Matching Pursuit are able to recover the
sparse solution from the noiseless samples. Due to the cyclic property of the
BCH codes, we show that the FFT algorithm can be employed in the reconstruction
methods to considerably reduce the computational complexity. In addition, we
combine the binary and bipolar matrices to form ternary sensing matrices
( elements) that satisfy the RIP condition.Comment: The paper is accepted for publication in IEEE Transaction on
Information Theor
Frame difference families and resolvable balanced incomplete block designs
Frame difference families, which can be obtained via a careful use of
cyclotomic conditions attached to strong difference families, play an important
role in direct constructions for resolvable balanced incomplete block designs.
We establish asymptotic existences for several classes of frame difference
families. As corollaries new infinite families of 1-rotational
-RBIBDs over are
derived, and the existence of -RBIBDs is discussed. We construct
-RBIBDs for , whose
existence were previously in doubt. As applications, we establish asymptotic
existences for an infinite family of optimal constant composition codes and an
infinite family of strictly optimal frequency hopping sequences.Comment: arXiv admin note: text overlap with arXiv:1702.0750
Discrete phase-space structure of -qubit mutually unbiased bases
We work out the phase-space structure for a system of qubits. We replace
the field of real numbers that label the axes of the continuous phase space by
the finite field \Gal{2^n} and investigate the geometrical structures
compatible with the notion of unbiasedness. These consist of bundles of
discrete curves intersecting only at the origin and satisfying certain
additional properties. We provide a simple classification of such curves and
study in detail the four- and eight-dimensional cases, analyzing also the
effect of local transformations. In this way, we provide a comprehensive
phase-space approach to the construction of mutually unbiased bases for
qubits.Comment: Title changed. Improved version. Accepted for publication in Annals
of Physic
Quantum Physics and Computers
Recent theoretical results confirm that quantum theory provides the
possibility of new ways of performing efficient calculations. The most striking
example is the factoring problem. It has recently been shown that computers
that exploit quantum features could factor large composite integers. This task
is believed to be out of reach of classical computers as soon as the number of
digits in the number to factor exceeds a certain limit. The additional power of
quantum computers comes from the possibility of employing a superposition of
states, of following many distinct computation paths and of producing a final
output that depends on the interference of all of them. This ``quantum
parallelism'' outstrips by far any parallelism that can be thought of in
classical computation and is responsible for the ``exponential'' speed-up of
computation.
This is a non-technical (or at least not too technical) introduction to the
field of quantum computation. It does not cover very recent topics, such as
error-correction.Comment: 27 pages, LaTeX, 8 PostScript figures embedded. A bug in one of the
postscript files has been fixed. Reprints available from the author. The
files are also available from
http://eve.physics.ox.ac.uk/Articles/QC.Articles.htm
A Neural Model of How the Brain Computes Heading from Optic Flow in Realistic Scenes
Animals avoid obstacles and approach goals in novel cluttered environments using visual information, notably optic flow, to compute heading, or direction of travel, with respect to objects in the environment. We present a neural model of how heading is computed that describes interactions among neurons in several visual areas of the primate magnocellular pathway, from retina through V1, MT+, and MSTd. The model produces outputs which are qualitatively and quantitatively similar to human heading estimation data in response to complex natural scenes. The model estimates heading to within 1.5° in random dot or photo-realistically rendered scenes and within 3° in video streams from driving in real-world environments. Simulated rotations of less than 1 degree per second do not affect model performance, but faster simulated rotation rates deteriorate performance, as in humans. The model is part of a larger navigational system that identifies and tracks objects while navigating in cluttered environments.National Science Foundation (SBE-0354378, BCS-0235398); Office of Naval Research (N00014-01-1-0624); National-Geospatial Intelligence Agency (NMA201-01-1-2016
- …