Search

UNKNOWN

UNKNOWN

During prolonged spaceflight, astronauts are exposed to both microgravity and space radiation and are at risk forincreased skeletal fragility due to bone loss, Evidence from rodent experiments has established that bothmicrogravity and ionizing radiation can cause bone loss due to increasd of bone-resorbing osteoclasts and decreasedin bone-forming osteoblasts, although the underlying molecular mechanisms for these changes are not fullyunderstood. We hypothesized that excess reactive oxidative species (ROS) produced by conditions that simulatedspaceflight alters the tight balance between osteoclast and osteoblast activities, leading to accelerated skeletalremodeling and culminating in loss of mineralized tissue. To begin to explore this hypothesis, we used the mCATmouse model [1]; these transgenic mice over-express the human catalase gene targeted to mitochondria, which arethe major organelle responsible for cellular production of free radicals. Catalase is an anti-oxidant that catalyzes theconversion of the reactive species, hydrogen peroxide (H202), into water and oxygen. This animal model wasselected as it displays extended lifespan, reduced cardiovascular disease and reduced central nervous systemradiosensitivity, consistent with elevated anti-oxidant activity conferred by the transgene. We reasoned that miceoverexpressing catalase the mitochondria of osteoblast and osteoclast lineage cells would be protected from the boneloss caused by simulated spaceflight.

We examined experimentally the effects of radiation and/or simulated weightlessness by hindlimb unloading on bone and blood vessel function either after a short period or at a later time after transient exposures in adult male, C57Bl6J mice. In sum, recent findings from our studies show that in the short term, ionizing radiation and simulate weightlessness cause greater deficits in blood vessels when combined compared to either challenge alone. In the long term, heavy ion radiation, but not unloading, can lead to persistent, adverse consequences for bone and vessel function, possibly due to oxidative stress-related pathways.

UNKNOWN

We examined experimentally the effects of radiation andor simulated weightlessness by hindlimb unloading on bone and blood vessel function either after a short period or at a later time after transient exposures in adult male, C57Bl6J mice. In sum, recent findings from our studies show that in the short term, ionizing radiation and simulate weightlessness cause greater deficits in blood vessels when combined compared to either challenge alone. In the long term, heavy ion radiation, but not unloading, can lead to persistent, adverse consequences for bone and vessel function, possibly due to oxidative stress-related pathways.

UNKNOWN

Spaceflight environment poses challenges to the human body. Both microgravity and radiation may lead to excess production of reactive oxygen species (ROS) and resulting oxidative stress and tissue damage. Specifically in bone, elevated ROS can contribute to excess bone resorption by osteoclasts over bone formation by osteoblasts, reduced viability of osteocytes, and ultimately, osteoporosis. Thus, we hypothesized that suppression of mitochondrial ROS in bone cells improves overall bone structure in the adult skeleton and skeletal defenses from spaceflight. To begin to test our hypothesis, we (1) modified ROS levels in bone cells using mCAT (Malonyl CoA-acyl carrier protein transacylase) mice, which overexpress the human anti-oxidant catalase gene targeted to the mitochondria. We also increased ROS and stimulated skeletal remodeling by exposing mice to simulated spaceflight (hindlimb-unloading and total body-irradiation) or sham treatment. When challenged with treatment, bones from wildtype mice showed elevated levels of oxidative damage whereas mCAT mice did not. Treatment caused expected bone loss in wildtype mice. Treatment caused deficits in microarchitecture of mCAT mice, although lower in magnitude than wildtype. In conclusion, our results indicate mitochondrial ROS generation in osteoblast and osteoclast lineage cells of skeletal tissue contributes to skeletal remodeling and quenching oxidative damage may improve the skeletal responses to spaceflight.

