A* Decoding Of Block Codes
Report presents study of application of A* algorithm to maximum-likelihood soft-decision decoding of binary linear block codes.
Ekroot, Laura↗
SEARCH · Search NASA
Results for “BINARY CODE”
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.
Discrete X-Ray Source Populations and Star-Formation History in Nearby Galaxies
This program aims in understanding the connection between the discrete X-ray source populations observed in nearby galaxies and the history of star-formation in these galaxies. The ultimate goal is to use this knowledge in order to constrain X-ray binary evolution channels. For this reason although the program is primarily observational it has a significant modeling component. During the first year of this study we focused on the definition of a pilot sample of galaxies with well know star-formation histories. A small part of this sample has already been observed and we performed initial analysis of the data. However, the majority of the objects in our sample either have not been observed at all, or the detection limit of the existing observations is not low enough to probe the bulk of their young X-ray binary populations. For this reason we successfully proposed for additional Chandra observations of three targets in Cycle-5. These observations are currently being performed. The analysis of the (limited) archival data for this sample indicated that the X-ray luminosity functions (XLF) of the discrete sources in these galaxies may not have the same shape as is widely suggested. However, any solid conclusions are hampered by the small number of detected sources. For this reason during the second year of this study, we will try to extend the sample in order to include more objects in each evolutionary stage. In addition we are completing the analysis of the Chandra monitoring observations of the Antennae galaxies. The results from this work, apart from important clues on the nature of the most luminous sources (Ultra-luminous X-ray sources; ULXs) provide evidence that source spectral and/or temporal variability does not significantly affect the shape of their X-ray luminosity functions. This is particularly important for comparisons between the XLFs of different galaxies and comparisons with predictions from theoretical models. Results from this work have been presented in several conferences. Refereed journal papers presenting these conclusions are currently in preparation. An important part of this study is the Chandra survey of the Small Magellanic Cloud, our second nearest star- forming galaxy. So far we have been awarded 5 Chandra observations of the central youngest part of the galaxy. These observations will help to study the very faint end of the young X-ray binary populations which is not possible to probe in more distant objects. Results from this study have been presented in several conferences and two papers are in preparation. In addition during year-2 we are planning of undertaking the task of identifying optical counterparts to the X-ray sources, which will help us to isolate interlopers (sources not associated with the SMC) and classify the X-ray binaries which are found to be associated with the SMC. In the theoretical front, the Star-Track X-ray binary population synthesis code which will be used for the modeling of the X-ray binary populations (led by co-I V. Kalogera and C. Belczynski), is complete. A first test using the XLF of the star-forming galaxy NGC-1569 showed remarkable agreement between the observed and the modeled XLF. These results are presented in an ApJ. Letters paper (Belczynski et al, 2004, 601, 147). During year-2 of this study we are planning of performing a parameter study in order to investigate which parameters are most important for the shape of the XLF. In addition we will perform comparisons with observations of other galaxies from our sample as they become available.
Zezas, Andreas↗
Exact determination of probability of bit error for perfect single error correcting codes
Bit error probability after decoding for binary perfect single error correcting codes
Apple, G. G.↗
Self-dual (48,24;12) codes
Two self-dual (48,24;12) codes are constructed as 6 x 8 matrices whose columns add up to form an extended BCH-Hamming (8,4;4) code and whose rows sum to odd or even parity. The codes constructed have the identical weight structure of the extended quadratic residue code of length 48. Algebraic isomorphisms may exist between pairs of these three codes. However, because of their matrix form, the newly constructed codes are easily correctable for all five-error and many six-error patterns. The first code comes from restricting a binary cyclic (63,18;36) code to a 6 x 7 matrix and then adjoining six dimensions to the extended 6 x 8 matrix. These six dimensions are generated by linear combinations of row permutations of a 6 x 8 matrix of weight 12, whose sums of rows and columns add to one. The second code comes from a slight modification in the parity (eighth) dimension of the Reed-Solomon (8,4;5) code over GF(64). Error correction in both codes uses the row sum parity information to detect errors in the correction algorithm.
Solomon, G.↗
Soft decoding a self-dual (48, 24; 12) code
A self-dual (48,24;12) code comes from restricting a binary cyclic (63,18;36) code to a 6 x 7 matrix, adding an eighth all-zero column, and then adjoining six dimensions to this extended 6 x 8 matrix. These six dimensions are generated by linear combinations of row permutations of a 6 x 8 matrix of weight 12, whose sums of rows and columns add to one. A soft decoding using these properties and approximating maximum likelihood is presented here. This is preliminary to a possible soft decoding of the box (72,36;15) code that promises a 7.7-dB theoretical coding under maximum likelihood.
Solomon, G.↗
Performance comparison of combined ECC/RLL codes
In this paper, we present a performance comparison of several combined error correcting/run-lenth limited (ECC/RLL) codes created by concatenating a convolutional code with a run-length limited code. In each case, encoding and decoding are accomplished using a single trellis based on the combined code. Half of the codes under investigation use conventionally (d,k) run-length limited codes, where d is the minimum and k is the maximum allowable run of 0's between 1's. The other half of the combined codes use a special class of (d,k) codes known as distance preserving codes. These codes have the property that pairwise Hamming distances out of the (d,k) encoder are at least as large as the corresponding distances into the encoder (i.e., the codes preserve distance). Thus a combined code, created using a convolutional code concatenated with a distance preserving (d,k) code, will have a free distance (dfree) no smaller than the free distance of the original convolutional code. It should be noted that this does not hold if the (d,k) code was not distance preserving. A computer simulation is used to compare the performance of these two types of codes over the binary symmetric channel for various (d,k) constraints, rates, free distances, and numbers of states. Of particular interest for magnetic recording applications are codes with run-length constraints (1,3), (1,7), and (2,7).
French, C.↗
An adaptable binary entropy coder
We present a novel entropy coding technique which is based on recursive interleaving of variable-to-variable length binary source codes. We discuss code design and performance estimation methods, as well as practical encoding and decoding algorithms.
data compression entropy coding↗
An adaptable binary entropy coder
We present a novel entropy coding technique which is based on recursive interleaving of variable-to-variable length binary source codes.
data compression entropy coding↗
VHClass
The code is used to predict the taxonomic source of an antibody heavy chain sequence. The code assigns a binary label to the input set of sequences - camelid or human. This prediction is generated using a random-forest based classification algorithm which is the backbone of the code. A complementary code splits the antibody sequence into antibody features - framework regions and CDR regions.
Davis, Anastasiia↗
Multilevel Concatenated Block Modulation Codes for the Frequency Non-selective Rayleigh Fading Channel
This paper is concerned with construction of multilevel concatenated block modulation codes using a multi-level concatenation scheme for the frequency non-selective Rayleigh fading channel. In the construction of multilevel concatenated modulation code, block modulation codes are used as the inner codes. Various types of codes (block or convolutional, binary or nonbinary) are being considered as the outer codes. In particular, we focus on the special case for which Reed-Solomon (RS) codes are used as the outer codes. For this special case, a systematic algebraic technique for constructing q-level concatenated block modulation codes is proposed. Codes have been constructed for certain specific values of q and compared with the single-level concatenated block modulation codes using the same inner codes. A multilevel closest coset decoding scheme for these codes is proposed.
Lin, Shu↗
On the undetected error probability of a concatenated coding scheme for error control
Consider a concatenated coding scheme for error control on a binary symmetric channel, called the inner channel. The bit error rate (BER) of the channel is correspondingly called the inner BER, and is denoted by Epsilon (sub i). Two linear block codes, C(sub f) and C(sub b), are used. The inner code C(sub f), called the frame code, is an (n,k) systematic binary block code with minimum distance, d(sub f). The frame code is designed to correct + or fewer errors and simultaneously detect gamma (gamma +) or fewer errors, where + + gamma + 1 = to or d(sub f). The outer code C(sub b) is either an (n(sub b), K(sub b)) binary block with a n(sub b) = mk, or an (n(sub b), k(Sub b) maximum distance separable (MDS) code with symbols from GF(q), where q = 2(b) and the code length n(sub b) satisfies n(sub)(b) = mk. The integerim is the number of frames. The outercode is designed for error detection only.
Deng, H.↗
Machine Learning for Predictive Performance Analysis in Charged Particle Beam Tools
Imaging methods driven by probes, electrons, and ions have played a dominant role in modern science and engineering. Opportunities for machine vision and AI that focus on consumer problems like driving and feature recognition, are now presenting themselves for automating aspects of the scientific processes. This proposal aims to enable and drive discovery in ultra-low energy implantation by taking advantage of faster processing, flexible control and detection methods, and architecture-agnostic workflows that will result in higher efficiency and shorter scientific development cycles. Custom microscope control, collection and analysis hardware will provide a framework for conducting novel in situ experiments revealing unprecedented insight into surface dynamics at the nanoscale. Ion implantation is a key capability for the semiconductor industry. As devices shrink, novel materials enter the manufacturing line, and quantum technologies transition to being more mainstream. Traditional implantation methods fall short in terms of energy, ion species, and positional precision. Here we demonstrate 1 keV focused ion beam Au implantation into Si and validate the results via atom probe tomography. We show the Au implant depth at 1 keV is 0.8 nm and that identical results for low energy ion implants can be achieved by either lowering the column voltage, or decelerating ions using bias – while maintaining a sub-micron beam focus. We compare our experimental results to static calculations using SRIM and dynamic calculations using binary collision approximation codes TRIDYN and IMSIL. A large discrepancy between the static and dynamic simulation is found that is due to lattice enrichment with high stopping power Au and surface sputtering. Additionally, we demonstrate how model details are particularly important to the simulation of these low-energy heavy-ion implantations. Finally, we discuss how our results pave a way to much lower implantation energies, while maintaining high spatial resolution.
47 OTHER INSTRUMENTATION↗
Probability Density Function for the spatial and intensity distribution of neutron-induced defects in Silicon
The ability to model semiconductor device degradation under neutron irradiation depends upon having a robust modeling capability for the neutron-induced collision cascades as well as a means to analytically fit the resulting probability distributions of defect production and ionizing energy deposition for purposes of extrapolation to low-probability, high-consequence scenarios. In this paper, the widely-utilized binary collision approximation codes MARLOWE and SRIM are deployed in conjunction with a critical examination of their parameterizations as benchmarked against higher-fidelity molecular dynamics simulations. A simple 3-parameter form described by the Generalized Logistic Distribution is shown to be a good fit to Frenkel pair and ionization intensity distributions in bulk silicon. The BCA codes are then applied to simulate cascades in 5 nm layers of a representative gate-all-around nanosheet transistor, where joint probability distributions of threshold levels of damage to multiple layers are evaluated.
36 MATERIALS SCIENCE↗
Pocket-size manual tape reader device aids computer tape checking
Pocket-size plastic manual tape reader device aids in reading, interpreting, and correcting binary and octal coded punched tapes. The coded information is more easily read if the color of the back plate contrasts sharply with that of the tape.
Odle, F. L.↗
Single-channel digital command-detection system
System, fabricated of highly-reliable digital logic elements, operates on binary pulse-code-modulated signals and derives internal synchronization from data signal. All-digital implementation of detector develops synchronization from data signal by computer cross-correlation of command modulation signal with its expected forms in sequence and adjusts detector phases in accordance with correlation peaks.
Carl, C. C.↗
Computer simulation of radiation damage in gallium arsenide
A version of the binary-collision simulation code MARLOWE was used to study the spatial characteristics of radiation damage in proton and electron irradiated gallium arsenide. Comparisons made with the experimental results proved to be encouraging.
Stith, John J.↗
Enhancing Soundtracks From Old Movies
Proposed system enhances soundtracks of old movies. Signal on optical soundtrack of film digitized and processed to reduce noise and improve quality; timing signals added, and signal recorded on compact disk. Digital comparator and voltage-controlled oscillator synchronizes speed of film-drive motor and compact disk motor. Frame-coded detector reads binary frame-identifying marks on film. Digital comparator generates error signal if marks on film do not match those on compact disk.
Frazer, Robert E.↗
Structured codebook design in CELP
Codebook Excited Linear Protection (CELP) is a popular analysis by synthesis technique for quantizing speech at bit rates from 4 to 6 kbps. Codebook design techniques to date have been largely based on either random (often Gaussian) codebooks, or on known binary or ternary codes which efficiently map the space of (assumed white) excitation codevectors. It has been shown that by introducing symmetries into the codebook, good complexity reduction can be realized with only marginal decrease in performance. Codebook design algorithms are considered for a wide range of structured codebooks.
Leblanc, W. P.↗