Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “minimum decoding”

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.

89 records · Page 5

Rate-compatible protograph LDPC code families with linear minimum distance

Digital communication coding methods are shown, which generate certain types of low-density parity-check (LDPC) codes built from protographs. A first method creates protographs having the linear minimum distance property and comprising at least one variable node with degree less than 3. A second method creates families of protographs of different rates, all having the linear minimum distance property, and structurally identical for all rates except for a rate-dependent designation of certain variable nodes as transmitted or non-transmitted. A third method creates families of protographs of different rates, all having the linear minimum distance property, and structurally identical for all rates except for a rate-dependent designation of the status of certain variable nodes as non-transmitted or set to zero. LDPC codes built from the protographs created by these methods can simultaneously have low error floors and low iterative decoding thresholds, and families of such codes of different rates can be decoded efficiently using a common decoding architecture.

Divsalar, Dariush↗

An Assessment of Receiver Algorithms for Distributed Massive MIMO Systems: Investigating Design Solutions and Performance

This study investigates receiver design solutions for distributed Massive Multiple Input Multiple Output (D-m MIMO) systems, taking into account parameters such as number of access points as well as concerns related to channel estimates that use single-carrier frequency-domain equalization (SC-FDE). A significant contribution of this research is the integration of Low-Density Parity-Check (LDPC) codes to simplify coding complexity and enhance communication efficiency. The research examines different receiver designs, such as spatial antenna correlation and sophisticated channel estimation methods. The authors propose integrating LDPC codes into the receiver architecture to simplify computations and enhance error correction and decoding. Moreover, the paper examines performance evaluation measures and approaches, highlighting the trade-offs among complexity, spectral efficiency, and error performance. The comparative analysis indicates the benefits, in terms of performance, of incorporating LDPC codes and improving system throughput and dependability. We examine four distinct receiver algorithms: zero-forcing (ZF), minimum mean square error (MMSE), maximum ratio combining (MRC), and equal gain combining (EGC). The study shows that MRC and EGC receivers work well in D-m MIMO because they make the receiver system less computationally demanding.

Gashtasbi, Ali↗

A multilevel approach to the design of dc-free line codes

A multilevel approach to the design of dc-free line codes is presented. The different levels can be used for different purposes; for example, to control the maximum accumulated charge or to guarantee a certain minimum distance. The advantages of codes designed by this method over similar codes are the improved run-length/accumulated-charge parameters, higher transmission rate, and the systematic nature of the code construction. The multilevel structure allows the redundancy in the signal selection procedure to be allocated efficiently among the different levels. It also allows the use of suboptimal staged decoding procedures that have performance/complexity advantages over maximum-likelihood decoding.

Calderbank, A. R.↗

Multi-level bandwidth efficient block modulation codes

The multilevel technique is investigated for combining block coding and modulation. There are four parts. In the first part, a formulation is presented for signal sets on which modulation codes are to be constructed. Distance measures on a signal set are defined and their properties are developed. In the second part, a general formulation is presented for multilevel modulation codes in terms of component codes with appropriate Euclidean distances. The distance properties, Euclidean weight distribution and linear structure of multilevel modulation codes are investigated. In the third part, several specific methods for constructing multilevel block modulation codes with interdependency among component codes are proposed. Given a multilevel block modulation code C with no interdependency among the binary component codes, the proposed methods give a multilevel block modulation code C which has the same rate as C, a minimum squared Euclidean distance not less than that of code C, a trellis diagram with the same number of states as that of C and a smaller number of nearest neighbor codewords than that of C. In the last part, error performance of block modulation codes is analyzed for an AWGN channel based on soft-decision maximum likelihood decoding. Error probabilities of some specific codes are evaluated based on their Euclidean weight distributions and simulation results.

Lin, Shu↗

On multilevel block modulation codes

