Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMMUNICATION THEORY”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

Bandwidth efficient coding: Theoretical limits and real achievements. Error control techniques for satellite and space communications

In his seminal 1948 paper 'The Mathematical Theory of Communication,' Claude E. Shannon derived the 'channel coding theorem' which has an explicit upper bound, called the channel capacity, on the rate at which 'information' could be transmitted reliably on a given communication channel. Shannon's result was an existence theorem and did not give specific codes to achieve the bound. Some skeptics have claimed that the dramatic performance improvements predicted by Shannon are not achievable in practice. The advances made in the area of coded modulation in the past decade have made communications engineers optimistic about the possibility of achieving or at least coming close to channel capacity. Here we consider the possibility in the light of current research results.

Costello, Daniel J., Jr.↗

Structural and compositional complexities of hierarchical self-assembly: A hypergraph approach

Programmable self-assembly enables the construction of complex molecular, supramolecular, and crystalline architectures from well-designed building blocks. In this work, we introduce a hypergraph-based formalism, Blocks & Bonds (B&B), which generalizes classical chemical graph theory by incorporating directed and multicolored interactions, internal symmetries, and hierarchical organization. Within this framework, we develop the Structure Code (SC), a compact and versatile language for describing self-assembled architectures. We define a Kolmogorov-style structural complexity as the total information content of SC, obtained through its tokenization and Shannon information assignment. Complementing this encoding-based measure, we introduce a much simpler quantity, the compositional complexity, which depends only on the number and cumulative usage of block and bond types in the construction set. A central result of this work is a strong empirical correlation between the token-based structural complexity and the compositional complexity across all examined systems. Owing to this agreement, the compositional complexity emerges as the most practical and broadly applicable measure: it is easy to compute, requires no explicit encoding, and yet closely tracks the actual information content of structurally diverse architectures. Applications to molecular systems (ethylene glycol and glucose), DNA-origami lattices, and crystalline assemblies show that B&B hypergraphs provide a unified, scalable, and information-efficient representation of structural organization, naturally capturing symmetry, modularity, and stereochemistry. This framework establishes a quantitative foundation for complexity-aware classification and inverse design of programmable matter.

36 MATERIALS SCIENCE↗

The ultimate quantum limits on the accuracy of measurements

A quantum generalization of rate-distortion theory from standard communication and information theory is developed for application to determining the ultimate performance limit of measurement systems in physics. For the estimation of a real or a phase parameter, it is shown that the root-mean-square error obtained in a measurement with a single-mode photon level N cannot do better than approximately N exp -1, while approximately exp(-N) may be obtained for multi-mode fields with the same photon level N. Possible ways to achieve the remarkable exponential performance are indicated.

Yuen, Horace P.↗

Security proof for cryptographic protocols based only on the monogamy of Bell's inequality violations

We show that monogamy of Bell's inequality violations, which is strictly weaker condition than the no-signaling principle is enough to prove security of quantum key distribution. We derive our results for a whole class of monogamy constraints and generalize our results to any theory that communicating parties may have access to. Some of these theories do not respect the no-signaling principle yet still allow for secure communication. This proves that no signaling is only a sufficient condition for the possibility of secure communication, but not the necessary one. We also present some new qualitative results concerning the security of existing quantum key distribution protocols.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Communication: Direct comparison between theory and experiment for correlated angular and product-state distributions of the ground-state and stretching-excited O({sup 3}P) + CH{sub 4} reactions

