Engineering Papers⌕ Search

Engineering topics

Lin, S.

Publications and source records attributed to Lin, S..

At least 55 records · Page 3

Measurement of the neutrino mixing angle θ 23 in NOvA

This Letter reports new results on muon neutrino disappearance from NOvA, using a 14 kton detector equivalent exposure of $6.05\times10^{20}$ protons-on-target from the NuMI beam at the Fermi National Accelerator Laboratory. The measurement probes the muon-tau symmetry hypothesis that requires maximal mixing ($\theta_{23} = \pi/4$). Assuming the normal mass hierarchy, we find $\Delta m^2 = (2.67 \pm 0.11)\times 10^{-3}$ eV$^2$ and $\sin^2 \theta_{23}$ at the two statistically degenerate values $0.404^{+0.030}_{-0.022}$ and $0.624^{+0.022}_{-0.030}$, both at the 68% confidence level. Finally, our data disfavor the maximal mixing scenario with 2.6 $\sigma$ significance.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Size effects on negative thermal expansion in cubic ScF{sub 3}

Scandium trifluoride (ScF{sub 3}), adopting a cubic ReO{sub 3}-type structure at ambient pressure, undergoes a pronounced negative thermal expansion (NTE) over a wide range of temperatures (10 K–1100 K). Here, we report the size effects on the NTE properties of ScF{sub 3}. The magnitude of NTE is reduced with diminishing the crystal size. As revealed by the specific heat measurement, the low-energy phonon vibrations which account for the NTE behavior are stiffened as the crystal size decreases. With decreasing the crystal size, the peaks in high-energy X-ray pair distribution function (PDF) become broad, which cannot be illuminated by local symmetry breaking. Instead, the broadened PDF peaks are strongly indicative of enhanced atomic displacements which are suggested to be responsible for the stiffening of NTE-related lattice vibrations. The present study suggests that the NTE properties of ReO{sub 3}-type and other open-framework materials can be effectively adjusted by controlling the crystal size.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ozonation and alkaline-peroxide pretreatment of wheat straw for Cryptococcus curvatus fermentation

Crop residues in an Advanced Life Support System (ALS) contain many valuable components that could be recovered and used. Wheat is 60% inedible, with approximately 90% of the total sugars in the residue cellulose and hemicellulose. To release these sugars requires pretreatment followed by enzymatic hydrolysis. Cryptococcus curvatus, an oleaginous yeast, uses the sugars in cellulose and hemicellulose for growth and production of storage triglycerides. In this investigation, alkaline-peroxide and ozonation pretreatment methods were compared for their efficiency to release glucose and xylose to be used in the cultivation of C. curvatus. Leaching the biomass with water at 65 degrees C for 4 h prior to pretreatment facilitated saccharification. Alkaline-peroxide and ozone pretreatment were almost 100% and 80% saccharification efficient, respectively. The sugars derived from the hydrolysis of alkaline-peroxide-treated wheat straw supported the growth of C. curvatus and the production of edible single-cell oil.

Non-NASA Center↗

Comparisons of the Vertical Development of Deep Tropical Convection and Associated Lightning Activity on a Global Basis

Simultaneous radar (13.8 Ghz) and lightning (Lightning Imaging Sensor) observations from the NASA TRMM (Tropical Rainfall Measuring Mission) spacecraft afford a new opportunity to examine differences in tropical continental and oceanic convection on a global basis, The 250 meter vertical resolution of the radar data and the approximately 17 dBZ sensitivity are well suited to providing vertical profiles of radar reflectivity over the entire tropical belt. The reflectivity profile has been shown in numerous local ground-based studies to be a good indicator of both updraft velocity and electrical activity. The radar and lightning observations for multiple satellite orbits have been integrated to produce global CAPPI's for various altitudes. At 7 km altitude, where mixed phase microphysics is known to be active, the mean reflectivity in continental convection is 10-15 dB greater than the value in oceanic convection. These results provide a sound physical basis for the order-of-magnitude contrast in lightning counts between continental and oceanic convection. These observations still beg the question, however, about the contrast in updraft velocity in these distinct convective regimes.

Williams, E.↗

Good trellises for IC implementation of viterbi decoders for linear block codes

