Search NASA⌕ Search

SEARCH · Search NASA

Results for “receiver optimization”

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 199 records · Page 11

Methodology and Method and Apparatus for Signaling With Capacity Optimized Constellations

Communication systems are described that use geometrically shaped constellations that have increased capacity compared to conventional constellations operating within a similar SNR band. In several embodiments, the geometrically shaped is optimized based upon a capacity measure such as parallel decoding capacity or joint capacity. In many embodiments, a capacity optimized geometrically shaped constellation can be used to replace a conventional constellation as part of a firmware upgrade to transmitters and receivers within a communication system. In a number of embodiments, the geometrically shaped constellation is optimized for an Additive White Gaussian Noise channel or a fading channel. In numerous embodiments, the communication uses adaptive rate encoding and the location of points within the geometrically shaped constellation changes as the code rate changes.

Barsoum, Maged F.↗

Methodology and Method and Apparatus for Signaling with Capacity Optimized Constellations

Design Methodology and Method and Apparatus for Signaling with Capacity Optimized Constellation Abstract Communication systems are described that use geometrically PSK shaped constellations that have increased capacity compared to conventional PSK constellations operating within a similar SNR band. The geometrically shaped PSK constellation is optimized based upon parallel decoding capacity. In many embodiments, a capacity optimized geometrically shaped constellation can be used to replace a conventional constellation as part of a firmware upgrade to transmitters and receivers within a communication system. In a number of embodiments, the geometrically shaped constellation is optimized for an Additive White Gaussian Noise channel or a fading channel. In numerous embodiments, the communication uses adaptive rate encoding and the location of points within the geometrically shaped constellation changes as the code rate changes.

Barsoum, Maged F.↗

Methodology and Method and Apparatus for Signaling with Capacity Optimized Constellations

Communication systems are described that use geometrically shaped constellations that have increased capacity compared to conventional constellations operating within a similar SNR band. In several embodiments, the geometrically shaped is optimized based upon a capacity measure such as parallel decoding capacity or joint capacity. In many embodiments, a capacity optimized geometrically shaped constellation can be used to replace a conventional constellation as part of a firmware upgrade to transmitters and receivers within a communication system. In a number of embodiments, the geometrically shaped constellation is optimized for an Additive White Gaussian Noise channel or a fading channel.

Barsoum, Maged F.↗

Topology optimization of 3D photonic crystals with complete bandgaps

The design of photonic crystals with complete bandgaps has recently received considerable research focus for numerous reasons. This work leverages well-known nonlinear programming techniques to alleviate the non-smoothness caused by degenerate eigenvalues such that topology optimization problems can be solved with the open-source IPOPT software. A fully-vectorial plane wave expansion technique is used with an iterative eigensolver to efficiently predict dispersion properties of candidate structures. Nonlinear programming is employed to solve the inverse problem of designing three-dimensional periodic structures that exhibit complete two-dimensional (2D) and three-dimensional (3D) photonic bandgaps. Mesh refinement is performed to alleviate the large computational burden of designing and analyzing photonic crystals, and a periodic density filter is implemented to impose a minimum feature size for manufacturability considerations.

97 MATHEMATICS AND COMPUTING↗

Single-qubit multi-party transmission using universal symmetric quantum cloning

This study considers the hypothetical quantum network case where Alice wishes to transmit one qubit of information (specifically a pure quantum state) to M parties, where M is some large number. The remote receivers locally perform single-qubit quantum state tomography on the transmitted qubits in order to compute the quantum state within some error rate (dependent on the tomography technique and the number of transmitted qubits). We show that with the use of an intermediate optimal symmetric universal quantum cloning machine (between Alice and the remote receivers) as a repeater-type node in a hypothetical quantum network, Alice can send significantly fewer qubits compared to direct transmission of the message qubits to each of the M remote receivers. This is possible due to two properties of quantum cloning. The first is that single qubit quantum clones retain the same Bloch angle as the initial quantum state. This means that if the mixed state of the quantum clone can be computed to high enough accuracy, the original pure quantum state can be inferred by extrapolating that vector to the surface of the Bloch sphere. The second property is that the state overlap of approximate quantum clones, with respect to the original pure quantum state, quickly converges (specifically for 1 → M , the limit of the fidelity as M goes to infinity is $\frac{2}{3}$). This means that Alice can prepare a constant number of qubits (which are then passed through the quantum cloning machine) in order to achieve a desired error rate if M is large enough. Combined, these two properties mean that for a large M , Alice can prepare many orders of magnitude fewer qubits in order to achieve the same single qubit transmission accuracy compared to the naive direct qubit transmission approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Aircraft configuration optimization including optimized flight profiles