Motivated by a recent experiment [H. Pan and K. Liu, J. Chem. Phys. 140, 191101 (2014)], we report a quasiclassical trajectory study of the O({sup 3}P) + CH{sub 4}(v{sub k} = 0, 1) → OH + CH{sub 3} [k = 1 and 3] reactions on an ab initio potential energy surface. The computed angular distributions and cross sections correlated to the OH(v = 0, 1) + CH{sub 3}(v = 0) coincident product states can be directly compared to experiment for O + CH{sub 4}(v{sub 3} = 0, 1). Both theory and experiment show that the ground-state reaction is backward scattered, whereas the angular distributions shift toward sideways and forward directions upon antisymmetric stretching (v{sub 3}) excitation of the reactant. Theory predicts similar behavior for the O + CH{sub 4}(v{sub 1} = 1) reaction. The simulations show that stretching excitation enhances the reaction up to about 15 kcal/mol collision energy, whereas the O + CH{sub 4}(v{sub k} = 1) reactions produce smaller cross sections for OH(v = 1) + CH{sub 3}(v = 0) than those of O + CH{sub 4}(v = 0) → OH(v = 0) + CH{sub 3}(v = 0). The former finding agrees with experiment and the latter awaits for confirmation. The computed cold OH rotational distributions of O + CH{sub 4}(v = 0) are in good agreement with experiment.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Agent oriented programming: An overview of the framework and summary of recent research

This is a short overview of the agent-oriented programming (AOP) framework. AOP can be viewed as an specialization of object-oriented programming. The state of an agent consists of components called beliefs, choices, capabilities, commitments, and possibly others; for this reason the state of an agent is called its mental state. The mental state of agents is captured formally in an extension of standard epistemic logics: beside temporalizing the knowledge and belief operators, AOP introduces operators for commitment, choice and capability. Agents are controlled by agent programs, which include primitives for communicating with other agents. In the spirit of speech-act theory, each communication primitive is of a certain type: informing, requesting, offering, etc. This document describes these features in more detail and summarizes recent results and ongoing AOP-related work.

Shoham, Yoav↗

Quantum Integers

In number theory, a partition of a positive integer n is a way of writing n as a sum of positive integers. The number of partitions of n is given by the partition function p(n). Inspired by quantum information processing, we extend the concept of partitions in number theory as follows: for an integer n, we treat each partition as a basis state of a quantum system representing that number n, so that the Hilbert-space that corresponds to that integer n is of dimension p(n); the 'classical integer' n can thus be generalized into a (pure) quantum state ||psi(n) > which is a superposition of the partitions of n, in the same way that a quantum bit (qubit) is a generalization of a classical bit. More generally, rho(n) is a density matrix in that same Hilbert-space (a probability distribution over pure states). Inspired by the notion of quantum numbers in quantum theory (such as in Bohr's model of the atom), we then try to go beyond the partitions, by defining (via recursion) the notion of 'sub-partitions' in number theory. Combining the two notions mentioned above, sub-partitions and quantum integers, we finally provide an alternative definition of the quantum integers [the pure-state |psi'(n)> and the mixed-state rho'(n),] this time using the sub-partitions as the basis states instead of the partitions, for describing the quantum number that corresponds to the integer n.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Establishment of a Chaotic Synchronous Response in the Presence of a Phase Filter in a Communication Channel

The problem of establishment of a chaotic synchronous response between two chaotic self-sustained oscillator systems under the conditions of phase filtration of the chaotic signal transferred via a channel from the master to slave system is considered. The characteristics of the phase filter are equivalent to those of a filter present in a communication channel with multipath propagation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reducing Computation and Communication in Scientific Computing: Connecting Theory to Practice.

This report summarizes the work produced as part of a Truman Fellowship appointment and its associated LDRD project. The overall goal of the project was to develop better algorithms and implementations for key computational kernels within the field of scientific computing by designing them to be communication efficient, moving as little data as possible. The primary problem of interest was dense matrix multiplication; other computations that were addressed include sparse matrix-matrix multiplication, QR factorization, solving symmetric linear systems, and the symmetric eigendecomposition. The project also involved the study of computations at the intersection of scientific computing and data analysis, including nonnegative matrix factorization for discovering latent factors, Tucker tensor decomposition for data compression, and sampling methods for similarity search.

97 MATHEMATICS AND COMPUTING↗

Detection and estimation theory

Equalization of dispersive channels using decision feedback, and state variable estimation of sonar or seismic data in presence of pure delay

COMMUNICATION THEORY↗