Microgravity and ionizing radiation may contribute to cellular stress; resulting in increased generation of reactive oxygen species (ROS), DNA damage, cell cycle arrest, and cell death. We hypothesized that suppression of excess ROS in osteoblasts and osteoclasts will improve bone microarchitecture. To test our hypothesis, we used irradiated transgenic mCAT mice overexpressing human anti-oxidant catalase gene targeted to the mitochondria (main site for ROS production). mCAT mice expressed the transgene and displayed elevated catalase activity in bone and ex vivo osteoblast and osteoclast cultures. Treated bone from wildtype mice showed elevated levels of oxidative damage whereas mCAT mice did not. Also, increased catalase activity correlated with decreased MDA levels and that increased oxidative damage correlated with decreased % bone volume. Ex-vivo osteoblast colony growth positively correlated with osteoblast catalase activity. mCAT mice displayed reduced % bone volume. Treatment caused significant bone loss in wildtype mice. Treatment also caused slight deficits in microarchitecture of mCAT mice. In conclusion, ROS signaling in both osteoblast and osteoclast lineage cells contribute to skeletal development and remodeling and quenching oxidative damage could play a role in bone loss prevention.

Bone loss can occur due to many challenges such age, radiation, microgravity, and Reactive Oxygen Species (ROS) play a critical role in bone resorption by osteoclasts (Bartell et al. 2014). We hypothesize that suppression of excess ROS in skeletal cells, both osteoblasts and osteoclasts, regulates skeletal growth and remodeling. To test our hypothesis, we used transgenic mCAT mice which overexpress the human anti-oxidant catalase gene targeted to the mitochondria, the main site for endogenous ROS production. mCAT mice have a longer life-span than wildtype controls and have been used to study various age-related disorders. To stimulate remodeling, 16 week old mCAT mice or wildtype mice were exposed to treatment (hindlimb-unloading and total body-irradiation) or sham treatment conditions (control). Tissues were harvested 2 weeks later for skeletal analysis (microcomputed tomography), biochemical analysis (gene expression and oxidative damage measurements), and ex vivo bone marrow derived cell culture (osteoblastogenesis and osteoclastogenesis). mCAT mice expressed the transgene and displayed elevated catalase activity in skeletal tissue and marrow-derived osteoblasts and osteoclasts grown ex vivo. In addition, when challenged with treatment, bone tissues from wildtype mice showed elevated levels of malondialdehyde (MDA), indicating oxidative damage) whereas mCAT mice did not. Correlation analysis revealed that increased catalase activity significantly correlated with decreased MDA levels and that increased oxidative damage correlated with decreased percent bone volume (BVTV). In addition, ex-vivo cultured osteoblast colony growth correlated with catalase activity in the osteoblasts. Thus, we showed that these transgenic mice can be used as a model to study the relationship between markers of oxidative damage and skeletal properties. mCAT mice displayed reduced BVTV and trabecular number relative to wildtype mice, as well as increased structural model index in the cancellous tibia. Treatment caused bone loss in wildtype mice, as expected. Treatment also caused deficits in microarchitecture of mCAT mice, although less severe than wildtype mice in some parameters (percent bone volume, structural model index and cortical area). In conclusion, our results indicate that endogenous ROS signaling in both osteoblast and osteoclast lineage cells contributes to skeletal growth and remodeling, and quenching oxidative damage could play a role in bone loss prevention.

Exposure to musculoskeletal disuse and radiation result in bone loss; we hypothesized that these catabolic treatments cause excess reactive oxygen species (ROS), and thereby alter the tight balance between bone resorption by osteoclasts and bone formation by osteoblasts, culminating in bone loss. To test this, we used transgenic mice which over-express the human gene for catalase, targeted to mitochondria (MCAT). Catalase is an anti-oxidant that converts the ROS hydrogen peroxide into water and oxygen. MCAT mice were shown previously to display reduced mitochondrial oxidative stress and radiosensitivity of the CNS compared to wild type controls (WT). As expected, MCAT mice expressed the transgene in skeletal tissue, and in marrow-derived osteoblasts and osteoclast precursors cultured ex vivo, and also showed greater catalase activity compared to wildtype (WT) mice (3-6 fold). Colony expansion in marrow cells cultured under osteoblastogenic conditions was 2-fold greater in the MCAT mice compared to WT mice, while the extent of mineralization was unaffected. MCAT mice had slightly longer tibiae than WT mice (2%, P less than 0.01), although cortical bone area was slightly lower in MCAT mice than WT mice (10%, p=0.09). To challenge the skeletal system, mice were treated by exposure to combined disuse (2 wk Hindlimb Unloading) and total body irradiation Cs(137) (2 Gy, 0.8 Gy/min), then bone parameters were analyzed by 2-factor ANOVA to detect possible interaction effects. Treatment caused a 2-fold increase (p=0.015) in malondialdehyde levels of bone tissue (ELISA) in WT mice, but had no effect in MCAT mice. These findings indicate that the transgene conferred protection from oxidative damage caused by treatment. Unexpected differences between WT and MCAT mice emerged in skeletal responses to treatment.. In WT mice, treatment did not alter osteoblastogenesis, cortical bone area, moment of inertia, or bone perimeter, whereas in MCAT mice, treatment increased these parameters. Taken together, this typically catabolic treatment (disuse and irradiation) appeared to stimulate cortical expansion in MCAT mice but not WT mice. In conclusion, these results reveal the importance of mitochondrial ROS generation in skeletal remodeling and show that MCAT mice provide a useful animal model for bone studies.

