Search NASA⌕ Search

SEARCH · Search NASA

Results for “communication lower bounds”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. Here, we establish communication lower bounds that determine how much data movement is required (under mild conditions) to perform the Multi-TTM computation in parallel. The crux of the proof relies on analytically solving a constrained, nonlinear optimization problem. We also present a parallel algorithm to perform this computation that organizes the processors into a logical grid with twice as many modes as the input tensor. We show that, with correct choices of grid dimensions, the communication cost of the algorithm attains the lower bounds and is therefore communication optimal. Finally, we show that our algorithm can significantly reduce communication compared to the straightforward approach of expressing the computation as a sequence of tensor-times-matrix operations when the input and output tensors vary greatly in size.

HBL-inequalities↗
DOE OSTI2025

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗
NASA NTRS1976

Basic limits on protocol information in data communications networks

The paper considers basic limitations on the amount of protocol information that must be transmitted in a data communication network to keep track of source and receiver addresses and of the starting and stopping of messages. Assuming Poisson message arrivals between each communicating source-receiver pair, a lower bound is found on the required protocol information for message. This lower bound is the sum of two terms, one for the message-length information, which depends only on the distribution of message lengths, and the other for the message-start information, which depends only on the product of the source-receiver pair arrival rate and the expected delay for transmitting the message. Two strategies are developed which, in the limit of large numbers of sources and receivers, almost meet the lower bound on protocol information.

Gallager, R. G.↗
NASA NTRS1969

DRSS communication considerations for manned space flight

A lower and an upper bound or manned space flight requirements for a data relay satellite system (DRSS) in the 1975-1980 time period are described. In all cases, the most stringent requirement is an intersatellite link to provide wideband information transfer from an overseas DRS to the Continental United States. A parametric communication analysis is made as a function of varying frequency and antenna aperture. The desirability of using a VHF frequency band for low data rates and voice relay and the requirement for frequencies of 8 and 16 GHz for video and wideband digital data relay are shown.

Peltzer, K. E.↗
NASA NTRS2023

High Altitude Platform System (HAPS) Communication Support for Wildland Firefighting

High Altitude Platform Systems (HAPS) are emerging aircraft and balloon-type technology that can host payloads and provide services from the stratosphere. One potential HAPS use case is to provide wireless communication services for mobile devices, such as LTE, to wildland firefighters who often operate in locations without terrestrial wireless communications coverage. In this research we analyze historical wildland fire data to provide estimates of the annual number of HAPS required to support a fire season. We apply agglomerative clustering to group historical daily satellite-based fire observations where each cluster is analogous to a required HAPS vehicle. Our lower and upper bound estimates span a range of years, communication payload footprints, the minimum days of clusters prior to launch, and categories of fires. Additionally, we consider a case where HAPS vehicles can be transferred between fires after the initial fire has dissipated. In our specific case study from 2022 “Significant” fires (greater than 40,000 acres), we approximate that either 8 balloon HAPS vehicles without considering overprovisioning for station-keeping limitations or 23 fixed-wing aircraft would be required. Overprovisioning can scale the estimate for balloon vehicles based on reader preference, and for reference, Google Loon overprovisioned by 5-10x. Furthermore, in the case where budgets are constrained and not all of the estimated HAPS vehicles can be acquired, we provide operational insight on where to deploy HAPS vehicles. Generally, in the Spring months we see that HAPS vehicles are needed in the south and southeast of the US which transitions to the north and west as the fire season progresses.

Aaron J. Burns↗
NASA NTRS1991

Estimation variance bounds of importance sampling simulations in digital communication systems

In practical applications of importance sampling (IS) simulation, two basic problems are encountered, that of determining the estimation variance and that of evaluating the proper IS parameters needed in the simulations. The authors derive new upper and lower bounds on the estimation variance which are applicable to IS techniques. The upper bound is simple to evaluate and may be minimized by the proper selection of the IS parameter. Thus, lower and upper bounds on the improvement ratio of various IS techniques relative to the direct Monte Carlo simulation are also available. These bounds are shown to be useful and computationally simple to obtain. Based on the proposed technique, one can readily find practical suboptimum IS parameters. Numerical results indicate that these bounding techniques are useful for IS simulations of linear and nonlinear communication systems with intersymbol interference in which bit error rate and IS estimation variances cannot be obtained readily using prior techniques.