The Flight Optimization System (FLOPS) is an aircraft configuration optimization program developed for use in conceptual design of new aircraft and in the assessment of the impact of advanced technology. The modular makeup of the program is illustrated. It contains modules for preliminary weights estimation, preliminary aerodynamics, detailed mission performance, takeoff and landing, and execution control. An optimization module is used to drive the overall design and in defining optimized profiles in the mission performance. Propulsion data, usually received from engine manufacturers, are used in both the mission performance and the takeoff and landing analyses. Although executed as a single in-core program, the modules are stored separately so that the user may select the appropriate modules (e.g., fighter weights versus transport weights) or leave out modules that are not needed.

Mccullers, L. A.↗

Airborne gravimetry, altimetry, and GPS navigation errors

Proper interpretation of airborne gravimetry and altimetry requires good knowledge of aircraft trajectory. Recent advances in precise navigation with differential GPS have made it possible to measure gravity from the air with accuracies of a few milligals, and to obtain altimeter profiles of terrain or sea surface correct to one decimeter. These developments are opening otherwise inaccessible regions to detailed geophysical mapping. Navigation with GPS presents some problems that grow worse with increasing distance from a fixed receiver: the effect of errors in tropospheric refraction correction, GPS ephemerides, and the coordinates of the fixed receivers. Ionospheric refraction and orbit error complicate ambiguity resolution. Optimal navigation should treat all error sources as unknowns, together with the instantaneous vehicle position. To do so, fast and reliable numerical techniques are needed: efficient and stable Kalman filter-smoother algorithms, together with data compression and, sometimes, the use of simplified dynamics.

Colombo, Oscar L.↗

Notes on SAW Tag Interrogation Techniques

We consider the problem of interrogating a single SAW RFID tag with a known ID and known range in the presence of multiple interfering tags under the following assumptions: (1) The RF propagation environment is well approximated as a simple delay channel with geometric power-decay constant alpha >/= 2. (2) The interfering tag IDs are unknown but well approximated as independent, identically distributed random samples from a probability distribution of tag ID waveforms with known second-order properties, and the tag of interest is drawn independently from the same distribution. (3) The ranges of the interfering tags are unknown but well approximated as independent, identically distributed realizations of a random variable rho with a known probability distribution f(sub rho) , and the tag ranges are independent of the tag ID waveforms. In particular, we model the tag waveforms as random impulse responses from a wide-sense-stationary, uncorrelated-scattering (WSSUS) fading channel with known bandwidth and scattering function. A brief discussion of the properties of such channels and the notation used to describe them in this document is given in the Appendix. Under these assumptions, we derive the expression for the output signal-to-noise ratio (SNR) for an arbitrary combination of transmitted interrogation signal and linear receiver filter. Based on this expression, we derive the optimal interrogator configuration (i.e., transmitted signal/receiver filter combination) in the two extreme noise/interference regimes, i.e., noise-limited and interference-limited, under the additional assumption that the coherence bandwidth of the tags is much smaller than the total tag bandwidth. Finally, we evaluate the performance of both optimal interrogators over a broad range of operating scenarios using both numerical simulation based on the assumed model and Monte Carlo simulation based on a small sample of measured tag waveforms. The performance evaluation results not only provide guidelines for proper interrogator design, but also provide some insight on the validity of the assumed signal model. It should be noted that the assumption that the impulse response of the tag of interest is known precisely implies that the temperature and range of the tag are also known precisely, which is generally not the case in practice. However, analyzing interrogator performance under this simplifying assumption is much more straightforward and still provides a great deal of insight into the nature of the problem.

Barton, Richard J.↗

NASA Tech Briefs, October 2010