This paper investigates trellis structures of linear block codes for the IC (integrated circuit) implementation of Viterbi decoders capable of achieving high decoding speed while satisfying a constraint on the structural complexity of the trellis in terms of the maximum number of states at any particular depth. Only uniform sectionalizations of the code trellis diagram are considered. An upper bound on the number of parallel and structurally identical (or isomorphic) subtrellises in a proper trellis for a code without exceeding the maximum state complexity of the minimal trellis of the code is first derived. Parallel structures of trellises with various section lengths for binary BCH and Reed-Muller (RM) codes of lengths 32 and 64 are analyzed. Next, the complexity of IC implementation of a Viterbi decoder based on an L-section trellis diagram for a code is investigated. A structural property of a Viterbi decoder called ACS-connectivity which is related to state connectivity is introduced. This parameter affects the complexity of wire-routing (interconnections within the IC). The effect of five parameters namely: (1) effective computational complexity; (2) complexity of the ACS-circuit; (3) traceback complexity; (4) ACS-connectivity; and (5) branch complexity of a trellis diagram on the VLSI complexity of a Viterbi decoder is investigated. It is shown that an IC implementation of a Viterbi decoder based on a non-minimal trellis requires less area and is capable of operation at higher speed than one based on the minimal trellis when the commonly used ACS-array architecture is considered.

Moorthy, H. T.↗

Deep imaging of the field of the z = 4.9 quasar PC 1247+3406, and faint galaxy counts in the K band with the Keck telescope

We present deep images in the K(sub s) band of the field of the quasar PC 1247+3406 at z = 4.897, obtained using the near-infrared camera on the W. M. Keck telescope. A number of faint sources have been detected, some of which appear to be quite red. Their nature and redshifts remain uncertain at this time. These data are combined with deep Keck infrared images of five additional fields and present galaxy counts reaching down to K(sub s) = 22 mag, comparable to the deepest K-band surveys to date. The data presented here are in good agreement with the Hawaii Deep Survey and represent the first independent verification of those results. The slope of the log N-log S relation derived from these data agrees well with the Hawaii Deep Survey, while the counts are slightly higher, especially at the faintest levels probed here. This may be due to a presence of groups or clusters around the target objects at high redshifts.

Soifer, B. T.↗

Near-infrared images of MG 1131+0456 with the W. M. Keck telescope: Another dusty gravitational lens?

Images of the gravitational lens system MG 1131+0456 taken with the near-infrared camera on the W. M. Keck telescope in the J and K(sub s) bands show that the infrared counterparts of the compact radio structure are exceedingly red, with J - K greater than 4.2 mag. The J image reveals only the lensing galaxy, while the K(sub s) image shows both the lens and the infrared counterparts of the compact radio components. After subtracting the lensing galaxy from the K(sub s) image, the position and orientation of the compact components agree with their radio counterparts. The broad-band spectrum and observed brightness of the lens suggest a giant galaxy at a redshift of approximately 0.75, while the color of the quasar images suggests significant extinction by dust in the lens. There is a significant excess of faint objects within 20 sec of MG 1131+0456. Depending on their mass and redshifts, these objects could complicate the lensing potential considerably.

Larkin, J. E.↗

A cascaded coding scheme for error control and its performance analysis

A coding scheme for error control in data communication systems is investigated. The scheme is obtained by cascading two error correcting codes, called the inner and the outer codes. The error performance of the scheme is analyzed for a binary symmetric channel with bit error rate epsilon < 1/2. It is shown that, if the inner and outer codes are chosen properly, extremely high reliability can be attained even for a high channel bit error rate. Various specific example schemes with inner codes ranging from high rates to very low rates and Reed-Solomon codes are considered, and their probabilities are evaluated. They all provide extremely high reliability even for very high bit error rates, say 0.1 to 0.01. Several example schemes are being considered by NASA for satellite and spacecraft down link error control.

Lin, S.↗

Performance analysis of a cascaded coding scheme with interleaved outer code

A cascaded coding scheme for a random error channel with a bit-error rate is analyzed. In this scheme, the inner code C sub 1 is an (n sub 1, m sub 1l) binary linear block code which is designed for simultaneous error correction and detection. The outer code C sub 2 is a linear block code with symbols from the Galois field GF (2 sup l) which is designed for correcting both symbol errors and erasures, and is interleaved with a degree m sub 1. A procedure for computing the probability of a correct decoding is presented and an upper bound on the probability of a decoding error is derived. The bound provides much better results than the previous bound for a cascaded coding scheme with an interleaved outer code. Example schemes with inner codes ranging from high rates to very low rates are evaluated. Several schemes provide extremely high reliability even for very high bit-error rates say 10 to the -1 to 10 to the -2 power.

Lin, S.↗

A concatenated coding scheme for error control

In this paper, a concatenated coding scheme for error control in data communications is presented and analyzed. In this scheme, the inner code is used for both error correction and detection; however, the outer code is used only for error detection. A retransmission is requested if either the inner code decoder fails to make a successful decoding or the outer code decoder detects the presence of errors after the inner code decoding. Probability of undetected error (or decoding error) of the proposed scheme is derived. An efficient method for computing this probability is presented. Throughput efficiency of the proposed error control scheme incorporated with a selective-repeat ARQ retransmission strategy is also analyzed. Three specific examples are presented. One of the examples is proposed for error control in the NASA Telecommand System.