Lu, D.↗
DOE OSTI2026

Capacities of Entanglement Distribution From a Central Source

Distribution of entanglement is an essential task in quantum information processing and the realization of quantum networks. In our work, we theoretically investigate the scenario where a central source prepares an N -partite entangled state and transmits each entangled subsystem to one of N receivers through noisy quantum channels. The receivers are then able to perform local operations assisted by unlimited classical communication to distill target entangled states from the noisy channel output. In this operational context, we define the EPR distribution capacity and the GHZ distribution capacity of a quantum channel as the largest rates at which Einstein-Podolsky-Rosen (EPR) states and Greenberger-Horne-Zeilinger (GHZ) states can be faithfully distributed through the channel, respectively. We establish lower and upper bounds on the EPR distribution capacity by connecting it with the task of assisted entanglement distillation. We also construct an explicit protocol consisting of a combination of a quantum communication code and a classical-post-processing-assisted entanglement generation code, which yields a simple achievable lower bound for generic channels. As applications of these results, we give an exact expression for the EPR distribution capacity over two erasure channels and bounds on the EPR distribution capacity over two generalized amplitude damping channels. We also bound the GHZ distribution capacity, which results in an exact characterization of the GHZ distribution capacity when the most noisy channel is a dephasing channel.

42 ENGINEERING↗
NASA NTRS1990

Performance bounds on parallel self-initiating discrete-event

The use is considered of massively parallel architectures to execute discrete-event simulations of what is termed self-initiating models. A logical process in a self-initiating model schedules its own state re-evaluation times, independently of any other logical process, and sends its new state to other logical processes following the re-evaluation. The interest is in the effects of that communication on synchronization. The performance is considered of various synchronization protocols by deriving upper and lower bounds on optimal performance, upper bounds on Time Warp's performance, and lower bounds on the performance of a new conservative protocol. The analysis of Time Warp includes the overhead costs of state-saving and rollback. The analysis points out sufficient conditions for the conservative protocol to outperform Time Warp. The analysis also quantifies the sensitivity of performance to message fan-out, lookahead ability, and the probability distributions underlying the simulation.

Nicol, David M.↗
NASA NTRS1991

Parallel computation of manipulator inverse dynamics

In this article, parallel computation of manipulator inverse dynamics is investigated. A hierarchical graph-based mapping approach is devised to analyze the inherent parallelism in the Newton-Euler formulation at several computational levels, and to derive the features of an abstract architecture for exploitation of parallelism. At each level, a parallel algorithm represents the application of a parallel model of computation that transforms the computation into a graph whose structure defines the features of an abstract architecture, i.e., number of processors, communication structure, etc. Data-flow analysis is employed to derive the time lower bound in the computation as well as the sequencing of the abstract architecture. The features of the target architecture are defined by optimization of the abstract architecture to exploit maximum parallelism while minimizing architectural complexity. An architecture is designed and implemented that is capable of efficient exploitation of parallelism at several computational levels. The computation time of the Newton-Euler formulation for a 6-degree-of-freedom (dof) general manipulator is measured as 187 microsec. The increase in computation time for each additional dof is 23 microsec, which leads to a computation time of less than 500 microsec, even for a 12-dof redundant arm.

Fijany, Amir↗
NASA NTRS1989

Data traffic reduction schemes for Cholesky factorization on asynchronous multiprocessor systems

Communication requirements of Cholesky factorization of dense and sparse symmetric, positive definite matrices are analyzed. The communication requirement is characterized by the data traffic generated on multiprocessor systems with local and shared memory. Lower bound proofs are given to show that when the load is uniformly distributed the data traffic associated with factoring an n x n dense matrix using n to the alpha power (alpha less than or equal 2) processors is omega(n to the 2 + alpha/2 power). For n x n sparse matrices representing a square root of n x square root of n regular grid graph the data traffic is shown to be omega(n to the 1 + alpha/2 power), alpha less than or equal 1. Partitioning schemes that are variations of block assignment scheme are described and it is shown that the data traffic generated by these schemes are asymptotically optimal. The schemes allow efficient use of up to O(n to the 2nd power) processors in the dense case and up to O(n) processors in the sparse case before the total data traffic reaches the maximum value of O(n to the 3rd power) and O(n to the 3/2 power), respectively. It is shown that the block based partitioning schemes allow a better utilization of the data accessed from shared memory and thus reduce the data traffic than those based on column-wise wrap around assignment schemes.