The multilevel (ML) technique for combining block coding and modulation is investigated. A general formulation is presented for ML modulation codes in terms of component codes with appropriate distance measures. A specific method for constructing ML block modulation codes (MLBMCs) with interdependency among component codes is proposed. Given an MLBMC C with no interdependency among the binary component codes, the proposed method gives an MLBC C-prime that has the same rate as C, a minimum squared Euclidean distance not less than that of C, a trellis diagram with the same number of states as that of C, and a smaller number of nearest-neighbor codewords than that of C. Finally, a technique is presented for analyzing the error performance of MLBMCs for an additive white Gaussian noise channel based on soft-decision maximum-likelihood decoding.

Kasami, Tadao↗

An encoder–decoder LSTM-based EMPC framework applied to a building HVAC system

Numerous studies have demonstrated the benefit of economic model predictive control (EMPC) applied to building heating, ventilation, and air conditioning (HVAC) systems. However, the construction and training of predictive models for building HVAC systems are widely recognized as a key technological barrier preventing large-scale adoption of EMPC for buildings. In this work, an encoder–decoder long short-term memory-based EMPC framework is developed. The key advantage of the approach is that a model may be automatically generated from a list of inputs and outputs. From the definition of inputs and outputs, the constructed model may be trained and automatically embedded into the EMPC framework for real-time estimation and control. The overall end-to-end EMPC framework from model training to on-line estimation and control are described. To this end, the encoder–decoder model provides a natural framework for state estimation (encoder), which is required to provide an initial condition for the predictive model of EMPC (decoder). Closed-loop simulations using EnergyPlus are performed to demonstrate the approach. The simulated closed-loop system consists of a building zone from a multi-zone building, which is served by an air handling unit-variable air volume HVAC system. For the HVAC example considered, the trained encoder–decoder model can predict the indoor air temperature and HVAC sensible cooling rate of a building zone over a two-day horizon with high accuracy. Overall, we find that considering a time-of-use electric rate structure, the EMPC, which manipulates the zone temperature setpoint, can reduce the HVAC power consumption cost relative to keeping the zone temperature setpoint at its maximum value (i.e., minimum energy approach).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Cyclic unequal error protection codes constructed from cyclic codes of composite length

The distance structure of cyclic codes of composite length was investigated. A lower bound on the minimum distance for this class of codes is derived. In many cases, the lower bound gives the true minimum distance of a code. Then the distance structure of the direct sum of two cyclic codes of composite length were investigated. It was shown that, under certain conditions, the direct-sum code provides two levels of error correcting capability, and hence is a two-level unequal error protection (UEP) code. Finally, a class of two-level UEP cyclic direct-sum codes and a decoding algorithm for a subclass of these codes are presented.

Lin, Shu↗

On the design of turbo codes

In this article, we design new turbo codes that can achieve near-Shannon-limit performance. The design criterion for random interleavers is based on maximizing the effective free distance of the turbo code, i.e., the minimum output weight of codewords due to weight-2 input sequences. An upper bound on the effective free distance of a turbo code is derived. This upper bound can be achieved if the feedback connection of convolutional codes uses primitive polynomials. We review multiple turbo codes (parallel concatenation of q convolutional codes), which increase the so-called 'interleaving gain' as q and the interleaver size increase, and a suitable decoder structure derived from an approximation to the maximum a posteriori probability decision rule. We develop new rate 1/3, 2/3, 3/4, and 4/5 constituent codes to be used in the turbo encoder structure. These codes, for from 2 to 32 states, are designed by using primitive polynomials. The resulting turbo codes have rates b/n (b = 1, 2, 3, 4 and n = 2, 3, 4, 5, 6), and include random interleavers for better asymptotic performance. These codes are suitable for deep-space communications with low throughput and for near-Earth communications where high throughput is desirable. The performance of these codes is within 1 dB of the Shannon limit at a bit-error rate of 10(exp -6) for throughputs from 1/15 up to 4 bits/s/Hz.

Divsalar, D.↗

Robustly optimal rate one-half binary convolutional codes

Three optimality criteria for convolutional codes are considered in this correspondence: namely, free distance, minimum distance, and distance profile. Here we report the results of computer searches for rate one-half binary convolutional codes that are 'robustly optimal' in the sense of being optimal for one criterion and optimal or near-optimal for the other two criteria. Comparisons with previously known codes are made. The results of a computer simulation are reported to show the importance of the distance profile to computational performance with sequential decoding.