Topics covered include: Hybrid Architecture Active Wavefront Sensing and Control; Carbon-Nanotube-Based Chemical Gas Sensor; Aerogel-Positronium Technology for the Detection of Small Quantities of Organic and/or Toxic Materials; Graphene-Based Reversible Nano-Switch/Sensor Schottky Diode; Inductive Non-Contact Position Sensor; High-Temperature Surface-Acoustic-Wave Transducer; Grid-Sphere Electrodes for Contact with Ionospheric Plasma; Enabling IP Header Compression in COTS Routers via Frame Relay on a Simplex Link; Ka-Band SiGe Receiver Front-End MMIC for Transponder Applications; Robust Optimization Design Algorithm for High-Frequency TWTs; Optimal and Local Connectivity Between Neuron and Synapse Array in the Quantum Dot/Silicon Brain; Method and Circuit for In-Situ Health Monitoring of Solar Cells in Space; BGen: A UML Behavior Network Generator Tool; Platform for Post-Processing Waveform-Based NDE; Electrochemical Hydrogen Peroxide Generator; Fabrication of Single, Vertically Aligned Carbon Nanotubes in 3D Nanoscale Architectures; Process to Create High-Fidelity Lunar Dust Simulants; Lithium-Ion Electrolytes Containing Phosphorous-Based, Flame-Retardant Additives; InGaP Heterojunction Barrier Solar Cells; Straight-Pore Microfilter with Efficient Regeneration; Determining Shear Stress Distribution in a Laminate; Self-Adjusting Liquid Injectors for Combustors; Handling Qualities Prediction of an F-16XL-Based Reduced Sonic Boom Aircraft; Tele-Robotic ATHLETE Controller for Kinematics - TRACK; Three-Wheel Brush-Wheel Sampler; Heterodyne Interferometer Angle Metrology; Aligning Astronomical Telescopes via Identification of Stars; Generation of Optical Combs in a WGM Resonator from a Bichromatic Pump; Large-Format AlGaN PIN Photodiode Arrays for UV Images; Fiber-Coupled Planar Light-Wave Circuit for Seed Laser Control in High Spectral Resolution Lidar Systems; On Calculating the Zero-Gravity Surface Figure of a Mirror; Optical Modification of Casimir Forces for Improved Function of Micro- and Nano-Scale Devices; Analysis, Simulation, and Verification of Knowledge-Based, Rule-Based, and Expert Systems; Core and Off-Core Processes in Systems Engineering; Digital Reconstruction Supporting Investigation of Mishaps; and Template Matching Approach to Signal Prediction.

Source record↗

ICESat-2 Constraint Analysis and Monitoring System (CAMS)

The Ice, Cloud and land Elevation Satellite-2 was launched on 15 September 2018 with mission goals of collecting surface elevation data that can precisely measure ice sheet topography, cloud and aerosol heights, land topography, as well as vegetation height for ecosystems studies. The Constraint Analysis and Monitoring System (CAMS) was implemented as an ICESat-2 ground system element to perform Mission Planning and Spacecraft Safety Monitoring. Mission Planning requires CAMS to serve as an interface between the Project Science Office, the Instrument Support Facility and the Mission Operation Control Center. By ingesting inputs received from all three groups, the CAMS builds an optimized and deconflicted timeline of science and instrument activities. Based upon the timeline of activities, the CAMS utilizes a sophisticated set of algorithms to model and predict the location and pointing of the spacecraft instrument relative to the Earth and Sun. From the predicted position and pointing, the CAMS provides precise monitoring of instrument health, and performs space asset laser conjunction detection. Furthermore, the CAMS determines alternative plans to prevent detected health constraint violations or mitigate potential laser conjunctions. This paper provides an overview of the CAMS and presents the operational performance of planning science and instrument activities, the monitoring of instrument constraints for health and safety, and the space asset laser conjunction screening and mitigation process.

ICESat-2↗

Multi-User Capacity for Cyclic Prefix Direct Sequence Spread Spectrum with Linear Detection and Precoding

Cyclic Prefix Direct Sequence Spread Spectrum (CP-DSSS) is a promising solution for futuristic 6G ultra-reliable low latency communications (URLLC) and massive machine type communication (mMTC) applications, where the CP-DSSS waveform would operate as a secondary network at the same frequencies as the primary network but at much lower SNR. In this paper, we show per-user capacity for multi-user scenarios, where simple matched filtering (MF) is performed on the uplink (UL) and time-reversal (TR) precoding is used on the downlink (DL). When operating in the low SNR regime, CP-DSSS achieves per-user capacity near the optimum single-user capacity by using a MF detector at the receiver for the UL. TR precoding converges to the optimal capacity as the number of antennas at the hub/gateway increases. Given the near-optimal performance of MF detection and TR precoding for each of the users, CP-DSSS can be implemented with simple device transceiver structures, reducing per-unit cost for massively deployed 6G networks.

5G and Beyond Communications↗

Entanglement-Enhanced Neyman-Pearson Target Detection

Quantum illumination (QI) provides entanglement-enabled target-detection enhancement, despite operating in an entanglement-breaking environment. Existing experimental studies of QI have utilized a Bayesian approach, assuming that the target is equally likely to be present or absent before detection, to demonstrate an advantage over classical target detection. However, such a premise breaks down in practical operational scenarios in which the prior probability is unknown, thereby hindering QI's applicability to real-world target-detection scenarios. In this work, we adopt the Neyman-Pearson criterion in lieu of the error probability for equally likely target absence or presence as our figure of merit for QI. We demonstrate an unconditional quantum advantage over the optimal classical-illumination protocol as benchmarked by the receiver operating characteristic, which examines detection probability versus false-alarm probability without resorting to known prior probabilities. Our work represents a critical advancement in adapting quantum-enhanced sensing to practical operational settings.

Ward, William↗

Optimizing branch re-wiring in a software instruction cache