Naik, Vijay K.↗
NASA NTRS1991

Improved algorithms for mapping pipelined and parallel computations

Recent work on the problem of mapping pipelined or parallel computations onto linear array, shared memory, and host-satellite systems is extended. It is shown how these problems can be solved even more efficiently when computation module execution times are bounded from below, intermodule communication times are bounded from above, and the processors satisfy certain homogeneity constraints. The improved algorithms have significantly lower time and space complexities than the more general algorithms: in one case, an O(nm3) time algorithm for mapping m modules onto n processors is replaced with an O(nm log m) time algorithm, and the space requirements are reduced from O(nm2) to O(m). Run-time complexity is reduced further with parallel mapping algorithms based on these improvements, which run on the architectures for which they create mappings.

Nicol, David M.↗
NASA NTRS1990

Error control techniques for satellite and space communications

An expurgated upper bound on the event error probability of trellis coded modulation is presented. This bound is used to derive a lower bound on the minimum achievable free Euclidean distance d sub (free) of trellis codes. It is shown that the dominant parameters for both bounds, the expurgated error exponent and the asymptotic d sub (free) growth rate, respectively, can be obtained from the cutoff-rate R sub O of the transmission channel by a simple geometric construction, making R sub O the central parameter for finding good trellis codes. Several constellations are optimized with respect to the bounds.

Costello, Daniel J., Jr.↗
NASA NTRS1972

Energy-ratio function for center-of-gravity feedback.

An energy-ratio function is introduced which greatly facilitates analysis and signal design for center-of-gravity feedback communication schemes. Using this function, we show that center-of-gravity feedback using regular-simplex signals achieves Shannon's lower bound on average energy per transmission for zero error probability if M, the number of messages, is 3, 4, or 5 and there is no constraint on system bandwidth.

Fang, T.-T.↗
NASA NTRS1987

Error control techniques for satellite and space communications

The performance of bandwidth efficient trellis inner codes using two-dimensional MPSK signal constellations in a NASA concatenated coding is summarized. Work was also continued on trellis coded modulation using multi-dimensional signal sets. Achievable lower bounds on free distance trellis codes were proved and the existence of good trellis coded modulation (TCM) schemes were established for a variety of signal constellations. The performance of TCM schemes on fading channels is being investigated. Preliminary results indicate that bandwidth efficient trellis coding is feasible on such channels, but that the important design parameter is no longer the minimum free Euclidean distance.

Costello, Daniel J., Jr.↗
NASA NTRS2020

Cramer-Rao Lower Bound for SoOp-R-Based Root-Zone Soil Moisture Remote Sensing

Signals of opportunity (SoOp) reflectometry (SoOp-R) is a maturing field for geophysical remote sensing as evidenced by the growing number of airborne and spaceborne experiments. As this approach receives more attention, it is worth analyzing SoOp-R’s capabilities to retrieve subsurface soil moisture (SM) by leveraging communication and navigation satellite transmitters. In this research, the CRLB is used to identify the effects of variable SoOp-R parameters on the best achievable estimation error for root-zone soil moisture (RZSM). This study investigates the use of multiple frequency, polarization, and incidence angle measurement configurations on a two-layered dielectric profile. The results also detail the effects of variable SM conditions on the capability of SoOp-R systems to predict subsurface SM. The most prevalent observation is the importance of using at least two frequencies to limit uncertainties from subsurface SM estimates. If at least two frequencies are used, the CRLB of a profile is retrievable within the root-zone depending on the surface SM content as well as the number of independent measurements of the profile. For a depth of 30 cm, it is observed that a CRLB corresponding to 4% RZSM estimation accuracy is achievable with as few as 2 dual-frequency-based SoOp-R measurements. For this depth, increasing number of measurements provided by polarization and incidence angle allow for sensing of increasingly wet SM profile structures. This study, overall, details a methodology by which SoOp-R receiver system can be designed to achieve a desired CRLB using a trade-off study between the available measurements and SM profile.

Signals of Opportunity (SoOp)↗