Johannesson, R.↗

A bandwidth compressive modulation system using multi-amplitude minimum shift keying /MAMSK/

A bandwidth compressive modem making use of multi-amplitude minimum shift keying (MAMSK) has been designed and implemented in a laboratory environment at microwave frequencies. This system achieves a substantial bandwidth reduction over binary PSK and operates within 0.5 dB of theoretical performance. A number of easily implemented microwave transmitters have been designed to generate the required set of 16 signals. The receiver has been designed to work at 1 Mbit/s and contains the necessary phase tracking, AGC, and symbol synchronization loops as well as a lock detector, SNR estimator and provisions for differential decoding. This paper describes this entire system and presents the experimental results.

Weber, W. J., III↗

DASEventNet: AI‐Based Microseismic Detection on Distributed Acoustic Sensing Data From the Utah FORGE Well 16A (78)‐32 Hydraulic Stimulation

Abstract Distributed acoustic sensing (DAS) has emerged as a promising seismic technology for monitoring microearthquakes (MEQs) with high spatial resolution. Efficient algorithms are needed for processing large DAS data volumes. This study introduces a deep learning (DL) model based on a Residual Convolutional Neural Network (ResNet) for detecting MEQs using DAS data, named as DASEventNet. The test data were collected from the Utah FORGE 16A (78)‐32 hydraulic stimulation experiments conducted in April 2022. The DASEventNet model achieves a remarkable accuracy of 100% when discriminating MEQs from noise in the raw test set of 260 examples. Surprisingly, the model identified weak MEQ signatures that have been manually categorized as noise. The decision‐making process with the model is decoded by the classic activation map, which illuminates learning features of the DASEventNet model. These features provide clear illustrations of weak MEQs and varied noise types. Finally, we apply the trained model to the entire period (∼7 days) of continuous DAS recordings and find that it discovers >5,700 new MEQs, previously unregistered in the public Silixa DAS catalog. The DASEventNet model significantly outperforms the traditional seismic method Short‐Term Average/Long‐Term Average (STA/LTA), which detected only 1,307 MEQs. The DASEventNet detection threshold is M w −1.80 compared to the minimum magnitude of M w −1.14 detected by STA/LTA. The spatiotemporal distribution of the newly identified MEQs defines an extensive stimulation zone and more accurately characterizes fracture geometry. Our results highlight the potential of DL for long‐term, real‐time microseismic monitoring that can improve enhanced geothermal systems and other activities that include subsurface hydraulic fracturing.

15 GEOTHERMAL ENERGY↗

Low-Power SOI CMOS Transceiver

The work aims at developing a low-power Silicon on Insulator Complementary Metal Oxide Semiconductor (SOI CMOS) Transceiver for deep-space communications. RF Receiver must accomplish the following tasks: (a) Select the desired radio channel and reject other radio signals, (b) Amplify the desired radio signal and translate them back to baseband, and (c) Detect and decode the information with Low BER. In order to minimize cost and achieve high level of integration, receiver architecture should use least number of external filters and passive components. It should also consume least amount of power to minimize battery cost, size, and weight. One of the most stringent requirements for deep-space communication is the low-power operation. Our study identified that two candidate architectures listed in the following meet these requirements: (1) Low-IF receiver, (2) Sub-sampling receiver. The low-IF receiver uses minimum number of external components. Compared to Zero-IF (Direct conversion) architecture, it has less severe offset and flicker noise problems. The Sub-sampling receiver amplifies the RF signal and samples it using track-and-hold Subsampling mixer. These architectures provide low-power solution for the short- range communications missions on Mars. Accomplishments to date include: (1) System-level design and simulation of a Double-Differential PSK receiver, (2) Implementation of Honeywell SOI CMOS process design kit (PDK) in Cadence design tools, (3) Design of test circuits to investigate relationships between layout techniques, geometry, and low-frequency noise in SOI CMOS, (4) Model development and verification of on-chip spiral inductors in SOI CMOS process, (5) Design/implementation of low-power low-noise amplifier (LNA) and mixer for low-IF receiver, and (6) Design/implementation of high-gain LNA for sub-sampling receiver. Our initial results show that substantial improvement in power consumption is achieved using SOI CMOS as compared to standard CMOS process. Potential advantages of SOI CMOS for deep-space communication electronics include: (1) Radiation hardness, (2) Low-power operation, and (3) System-on-Chip (SOC) solutions.

