SEARCH · Search NASA
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.
Method of analyzing responses of computer network based on simple queuing-theory mathmatical models via spreadsheet program. Effects of variations in traffic, capacities of channels, and message protocols assessed.
We present a design framework for the implementation for a Low-Density Parity-Check (LDPC) decoders. We employed a scalable decoding architecture for a certain class of structured LDPC codes.
We present a low-complexity quantization scheme for the implementation of regular (3,6) LDPC codes. The quantization parameters are optimized to maximize the mutual information between the source and the quantized messages. Using this non-uniform quantized belief propagation algorithm, we have simulated that an optimized 3-bit quantizer operates with 0.2dB implementation loss relative to a floating point decoder, and an optimized 4-bit quantizer operates less than 0.1dB quantization loss.
We present a scalable decoding architecture for a certain class of structured LDPC codes. The codes are designed using a small (n,r) protograph that is replicated Z times to produce a decoding graph for a (Z x n, Z x r) code. Using this architecture, we have implemented a decoder for a (4096,2048) LDPC code on a Xilinx Virtex-II 2000 FPGA, and achieved decoding speeds of 31 Mbps with 10 fixed iterations. The implemented message-passing algorithm uses an optimized 3-bit non-uniform quantizer that operates with 0.2dB implementation loss relative to a floating point decoder.
A circuit switching system in an M-ary, n-cube connected network completes a best-first path from an originating node to a destination node by latching valid legs of the path as the path is being sought out. Each network node is provided with a routing hyperswitch sub-network, (HSN) connected between that node and bidirectional high capacity communication channels of the n-cube network. The sub-networks are all controlled by routing algorithms which respond to message identification headings (headers) on messages to be routed along one or more routing legs. The header includes information embedded therein which is interpreted by each sub-network to route and historically update the header. A logic circuit, available at every node, implements the algorithm and automatically forwards or back-tracks the header in the network legs of various paths until a completed path is latched.
The throughput is an important performance metric of entangled qubit distribution quantum networks, and may be characterized by the number of distributed entangled qubit pairs per second (ebps). It is measured over physical quantum network connections using specialized instruments, including photonic entanglement sources and single photon detectors. Extensive theory has been developed to estimate the entangled qubit capacity of quantum channels using abstractions of physical connections. These two quantities both characterize the throughput performance but in different ways, and typically have been hard to relate to each other in concrete terms, in part due to the lack of precise measurements with matching analytical models and derivations. We describe measurements on a physical testbed with fiber connections of lengths 0-75 kilometers. We obtain the normalized analytic capacity estimates using the transmissivity approximations derived using single photon coincidence measurements, and convert them to bounds on throughput (measured in ebps) using a multiplier derived from co-located detector measurements. The results indicate consistent throughput measurements upper-bounded by their analytical capacity estimates across all connections. We show that previous capacity estimates using light measurements are below ebps measurements for some connections, due to the inclusion of non-representative decrease of light levels outside C-band with distance.
Bounds for the linear feedback capacity of m-th order Gaussian autoregressive channels are derived. The upper bound is tighter than that found by Tiernan and Schalwijk (1974) for the feedback capacity of a first-order autoregressive Gaussian channel with not necessarily linear processing. The separation between the upper and lower bounds is small, and it is conjectured that the lower bound converges to the feedback capacity of the first-order channel as the number of signals tends to infinity.
Bosonic pure-loss channel, which represents the process of photons decaying into a vacuum environment, has zero quantum capacity when the channel’s transmissivity is less than 50%. Modeled as a beam splitter interaction between the system and its environment, the performance of bosonic pure-loss channel can be enhanced by controlling the environment state. We show that by choosing the ideal Gottesman-Kitaev-Preskill (GKP) states for the system and its environment, perfect transmission of quantum information through a beam splitter is achievable at arbitrarily low transmissivities. Our explicit constructions allow for experimental demonstration of the improved performance of a quantum channel through passive environment assistance, which is potentially useful for quantum transduction where the environment state can be naturally controlled. In practice, it is crucial to consider finite-energy constraints, and high-fidelity quantum communication through a beam splitter remains achievable with GKP states at the few-photon level.
Pinsker and Ebert (1970) proved that in channels with additive Gaussian noise, feedback at most doubles the capacity. Cover and Pombra (1989) proved that feedback at most adds half a bit per transmission. Following their approach, the author proves that in the limit as signal power approaches either zero (very low SNR) or infinity (very high SNR), feedback does not increase the finite block-length capacity (which for nonstationary Gaussian channels replaces the standard notion of capacity that may not exist). Tighter upper bounds on the capacity are obtained in the process. Specializing these results to stationary channels, the author recovers some of the bounds recently obtained by Ozarow.
This paper presents different results related to the ordering of a sequence of N received symbols with respect to their reliability measure, for BPSK transmission over the AWGN channel model. First, a tight approximation of Pe (i; N), the probability that the hard decision associated with the i-th symbol of the ordered sequence is in error, is derived. Then, it is shown that despite the fact that the random variables representing the noise at positions n 1(sub 1), n(sub 2), ..., n(sub j) of the ordering are no longer independent, the events of having a hard decision decoding error at these positions remain almost independent Pe (n(sub i), n2, ..., n(sub j); N), the probability that the hard decisions associated with the symbols at positions n(sub 1), n(sub 2), ..., n(sub j), in the ordered sequence are in error, is thus well approximated from each of the Pe (n(sub i): N), for i is a member of [1, j]. Finally, based on the independence of these events, the fully connected 2(sup N) -state BSC representing the channel after ordering is simplified by N independent time-shared 2-state BSC's. This new model allows one to easily and tightly approximate the capacity of the channel after ordering.
This paper evaluates the quantization process in the context of the end-to-end performance of the visual-communication channel. Results show that the trade-off between data transmission and visual quality revolves around the information in the acquired signal, not around its energy. Improved information efficiency is gained by frequency dependent quantization that maintains the information capacity of the channel and reduces the entropy of the encoded signal. Restorations with energy bit-allocation lose both in sharpness and clarity relative to restorations with information bit-allocation. Thus, quantization with information bit-allocation is preferred for high information efficiency and visual quality in optimized visual communication.
Algebraic and sequential coding-decoding method for data communication rates up to capacity of discrete memoryless channel, discussing error probabilities
Attention is given to a communication network consisting of an arbitrary number of nodes which can communicate with each other via a time-division multiple access (TDMA) broadcast channel. The reported investigation is concerned with the development of efficient distributed multiple access protocols for traffic consisting primarily of single packet messages in a datagram mode of operation. The motivation for the design of the protocols came from the consideration of efficient multiple access utilization of moderate to high bandwidth (4-40 Mbit/s capacity) communication satellite channels used for the transmission of short (1000-10,000 bits) fixed length packets. Under these circumstances, the ratio of roundtrip propagation time to packet transmission time is between 100 to 10,000. It is shown how a TDMA channel can be adaptively shared by datagram traffic and constant bandwidth users such as in digital voice applications. The distributed reservation control protocols described are a hybrid between contention and reservation protocols.
The integration of a chopped molecular beam mass spectrometer with a time multiplexing system is described. The chopping of the molecular beam is synchronized with the time intervals by a phase detector and a synchronous motor. Arithmetic means are generated for phase shifting the chopper with respect to the multiplexer. A four channel amplifier provides the capacity to independently vary the baseline and amplitude in each channel of the multiplexing system.
A computer simulation of a remote manipulation task and a rate-controlled manipulator is described. Some low-level automatic decision making ability which could be used at the operator's discretion to augment his direct continuous control was built into the manipulator. Experiments were made on the effect of transmission delay, dynamic lag, and intermittent vision on human manipulative ability. Delay does not make remote manipulation impossible. Intermittent visual feedback, and the absence of rate information in the display presented to the operator do not seem to impair the operator's performance. A small-capacity visual feedback channel may be sufficient for remote manipulation tasks, or one channel might be time-shared between several operators. In other experiments the operator called in sequence various on-site automatic control programs of the machine, and thereby acted as a supervisor. The supervisory mode of operation has some advantages when the task to be performed is difficult for a human controlling directly.
Data-compression system developed to satisfy need for high-speed, high-performance compression of data from sources as diverse as medical images, high-definition television images, audio signals, readouts from scientific instruments, and binary data files. Maximum data-transmission capability of communication channel or storage capacity of storage device multiplied by approximately compression ratio. Various combinations of lossless and lossy compression chosen to suit various data streams.
For a pure loss channel, the ultimate capacity can be achieved with classical coherent states (i.e., ideal laser light): (1) Capacity-achieving receiver (measurement) is yet to be determined. (2) Heterodyne detection approaches the ultimate capacity at high mean photon numbers. (3) Photon-counting approaches the ultimate capacity at low mean photon numbers. A number of current technology limits drive the achievable performance of free-space communication links. Approaching fundamental limits in the bandwidth-limited regime: (1) Heterodyne detection with high-order coherent-state modulation approaches ultimate limits. SOA improvements to laser phase noise, adaptive optics systems for atmospheric transmission would help. (2) High-order intensity modulation and photon-counting can approach heterodyne detection within approximately a factor of 2. This may have advantages over coherent detection in the presence of turbulence. Approaching fundamental limits in the photon-limited regime (1) Low-duty cycle binary coherent-state modulation (OOK, PPM) approaches ultimate limits. SOA improvements to laser extinction ratio, receiver dark noise, jitter, and blocking would help. (2) In some link geometries (near field links) number-state transmission could improve over coherent-state transmission
Architecting complex systems requires high-level cognitive processing and extensive knowledge of the system elements, functions, relationships, and constraints. This paper describes a systems architecting methodology implemented through cognitive psychological creative processes using Bloom’s taxonomy as a framework to generate the expert knowledge required to effectively and systematically synthesize new systems. Systems architecting activities were carried out to identify, develop, and capture factual and conceptual knowledge relevant to the system subject matter and functional elements, as well as to facilitate active processing of the knowledge through remembering, understanding, applying, analyzing, evaluating, and creating. Dual channel and limited capacity principles of learning were incorporated into the format of the systems engineering tools developed to assist with information processing and retention. Meta-cognitive strategies associated with memory and creative idea generation were implemented into the methodology to effectively and efficiently develop system alternatives using the full collection of knowledge. Synthesis of an orbiting sample capture and orientation system architecture to enable spacecraft-based on orbit capture of a Mars sample container for a potential Mars Sample Return campaign was used as a case study.