Search NASA⌕ Search

SEARCH · Search NASA

Results for “channel capacity”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

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.↗
NASA NTRS1999

The Future of the Deep Space Network: Technology Development for K2-Band Deep Space Communications

Projections indicate that in the future the number of NASA's robotic deep space missions is likely to increase significantly. A launch rate of up to 4-6 launches per year is projected with up to 25 simultaneous missions active [I]. Future high resolution mapping missions to other planetary bodies as well as other experiments are likely to require increased downlink capacity. These future deep space communications requirements will, according to baseline loading analysis, exceed the capacity of NASA's Deep Space Network in its present form. There are essentially two approaches for increasing the channel capacity of the Deep Space Network. Given the near-optimum performance of the network at the two deep space communications bands, S-Band (uplink 2.025-2.120 GHz, downlink 2.2-2.3 GHz), and X-Band (uplink 7.145-7.19 GHz, downlink 8.48.5 GHz), additional improvements bring only marginal return for the investment. Thus the only way to increase channel capacity is simply to construct more antennas, receivers, transmitters and other hardware. This approach is relatively low-risk but involves increasing both the number of assets in the network and operational costs.

Bhanji, Alaudin M.↗
NASA NTRS1991

Mobile telephony through LEO satellites: To OBP or not

GLOBALSTAR is a satellite-based mobile communications system that is interoperable with the current and future Public Land Mobile Network (PLMN) and Public Switched Telephone Network (PSTN). The selection of the transponder type, bent-pipe, or onboard processing (OBP), for GLOBALSTAR is based on many criteria, each of which is essential to the commercial and technological feasibility of GLOBALSTAR. The trade study that was done to determine the pros and cons of a bent-pipe transponder or an onboard processing transponder is described. The design of GLOBALSTAR's telecommunications system is a multi-variable cost optimization between the cost and complexity of individual satellites, the number of satellites required to provide coverage to the service areas, the cost of launching the satellites into their selected orbits, the ground segment cost, user equipment cost, satellite voice channel capacity, and other issues. Emphasis is on the cost and complexity of the individual satellites, specifically the transponder type and the impact of the transponder type on satellite and ground segment cost, satellite power and weight, and satellite voice channel capacity.

Monte, Paul A.↗
NASA NTRS2004

Accumulate-Repeat-Accumulate-Accumulate-Codes

Inspired by recently proposed Accumulate-Repeat-Accumulate (ARA) codes [15], in this paper we propose a channel coding scheme called Accumulate-Repeat-Accumulate-Accumulate (ARAA) codes. These codes can be seen as serial turbo-like codes or as a subclass of Low Density Parity Check (LDPC) codes, and they have a projected graph or protograph representation; this allows for a high-speed iterative decoder implementation using belief propagation. An ARAA code can be viewed as a precoded Repeat-and-Accumulate (RA) code with puncturing in concatenation with another accumulator, where simply an accumulator is chosen as the precoder; thus ARAA codes have a very fast encoder structure. Using density evolution on their associated protographs, we find examples of rate-lJ2 ARAA codes with maximum variable node degree 4 for which a minimum bit-SNR as low as 0.21 dB from the channel capacity limit can be achieved as the block size goes to infinity. Such a low threshold cannot be achieved by RA or Irregular RA (IRA) or unstructured irregular LDPC codes with the same constraint on the maximum variable node degree. Furthermore by puncturing the accumulators we can construct families of higher rate ARAA codes with thresholds that stay close to their respective channel capacity thresholds uniformly. Iterative decoding simulation results show comparable performance with the best-known LDPC codes but with very low error floor even at moderate block sizes.

density evolution↗
NASA NTRS2009

Constructing LDPC Codes from Loop-Free Encoding Modules

