An efficient pcm error correction and synchronization code
Frame synchronization and error correction by pulse-code modulated systems
SYNCHRONIZATION↗
SEARCH · Engineering Papers
Results for “L CODES”
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.
Evaluation of the COHORT 2 Monte Carlo shielding code - Gamma ray transport using source direction biasing
Gamma ray transport portion of COHORT 2 Monte Carlo shielding code
Bloomfield, H. S.↗
On the structure of rate 1/n convolutional codes.
It is shown what choice there is in assigning output digits to transitions of binary rate 1/n code trellis so that the latter will correspond to a convolutional code. A new upper bound on free distance of rate 1/n convolutional codes is also derived, and the results obtained are used to determine the length of the largest input sequence that can conceivably result in an output whose weight is equal to the free distance of a code of rate 1/2.
Bahl, L.↗
Convolutional coding techniques for data protection
Results of research on the use of convolutional codes in data communications are presented. Convolutional coding fundamentals are discussed along with modulation and coding interaction. Concatenated coding systems and data compression with convolutional codes are described.
Massey, J. L.↗
Research on MLS airborne antenna
Numerical solutions for the radiation patterns of antennas mounted on aircraft are developed. The airborne antenna problems associated with the Microwave Landing System (MLS) are emphasized. Based on the requirements of the MLS, volumetric pattern solutions are essential. Previous attempts at solving for the volumetric patterns were found to be far too complex and very inefficient. However as a result of previous efforts, it is possible to combine the elevation and roll plane pattern solutions to give the complete volumetric pattern. This combination is described as well as the aircraft simulation models used in the analysis. A numerical technique is presented to aid in the simulation of the aircraft studied. Finally, a description of the input data used in the computer code is given.
Yu, C. L.↗
Performance of some block codes on a Gaussian channel
A technique proposed by Chase (1972) is used to evaluate the performance of several fairly long binary block codes on a wideband additive Gaussian channel. Considerations leading to the use of Chase's technique are discussed. Chase's concepts are first applied to the most powerful practical class of binary codes, the BCH codes with Berlekamp's (1972) decoding algorithm. Chase's algorithm is then described along with proposed selection of candidate codes. Results are presented of applying Chase's algorithm to four binary codes: (23, 12) Golay code, (32, 16) second-order Reed-Muller code, (63, 36) 5-error correcting BCH code, and (95, 39) 9-error correcting shortened BCH code. It is concluded that there are many block codes of length not exceeding 100 with extremely attractive maximum likelihood decoding performance on a Gaussian channel. BCH codes decoded via Berlekamp's binary decoding algorithm and Chase's idea are close to being practical competitors to short-constraint length convolutional codes with Viterbi decoding.
Baumert, L. D.↗
Coding for optical channels
In a previous paper Pierce considered the problem of optical communication from a novel viewpoint, and concluded that performance will likely be limited by issues of coding complexity rather than by thermal noise. This paper reviews the model proposed by Pierce and presents some results on the analysis and design of codes for this application.
Baumert, L. D.↗
Analysis and calculation of macrosegregation in a casting ingot. MPS solidification model. Volume 2: Software documentation
The software developed for the solidification model is presented. A link between the calculations and the FORTRAN code is provided, primarily in the form of global flow diagrams and data structures. A complete listing of the solidification code is given.
Maples, A. L.↗
Trophic classification of Tennessee Valley area reservoirs derived from LANDSAT multispectral scanner data
LANDSAT MSS data from four different dates were extracted from computer tapes using a semiautomated digital data handling and analysis system. Reservoirs were extracted from the surrounding land matrix by using a Band 7 density level slice of 3; and descriptive statistics to include mean, variance, and ratio between bands for each of the four bands were calculated. Significant correlations ( 0.80) were identified between the MSS statistics and many trophic indicators from ground truth water quality data collected at 35 reservoirs in the greater Tennessee Valley region. Regression models were developed which gave significant estimates of each reservoir's trophic state as defined by its trophic state index and explained in all four LANDSAT frames at least 85 percent of the variability in the data. To illustrate the spatial variations within reservoirs as well as the relative variations between reservoirs, a table look up elliptical classification was used in conjunction with each reservoir's trophic state index to classify each reservoir on a pixel by pixel basis and produce color coded thematic representations.
Meinert, D. L.↗
Erasure decoding in burst-error channels
A proven means of communicating reliably in a burst-error channel is the code interleaving scheme. Code symbols from a number of component codes are interleaved before being sent through the channel. This method effectively distributes the error detection and correction burden among the component codes and makes errors occurring in a codeword from each component code more or less independent. Erasure decoding techniques allow further refinement on the code interleaving concept. Their application leads to improved overall code performance when the symbol depth of the lead code is shallow compared to the average error-burst length of the channel. Theoretical formulations derived for predicting the performance of separate decoding and erasure decoding schemes are valuable in providing reasonably good estimates on redundancy requirements of the component codes.
Leung, K. S.↗
Sideband-aided receiver arraying
Efforts to increase the amount of data that can be received from outer planet missions by coherently combining signals from ground antennas in such a way as to increase the total effective aperture of the receiving system are discussed. As these signals become weaker, the baseband arraying technique in current use degrades somewhat due to carrier jitter. One solution to this problem is Sideband-Aided Receiver Arraying (SARA). In SARA, sidebands demodulated to baseband in a master receiver at the largest antenna are used to allow slave receivers in the other antennas to track the sideband power in the signal rather than the carrier power. The already existing receivers can be used in the slaves to track and demodulate the signals in either a residual carrier or a suppressed carrier environment. The resultant baseband signals from all the antennas can then be combined using existing baseband combining equiment. Computer simulations of SARA show increases in throughput (measured in data bits per second) over baseband-only combining 17 percent at Voyager 2 Uranum encounter and 31 percent at Neptune for a four-element antenna array and (7, 1/2) convolutional coding.
Butman, S. A.↗
One-dimensional kinematics of particle stream flow with application to solar wind simulation
A simple kinematic method for determining the particle velocity distribution of a model solar wind for which the spatial distribution of particles is given as a function of particle travel time has been developed by Hakamada and Akasofu (1982). Here their method is formalized mathematically and an inverse procedure for determining the particle distribution from a given velocity distribution is derived. This inverse procedure is then applied to a simulated velocity distribution obtained from an MHD finite difference code.
Olmsted, C.↗
Developments in the simulation of separated flows using finite difference methods
Compressible viscous flow simulation using finite difference Navier-Stokes and viscous-inviscid interaction methods is described. Recent developments are reviewed that significantly improve the computational efficiency of approximately factored implicit Navier-Stokes algorithms. Compared to Navier-Stokes codes, modern viscous-inviscid interaction codes are more computationally efficient, but have restricted application and are more complicated to program. Therefore, less efficient but more general viscous-inviscid interaction methods are investigated that use forcing functions instead of boundary condition matching, and a simple, direct/inverse, three-dimensional, finite-difference, boundary layer code is presented.
Steger, J. L.↗
Measurements of a turbulent horseshoe vortex formed around a cylinder
An experimental investigation was conducted to characterize a symmetrical horseshoe vortex system in front of and around a single large-diameter right cylinder centered between the sidewalls of a wind tunnel. Surface flow visualization and surface static pressure measurements as well as extensive mean velocity and pressure measurements in and around the vortex system were acquired. The results lend new insight into the formation and development of the vortex system. Contrary to what has been assumed previously, a strong vortex was not identified in the streamwise plane of symmetry, but started a significant angular distance away from it. Rather than the multiple vortex systems reported by others, only a single primary vortex and saddle point were found. The scale of the separation process at the saddle point was much smaller than the scale of the approaching boundary layer thickness. Results of the present study not only shed light on such phenomena as the nonsymmetrical endwall flow in axial turbomachinery but can also be used as a test case for three-dimensional computational fluid mechanics computer codes.
Eckerle, W. A.↗
A theoretical basis for extending surface-paneling methods to transonic flow
The surface integral terms in Green's third identity are often used to solve the Prandtl-Glauert (linear potential-flow) equation with panel methods. This can be done, as in the PAN AIR code, for either subsonic or supersonic flow about complete aircraft. The extension to transonic flow is suggested by the volume integral terms of Green's third identity. The mathematical basis for this extension, without the use of body-fitted grids, is presented. Supercritical transonic results computed from a two-dimensional transonic PAN AIR research code demonstrate the method.
Erickson, L. L.↗
Horseshoe vortex formation around a cylinder
An experimental investigation was conducted to characterize a symmetrical horseshoe vortex system in front of and a around a single large-diameter right cylinder centered between the sidewalls of a wind tunnel. Surface flow visualization anad surface static pressure measurements as well as extensive mean velocity and pressure measurements in and around the vortex system were acquired. The results lend new insight into the formation and development of the vortex system. Contrary to what has been assumed previously, a strong vortex was not identified in the streamwise plane of symmetry, but started a significant angular distance away from it. Rather than the multiple vortex systems reported by others, only a single primary vortex and saddle point were found. The scale of the separation process at the saddle point was much smaller than the scale of the approaching bundary layer thickness. Results of the present study not only shed light on such phenomena as the nonsymmetrical endwall flow in axial turbomachinery but can also be used as a test case for three-dimensional computational fluid mechanics computer codes.
Eckerle, W. A.↗
A new method for frame synchronization
A frame synchronization method based on an examination of the shortest bit length containing all error bursts is introduced. It is shown that the new method is more reliable and efficient than the commonly used one based on counting the number of errors for the convolutionally coded channel.
Shahshahani, M.↗