This paper characterizes the performance of a single deformable mirror Shack-Hartmann natural guide star AO system based on the present-generation digital signal processors TMS320C6701 from Texas Instruments.

A new algebraic approach for decoding the quadratic residue (QR) codes, in particular the (41, 21, 9) QR code is presented. The key ideas behind this decoding technique are a systematic application of the Sylvester resultant method to the Newton identities associated with the code syndromes to find the error-locator polynomial, and next a method for determining error locations by solving certain quadratic, cubic and quartic equations over GF(2 exp m) in a new way which uses Zech's logarithms for the arithmetic. The algorithms developed here are suitable for implementation in a programmable microprocessor or special-purpose VLSI chip. It is expected that the algebraic methods developed here can apply generally to other codes such as the BCH and Reed-Solomon codes.

The arithmetic Fourier transform (AFT) is a number-theoretic approach to Fourier analysis which has been shown to perform competitively with the classical FFT in terms of accuracy, complexity, and speed. Theorems developed in a previous paper for the AFT algorithm are used here to derive the original AFT algorithm which Bruns found in 1903. This is shown to yield an algorithm of less complexity and of improved performance over certain recent AFT algorithms. A VLSI architecture is suggested for this simplified AFT algorithm. This architecture uses a butterfly structure which reduces the number of additions by 25 percent of that used in the direct method.

A systolic Viterbi decoder for convolutional codes is developed which uses the trace-back method to reduce the amount of data needed to be stored in registers. It is shown that this new algorithm requires a smaller chip size and achieves a faster decoding time than other existing methods.

A novel Fourier technique for digital signal processing is developed. This approach to Fourier analysis is based on the number-theoretic method of the Moebius inversion of series. The Fourier transform method developed is shown also to yield the convolution of two signals. A computer simulation shows that this method for finding Fourier coefficients is quite suitable for digital signal processing. It competes with the classical FFT (fast Fourier transform) approach in terms of accuracy, complexity, and speed.

A systolic Viterbi decoder for convolutional codes is developed. This decoder uses the trace-back method to reduce the amount of data needed to be stored in registers. It is shown that this new algorithm requires a smaller chip size and achieves a faster decoding time than other existing methods.

New decoder realized by simplified pipeline architecture. Simplified procedure for correction of errors and erasures in Reed-Solomon codes expected to result in simpler decoding equipment. Development widens commercial applicability of Reed-Solomon codes, used to correct bursts of errors in digital communication and recording systems. Improved decoder less complex. Made more regular, simple, and suitable for implementation in both VLSI and software.

A Reed-Solomon (RS) code is considered to be a special case of a redundant residue polynomial (RRP) code, and a fast transform decoding algorithm to correct both errors and erasures is presented. This decoding scheme is an improvement of the decoding algorithm for the RRP code suggested by Shiozaki and Nishida, and can be realized readily on very large scale integration chips.

A decoding method for a (23,12) Golay code is extended to the important 1/2-rate (24,12) Golay code so that three errors can be corrected and four errors can be detected. It is shown that the method can be extended to any decoding method which can correct three errors in the (23,12) Golay code.

A new very large scale integration (VLSI) architecture for implementing Reed-Solomon (RS) decoders that can correct both errors and erasures is described. This new architecture implements a Reed-Solomon decoder by using replication of a single VLSI chip. It is anticipated that this single chip type RS decoder approach will save substantial development and production costs. It is estimated that reduction in cost by a factor of four is possible with this new architecture. Furthermore, this Reed-Solomon decoder is programmable between 8 bit and 10 bit symbol sizes. Therefore, both an 8 bit Consultative Committee for Space Data Systems (CCSDS) RS decoder and a 10 bit decoder are obtained at the same time, and when concatenated with a (15,1/6) Viterbi decoder, provide an additional 2.1-dB coding gain.