A method of constructing certain low-density parity-check (LDPC) codes by use of relatively simple loop-free coding modules has been developed. The subclasses of LDPC codes to which the method applies includes accumulate-repeat-accumulate (ARA) codes, accumulate-repeat-check-accumulate codes, and the codes described in Accumulate-Repeat-Accumulate-Accumulate Codes (NPO-41305), NASA Tech Briefs, Vol. 31, No. 9 (September 2007), page 90. All of the affected codes can be characterized as serial/parallel (hybrid) concatenations of such relatively simple modules as accumulators, repetition codes, differentiators, and punctured single-parity check codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. These codes can also be characterized as hybrid turbolike codes that have projected graph or protograph representations (for example see figure); these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The present method comprises two related submethods for constructing LDPC codes from simple loop-free modules with circulant permutations. The first submethod is an iterative encoding method based on the erasure-decoding algorithm. The computations required by this method are well organized because they involve a parity-check matrix having a block-circulant structure. The second submethod involves the use of block-circulant generator matrices. The encoders of this method are very similar to those of recursive convolutional codes. Some encoders according to this second submethod have been implemented in a small field-programmable gate array that operates at a speed of 100 megasymbols per second. By use of density evolution (a computational- simulation technique for analyzing performances of LDPC codes), it has been shown through some examples that as the block size goes to infinity, low iterative decoding thresholds close to channel capacity limits can be achieved for the codes of the type in question having low maximum variable node degrees. The decoding thresholds in these examples are lower than those of the best-known unstructured irregular LDPC codes constrained to have the same maximum node degrees. Furthermore, the present method enables the construction of codes of any desired rate with thresholds that stay uniformly close to their respective channel capacity thresholds.

Divsalar, Dariush↗
NASA NTRS2004

Accumulate repeat accumulate codes

In this paper we propose an innovative channel coding scheme called 'Accumulate Repeat Accumulate codes' (ARA). This class of codes can be viewed as serial turbo-like codes, or as a subclass of Low Density Parity Check (LDPC) codes, thus belief propagation can be used for iterative decoding of ARA codes on a graph. The structure of encoder for this class can be viewed as precoded Repeat Accumulate (RA) code or as precoded Irregular Repeat Accumulate (IRA) code, where simply an accumulator is chosen as a precoder. Thus ARA codes have simple, and very fast encoder structure when they representing LDPC codes. Based on density evolution for LDPC codes through some examples for ARA codes, we show that for maximum variable node degree 5 a minimum bit SNR as low as 0.08 dB from channel capacity for rate 1/2 can be achieved as the block size goes to infinity. Thus based on fixed low maximum variable node degree, its threshold outperforms not only the RA and IRA codes but also the best known LDPC codes with the dame maximum node degree. Furthermore by puncturing the accumulators any desired high rate codes close to code rate 1 can be obtained with thresholds that stay close to the channel capacity thresholds uniformly. Iterative decoding simulation results are provided. The ARA codes also have projected graph or protograph representation that allows for high speed decoder implementation.

Low Density Parity Check codes (LDPC)↗
DOE OSTI2026

Entanglement Throughput Measurements and Capacity Estimates for Aerial-Inground Fiber

The throughput of entangled qubit pairs per second (eqps) is a basic performance metric of quantum networks that provide the entanglement distribution capability. Over fiber connections, it is measured using specialized instruments, including photonic entanglement sources and single-photon detectors. Extensive theory has been developed to estimate the capacity of a generic quantum channel, which in turn is applied to estimate the maximum achievable eqps over a fiber connection. However, there is a gap in relating these two performance metrics, in part due to their disparate nature, namely, mathematical formulae of the channel capacity and specialized instrumentation for eqps measurements. We describe eqps measurements collected over testbed connections composed of aerial and inground fiber of lengths up to 45 km. We estimate the normalized capacity using the transmissivity parameter derived from single photon detector measurements. These estimates are then converted to capacity bounds on the connection's eqps using the source eqps rate derived from co-located detector measurements. The results indicate a consistency between eqps measurements and their capacity estimates, and provide insights into relating the parameters of analytic capacity estimates to physical measurements.

Rao, Nageswara [ORNL] (ORCID:0000000234085941)↗
NASA NTRS2018

Improving Scientific Payload Communication Over Multiple, Low-Capacity Links