Kasami, T.↗

Coding for reliable satellite communications

This research project was set up to study various kinds of coding techniques for error control in satellite and space communications for NASA Goddard Space Flight Center. During the project period, researchers investigated the following areas: (1) decoding of Reed-Solomon codes in terms of dual basis; (2) concatenated and cascaded error control coding schemes for satellite and space communications; (3) use of hybrid coding schemes (error correction and detection incorporated with retransmission) to improve system reliability and throughput in satellite communications; (4) good codes for simultaneous error correction and error detection, and (5) error control techniques for ring and star networks.

Gaarder, N. T.↗

A cascaded coding scheme for error control

A cascaded coding scheme for error control was investigated. The scheme employs a combination of hard and soft decisions in decoding. Error performance is analyzed. If the inner and outer codes are chosen properly, extremely high reliability can be attained even for a high channel bit-error-rate. Some example schemes are studied which seem to be quite suitable for satellite down-link error control.

Kasami, T.↗

A concatenated coding scheme for error control

A concatenated coding scheme for error contol in data communications was analyzed. The inner code is used for both error correction and detection, however the outer code is used only for error detection. A retransmission is requested if either the inner code decoder fails to make a successful decoding or the outer code decoder detects the presence of errors after the inner code decoding. Probability of undetected error of the proposed scheme is derived. An efficient method for computing this probability is presented. Throughout efficiency of the proposed error control scheme incorporated with a selective repeat ARQ retransmission strategy is analyzed.

Lin, S.↗

On the undetected error probability for shortened Hamming codes

Shortened Hamming codes are widely used for error detection in data communications. In this paper, a method for computing the probability of an undetected error for these codes is presented. This method is then used to evaluate the error-detection performance of the shortened codes obtained from the two distance-four Hamming codes adopted by CCITT X.25 for error control for packet-switched networks. It is shown that shortening a code does affect its error-detection performance.

Fujiwara, T.↗

A concatenated coding scheme for error control

A concatenated coding scheme for error control in data communications is analyzed. The inner code is used for both error correction and detection, however the outer code is used only for error detection. A retransmission is requested if the outer code detects the presence of errors after the inner code decoding. The probability of undetected error of the above error control scheme is derived and upper bounded. Two specific exmaples are analyzed. In the first example, the inner code is a distance-4 shortened Hamming code with generator polynomial (X+1)(X(6)+X+1) = X(7)+X(6)+X(2)+1 and the outer code is a distance-4 shortened Hamming code with generator polynomial (X+1)X(15+X(14)+X(13)+X(12)+X(4)+X(3)+X(2)+X+1) = X(16)+X(12)+X(5)+1 which is the X.25 standard for packet-switched data network. This example is proposed for error control on NASA telecommand links. In the second example, the inner code is the same as that in the first example but the outer code is a shortened Reed-Solomon code with symbols from GF(2(8)) and generator polynomial (X+1)(X+alpha) where alpha is a primitive element in GF(z(8)).

Lin, S.↗

On the binary weight distribution of some Reed-Solomon codes

Consider an (n,k) linear code with symbols from GF(2 sup M). If each code symbol is represented by a m-tuple over GF(2) using certain basis for GF(2 sup M), a binary (nm,km) linear code is obtained. The weight distribution of a binary linear code obtained in this manner is investigated. Weight enumerators for binary linear codes obtained from Reed-Solomon codes over GF(2 sup M) generated by polynomials, (X-alpha), (X-l)(X-alpha), (X-alpha)(X-alpha squared) and (X-l)(X-alpha)(X-alpha squared) and their extended codes are presented, where alpha is a primitive element of GF(2 sup M). Binary codes derived from Reed-Solomon codes are often used for correcting multiple bursts of errors.

Lin, S.↗

The undetected error probability for shortened hamming codes

Hamming or shortened Hamming codes are widely used for error detection in data communications. For example, the CCITT (International Telegraph and Telephone Consultative Committee) recommendation X.25 for packet-switched data networks adopts a distance-4 cyclic Hamming code with 16 parity-check bits for error detection. The natural length of this code is n = 2(15)-1 = 32,767. In practice the length of a data packet is no more than a few thousand bits which is much shorter than the natural length of the code. Consequently, a shortened version of thecode is used. Often the length of a data packet varies, say from a few hundred bits to a few thousand bits, hence the code must be shortened by various degrees. Shortening affects the performance of the code. The error-detection performance of shortened Hamming codes, particularly the codes obtained from the distance-4 Hamming codes adopted by CCITT recommendation X.25, is investigated. A method for computing the probability of an undetected error is presented.

Costello, D. J., Jr.↗