A simplified procedure is developed to decode the three possible erors in a (23,12) Golay codeword. A computer simulation shows that this algorithm is modular, regular and naturally suitable for both Very Large Scale Integration (VLSI) and software implementation. An extension of this new decoding procedure is used also to decode the 1/2-rate (24,12) Golay code, thereby correcting three and detecting four errors.

Three different finite-field multipliers are presented: (1) a dual-basis multiplier due to Berlekamp; the Massey-Omura normal basis multiplier; and (3) the Scott-Tavares-Peppard standard basis multiplier. These algorithms are chosen because each has its own distinct features that apply most suitably in different areas. Finally, they are implemented on silicon chips with nitride metal oxide semiconductor technology so that the multiplier most desirable for VLSI implementation can readily be ascertained.

Finite field multiplication is central to coding theory. For this application, there is a need for a multiplication algorithm which can be realized easily on VLSI chips. A new algorithm is developed which is based on the Babylonian multiplication technique utilizing tables of squares. This algorithm is applied to the finite fields GF(q sup m), where q equals 3 and 5. It is also shown that this multiplier can be used to compute complex multiplications defined on the direct sum of two identical copies of such Galois fields.

A conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite field, GF(q sub n). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode Reed-Solomon codes. Such a pipeline fast prime factor DFT algorithm over GF(q sub n) is regular, simple, expandable, and naturally suitable for VLSI implementation. An example illustrating the pipeline aspect of a 30-point transform over GF(q sub n) is presented.

It is well known that the Euclidean algorithm or its equivalent, continued fractions, can be used to find the error locator polynomial needed to decode a Reed-Solomon (RS) code. It is shown that this algorithm can be used for both time and transform domain decoding by replacing its initial conditions with the Forney syndromes and the erasure locator polynomial. By this means both the errata locator polynomial and the errate evaluator polynomial can be obtained with the Euclidean algorithm. With these ideas, both time and transform domain Reed-Solomon decoders for correcting errors and erasures are simplified and compared. As a consequence, the architectures of Reed-Solomon decoders for correcting both errors and erasures can be made more modular, regular, simple, and naturally suitable for VLSI implementation.

Computer program uses fast-polynomial-transformation (FPT) algorithm applicable to two-dimensional mathematical convolutions. Two-dimensional cyclic convolutions converted to one-dimensional convolutions in polynomial rings. Program decomposes cyclic polynomials into polynomial convolutions of same length. Only FPT's and fast Fourier transforms of same length required. Modular approach saves computional resources. Program written in C.

It is well known that the Euclidean algorithm or its equivalent, continued fractions, can be used to find the error locator polynomial and the error evaluator polynomial in Berlekamp's key equation needed to decode a Reed-Solomon (RS) code. A simplified procedure is developed and proved to correct erasures as well as errors by replacing the initial condition of the Euclidean algorithm by the erasure locator polynomial and the Forney syndrome polynomial. By this means, the errata locator polynomial and the errata evaluator polynomial can be obtained, simultaneously and simply, by the Euclidean algorithm only. With this improved technique the complexity of time domain RS decoders for correcting both errors and erasures is reduced substantially from previous approaches. As a consequence, decoders for correcting both errors and erasures of RS codes can be made more modular, regular, simple, and naturally suitable for both VLSI and software implementation. An example illustrating this modified decoding procedure is given for a (15, 9) RS code.

A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-Pw technology.

Three different finite field multipliers are presented: (1) a dual basis multiplier due to Berlekamp; (2) a Massy-Omura normal basis multiplier; and (3) the Scott-Tavares-Peppard standard basis multiplier. These algorithms are chosen because each has its own distinct features which apply most suitably in different areas. Finally, they are implemented on silicon chips with nitride metal oxide semiconductor technology so that the multiplier most desirable for very large scale integration implementations can readily be ascertained.

