Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 91 records · Page 5

Error control techniques for satellite and space communications

High rate concatenated coding systems with trellis inner codes and Reed-Solomon (RS) outer codes for application in satellite communication systems are considered. Two types of inner codes are studied: high rate punctured binary convolutional codes which result in overall effective information rates between 1/2 and 1 bit per channel use; and bandwidth efficient signal space trellis codes which can achieve overall effective information rates greater than 1 bit per channel use. Channel capacity calculations with and without side information performed for the concatenated coding system. Concatenated coding schemes are investigated. In Scheme 1, the inner code is decoded with the Viterbi algorithm and the outer RS code performs error-correction only (decoding without side information). In scheme 2, the inner code is decoded with a modified Viterbi algorithm which produces reliability information along with the decoded output. In this algorithm, path metrics are used to estimate the entire information sequence, while branch metrics are used to provide the reliability information on the decoded sequence. This information is used to erase unreliable bits in the decoded output. An errors-and-erasures RS decoder is then used for the outer code. These two schemes are proposed for use on NASA satellite channels. Results indicate that high system reliability can be achieved with little or no bandwidth expansion.

Costello, D. J., Jr.↗

Hardware Implementation of Serially Concatenated PPM Decoder

A prototype decoder for a serially concatenated pulse position modulation (SCPPM) code has been implemented in a field-programmable gate array (FPGA). At the time of this reporting, this is the first known hardware SCPPM decoder. The SCPPM coding scheme, conceived for free-space optical communications with both deep-space and terrestrial applications in mind, is an improvement of several dB over the conventional Reed-Solomon PPM scheme. The design of the FPGA SCPPM decoder is based on a turbo decoding algorithm that requires relatively low computational complexity while delivering error-rate performance within approximately 1 dB of channel capacity. The SCPPM encoder consists of an outer convolutional encoder, an interleaver, an accumulator, and an inner modulation encoder (more precisely, a mapping of bits to PPM symbols). Each code is describable by a trellis (a finite directed graph). The SCPPM decoder consists of an inner soft-in-soft-out (SISO) module, a de-interleaver, an outer SISO module, and an interleaver connected in a loop (see figure). Each SISO module applies the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm to compute a-posteriori bit log-likelihood ratios (LLRs) from apriori LLRs by traversing the code trellis in forward and backward directions. The SISO modules iteratively refine the LLRs by passing the estimates between one another much like the working of a turbine engine. Extrinsic information (the difference between the a-posteriori and a-priori LLRs) is exchanged rather than the a-posteriori LLRs to minimize undesired feedback. All computations are performed in the logarithmic domain, wherein multiplications are translated into additions, thereby reducing complexity and sensitivity to fixed-point implementation roundoff errors. To lower the required memory for storing channel likelihood data and the amounts of data transfer between the decoder and the receiver, one can discard the majority of channel likelihoods, using only the remainder in operation of the decoder. This is accomplished in the receiver by transmitting only a subset consisting of the likelihoods that correspond to time slots containing the largest numbers of observed photons during each PPM symbol period. The assumed number of observed photons in the remaining time slots is set to the mean of a noise slot. In low background noise, the selection of a small subset in this manner results in only negligible loss. Other features of the decoder design to reduce complexity and increase speed include (1) quantization of metrics in an efficient procedure chosen to incur no more than a small performance loss and (2) the use of the max-star function that allows sum of exponentials to be computed by simple operations that involve only an addition, a subtraction, and a table lookup. Another prominent feature of the design is a provision for access to interleaver and de-interleaver memory in a single clock cycle, eliminating the multiple clock-cycle latency characteristic of prior interleaver and de-interleaver designs.

Moision, Bruce↗

Spatial Mode Correction of Single Photons Using Machine Learning

Abstract Spatial modes of light constitute valuable resources for a variety of quantum technologies ranging from quantum communication and quantum imaging to remote sensing. Nevertheless, their vulnerabilities to phase distortions, induced by random media, impose significant limitations on the realistic implementation of numerous quantum‐photonic technologies. Unfortunately, this problem is exacerbated at the single‐photon level. Over the last two decades, this challenging problem has been tackled through conventional schemes that utilize optical nonlinearities, quantum correlations, and adaptive optics. In this article, the self‐learning and self‐evolving features of artificial neural networks are exploited to correct the complex spatial profile of distorted Laguerre–Gaussian modes at the single‐photon level. Furthermore, the potential of this technique is used to improve the channel capacity of an optical communication protocol that relies on structured single photons. The results have important implications for real‐time turbulence correction of structured photons and single‐photon images.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Full Information Acquisition in Scanning Probe Microscopy

Scanning Probe Microscopy (SPM) has unlocked the nanoworld for exploration and control. While substantial effort has been dedicated towards the development of better instrumental platforms and probes, opportunities related to signal processing and data acquisition in SPMareoftenoverlooked. In this work, we discuss opportunities offered by capturing the full information of thedata stream from the detector, referred to as General Mode (G-Mode) SPM. This approach allows exploration of the complex tip-surface interactions, spatial mapping of multidimensional variability of material properties and their mutual interactions, and imaging at the information channel capacity limit, providing a new paradigm for SPM detection.

47 OTHER INSTRUMENTATION↗

Complete information acquisition in scanning probe microscopy