Communication is an important part of every airborne science mission. It provides a means for a large group of ground-based scientists to monitor and adjust experiments aboard aircraft that often cannot support a large number of passengers. In some cases, such as unmanned aircraft, communication becomes critical to a successful mission. Existing communication systems require the use of multiple, low-capacity channels, or links, to handle the capacity requirements of the scientists. Current communication solutions attempt to balance performance and reliability, but ultimately suffer from some critical design flaws that limit the ability of the system to handle additional links. We show how adding resources to the current system results in decreased performance and reliability. We explore the use of a new communication protocol, MultiPath Transmission Control Protocol, to make better use of multiple communication links and propose a total system capable of scaling to any number of channels efficiently and dynamically. The tools developed to support and measure this solution are also detailed.

MPTCP↗
NASA NTRS1965

Audio problems in space.

Audio signal processing techniques in future space exploration, discussing channel capacity, speech processing, bandwidth narrowing, etc

SPACE EXPLORATION↗
NASA NTRS1983

Capacity and cutoff rate of (M+1)-ary decision rules for noisy M-ary optical PPM channel

The channel capacity C and the cutoff rate R sub o of two (M + 1)-ary decision rules for noisy M slots/symbol optical pulse position modulation (PPM) with ideal photon counting are computed and compared. Also the values of the optimum thresholds needed to minimize the signal requirements are given. With a minor increase in hardware complexity, the symbol by symbol threshold decision rule is shown to be superior to the slot by slot threshold detection and decision rule in two aspects: first, it saves more than 0.5 dB in signal energy for the very noisy cases of more than one noise photon per slot (for low noise cases it also saves signal energy, but a negligibly small amount). Second, it is more robust to variations in the noise level.

Lee, P. J.↗
NASA NTRS1996

Error Control Techniques for Satellite and Space Communications

In this report, we present the results of our recent work on turbo coding in two formats. Appendix A includes the overheads of a talk that has been given at four different locations over the last eight months. This presentation has received much favorable comment from the research community and has resulted in the full-length paper included as Appendix B, 'A Distance Spectrum Interpretation of Turbo Codes'. Turbo codes use a parallel concatenation of rate 1/2 convolutional encoders combined with iterative maximum a posteriori probability (MAP) decoding to achieve a bit error rate (BER) of 10(exp -5) at a signal-to-noise ratio (SNR) of only 0.7 dB. The channel capacity for a rate 1/2 code with binary phase shift-keyed modulation on the AWGN (additive white Gaussian noise) channel is 0 dB, and thus the Turbo coding scheme comes within 0.7 DB of capacity at a BER of 10(exp -5).

Costello, Daniel J., Jr.↗
NASA NTRS2010

Capacity Maximizing Constellations

Some non-traditional signal constellations have been proposed for transmission of data over the Additive White Gaussian Noise (AWGN) channel using such channel-capacity-approaching codes as low-density parity-check (LDPC) or turbo codes. Computational simulations have shown performance gains of more than 1 dB over traditional constellations. These gains could be translated to bandwidth- efficient communications, variously, over longer distances, using less power, or using smaller antennas. The proposed constellations have been used in a bit-interleaved coded modulation system employing state-ofthe-art LDPC codes. In computational simulations, these constellations were shown to afford performance gains over traditional constellations as predicted by the gap between the parallel decoding capacity of the constellations and the Gaussian capacity

Barsoum, Maged↗
NASA NTRS1973

Multiple-beam satellite repeater tradeoffs applied to a multifunctional system.

This paper concerns satellite repeater tradeoffs for a multiple-beam, multiple-channel, multiple-connectivity satellite postulated to serve a diversity of domestic U.S. noncommercial requirements, with a substantial portion of the satellite power, weight, and bandwidth dedicated to video distribution and bradcast. The orders-of-magnitude of the requirements are given for the video plus high-rate data traffic category. The designs of two alternative baseline repeater configurations are presented, and estimates of their weight and their prime power consumption are given. These data are the basis for estimating the weight and power consumption of a range of alternative beam coverage, modulation, and channel capacity systems. These estimates are used to illustrate tradeoffs with different performance criteria as the independent variable: number of channels per beam and total number of beam-channels.

Kinal, G. V.↗