Uniform codes.
Existence of q-ary uniform convolutional codes where q is any prime-power, noting error- correcting ability comparable to familiar maximal- length block codes
ENCODING↗
SEARCH · Search NASA
Results for “block errors”
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.
Analysis of transmission error effects on the transfer of real-time simulation data
An analysis was made to determine the effect of transmission errors on the quality of data transferred from the Terminal Area Air Traffic Model to a remote site. Data formating schemes feasible within the operational constraints of the data link were proposed and their susceptibility to both random bit error and to noise burst were investigated. It was shown that satisfactory reliability is achieved by a scheme formating the simulation output into three data blocks which has the priority data triply redundant in the first block in addition to having a retransmission priority on that first block when it is received in error.
Credeur, L.↗
A spectral filter for ESMR's sidelobe errors
Fourier analysis was used to remove periodic errors from a series of NIMBUS-5 electronically scanned microwave radiometer brightness temperatures. The observations were all taken from the midnight orbits over fixed sites in the Australian grasslands. The angular dependence of the data indicates calibration errors consisted of broad sidelobes and some miscalibration as a function of beam position. Even though an angular recalibration curve cannot be derived from the available data, the systematic errors can be removed with a spectral filter. The 7 day cycle in the drift of the orbit of NIMBUS-5, coupled to the look-angle biases, produces an error pattern with peaks in its power spectrum at the weekly harmonics. About plus or minus 4 K of error is removed by simply blocking the variations near two- and three-cycles-per-week.
Chesters, D.↗
Comparison of Five System Identification Algorithms for Rotorcraft Higher Harmonic Control
This report presents an analysis and performance comparison of five system identification algorithms. The methods are presented in the context of identifying a frequency-domain transfer matrix for the higher harmonic control (HHC) of helicopter vibration. The five system identification algorithms include three previously proposed methods: (1) the weighted-least- squares-error approach (in moving-block format), (2) the Kalman filter method, and (3) the least-mean-squares (LMS) filter method. In addition there are two new ones: (4) a generalized Kalman filter method and (5) a generalized LMS filter method. The generalized Kalman filter method and the generalized LMS filter method were derived as extensions of the classic methods to permit identification by using more than one measurement per identification cycle. Simulation results are presented for conditions ranging from the ideal case of a stationary transfer matrix and no measurement noise to the more complex cases involving both measurement noise and transfer-matrix variation. Both open-loop identification and closed- loop identification were simulated. Closed-loop mode identification was more challenging than open-loop identification because of the decreasing signal-to-noise ratio as the vibration became reduced. The closed-loop simulation considered both local-model identification, with measured vibration feedback and global-model identification with feedback of the identified uncontrolled vibration. The algorithms were evaluated in terms of their accuracy, stability, convergence properties, computation speeds, and relative ease of implementation.
Jacklin, Stephen A.↗
Numerical Generation of Asymmetric Flows about Slender Bodies of Revolution at Extreme Incidence
It is well known that slender bodies of revolution will develop an asymmetric, unsteady flow pattern in experimental tests, if the angle of incidence to the oncoming stream is above a critical value. It has been suggested that the origin of these asymmetric flows may stem from geometric imperfections of the model being tested, or from disturbances in the oncoming stream. In numerical simulations, it is possible to generate bodies of revolution which are perfectly symmetric about their longitudinal axis, and to impose uniform flow conditions which are free from disturbances. The current work presents numerical simulations of the flow about an ogive-cylinder configuration at 40 and 60 degree angle of incidence. These simulations. were performed using numerical algorithms which are also symmetric about the lateral plane of the cylinder body. The flowfields at 40 degree angle of attack were seen to remain symmetric to the round-off accuracy of the computer. At 60 degree angle of attack, a lateral force coefficient developed of O(1) which progressed to an alternate vortex shedding in time. The nature of this lateral force generation and vortex shedding was dependent on the choice of numerical algorithm. The origin of the asymmetries observed in the 60 degree angle of attack computations were traced to round-off errors in the implicit block-matrix inverter. A means of inverting the implicit operator matrices, which maintains the symmetry of the overall numerical algorithm was implemented.
Murman, Scott M.↗
Linear Parameter Varying Control for Actuator Failure
A robust linear parameter varying (LPV) control synthesis is carried out for an HiMAT vehicle subject to loss of control effectiveness. The scheduling parameter is selected to be a function of the estimates of the control effectiveness factors. The estimates are provided on-line by a two-stage Kalman estimator. The inherent conservatism of the LPV design is reducing through the use of a scaling factor on the uncertainty block that represents the estimation errors of the effectiveness factors. Simulations of the controlled system with the on-line estimator show that a superior fault-tolerance can be achieved.
Shin, Jong-Yeob↗
Upper bounds to error probabilities of coded systems beyond the cutoff rate
A family of upper bounds to error probabilities of coded systems was recently proposed by Divsalar. These bounds are valid for transmission over the additive white Gaussian noise channel, and require only the knowledge of the weight spectrum of the code words. After illustrating these bounds, we extend them to fading channels. Contrary to the union bound, our bounds maintain their effectiveness below the signal-to-noise ratio (SNR)at which the cutoff rate of the channel equals the rate of the code. Some applications are shown. First, we derive upper bounds to the minimum SNR necessary to achieve zero error probability as the code block length increases to infinity. Next, we use our bounds to predict the performance of turbo codes and low-density parity-check codes.
Biglieri, Ezio↗
On the decoder error probability of linear codes
By using coding and combinatorial techniques, an approximate formula for the weight distribution of decodable words of most linear block codes is evaluated. This formula is then used to give an approximate expression for the decoder error probability P(sub E)(u) of linear block codes, given that an error pattern of weight u has occurred. It is shown that P(sub E)(u) approaches the constant Q as u gets large, where Q is the probability that a completely random error pattern will cause decoder error.
Cheung, K.-M.↗
Protograph based LDPC codes with minimum distance linearly growing with block size
We propose several LDPC code constructions that simultaneously achieve good threshold and error floor performance. Minimum distance is shown to grow linearly with block size (similar to regular codes of variable degree at least 3) by considering ensemble average weight enumerators. Our constructions are based on projected graph, or protograph, structures that support high-speed decoder implementations. As with irregular ensembles, our constructions are sensitive to the proportion of degree-2 variable nodes. A code with too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code with too many such nodes tends to not exhibit a minimum distance that grows linearly in block length. In this paper we also show that precoding can be used to lower the threshold of regular LDPC codes. The decoding thresholds of the proposed codes, which have linearly increasing minimum distance in block size, outperform that of regular LDPC codes. Furthermore, a family of low to high rate codes, with thresholds that adhere closely to their respective channel capacity thresholds, is presented. Simulation results for a few example codes show that the proposed codes have low error floors as well as good threshold SNFt performance.
minimum decoding↗
The Control Network of Mars: October 1984
Strips of Viking mapping pictures are being added to the planetwide control networks of Mars. These high resolution strips run from the Viking 1 lander site east to Airy-O, north along the 0 deg meridian to 60 deg latitude, southwest through the Viking 1 lander site to the equator, and along the equator encircling the planet. Everywhere along these strips, old points are incorporated in the measurements, thus assuring that the strips and planetwide net make a single large data set. The control points are much denser in the areas covered by the strips than in those regions not covered by strips and their coordinates of the control points is estimated to be less than 3 km and the error in longitude of a few points near Airy-O is less than 40 m. The horizontal coordinates of the control points on Mars have been updated with a single-block planetwide analytical triangulation. The standard error of measurement was 18.06 micron m. The longitude of the Viking 1 lander site was 47 deg.962 and the latitude 22 deg. 480. The latitude of Airy-O was -5 deg. 152.
Davies, M. E.↗
Accuracy Analysis on Large Blocks of High Resolution Images
Although high altitude frequencies effects are removed at the time of basic image generation, low altitude (Yaw) effects are still present in form of affinity/angular affinity. They are effectively removed by additional parameters. Bundle block adjustment based on properly weighted ephemeris/altitude quaternions (BBABEQ) are not enough to remove the systematic effect. Moreover, due to the narrow FOV of the HRSI, position and altitude are highly correlated making it almost impossible to separate and remove their systematic effects without extending the geometric model (Self-Calib.) The systematic effects gets evident on the increase of accuracy (in terms of RMSE at GCPs) for looser and relaxed ground control at the expense of large and strong block deformation with large residuals at check points. Systematic errors are most freely distributed and their effects propagated all over the block.
Passini, Richardo M.↗
Analysis of space telescope data collection system
An analysis of the expected performance for the Multiple Access (MA) system is provided. The analysis covers the expected bit error rate performance, the effects of synchronization loss, the problem of self-interference, and the problem of phase ambiguity. The problem of false acceptance of a command word due to data inversion is discussed. A mathematical determination of the probability of accepting an erroneous command word due to a data inversion is presented. The problem is examined for three cases: (1) a data inversion only, (2) a data inversion and a random error within the same command word, and a block (up to 256 48-bit words) containing both a data inversion and a random error.
Ingels, F. M.↗
Precision trimmer aids in preparing biomedical specimen blocks for ultrathin sectioning
Precision trimmer, which neatly trims biomedical specimen blocks for ultrathin sectioning, eliminates the risk of human error. Four inches in diameter and 3 inches in height, it supports the block and serves as a support for a cutting tool and can be adjusted in three dimensions.
Tahmisian, T. N.↗
High accuracy switched-current circuits using an improved dynamic mirror
The switched-current technique, a recently developed circuit approach to analog signal processing, has emerged as an alternative/compliment to the well established switched-capacitor circuit technique. High speed switched-current circuits offer potential cost and power savings over slower switched-capacitor circuits. Accuracy improvements are a primary concern at this stage in the development of the switched-current technique. Use of the dynamic current mirror has produced circuits that are insensitive to transistor matching errors. The dynamic current mirror has been limited by other sources of error including clock-feedthrough and voltage transient errors. In this paper we present an improved switched-current building block using the dynamic current mirror. Utilizing current feedback the errors due to current imbalance in the dynamic current mirror are reduced. Simulations indicate that this feedback can reduce total harmonic distortion by as much as 9 dB. Additionally, we have developed a clock-feedthrough reduction scheme for which simulations reveal a potential 10 dB total harmonic distortion improvement. The clock-feedthrough reduction scheme also significantly reduces offset errors and allows for cancellation with a constant current source. Experimental results confirm the simulated improvements.
Zweigle, G.↗
Retransmission error control with memory
In this paper, an error control technique that is a basic improvement over automatic-repeat-request ARQ is presented. Erroneously received blocks in an ARQ system are used for error control. The technique is termed ARQ-with-memory (MRQ). The general MRQ system is described, and simple upper and lower bounds are derived on the throughput achievable by MRQ. The performance of MRQ with respect to throughput, message delay and probability of error is compared to that of ARQ by simulating both systems using error data from a VHF satellite channel being operated in the ALOHA packet broadcasting mode.
Sindhu, P. S.↗
Direct modulation at L-band using a quadrature modulator with feedback
This paper describes how a high quality modulated signal can be generated directly at the frequency of transmission, using a standard quadrature modulator and other commercially-available, low-cost building blocks. The method uses a feedback technique for automatic correction of carrier leakage, differential gain and phase mismatch errors in the quadrature modulator, and other building blocks, by providing guidance to the digital baseband portion of the modulator. Experimental results are presented for direct modulation at 1.65 GHz.
Datta, Ravi↗
Documentation of photogrammetric mission simulator program. Volume 3: Multi-mission block adjustment module
Electronic module used to compute error statistics for simulations of photogrammetric schemes involving more than one lunar mission
Source record↗
LDPC Codes with Minimum Distance Proportional to Block Size
Low-density parity-check (LDPC) codes characterized by minimum Hamming distances proportional to block sizes have been demonstrated. Like the codes mentioned in the immediately preceding article, the present codes are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. The previously mentioned codes have low decoding thresholds and reasonably low error floors. However, the minimum Hamming distances of those codes do not grow linearly with code-block sizes. Codes that have this minimum-distance property exhibit very low error floors. Examples of such codes include regular LDPC codes with variable degrees of at least 3. Unfortunately, the decoding thresholds of regular LDPC codes are high. Hence, there is a need for LDPC codes characterized by both low decoding thresholds and, in order to obtain acceptably low error floors, minimum Hamming distances that are proportional to code-block sizes. The present codes were developed to satisfy this need. The minimum Hamming distances of the present codes have been shown, through consideration of ensemble-average weight enumerators, to be proportional to code block sizes. As in the cases of irregular ensembles, the properties of these codes are sensitive to the proportion of degree-2 variable nodes. A code having too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code having too many such nodes tends not to exhibit a minimum distance that is proportional to block size. Results of computational simulations have shown that the decoding thresholds of codes of the present type are lower than those of regular LDPC codes. Included in the simulations were a few examples from a family of codes characterized by rates ranging from low to high and by thresholds that adhere closely to their respective channel capacity thresholds; the simulation results from these examples showed that the codes in question have low error floors as well as low decoding thresholds. As an example, the illustration shows the protograph (which represents the blueprint for overall construction) of one proposed code family for code rates greater than or equal to 1.2. Any size LDPC code can be obtained by copying the protograph structure N times, then permuting the edges. The illustration also provides Field Programmable Gate Array (FPGA) hardware performance simulations for this code family. In addition, the illustration provides minimum signal-to-noise ratios (Eb/No) in decibels (decoding thresholds) to achieve zero error rates as the code block size goes to infinity for various code rates. In comparison with the codes mentioned in the preceding article, these codes have slightly higher decoding thresholds.
Divsalar, Dariush↗