In the last three decades, scanning probe microscopy (SPM) has emerged as a primary tool for exploring and controlling the nanoworld. A critical part of the SPM measurements is the information transfer from the tip-surface junction to a macroscopic measurement system. This process reduces the many degrees of freedom of a vibrating cantilever to relatively few parameters recorded as images. Similarly, the details of dynamic cantilever response at sub-microsecond time scales of transients, higher-order eigenmodes and harmonics are averaged out by transitioning to millisecond time scale of pixel acquisition. Hence, the amount of information available to the external observer is severely limited, and its selection is biased by the chosen data processing method. Here, we report a fundamentally new approach for SPM imaging based on information theory-type analysis of the data stream from the detector. This approach allows full exploration of complex tip-surface interactions, spatial mapping of multidimensional variability of material s properties and their mutual interactions, and SPM imaging at the information channel capacity limit.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Positivity of linear maps under tensor powers

We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with n copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show that for every n ∈ ℕ, there exist non-trivial maps with this property and that for two-dimensional Hilbert spaces there is no non-trivial map for which this holds for all n. For higher dimensions, we reduce the existence question of such non-trivial “tensor-stable positive maps” to a one-parameter family of maps and show that an affirmative answer would imply the existence of non-positive partial transpose bound entanglement. As an application, we show that any tensor-stable positive map that is not completely positive yields an upper bound on the quantum channel capacity, which for the transposition map gives the well-known cb-norm bound. We, furthermore, show that the latter is an upper bound even for the local operations and classical communications-assisted quantum capacity, and that moreover it is a strong converse rate for this task.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum communication network utilizing quadripartite entangled states of optical field

We propose two types of quantum dense coding communication networks with optical continuous variables, in which a quadripartite entangled state of the optical field with totally three-party correlations of quadrature amplitudes is utilized. In the networks, the exchange of information between any two participants can be manipulated by one or two of the remaining participants. The channel capacities for a variety of communication protocols are numerically calculated. Due to the fact that the quadripartite entangled states applied in the communication systems have been successfully prepared already in the laboratory, the proposed schemes are experimentally accessible at present.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Forgetfulness of continuous Markovian quantum channels

The notion of forgetfulness, used in discrete quantum memory channels, is slightly weakened in order to be applied to the case of continuous channels. This is done in the context of quantum memory channels with Markovian noise. As a case study, we apply the notion of weak forgetfulness to a bosonic memory channel with additive noise. A suitable encoding and decoding unitary transformation allows us to unravel the effects of the memory, hence the channel capacities can be computed using known results from the memoryless setting.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Complete hyperentangled-Bell-state analysis for quantum communication

It is impossible to unambiguously distinguish the four Bell states in polarization, resorting to linear optical elements only. Recently, the hyperentangled Bell state, the simultaneous entanglement in more than one degree of freedom, has been used to assist in the complete Bell-state analysis of the four Bell states. However, if the additional degree of freedom is qubitlike, one can only distinguish 7 from the group of 16 states. Here we present a way to distinguish the hyperentangled Bell states completely with the help of cross-Kerr nonlinearity. Also, we discuss its application in the quantum teleportation of a particle in an unknown state in two different degrees of freedom and in the entanglement swapping of hyperentangled states. These applications will increase the channel capacity of long-distance quantum communication.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient bounds on quantum-communication rates via their reduced variants

We investigate one-way communication scenarios where Bob operating on his component can transfer some subsystem to the environment. We define reduced versions of quantum-communication rates and, further, prove upper bounds on a one-way quantum secret key, distillable entanglement, and quantum-channel capacity by means of their reduced versions. It is shown that in some cases they drastically improve their estimation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Superdense Coding over Optical Fiber Links with Complete Bell-State Measurements

Adopting quantum communication to modern networking requires transmitting quantum information through a fiber-based infrastructure. In this paper, we report the first demonstration of superdense coding over optical fiber links, taking advantage of a complete Bell-state measurement enabled by time-polarization hyperentanglement, linear optics, and common single-photon detectors. Finally, we demonstrate the highest single-qubit channel capacity to date utilizing linear optics, 1.665 ± 0.018, and we provide a full experimental implementation of a hybrid, quantum-classical communication protocol for image transfer.

97 MATHEMATICS AND COMPUTING↗

Eavesdropping on the Decohering Environment: Quantum Darwinism, Amplification, and the Origin of Objective Classical Reality

“How much information about a system S can one extract from a fragment F of the environment E that decohered it?” is the central question of Quantum Darwinism. To date, most answers relied on the quantum mutual information of SF, or on the Holevo bound on the channel capacity of F to communicate the classical information encoded in S. Furthermore, these are reasonable upper bounds on what is really needed but much harder to calculate—the accessible information in the fragment F about S. We consider a model based on imperfect c-not gates where all the above can be computed, and discuss its implications for the emergence of objective classical reality. We find that all relevant quantities, such as the quantum mutual information as well as various bounds on the accessible information exhibit similar behavior. In the regime relevant for the emergence of objective classical reality this includes scaling independent of the quality of the imperfect c-not gates or the size of E, and even nearly independent of the initial state of S.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Telemetry Design

The basic telemetry-system concept for Explorer XI11 was selected primarily on the basis of demonstrated performance (ref. IV-1). The successful orbiting of Vanguard I1 (1939 Alpha) and Vanguard I11 (1959 Eta) had proven the basic design of the tracking and telemetry concepts which were compatible with mini- track network. It was necessary for the NASA Langley Research Center (LRC) to expand the system to provide a 48-channel telemetry system. Two of these sys- tems were used in the Explorer XI11 in order to provide the required channel capacity.

TELEMETRY↗

Data compression with bounded errors.

Data compression from standpoint of epsilon entropy theory, considering precise measure of channel capacity necessary to describe data source

Posner, E. C.↗

The rate of a class of random processes

Algorithm applied to specific classes of random processes for calculating minimum channel capacity required by transmission system for sources in each class

Sakrison, D. J.↗