Fujikawa, Gene↗

Rate-compatible protograph LDPC code families with linear minimum distance

Digital communication coding methods are shown, which generate certain types of low-density parity-check (LDPC) codes built from protographs. A first method creates protographs having the linear minimum distance property and comprising at least one variable node with degree less than 3. A second method creates families of protographs of different rates, all structurally identical for all rates except for a rate-dependent designation of certain variable nodes as transmitted or non-transmitted. A third method creates families of protographs of different rates, all structurally identical for all rates except for a rate-dependent designation of the status of certain variable nodes as non-transmitted or set to zero. LDPC codes built from the protographs created by these methods can simultaneously have low error floors and low iterative decoding thresholds.

Divsalar, Dariush↗

Weight distributions for turbo codes using random and nonrandom permutations

This article takes a preliminary look at the weight distributions achievable for turbo codes using random, nonrandom, and semirandom permutations. Due to the recursiveness of the encoders, it is important to distinguish between self-terminating and non-self-terminating input sequences. The non-self-terminating sequences have little effect on decoder performance, because they accumulate high encoded weight until they are artificially terminated at the end of the block. From probabilistic arguments based on selecting the permutations randomly, it is concluded that the self-terminating weight-2 data sequences are the most important consideration in the design of constituent codes; higher-weight self-terminating sequences have successively decreasing importance. Also, increasing the number of codes and, correspondingly, the number of permutations makes it more and more likely that the bad input sequences will be broken up by one or more of the permuters. It is possible to design nonrandom permutations that ensure that the minimum distance due to weight-2 input sequences grows roughly as the square root of (2N), where N is the block length. However, these nonrandom permutations amplify the bad effects of higher-weight inputs, and as a result they are inferior in performance to randomly selected permutations. But there are 'semirandom' permutations that perform nearly as well as the designed nonrandom permutations with respect to weight-2 input sequences and are not as susceptible to being foiled by higher-weight inputs.

Dolinar, S.↗

Low-Cost Telemetry System for Small/Micro Satellites

A Software Defined Radio (SDR) concept uses a minimum amount of analog/radio frequency components to up/downconvert the RF signal to/from a digital format. Once in the digital domain, all other processing (filtering, modulation, demodulation, etc.) is done in software. The project will leverage existing designs and enhance capabilities in the commercial sector to provide a path to a radiation-hardened SDR transponder. The SDR transponder would incorporate baseline technologies dealing with improved Forward Error Correcting (FEC) codes to be deployed to all Near Earth Network (NEN) ground stations. By incorporating this FEC, at least a tenfold increase in data throughput can be achieved. A family of transponder products can be implemented using common platform architecture, allowing new products to be more quickly introduced into the market. Software can be reused across products, reducing software/hardware costs dramatically. New features and capabilities, such as encoding and decoding algorithms, filters, and bit synchronizers, can be added to the existing infrastructure without requiring major new capital expenditures, allowing implementation of advanced features in the communication systems. As new telecommunication technologies emerge, incorporating them into the SDR fabric will be easily accomplished with little or no requirements for new hardware. There are no preferred flight platforms for the SDR technology, so it can be used on any type of orbital or sub-orbital platform, all within a fully radiation hardened design.

Sims, William↗

On complexity of trellis structure of linear block codes