A method includes a computer device receiving a branch instruction; the computer device managing two tables, where a first table relates to application blocks and a second table relates to available address slots; and the computer device calculating a target of the branch instruction using a branch-to-link register, the computer device optimizes re-wiring in a cache using the calculation and the managed two tables.

97 MATHEMATICS AND COMPUTING↗

Real time feedback-based optimization of distributed energy resources

An example device includes a processor configured to receive a plurality of voltage values corresponding to voltage nodes in a first portion of a power system and determine, for each voltage node, a respective value of first and second voltage-constraint coefficients. The processor is also configured to receive a power value corresponding to a connection point of the first portion of the power system with a second portion of the power system and determine for the connection point, a respective value of first and second power-constraint coefficients. The processor is also configured to cause at least one energy resource connected to the first portion of the power system to modify an output power of the at least one energy resource based on the value of the first and second voltage-constraint coefficients for each voltage node and the value of the first and second power-constraint coefficients.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Real time feedback-based optimization of distributed energy resources

An example device includes a processor configured to receive a plurality of voltage values representing respective voltage magnitudes at voltage nodes in a first portion of a power system and determine, for each voltage node, a respective value of first and second voltage-constraint coefficients. The processor is also configured to receive a power value corresponding to a connection point of the first portion of the power system with a second portion of the power system and determine for the connection point, a respective value of first and second power-constraint coefficients. The processor is also configured to cause at least one energy resource connected to the first portion of the power system to modify an output power of the at least one energy resource based on the value of the first and second voltage-constraint coefficients for each voltage node and the value of the first and second power-constraint coefficients.

Dall'Anese, Emiliano↗

Real time feedback-based optimization of distributed energy resources

An example device includes a processor configured to receive a plurality of voltage values representing respective voltage magnitudes at voltage nodes in a first portion of a power system and determine, for each voltage node, a respective value of first and second voltage-constraint coefficients. The processor is also configured to receive a power value corresponding to a connection point of the first portion of the power system with a second portion of the power system and determine for the connection point, a respective value of first and second power-constraint coefficients. The processor is also configured to cause at least one energy resource connected to the first portion of the power system to modify an output power of the at least one energy resource based on the value of the first and second voltage-constraint coefficients for each voltage node and the value of the first and second power-constraint coefficients.

Dall'Anese, Emiliano↗

Soft-Decision Decoding of Binary Linear Block Codes Based on an Iterative Search Algorithm

This correspondence presents a suboptimum soft-decision decoding scheme for binary linear block codes based on an iterative search algorithm. The scheme uses an algebraic decoder to iteratively generate a sequence of candidate codewords one at a time using a set of test error patterns that are constructed based on the reliability information of the received symbols. When a candidate codeword is generated, it is tested based on an optimality condition. If it satisfies the optimality condition, then it is the most likely (ML) codeword and the decoding stops. If it fails the optimality test, a search for the ML codeword is conducted in a region which contains the ML codeword. The search region is determined by the current candidate codeword and the reliability of the received symbols. The search is conducted through a purged trellis diagram for the given code using the Viterbi algorithm. If the search fails to find the ML codeword, a new candidate is generated using a new test error pattern, and the optimality test and search are renewed. The process of testing and search continues until either the MEL codeword is found or all the test error patterns are exhausted and the decoding process is terminated. Numerical results show that the proposed decoding scheme achieves either practically optimal performance or a performance only a fraction of a decibel away from the optimal maximum-likelihood decoding with a significant reduction in decoding complexity compared with the Viterbi decoding based on the full trellis diagram of the codes.

Lin, Shu↗

PSC algorithm description

An overview of the performance seeking control (PSC) algorithm and details of the important components of the algorithm are given. The onboard propulsion system models, the linear programming optimization, and engine control interface are described. The PSC algorithm receives input from various computers on the aircraft including the digital flight computer, digital engine control, and electronic inlet control. The PSC algorithm contains compact models of the propulsion system including the inlet, engine, and nozzle. The models compute propulsion system parameters, such as inlet drag and fan stall margin, which are not directly measurable in flight. The compact models also compute sensitivities of the propulsion system parameters to change in control variables. The engine model consists of a linear steady state variable model (SSVM) and a nonlinear model. The SSVM is updated with efficiency factors calculated in the engine model update logic, or Kalman filter. The efficiency factors are used to adjust the SSVM to match the actual engine. The propulsion system models are mathematically integrated to form an overall propulsion system model. The propulsion system model is then optimized using a linear programming optimization scheme. The goal of the optimization is determined from the selected PSC mode of operation. The resulting trims are used to compute a new operating point about which the optimization process is repeated. This process is continued until an overall (global) optimum is reached before applying the trims to the controllers.

Nobbs, Steven G.↗