A single-chip implementation of a Reed-Solomon encoder with interleaving capability is described. The code used was adapted by the CCSDS (Consulative Committee on Space Data Systems). It forms the outer code of the NASA standard concatenated coding system which includes a convolutional inner code of rate 1/2 and constraint length 7. The architecture, leading to this single VLSI chip design, makes use of a bit-serial finite field multiplication algorithm due to E.R. Berlekamp.

A pipeline binary updown counter with many bits is developed which can be used in a variety of applications. One such application includes the design of a digital correlator for very long baseline interferometry (VLBI). The advantage of the presently conceived approach over the previous techniques is that the number of logic operations involved in the design of the binary updown counter can be reduced substantially. The architecture design using these methods is regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

A description of a single VLSI chip for computing syndromes in the (255, 223) Reed-Solomon decoder is presented. The architecture that leads to this single VLSI chip design makes use of the dual basis multiplication algorithm. The same architecture can be applied to design VLSI chips to compute various kinds of number theoretic transforms.

The complex integer multiplier and adder over the direct sum of two copies of finite field developed by Cozzens and Finkelstein (1985) is specialized to the direct sum of the rings of integers modulo Fermat numbers. Such multiplication over the rings of integers modulo Fermat numbers can be performed by means of two integer multiplications, whereas the complex integer multiplication requires three integer multiplications. Such multiplications and additions can be used in the implementation of a discrete Fourier transform (DFT) of a sequence of complex numbers. The advantage of the present approach is that the number of multiplications needed to compute a systolic array of the DFT can be reduced substantially. The architectural designs using this approach are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

A recursive algorithm using the error-trellis decoding technique is developed to decode convolutional codes (CCs). An example, illustrating the very large scale integration (VLSI) architecture of such a decode, is given for a dual-K CC. It is demonstrated that such a decoder can be realized readily on a single chip with metal-nitride-oxide-semiconductor technology.

A new table look-up method for finding the log and antilog of finite field elements has been developed by N. Glover. In his method, the log and antilog of a field element is found by the use of several smaller tables. The method is based on a use of the Chinese Remainder Theorem. The technique often results in a significant reduction in the memory requirements of the problem. A VLSI architecture is developed for a special case of this new algorithm to perform finite field arithmetic including multiplication, division, and the finding of an inverse element in the finite field.

A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-pw technology.

Simplifications result from use of residue Fermat number systems. System of finite arithmetic over residue Fermat number systems enables calculation of discrete Fourier transform (DFT) of series of complex numbers with reduced number of multiplications. Computer architectures based on approach suitable for design of very-large-scale integrated (VLSI) circuits for computing DFT's. General approach not limited to DFT's; Applicable to decoding of error-correcting codes and other transform calculations. System readily implemented in VLSI.

Some complicated intermediate steps shortened or eliminated. Decoding of convolutional error-correcting digital codes simplified by new errortrellis syndrome technique. In new technique, syndrome vector not computed. Instead, advantage taken of newly-derived mathematical identities simplify decision tree, folding it back on itself into form called "error trellis." This trellis graph of all path solutions of syndrome equations. Each path through trellis corresponds to specific set of decisions as to received digits. Existing decoding algorithms combined with new mathematical identities reduce number of combinations of errors considered and enable computation of correction vector directly from data and check bits as received.

A conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite field, GF(q sub n). A pipeline structure is used to implement this prime factor DFT over GF(q sub n). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode Reed-Solomon codes. Such a pipeline fast prime factor DFT algorithm over GF(q sub n) is regular, simple, expandable, and naturally suitable for VLSI implementation. An example illustrating the pipeline aspect of a 30-point transform over GF(q sub n) is presented.

Reed-Solomon (RS) encoder based on Berlekamp bit-serial multiplier algorithm. RS code standard, based on code words of 255 8-bit symbols, of which 223 symbols convey information and remaining 32 are check symbols. This code enables correction of up to 16 erroneous information symbols per word. Berlekamp algorithm based on code-generating polynomial with 32 roots that occur in reciprocal pairs. Choice of algorithm permits compact design.

Multipliers based on new algorithm for Galois-field (GF) arithmetic regular and expandable. Pipeline structures used for computing both multiplications and inverses. Designs suitable for implementation in very-large-scale integrated (VLSI) circuits. This general type of inverter and multiplier architecture especially useful in performing finite-field arithmetic of Reed-Solomon error-correcting codes and of some cryptographic algorithms.