The trellis structure of linear block codes (LBCs) is discussed. The state and branch complexities of a trellis diagram (TD) for a LBC is investigated. The TD with the minimum number of states is said to be minimal. The branch complexity of a minimal TD for a LBC is expressed in terms of the dimensions of specific subcodes of the given code. Then upper and lower bounds are derived on the number of states of a minimal TD for a LBC, and it is shown that a cyclic (or shortened cyclic) code is the worst in terms of the state complexity among the LBCs of the same length and dimension. Furthermore, it is shown that the structural complexity of a minimal TD for a LBC depends on the order of its bit positions. This fact suggests that an appropriate permutation of the bit positions of a code may result in an equivalent code with a much simpler minimal TD. Boolean polynomial representation of codewords of a LBC is also considered. This representation helps in study of the trellis structure of the code. Boolean polynomial representation of a code is applied to construct its minimal TD. Particularly, the construction of minimal trellises for Reed-Muller codes and the extended and permuted binary primitive BCH codes which contain Reed-Muller as subcodes is emphasized. Finally, the structural complexity of minimal trellises for the extended and permuted, and double-error-correcting BCH codes is analyzed and presented. It is shown that these codes have relatively simple trellis structure and hence can be decoded with the Viterbi decoding algorithm.

Lin, Shu↗

Airborne Antenna System for Minimum-Cycle-Slip GPS Reception

A system that includes a Global Positioning System (GPS) antenna and associated apparatus for keeping the antenna aimed upward has been developed for use aboard a remote-sensing-survey airplane. The purpose served by the system is to enable minimum- cycle-slip reception of GPS signals used in precise computation of the trajectory of the airplane, without having to restrict the airplane to maneuvers that increase the flight time needed to perform a survey. Cycle slip signifies loss of continuous track of the phase of a signal. Minimum-cycle-slip reception is desirable because maintaining constant track of the phase of the carrier signal from each available GPS satellite is necessary for surveying to centimeter or subcentimeter precision. Even a loss of signal for as short a time as a nanosecond can cause cycle slip. Cycle slips degrade the quality and precision of survey data acquired during a flight. The two principal causes of cycle slip are weakness of signals and multipath propagation. Heretofore, it has been standard practice to mount a GPS antenna rigidly on top of an airplane, and the radiation pattern of the antenna is typically hemispherical, so that all GPS satellites above the horizon are viewed by the antenna during level flight. When the airplane must be banked for a turn or other maneuver, the reception hemisphere becomes correspondingly tilted; hence, the antenna no longer views satellites that may still be above the Earth horizon but are now below the equatorial plane of the tilted reception hemisphere. Moreover, part of the reception hemisphere (typically, on the inside of a turn) becomes pointed toward ground, with a consequent increase in received noise and, therefore, degradation of GPS measurements. To minimize the likelihood of loss of signal and cycle slip, bank angles of remote-sensing survey airplanes have generally been limited to 10 or less, resulting in skidding or slipping uncoordinated turns. An airplane must be banked in order to make a coordinated turn. For small-radius, short-time coordinated turns, it is necessary to employ banks as steep as 45 , and turns involving such banks are times and for confining airplanes as closely as possible to areas to be surveyed. The idea underlying the design is that if the antenna can be kept properly aimed, then the incidence of cycle slips caused by loss or weakness of signals can be minimized. The system includes an articulating GPS antenna and associated electronic circuitry mounted under a radome atop an airplane. The electronic circuitry includes a microprocessor-based interface-circuit-and-data-translation module. The system receives data on the current attitude of the airplane from the inertial navigation system of the airplane. The microprocessor decodes the attitude data and uses them to compute commands for the GPS-antenna-articulating mechanism to tilt the antenna, relative to the airplane, in opposition to the roll or bank of the airplane to keep the antenna pointed toward the zenith. The system was tested aboard the hurricane- hunting airplane of the National Oceanic and Atmospheric Administration (NOAA) [see figure] during an 11-hour flight to observe the landfall of Hurricane Bret in late summer of 1999. No bank-angle restrictions were imposed during the flight. Post-flight analysis of the GPS trajectory data revealed that no cycle slip had occurred.considered normal maneuvers. These steep banks are highly desirable for minimizing flight

Wright, C. Wayne↗